Rossella Petreschi


Ontology type: schema:Person     


Person Info

NAME

Rossella

SURNAME

Petreschi

Publications in SciGraph latest 50 shown

  • 2018 Graphs that Are Not Pairwise Compatible: A New Proof Technique (Extended Abstract) in COMBINATORIAL ALGORITHMS
  • 2016 Fully Dynamically Maintaining Minimal Integral Separator for Threshold and Difference Graphs in WALCOM: ALGORITHMS AND COMPUTATION
  • 2014 On Dilworth k Graphs and Their Pairwise Compatibility in ALGORITHMS AND COMPUTATION
  • 2013 Use Knowledge to Learn Faster: Topology Recognition with Advice in DISTRIBUTED COMPUTING
  • 2013 Learning a Ring Cheaply and Fast in AUTOMATA, LANGUAGES, AND PROGRAMMING
  • 2013 How to Design an Algorithm in THE POWER OF ALGORITHMS
  • 2012 On Relaxing the Constraints in Pairwise Compatibility Graphs in WALCOM: ALGORITHMS AND COMPUTATION
  • 2011 L(2,1)-Labeling of Unigraphs in THEORY AND PRACTICE OF ALGORITHMS IN (COMPUTER) SYSTEMS
  • 2010-02 Bijective Linear Time Coding and Decoding for k-Trees in THEORY OF COMPUTING SYSTEMS
  • 2010 Parallel Algorithms for Encoding and Decoding Blob Code in WALCOM: ALGORITHMS AND COMPUTATION
  • 2009 Recognition of Unigraphs through Superposition of Graphs (Extended Abstract) in WALCOM: ALGORITHMS AND COMPUTATION
  • 2009 Parallel Algorithms for Dandelion-Like Codes in COMPUTATIONAL SCIENCE – ICCS 2009
  • 2008-07 A General Approach to L(h,k)-Label Interconnection Networks in JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY
  • 2008 Engineering Tree Labeling Schemes: A Case Study on Least Common Ancestors in ALGORITHMS - ESA 2008
  • 2007 A Bijective Code for k-Trees with Linear Time Encoding and Decoding in COMBINATORICS, ALGORITHMS, PROBABILISTIC AND EXPERIMENTAL METHODOLOGIES
  • 2007 On the L(h,k)-Labeling of Co-comparability Graphs in COMBINATORICS, ALGORITHMS, PROBABILISTIC AND EXPERIMENTAL METHODOLOGIES
  • 2005-11 Structure-Preserving Hierarchical Decompositions in THEORY OF COMPUTING SYSTEMS
  • 2005-06-20 An efficient orthogonal grid drawing algorithm for cubic graphs in COMPUTING AND COMBINATORICS
  • 2005 String Coding of Trees with Locality and Heritability in COMPUTING AND COMBINATORICS
  • 2004 A Unified Approach to Coding Labeled Trees in LATIN 2004: THEORETICAL INFORMATICS
  • 2002 On the Radiocoloring Problem in DISTRIBUTED COMPUTING
  • 2002 L(2, 1)-Coloring Matrogenic Graphs in LATIN 2002: THEORETICAL INFORMATICS
  • 2001-07-31 On the Validity of Hierarchical Decompositions in COMPUTING AND COMBINATORICS
  • 2001 Hierarchical Clustering of Trees: Algorithms and Experiments in ALGORITHM ENGINEERING AND EXPERIMENTATION
  • 2001 Edge-clique graphs and the lambda-coloring problem in JOURNAL OF THE BRAZILIAN COMPUTER SOCIETY
  • 1999-11-19 A Parallel Approximation Algorithm for the Max Cut Problem on Cubic Graphs in ADVANCES IN COMPUTING SCIENCE — ASIAN’99
  • 1997-04 AnO(n3) recognition algorithm for bithreshold graphs in ALGORITHMICA
  • 1996 Threshold graphs and synchronization protocols in COMBINATORICS AND COMPUTER SCIENCE
  • 1995 Parallel maximal matching on minimal vertex series parallel digraphs in ALGORITHMS, CONCURRENCY AND KNOWLEDGE
  • 1994-06 At most single-bend embeddings of cubic graphs in APPLIED MATHEMATICS
  • 1992-04 Theoretical results on at most 1-bend embeddability of graphs in ACTA MATHEMATICAE APPLICATAE SINICA, ENGLISH SERIES
  • 1990-09 On-line 2-satisfiability in ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE
  • JSON-LD is the canonical representation for SciGraph data.

    TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

    [
      {
        "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
        "familyName": "Petreschi", 
        "givenName": "Rossella", 
        "id": "sg:person.011402427702.78", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011402427702.78"
        ], 
        "sdDataset": "persons", 
        "sdDatePublished": "2019-03-07T14:08", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        }, 
        "sdSource": "s3://com-uberresearch-data-dimensions-researchers-20181010/20181011/dim_researchers/base/researchers_1899.json", 
        "type": "Person"
      }
    ]
     

    Download the RDF metadata as:  json-ld nt turtle xml License info

    HOW TO GET THIS DATA PROGRAMMATICALLY:

    JSON-LD is a popular format for linked data which is fully compatible with JSON.

    curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/person.011402427702.78'

    N-Triples is a line-based linked data format ideal for batch operations.

    curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/person.011402427702.78'

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/person.011402427702.78'

    RDF/XML is a standard XML format for linked data.

    curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/person.011402427702.78'


     

    This table displays all metadata directly associated to this object as RDF triples.

    11 TRIPLES      9 PREDICATES      10 URIs      6 LITERALS      1 BLANK NODES

    Subject Predicate Object
    1 sg:person.011402427702.78 schema:familyName Petreschi
    2 schema:givenName Rossella
    3 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011402427702.78
    4 schema:sdDatePublished 2019-03-07T14:08
    5 schema:sdLicense https://scigraph.springernature.com/explorer/license/
    6 schema:sdPublisher Ne23f444e580742b7b9cfbe9f67346ca0
    7 sgo:license sg:explorer/license/
    8 sgo:sdDataset persons
    9 rdf:type schema:Person
    10 Ne23f444e580742b7b9cfbe9f67346ca0 schema:name Springer Nature - SN SciGraph project
    11 rdf:type schema:Organization
     




    Preview window. Press ESC to close (or click here)


    ...