| Publication | Date of Publication | Type |
|---|
The parameterized complexity of coordinated motion planning
| 2024-10-16 | Paper |
The role of twins in computing planar supports of hypergraphs
Journal of Graph Algorithms and Applications | 2024-10-08 | Paper |
Nearly time-optimal kernelization algorithms for the line-cover problem with big data
Algorithmica | 2024-08-13 | Paper |
Near-optimal algorithms for point-line covering problems
| 2024-04-23 | Paper |
scientific article; zbMATH DE number 7692358 (Why is no real title available?)
| 2023-06-05 | Paper |
A Colored Path Problem and Its Applications
ACM Transactions on Algorithms | 2023-04-26 | Paper |
On the parameterized complexity of clustering problems for incomplete data
Journal of Computer and System Sciences | 2023-03-10 | Paper |
On covering segments with unit intervals
| 2023-02-07 | Paper |
On Covering Segments with Unit Intervals
SIAM Journal on Discrete Mathematics | 2022-06-03 | Paper |
On existential MSO and its relation to ETH
ACM Transactions on Computation Theory | 2022-03-07 | Paper |
scientific article; zbMATH DE number 7378721 (Why is no real title available?)
| 2021-08-04 | Paper |
How to navigate through obstacles?
| 2021-07-28 | Paper |
The complexity of tree partitioning
Algorithmica | 2020-09-03 | Paper |
Solving partition problems almost always requires pushing many vertices around
SIAM Journal on Discrete Mathematics | 2020-03-11 | Paper |
There are Plane Spanners of Maximum Degree 4
Proceedings of the thirtieth annual symposium on Computational geometry | 2018-04-23 | Paper |
On existential MSO and its relation to ETH
| 2018-03-21 | Paper |
Finding points in general position
International Journal of Computational Geometry & Applications | 2018-02-22 | Paper |
Degree four plane spanners: simpler and better
| 2018-01-30 | Paper |
On the parameterized complexity of monotone and antimonotone weighted circuit satisfiability
Information and Computation | 2017-11-16 | Paper |
Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs
Journal of Computer and System Sciences | 2017-11-14 | Paper |
Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs
| 2017-10-17 | Paper |
On the Parameterized Complexity of Finding Small Unsatisfiable Subsets of CNF Formulas and CSP Instances
ACM Transactions on Computational Logic | 2017-10-16 | Paper |
Computing the flip distance between triangulations
Discrete & Computational Geometry | 2017-10-10 | Paper |
The complexity of tree partitioning
Lecture Notes in Computer Science | 2017-09-22 | Paper |
Degree four plane spanners: simpler and better
| 2017-03-30 | Paper |
Twins in Subdivision Drawings of Hypergraphs
Lecture Notes in Computer Science | 2017-02-21 | Paper |
Flip distance is in FPT time \(O(n+ k \cdot c^k)\)
| 2017-01-24 | Paper |
On the ordered list subgraph embedding problems
Algorithmica | 2016-04-06 | Paper |
Improved parameterized and exact algorithms for cut problems on trees
Theoretical Computer Science | 2015-12-11 | Paper |
Parameterized and subexponential-time complexity of satisfiability problems and applications
Theoretical Computer Science | 2015-12-11 | Paper |
Algorithms for cut problems on trees
Combinatorial Optimization and Applications | 2015-09-11 | Paper |
Parameterized and subexponential-time complexity of satisfiability problems and applications
Combinatorial Optimization and Applications | 2015-09-11 | Paper |
Well-Formed Separator Sequences, with an Application to Hypergraph Drawing
| 2015-07-08 | Paper |
3-hitting set on bounded degree hypergraphs: upper and lower bounds on the kernel size
Discrete Mathematics, Algorithms and Applications | 2015-07-01 | Paper |
There are plane spanners of degree 4 and moderate stretch factor
Discrete & Computational Geometry | 2015-06-18 | Paper |
On the subexponential-time complexity of CSP
Journal of Artificial Intelligence Research | 2015-03-04 | Paper |
On certain geometric properties of the Yao-Yao graphs
Journal of Combinatorial Optimization | 2014-02-25 | Paper |
On the ordered list subgraph embedding problems
Lecture Notes in Computer Science | 2013-12-10 | Paper |
When is weighted satisfiability FPT?
Lecture Notes in Computer Science | 2013-08-12 | Paper |
Local backbones
Theory and Applications of Satisfiability Testing – SAT 2013 | 2013-08-05 | Paper |
On the independence number of graphs with maximum degree 3
Theoretical Computer Science | 2013-06-06 | Paper |
On geometric spanners of Euclidean and unit disk graphs
| 2013-03-19 | Paper |
On the Induced Matching Problem
| 2013-03-19 | Paper |
Parameterized top-\(K\) algorithms
Theoretical Computer Science | 2013-02-19 | Paper |
On certain geometric properties of the Yao-Yao graphs
Combinatorial Optimization and Applications | 2012-11-02 | Paper |
Improved local algorithms for spanner construction
Theoretical Computer Science | 2012-10-11 | Paper |
Parameterized complexity and subexponential-time computability
The Multivariate Algorithmic Revolution and Beyond | 2012-09-05 | Paper |
Multicut in trees viewed through the eyes of vertex cover
Journal of Computer and System Sciences | 2012-08-17 | Paper |
Safe approximation and its relation to kernelization
Parameterized and Exact Computation | 2012-06-15 | Paper |
On the induced matching problem
Journal of Computer and System Sciences | 2012-01-11 | Paper |
On the Independence Number of Graphs with Maximum Degree 3
Graph-Theoretic Concepts in Computer Science | 2011-12-16 | Paper |
Editing graphs into disjoint unions of dense clusters
Algorithmica | 2011-12-14 | Paper |
Local algorithms for edge colorings in UDGs
Theoretical Computer Science | 2011-09-12 | Paper |
Multicut in trees viewed through the eyes of vertex cover
Lecture Notes in Computer Science | 2011-08-12 | Paper |
3-\textsc{hitting set} on bounded degree hypergraphs: upper and lower bounds on the kernel size
Theory and Practice of Algorithms in (Computer) Systems | 2011-05-12 | Paper |
On the stretch factor of Delaunay triangulations of points in convex position
Computational Geometry | 2011-01-31 | Paper |
On spanners and lightweight spanners of geometric graphs
SIAM Journal on Computing | 2011-01-17 | Paper |
Improved upper bounds for vertex cover
Theoretical Computer Science | 2010-10-11 | Paper |
The parameterized complexity of some minimum label problems
Journal of Computer and System Sciences | 2010-10-07 | Paper |
Linear FPT reductions and computational lower bounds
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing | 2010-08-15 | Paper |
Local Algorithms for Edge Colorings in UDGs
Graph-Theoretic Concepts in Computer Science | 2010-01-21 | Paper |
The parameterized complexity of some minimum label problems
Graph-Theoretic Concepts in Computer Science | 2010-01-21 | Paper |
What makes equitable connected partition easy
Parameterized and Exact Computation | 2010-01-14 | Paper |
Editing graphs into disjoint unions of dense clusters
Algorithms and Computation | 2009-12-17 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2009-08-07 | Paper |
Convex Recoloring Revisited: Complexity and Exact Algorithms
Lecture Notes in Computer Science | 2009-07-23 | Paper |
On parameterized exponential time complexity
Theoretical Computer Science | 2009-07-10 | Paper |
On Spanners of Geometric Graphs
Lecture Notes in Computer Science | 2009-06-03 | Paper |
On Parameterized Exponential Time Complexity
Lecture Notes in Computer Science | 2009-06-03 | Paper |
On the pseudo-achromatic number problem
Theoretical Computer Science | 2009-03-17 | Paper |
On the Pseudo-achromatic Number Problem
Graph-Theoretic Concepts in Computer Science | 2009-01-20 | Paper |
Computing Lightweight Spanners Locally
Lecture Notes in Computer Science | 2008-11-20 | Paper |
Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size
SIAM Journal on Computing | 2008-08-14 | Paper |
Seeing the trees and their branches in the network is hard
Theoretical Computer Science | 2008-07-31 | Paper |
The compatibility of binary characters on phylogenetic networks: Complexity and parameterized algorithms
Algorithmica | 2008-07-01 | Paper |
On the Effective Enumerability of NP Problems
Parameterized and Exact Computation | 2008-06-03 | Paper |
Reconstructing Evolution of Natural Languages: Complexity and Parameterized Algorithms
Lecture Notes in Computer Science | 2007-09-10 | Paper |
Improved Parameterized Upper Bounds for Vertex Cover
Lecture Notes in Computer Science | 2007-09-05 | Paper |
Genus characterizes the complexity of certain graph problems: Some tight results
Journal of Computer and System Sciences | 2007-08-23 | Paper |
Polynomial time approximation schemes and parameterized complexity
Discrete Applied Mathematics | 2007-02-19 | Paper |
Strong computational lower bounds via parameterized complexity
Journal of Computer and System Sciences | 2006-12-07 | Paper |
On the computational hardness based on linear fpt-reductions
Journal of Combinatorial Optimization | 2006-08-14 | Paper |
Labeled search trees and amortized analysis: Improved upper bounds for NP-hard problems
Algorithmica | 2006-03-21 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
STACS 2005
Lecture Notes in Computer Science | 2005-12-02 | Paper |
Tight lower bounds for certain parameterized NP-hard problems
Information and Computation | 2005-10-10 | Paper |
Parameterized and Exact Computation
Lecture Notes in Computer Science | 2005-08-23 | Paper |
Mathematical Foundations of Computer Science 2004
Lecture Notes in Computer Science | 2005-08-22 | Paper |
On approximating minimum vertex cover for graphs with perfect matching
Theoretical Computer Science | 2005-06-30 | Paper |
Using nondeterminism to design efficient deterministic algorithms
Algorithmica | 2004-10-01 | Paper |
Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms
Journal of Computer and System Sciences | 2004-08-19 | Paper |
Improved exact algorithms for MAX-SAT
Discrete Applied Mathematics | 2004-08-19 | Paper |
scientific article; zbMATH DE number 2086240 (Why is no real title available?)
| 2004-08-11 | Paper |
scientific article; zbMATH DE number 2080241 (Why is no real title available?)
| 2004-08-04 | Paper |
scientific article; zbMATH DE number 2081099 (Why is no real title available?)
| 2004-08-04 | Paper |
scientific article; zbMATH DE number 2044921 (Why is no real title available?)
| 2004-02-18 | Paper |
scientific article; zbMATH DE number 2038759 (Why is no real title available?)
| 2004-02-08 | Paper |
scientific article; zbMATH DE number 1929955 (Why is no real title available?)
| 2003-06-18 | Paper |
The inapproximability of non-NP-hard optimization problems.
Theoretical Computer Science | 2003-01-21 | Paper |
Vertex cover: Further observations and further improvements
Journal of Algorithms | 2002-07-08 | Paper |
scientific article; zbMATH DE number 1420918 (Why is no real title available?)
| 2000-06-07 | Paper |
