Algorithms-lup-obsolete
1 – 39 of 39
- show: 50
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=" "
width=" "
height=" "
allowtransparency="true"
frameborder="0">
</iframe>
- 2016
-
Mark
Constrained Multilinear Detection and Generalized Graph Motifs
(
- Contribution to journal › Article
- 2015
-
Mark
A Fire Fighter's Problem.
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Monstret i Turings bibliotek
(
- Contribution to specialist publication or newspaper › Specialist publication article
-
Mark
Spotting Trees with Few Leaves
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
The Parity of Set Systems under Random Restrictions with Applications to Exponential Time Problems
2015) The 42nd International Colloquium on Automata, Languages, and Programming (ICALP 2015) 9134. p.231-242(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Graph colouring algorithms
2015) p.277-303(
- Chapter in Book/Report/Conference proceeding › Book chapter
- 2014
-
Mark
Determinant Sums for Undirected Hamiltonicity
(
- Contribution to journal › Article
-
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
Exponential Time Complexity of the Permanent and the Tutte Polynomial
(
- Contribution to journal › Article
-
Mark
Listing Triangles
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Fast Witness Extraction using a Decision Oracle
(
- 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
Shortest cycle through specified elements
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
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
Below All Subsets for Some Permutational Counting Problems
(
- Contribution to journal › Article
- 2011
-
Mark
Covering and packing in linear space
(
- Contribution to journal › Article
- 2010
-
Mark
Determinant sums for undirected Hamiltonicity
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Invitation to algorithmic uses of inclusion–exclusion
2010) 38th International Colloquium on Automata, Languages and Programming (ICALP 2011) 6756. p.42-59(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Exponential time complexity of the permanent and the Tutte polynomial
2010) 37th International Colloquium on Automata, Languages and Programming (ICALP 2010) In Lecture Notes in Computer Science 6198. p.426-437(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
The exponential time complexity of computing the probability that a graph is connected
2010) 5th International Symposium on Parameterized and Exact Computation (IPEC 2010) 6198. p.192-203(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Trimmed moebius inversion and graphs of bounded degree
(
- Contribution to journal › Article
-
Mark
Exact covers via determinants
2010) 27th International Symposium on Theoretical Aspects of Computer Science, STACS 2010 5. p.95-106(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Evaluation of permanents in rings and semirings
(
- Contribution to journal › Article
-
Mark
Covering and packing in linear space
2010) 37th International Colloquium on Automata, Languages and Programming (ICALP 2010) 6198. p.727-737(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Narrow sieves for parameterized paths and packings
(
- Contribution to journal › Article
- 2009
-
Mark
Set partitioning via inclusion-exclusion
(
- Contribution to journal › Article
-
Mark
Counting paths and packings in halves
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2008
-
Mark
Computing the Tutte polynomial in vertex-exponential time
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Exact algorithms for exact satisfiability and number of perfect matchings
(
- Contribution to journal › Article
-
Mark
The travelling salesman problem in bounded degree graphs
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Exact graph coloring using inclusion–exclusion
2008) p.289-290(
- Chapter in Book/Report/Conference proceeding › Book chapter
-
Mark
Trimmed moebius inversion and graphs of bounded degree
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2007
-
Mark
Fourier meets Möbius: fast subset convolution
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding