Pierluigi Crescenzi


Ontology type: schema:Person     


Person Info

NAME

Pierluigi

SURNAME

Crescenzi

Publications in SciGraph latest 50 shown

  • 2019 Playful Learning for Kids with Special Educational Needs in PROCEEDINGS OF THE 20TH CONGRESS OF THE INTERNATIONAL ERGONOMICS ASSOCIATION (IEA 2018)
  • 2018 Degrees of Separation and Diameter in Large Graphs in ENCYCLOPEDIA OF BIG DATA TECHNOLOGIES
  • 2016 An Eclipse IDE for Teaching Java– in SOFTWARE TECHNOLOGIES
  • 2015-12 EUCALYPT: efficient tree reconciliation enumerator in ALGORITHMS FOR MOLECULAR BIOLOGY
  • 2015 On Computing the Hyperbolicity of Real-World Graphs in ALGORITHMS - ESA 2015
  • 2015 Greedily Improving Our Own Centrality in A Network in EXPERIMENTAL ALGORITHMS
  • 2014 On the Solvability of the Six Degrees of Kevin Bacon Game in FUN WITH ALGORITHMS
  • 2013 Telling Stories Fast in EXPERIMENTAL ALGORITHMS
  • 2013 Rumor Spreading in Random Evolving Graphs in ALGORITHMS – ESA 2013
  • 2012 Minimum Ratio Cover of Matrix Columns by Extreme Rays of Its Induced Cone in COMBINATORIAL OPTIMIZATION
  • 2012 Brief Announcement: Flooding in Dynamic Graphs with Arbitrary Degree Sequence in DISTRIBUTED COMPUTING
  • 2012 Efficient Bubble Enumeration in Directed Graphs in STRING PROCESSING AND INFORMATION RETRIEVAL
  • 2012 On Computing the Diameter of Real-World Directed (Weighted) Graphs in EXPERIMENTAL ALGORITHMS
  • 2011-09 Parsimonious flooding in dynamic graphs in DISTRIBUTED COMPUTING
  • 2011 A Comparison of Three Algorithms for Approximating the Distance Distribution in Real-World Graphs in THEORY AND PRACTICE OF ALGORITHMS IN (COMPUTER) SYSTEMS
  • 2010 Enumerating Chemical Organisations in Consistent Metabolic Networks: Complexity and Algorithms in ALGORITHMS IN BIOINFORMATICS
  • 2010 Finding the Diameter in Real-World Graphs in ALGORITHMS – ESA 2010
  • 2009-02 Foreword in THEORY OF COMPUTING SYSTEMS
  • 2008-06 Foreword in THEORY OF COMPUTING SYSTEMS
  • 2005-06-17 Parallel approximation of optimization problems in SOLVING COMBINATORIAL OPTIMIZATION PROBLEMS IN PARALLEL
  • 2005-06-09 The parallel complexity of approximating the High Degree Subgraph problem in ALGORITHMS AND COMPUTATIONS
  • 2003-01-14 IP Address LookupMade Fast and Simple in ALGORITHMS - ESA’ 99
  • 2001-09 On Approximating a Scheduling Problem in JOURNAL OF COMBINATORIAL OPTIMIZATION
  • 2000-02 On Approximation Scheme Preserving Reducibility and Its Applications in THEORY OF COMPUTING SYSTEMS
  • 2000 On Approximating a Scheduling Problem in APPROXIMATION AND COMPLEXITY IN NUMERICAL OPTIMIZATION
  • 1999 Complexity and Approximation, Combinatorial Optimization Problems and Their Approximability Properties in NONE
  • 1999 On the Complexity of Approximating Colored-Graph Problems Extended Abstract in COMPUTING AND COMBINATORICS
  • 1997 Approximation on the web: A compendium of NP optimization problems in RANDOMIZATION AND APPROXIMATION TECHNIQUES IN COMPUTER SCIENCE
  • 1995 Structure in approximation classes in COMPUTING AND COMBINATORICS
  • 1995 Optimal-area upward drawings of AVL trees in GRAPH DRAWING
  • 1995 Minimum vertex cover, distributed decision-making, and communication complexity in GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE
  • 1994 On approximation scheme preserving reductibility and its applications in FOUNDATION OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE
  • 1992 Parallel Simulated Annealing for Shape Detection in VISUAL FORM
  • 1991-05 Minimum-delay schedules in layered networks in ACTA INFORMATICA
  • 1989 Completeness in approximation classes in FUNDAMENTALS OF COMPUTATION THEORY
  • 1988 An introduction to the theory of computational complexity in MEASURES OF COMPLEXITY
  • Affiliations

    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", 
        "affiliation": [
          {
            "affiliation": {
              "id": "https://www.grid.ac/institutes/grid.8404.8", 
              "type": "Organization"
            }, 
            "isCurrent": true, 
            "type": "OrganizationRole"
          }
        ], 
        "familyName": "Crescenzi", 
        "givenName": "Pierluigi", 
        "id": "sg:person.01173734710.11", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01173734710.11"
        ], 
        "sdDataset": "persons", 
        "sdDatePublished": "2019-03-07T13:12", 
        "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_1031.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.01173734710.11'

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

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

    Turtle is a human-readable linked data format.

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

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

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


     




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


    ...