Algorithms-lup-obsolete
11 – 20 of 39
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=" "
width=" "
height=" "
allowtransparency="true"
frameborder="0">
</iframe>
- 2014
-
Mark
Shortest Two Disjoint Paths in Polynomial Time
2014) Automata, Languages, and Programming : 41st International Colloquium, ICALP 2014 8572. p.211-222(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Counting Thin Subgraphs via Packings Faster Than Meet-in-the-Middle Time
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Automata, Languages, and Programming
- Book/Report › Conference proceeding (editor)
- 2013
-
Mark
Probably Optimal Graph Motifs
2013) 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), LIPIcs 20. p.20-31(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Exponential Algorithms: Algorithms and Complexity Beyond Polynomial Time
(
- Contribution to journal › Article
-
Mark
The Parity of Directed Hamiltonian Cycles
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Counting Closed Trails
(
- Contribution to journal › Letter
- 2012
-
Mark
Fast zeta transforms for point lattices
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Counting perfect matchings as fast as Ryser
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Shortest cycle through specified elements
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding