Piotr Berman


Ontology type: schema:Person     


Person Info

NAME

Piotr

SURNAME

Berman

Publications in SciGraph latest 50 shown

  • 2018-07-31 The Power and Limitations of Uniform Samples in Testing Properties of Figures in ALGORITHMICA
  • 2014-02-08 Steiner transitive-closure spanners of low-dimensional posets in COMBINATORICA
  • 2013-08-09 HybridPlan: a capacity planning technique for projecting storage requirements in hybrid storage systems in THE JOURNAL OF SUPERCOMPUTING
  • 2013-03-26 On the Computational Complexity of Measuring Global Stability of Banking Networks in ALGORITHMICA
  • 2012 Primal-Dual Approximation Algorithms for Node-Weighted Network Design in Planar Graphs in APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION. ALGORITHMS AND TECHNIQUES
  • 2011-11-16 Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems in ALGORITHMICA
  • 2011 Steiner Transitive-Closure Spanners of Low-Dimensional Posets in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 2011 Improved Approximation for the Directed Spanner Problem in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 2011 O(1)-Approximations for Maximum Movement Problems in APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION. ALGORITHMS AND TECHNIQUES
  • 2010 Successes and Failures of Elegant Algorithms in Computational Biology in BIOINFORMATICS RESEARCH AND APPLICATIONS
  • 2010 A 3/2-Approximation Algorithm for Generalized Steiner Trees in Complete Graphs with Edge Lengths 1 and 2 in ALGORITHMS AND COMPUTATION
  • 2010 Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems in COMPUTING AND COMBINATORICS
  • 2010 Approximation Algorithms for Min-Max Generalization Problems in APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION. ALGORITHMS AND TECHNIQUES
  • 2009 Aligning Two Genomic Sequences That Contain Duplications in COMPARATIVE GENOMICS
  • 2009 1.25-Approximation Algorithm for Steiner Tree Problem with Distances 1 and 2 in ALGORITHMS AND DATA STRUCTURES
  • 2009 Approximating Transitive Reductions for Directed Networks in ALGORITHMS AND DATA STRUCTURES
  • 2008-01-31 On cycles in the transcription network of Saccharomyces cerevisiae in BMC SYSTEMS BIOLOGY
  • 2008-01-01 HCV Quasispecies Assembly Using Network Flows in BIOINFORMATICS RESEARCH AND APPLICATIONS
  • 2007-11-10 Consistent Sets of Secondary Structures in Proteins in ALGORITHMICA
  • 2007-08 Foreword in ALGORITHMICA
  • 2007 Bringing Folding Pathways into Strand Pairing Prediction in ALGORITHMS IN BIOINFORMATICS
  • 2007-01-01 Faster Approximation of Distances in Graphs in ALGORITHMS AND DATA STRUCTURES
  • 2007 Optimal Trade-Off for Merkle Tree Traversal in E-BUSINESS AND TELECOMMUNICATION NETWORKS
  • 2006-03-08 Fold classification based on secondary structure – how much is gained by including loop topology? in BMC MOLECULAR AND CELL BIOLOGY
  • 2006 A Linear-Time Algorithm for Studying Genetic Variation in ALGORITHMS IN BIOINFORMATICS
  • 2006 Applications of the Linear Matroid Parity Algorithm to Approximating Steiner Trees in COMPUTER SCIENCE – THEORY AND APPLICATIONS
  • 2006 Controlling Size When Aligning Multiple Genomic Sequences with Duplications in ALGORITHMS IN BIOINFORMATICS
  • 2005 On the Vehicle Routing Problem in ALGORITHMS AND DATA STRUCTURES
  • 2005 Approximating the Online Set Multicover Problems via Randomized Winnowing in ALGORITHMS AND DATA STRUCTURES
  • 2004 Tight Approximability Results for Test Set Problems in Bioinformatics in ALGORITHM THEORY - SWAT 2004
  • 2004 Randomized Approximation Algorithms for Set Multicover Problems with Applications to Reverse Engineering of Protein and Gene Networks in APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION. ALGORITHMS AND TECHNIQUES
  • 2004 The Protein Sequence Design Problem in Canonical Model on 2D and 3D Lattices in COMBINATORIAL PATTERN MATCHING
  • 2002-10-10 Fast Optimal Genome Tiling with Applications to Microarray Design and Homology Search in ALGORITHMS IN BIOINFORMATICS
  • 2002-08-29 1.375-Approximation Algorithm for Sorting by Reversals in ALGORITHMS — ESA 2002
  • 2002-06-25 Approximating Huffman Codes in Parallel in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 2002-06-25 Approximation Hardness of Bounded Degree MIN-CSP and MIN-BISECTION in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 2002 A Simple Approximation Algorithm for Nonoverlapping Local Alignments (Weighted Independent Sets of Axis Parallel Rectangles) in BIOCOMPUTING
  • 2001-08-17 An Online Algorithm for the Postman Problem with a Small Penalty in APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES
  • 2000-09 Multi-phase Algorithms for Throughput Maximization for Real-Time Scheduling in JOURNAL OF COMBINATORIAL OPTIMIZATION
  • 2000 On Approximation of the Power-p and Bottleneck Steiner Trees in ADVANCES IN STEINER TREES
  • 2000 A d/2 Approximation for Maximum Weight Independent Set in d-Claw Free Graphs in ALGORITHM THEORY - SWAT 2000
  • 2000 Variable Length Sequencing with Two Lengths in APPROXIMATION ALGORITHMS FOR COMBINATORIAL OPTIMIZATION
  • 1999-04 On Approximation Properties of the Independent Set Problem for Low Degree Graphs in THEORY OF COMPUTING SYSTEMS
  • 1999 The T-join Problem in Sparse Graphs: Applications to Phase Assignment Problem in VLSI Mask Layout in ALGORITHMS AND DATA STRUCTURES
  • 1999 On Some Tighter Inapproximability Results (Extended Abstract) in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 1998 Speed is more powerful than clairvoyance in ALGORITHM THEORY — SWAT'98
  • 1998 Adaptability and the Usefulness of Hints (Extended Abstract) in ALGORITHMS — ESA’ 98
  • 1997-04 Complexities of efficient solutions of rectilinear polygon cover problems in ALGORITHMICA
  • 1997 On the complexity of pattern matching for highly compressed two-dimensional texts in COMBINATORIAL PATTERN MATCHING
  • 1997 On-line load balancing for related machines in ALGORITHMS AND DATA STRUCTURES
  • 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": "http://www.grid.ac/institutes/grid.29857.31", 
              "type": "Organization"
            }, 
            "isCurrent": true, 
            "type": "OrganizationRole"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.40263.33", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.10388.32", 
            "type": "Organization"
          }
        ], 
        "familyName": "Berman", 
        "givenName": "Piotr", 
        "id": "sg:person.01274506210.27", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01274506210.27"
        ], 
        "sdDataset": "persons", 
        "sdDatePublished": "2022-06-01T22:52", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        }, 
        "sdSource": "s3://com-springernature-scigraph/baseset/20220601/entities/gbq_results/person/person_692.jsonl", 
        "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.01274506210.27'

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

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

    Turtle is a human-readable linked data format.

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

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

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


     




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


    ...