Andrzej Proskurowski


Ontology type: schema:Person     


Person Info

NAME

Andrzej

SURNAME

Proskurowski

Publications in SciGraph latest 50 shown

  • 2013 Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs in GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE
  • 2011 A Generic Approach to Decomposition Algorithms, with an Application to Digraph Decomposition in COMPUTING AND COMBINATORICS
  • 2008 Minimum Distortion Embeddings into a Path of Bipartite Permutation and Threshold Graphs in ALGORITHM THEORY – SWAT 2008
  • 2006 Qualitative Reasoning and Bifurcations in Dynamic Systems in MICAI 2006: ADVANCES IN ARTIFICIAL INTELLIGENCE
  • 2006 Generation of Graphs with Bounded Branchwidth in GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE
  • 2005-06-10 An algebraic theory of graph reduction in GRAPH GRAMMARS AND THEIR APPLICATION TO COMPUTER SCIENCE
  • 2002-11-08 Geometric Systems of Disjoint Representatives in GRAPH DRAWING
  • 2002-07-18 Coloring Mixed Hypertrees in GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE
  • 2002-03-15 Embeddings of k-Connected Graphs of Pathwidth k in ALGORITHM THEORY - SWAT 2000
  • 2001-10-16 Distance Constrained Labeling of Precolored Trees in THEORETICAL COMPUTER SCIENCE
  • 2000-01 Memory Requirements for Table Computations in Partial \sl k -Tree Algorithms in ALGORITHMICA
  • 2000-01 Faster Algorithms for Subgraph Isomorphism of \sl k -Connected Partial \sl k -Trees in ALGORITHMICA
  • 1999-12 Hamiltonicity of Amalgams in GRAPHS AND COMBINATORICS
  • 1999 Multi-coloring Trees in COMPUTING AND COMBINATORICS
  • 1998 Memory requirements for table computations in partial k-tree algorithms in ALGORITHM THEORY — SWAT'98
  • 1997-12 Minimum Self-Repairing Graphs in GRAPHS AND COMBINATORICS
  • 1997 Complexity of colored graph covers I. Colored directed multigraphs in GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE
  • 1996 A technique for recognizing graphs of bounded treewidth with application to subclasses of partial 2-paths in GRAPH GRAMMARS AND THEIR APPLICATION TO COMPUTER SCIENCE
  • 1996 Faster algorithms for subgraph isomorphism of κ-connected partial κ-trees in ALGORITHMS — ESA '96
  • 1995 Complexity of graph covering problems in GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE
  • 1993 Practical algorithms on partial k-trees with an application to domination-like problems in ALGORITHMS AND DATA STRUCTURES
  • 1992-06 Canonical representations of partial 2- and 3-trees in BIT NUMERICAL MATHEMATICS
  • 1991 Monadic second order logic, tree automata and forbidden minors in COMPUTER SCIENCE LOGIC
  • 1990 Efficient Computations in Tree-Like Graphs in COMPUTATIONAL GRAPH THEORY
  • 1990 Canonical representations of partial 2-and 3-trees in SWAT 90
  • 1988 Generating binary trees by transpositions in SWAT 88
  • 1987 Fast parallel algorithms for the subgraph homeomorphism and the subgraph isomorphism problem for classes of planar graphs in FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE
  • 1984 Concurrent transmissions in broadcast networks in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 1983 On Halin graphs in GRAPH THEORY
  • 1981-04 Minimum dominating cycles in outerplanar graphs in INTERNATIONAL JOURNAL OF PARALLEL PROGRAMMING
  • 1981-02 Partitioning trees: Matching, domination, and maximum diameter in INTERNATIONAL JOURNAL OF PARALLEL PROGRAMMING
  • 1979-10 Minimum dominating cycles in 2-trees in INTERNATIONAL JOURNAL OF PARALLEL PROGRAMMING
  • 1979-06 Canonical incidence matrices of graphs in BIT NUMERICAL MATHEMATICS
  • 1974-06 Search for a unique incidence matrix of a graph in BIT NUMERICAL MATHEMATICS
  • 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.170202.6", 
              "type": "Organization"
            }, 
            "isCurrent": true, 
            "type": "OrganizationRole"
          }
        ], 
        "familyName": "Proskurowski", 
        "givenName": "Andrzej", 
        "id": "sg:person.013546165773.39", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013546165773.39"
        ], 
        "sdDataset": "persons", 
        "sdDatePublished": "2019-03-07T14:02", 
        "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_1801.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.013546165773.39'

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

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

    Turtle is a human-readable linked data format.

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

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

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


     




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


    ...