| Publication | Date of Publication | Type |
|---|
| Hard problems on random graphs | 2026-03-18 | Paper |
| Evaluating restricted first-order counting properties on nowhere dense classes and beyond | 2025-01-06 | Paper |
| The online simple knapsack problem with reservation and removability | 2024-12-03 | Paper |
Transformations of probability distributions
Theoretical Computer Science | 2024-10-08 | Paper |
| Delaying decisions and reservation costs | 2024-08-22 | Paper |
| scientific article; zbMATH DE number 7803590 (Why is no real title available?) | 2024-02-12 | Paper |
scientific article; zbMATH DE number 7788442 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
Online knapsack with removal and recourse
Lecture Notes in Computer Science | 2023-12-22 | Paper |
| Maximum Shallow Clique Minors in Preferential Attachment Graphs Have Polylogarithmic Size | 2023-10-31 | Paper |
On the Advice Complexity of Online Edge- and Node-Deletion Problems
Adventures Between Lower Bounds and Higher Altitudes | 2023-06-30 | Paper |
| The secretary problem with reservation costs | 2023-03-30 | Paper |
| An open pouring problem | 2023-02-07 | Paper |
First-Order Model-Checking in Random Graphs and Complex Networks
(available as arXiv preprint) | 2023-02-07 | Paper |
| Motif Counting in Preferential Attachment Graphs | 2023-02-03 | Paper |
| scientific article; zbMATH DE number 7650219 (Why is no real title available?) | 2023-02-03 | Paper |
The complexity of packing edge-disjoint paths
(available as arXiv preprint) | 2023-02-03 | Paper |
PRAM's towards realistic parallelism: BRAM's
Fundamentals of Computation Theory | 2022-12-09 | Paper |
Further results on online node- and edge-deletion problems with advice
Lecture Notes in Computer Science | 2022-10-13 | Paper |
Reoptimization of parameterized problems
Acta Informatica | 2022-08-30 | Paper |
Parallel recognition and ranking of context-free languages
Mathematical Foundations of Computer Science 1992 | 2022-08-18 | Paper |
The emptiness problem for intersections of regular languages
Mathematical Foundations of Computer Science 1992 | 2022-08-18 | Paper |
| scientific article; zbMATH DE number 7559401 (Why is no real title available?) | 2022-07-18 | Paper |
Online node- and edge-deletion problems with advice
Algorithmica | 2021-09-02 | Paper |
| An Efficient Fixed-Parameter Algorithm for the 2-Plex Bipartition Problem | 2020-11-25 | Paper |
Local structure theorems for Erdős-Rényi graphs and their algorithmic applications
SOFSEM 2018: Theory and Practice of Computer Science | 2020-10-21 | Paper |
Width, depth, and space: tradeoffs between branching and dynamic programming
Algorithms | 2020-01-21 | Paper |
What one has to know when attacking \(\mathsf{P}\) vs.\(\mathsf{NP}\)
Journal of Computer and System Sciences | 2019-11-29 | Paper |
Evaluation of an MSO-Solver
2012 Proceedings of the Fourteenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
Structural sparsity of complex networks: bounded expansion in random models and real-world graphs
Journal of Computer and System Sciences | 2019-08-07 | Paper |
Structural sparsity of complex networks: bounded expansion in random models and real-world graphs
Journal of Computer and System Sciences | 2019-08-07 | Paper |
Moderately exponential time algorithms for the maximum bounded-degree-1 set problem
Discrete Applied Mathematics | 2018-12-03 | Paper |
Linear kernels and single-exponential algorithms via protrusion decompositions
ACM Transactions on Algorithms | 2018-10-30 | Paper |
Fixed-parameter algorithms for Vertex Cover \(P_3\)
Discrete Optimization | 2018-05-24 | Paper |
Optimal average case sorting on arrays
STACS 95 | 2017-12-04 | Paper |
| What one has to know when attacking \(\mathsf {P}\) vs. \(\mathsf {NP}\) (extended abstract) | 2017-11-22 | Paper |
Kernelization using structural parameters on sparse graph classes
Journal of Computer and System Sciences | 2016-11-14 | Paper |
Kernelization using structural parameters on sparse graph classes
Journal of Computer and System Sciences | 2016-11-14 | Paper |
Are there any good digraph width measures?
Journal of Combinatorial Theory. Series B | 2015-12-11 | Paper |
Finite integer index of pathwidth and treewidth
Parameterized and Exact Computation | 2015-09-15 | Paper |
Practical algorithms for MSO model-checking on tree-decomposable graphs
Computer Science Review | 2014-11-24 | Paper |
A faster parameterized algorithm for treedepth
Automata, Languages, and Programming | 2014-07-01 | Paper |
Exact algorithms for problems related to the densest \(k\)-set problem
Information Processing Letters | 2014-05-05 | Paper |
Testing consistency of quartet topologies: a parameterized approach
Information Processing Letters | 2014-04-14 | Paper |
Digraph width measures in parameterized algorithmics
Discrete Applied Mathematics | 2014-04-02 | Paper |
The online knapsack problem: advice and randomization
Theoretical Computer Science | 2014-03-13 | Paper |
Lower bounds on the complexity of \(\mathsf{MSO}_1\) model-checking
Journal of Computer and System Sciences | 2014-01-28 | Paper |
Fast exact algorithm for \(L(2,1)\)-labeling of graphs
Theoretical Computer Science | 2014-01-16 | Paper |
Kernelization using structural parameters on sparse graph classes
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Linear kernels and single-exponential algorithms via protrusion decompositions
Lecture Notes in Computer Science | 2013-08-06 | Paper |
Recognition of probe distance-hereditary graphs
Discrete Applied Mathematics | 2013-01-18 | Paper |
On the power of randomness versus advice in online computation
Lecture Notes in Computer Science | 2012-11-01 | Paper |
| A fine-grained analysis of a simple independent set algorithm | 2012-10-24 | Paper |
| Lower bounds on the complexity of \(\mathrm{MSO}_1\) model-checking | 2012-08-23 | Paper |
On the advice complexity of the knapsack problem
LATIN 2012: Theoretical Informatics | 2012-06-29 | Paper |
Courcelle's theorem -- a game-theoretic approach
Discrete Optimization | 2012-04-05 | Paper |
An exact algorithm for the maximum leaf spanning tree problem
Theoretical Computer Science | 2012-01-09 | Paper |
A new algorithm for finding trees with many leaves
Algorithmica | 2011-12-14 | Paper |
A property tester for tree-likeness of quartet topologies
Theory of Computing Systems | 2011-11-30 | Paper |
Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack
Journal of Discrete Algorithms | 2011-08-23 | Paper |
Fast exact algorithm for \(L(2,1)\)-labeling of graphs
Lecture Notes in Computer Science | 2011-07-01 | Paper |
Linear-time algorithms for graphs of bounded rankwidth: a fresh look using game theory (extended abstract)
Lecture Notes in Computer Science | 2011-07-01 | Paper |
Are there any good digraph width measures?
Parameterized and Exact Computation | 2010-12-07 | Paper |
New fixed-parameter algorithms for the minimum quartet inconsistency problem
Theory of Computing Systems | 2010-10-06 | Paper |
A Parameterized Route to Exact Puzzles: Breaking the 2 n -Barrier for Irredundance
Lecture Notes in Computer Science | 2010-05-28 | Paper |
A bound on the pathwidth of sparse graphs with applications to exact algorithms
SIAM Journal on Discrete Mathematics | 2010-03-17 | Paper |
Parameterized power domination complexity
Information Processing Letters | 2010-01-18 | Paper |
An exact algorithm for the maximum leaf spanning tree problem
Parameterized and Exact Computation | 2010-01-14 | Paper |
On digraph width measures in parameterized algorithmics
Parameterized and Exact Computation | 2010-01-14 | Paper |
Randomized divide-and-conquer: improved path, matching, and packing algorithms
SIAM Journal on Computing | 2010-01-06 | Paper |
Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution
Lecture Notes in Computer Science | 2009-10-29 | Paper |
Reoptimization of Steiner trees: changing the terminal set
Theoretical Computer Science | 2009-08-21 | Paper |
Breaking Anonymity by Learning a Unique Minimum Hitting Set
Computer Science - Theory and Applications | 2009-08-18 | Paper |
A New Algorithm for Finding Trees with Many Leaves
Algorithms and Computation | 2009-01-29 | Paper |
Improved Upper Bounds for Partial Vertex Cover
Graph-Theoretic Concepts in Computer Science | 2009-01-20 | Paper |
Divide-and-Color
Graph-Theoretic Concepts in Computer Science | 2008-09-04 | Paper |
An efficient automata approach to some problems on context-free grammars.
Information Processing Letters | 2008-06-27 | Paper |
Enumerate and expand: Improved algorithms for connected vertex cover and tree cover
Theory of Computing Systems | 2008-06-17 | Paper |
New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem
Parameterized and Exact Computation | 2008-06-05 | Paper |
Intuitive Algorithms and t-Vertex Cover
Algorithms and Computation | 2008-04-24 | Paper |
A Faster Algorithm for the Steiner Tree Problem
STACS 2006 | 2008-03-19 | Paper |
Partial vs. Complete Domination: t-Dominating Set
Lecture Notes in Computer Science | 2008-03-07 | Paper |
Dynamic programming for minimum Steiner trees
Theory of Computing Systems | 2007-12-19 | Paper |
Enumerate and Expand: New Runtime Bounds for Vertex Cover Variants
Lecture Notes in Computer Science | 2007-09-10 | Paper |
Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover
Computer Science – Theory and Applications | 2007-05-02 | Paper |
An efficient fixed-parameter algorithm for 3-hitting set
Journal of Discrete Algorithms | 2007-04-26 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Mathematical Foundations of Computer Science 2005
Lecture Notes in Computer Science | 2006-10-20 | Paper |
| scientific article; zbMATH DE number 2081011 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2080245 (Why is no real title available?) | 2004-08-04 | Paper |
Fixed-parameter algorithms for CLOSEST STRING and related problems
Algorithmica | 2004-03-11 | Paper |
Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT.
Discrete Applied Mathematics | 2003-09-15 | Paper |
On efficient fixed-parameter algorithms for weighted vertex cover
Journal of Algorithms | 2003-08-17 | Paper |
A general method to speed up fixed-parameter-tractable algorithms
Information Processing Letters | 2002-07-25 | Paper |
| scientific article; zbMATH DE number 1670780 (Why is no real title available?) | 2001-11-11 | Paper |
Stochastic finite learning of the pattern languages
Machine Learning | 2001-10-14 | Paper |
Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries
Theoretical Computer Science | 2001-08-20 | Paper |
A uniform framework for problems on context-free grammars
Bulletin of the European Association for Theoretical Computer Science EATCS | 2001-07-18 | Paper |
New Upper Bounds for Maximum Satisfiability
Journal of Algorithms | 2001-05-06 | Paper |
| scientific article; zbMATH DE number 1405665 (Why is no real title available?) | 2000-10-17 | Paper |
Optimal deterministic sorting and routing on grids and tori with diagonals
Algorithmica | 2000-05-28 | Paper |
| scientific article; zbMATH DE number 1453034 (Why is no real title available?) | 2000-05-25 | Paper |
| scientific article; zbMATH DE number 1414311 (Why is no real title available?) | 2000-03-16 | Paper |
| scientific article; zbMATH DE number 1372649 (Why is no real title available?) | 1999-12-01 | Paper |
| scientific article; zbMATH DE number 1346519 (Why is no real title available?) | 1999-10-03 | Paper |
| scientific article; zbMATH DE number 1304341 (Why is no real title available?) | 1999-09-24 | Paper |
| scientific article; zbMATH DE number 1101595 (Why is no real title available?) | 1998-09-20 | Paper |
Unambiguous computations and locally definable acceptance types
Theoretical Computer Science | 1998-08-13 | Paper |
Expressing uniformity via oracles
Theory of Computing Systems | 1997-07-28 | Paper |
| scientific article; zbMATH DE number 977923 (Why is no real title available?) | 1997-05-25 | Paper |
Unambiguous auxiliary pushdown automata and semi-unbounded fan-in circuits
Information and Computation | 1995-07-10 | Paper |
| scientific article; zbMATH DE number 512853 (Why is no real title available?) | 1994-06-13 | Paper |
| scientific article; zbMATH DE number 176503 (Why is no real title available?) | 1993-05-18 | Paper |
Observations on \(\log(n)\) time parallel recognition of unambiguous cfl's
Information Processing Letters | 1993-05-16 | Paper |
| scientific article; zbMATH DE number 4209587 (Why is no real title available?) | 1990-01-01 | Paper |
