| Publication | Date of Publication | Type |
|---|
An \(\mathcal{O}(3.82^k)\) time \(\mathcal{FPT}\) algorithm for convex flip distance
| 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 |
The complexity of tree partitioning
Algorithmica | 2020-09-03 | Paper |
New and improved spanning ratios for Yao graphs
Proceedings of the thirtieth annual symposium on Computational geometry | 2018-04-23 | Paper |
There are Plane Spanners of Maximum Degree 4
Proceedings of the thirtieth annual symposium on Computational geometry | 2018-04-23 | Paper |
On the parameterized complexity of monotone and antimonotone weighted circuit satisfiability
Information and Computation | 2017-11-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 |
New and improved spanning ratios for Yao graphs
| 2017-03-30 | Paper |
Flip distance is in FPT time \(O(n+ k \cdot c^k)\)
| 2017-01-24 | Paper |
Edge-disjoint packing of stars and cycles
Theoretical Computer Science | 2016-07-05 | Paper |
Edge-disjoint packing of stars and cycles
Combinatorial Optimization and Applications | 2016-02-05 | Paper |
Improved parameterized and exact algorithms for cut problems on trees
Theoretical Computer Science | 2015-12-11 | Paper |
Algorithms for cut problems on trees
Combinatorial Optimization and Applications | 2015-09-11 | Paper |
There are plane spanners of degree 4 and moderate stretch factor
Discrete & Computational Geometry | 2015-06-18 | Paper |
Improved upper bound on the stretch factor of Delaunay triangulations
Proceedings of the twenty-seventh annual symposium on Computational geometry | 2014-03-24 | Paper |
On certain geometric properties of the Yao-Yao graphs
Journal of Combinatorial Optimization | 2014-02-25 | Paper |
The stretch factor of the Delaunay triangulation is less than 1.998
SIAM Journal on Computing | 2013-11-14 | Paper |
When is weighted satisfiability FPT?
Lecture Notes in Computer Science | 2013-08-12 | 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 |
Kernelization for cycle transversal problems
Discrete Applied Mathematics | 2012-05-30 | Paper |
On the induced matching problem
Journal of Computer and System Sciences | 2012-01-11 | Paper |
On the small cycle transversal of planar graphs
Theoretical Computer Science | 2011-07-14 | 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 |
On the small cycle transversal of planar graphs
Graph Theoretic Concepts in Computer Science | 2010-11-16 | Paper |
Improved upper bounds for vertex cover
Theoretical Computer Science | 2010-10-11 | Paper |
Linear FPT reductions and computational lower bounds
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing | 2010-08-15 | Paper |
Kernelization for cycle transversal problems
Algorithmic Aspects in Information and Management | 2010-07-20 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2009-08-07 | Paper |
On parameterized exponential time complexity
Theoretical Computer Science | 2009-07-10 | 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 |
Mathematical Foundations of Computer Science 2004
Lecture Notes in Computer Science | 2005-08-22 | Paper |
scientific article; zbMATH DE number 2038759 (Why is no real title available?)
| 2004-02-08 | Paper |
