Piotr Sankowski

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Harold N. Gabow

> Home > Persons > Piotr Sankowski

Publications

2021
[j18]
- view
  authority control:
- export record
  dblp key:
  - journals/siamcomp/GabowS21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/GabowS21
Harold N. Gabow, Piotr Sankowski:
Algorithms for Weighted Matching Generalizations I: Bipartite Graphs, b-matching, and Unweighted f-factors. SIAM J. Comput. 50(2): 440-486 (2021)
[j17]
- view
  authority control:
- export record
  dblp key:
  - journals/siamcomp/GabowS21a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/GabowS21a
Harold N. Gabow, Piotr Sankowski:
Algorithms for Weighted Matching Generalizations II: f-factors and the Special Case of Shortest Paths. SIAM J. Comput. 50(2): 555-601 (2021)
2015
[j10]
- view
  authority control:
- export record
  dblp key:
  - journals/jacm/CyganGS15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jacm/CyganGS15
Marek Cygan, Harold N. Gabow, Piotr Sankowski:
Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter, and Matchings. J. ACM 62(4): 28:1-28:30 (2015)
2013
[c34]
- view
  authority control:
- export record
  dblp key:
  - conf/focs/GabowS13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/focs/GabowS13
Harold N. Gabow, Piotr Sankowski:
Algebraic Algorithms for B-Matching, Shortest Undirected Paths, and F-Factors. FOCS 2013: 137-146
[i11]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1304-6740
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1304-6740
Harold N. Gabow, Piotr Sankowski:
Algebraic Algorithms for b-Matching, Shortest Undirected Paths, and f-Factors. CoRR abs/1304.6740 (2013)
2012
[c29]
- view
  authority control:
- export record
  dblp key:
  - conf/focs/CyganGS12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/focs/CyganGS12
Marek Cygan, Harold N. Gabow, Piotr Sankowski:
Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter and Matchings. FOCS 2012: 531-540
[i8]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1204-1616
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1204-1616
Marek Cygan, Harold N. Gabow, Piotr Sankowski:
Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter and Matchings. CoRR abs/1204.1616 (2012)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.