Daniel Lokshtanov

According to our database1, Daniel Lokshtanov
  • authored at least 228 papers between 2005 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
Uniform Kernelization Complexity of Hitting Forbidden Minors.
ACM Trans. Algorithms, 2017

Representative Families of Product Families.
ACM Trans. Algorithms, 2017

Parameterized Complexity of Directed Steiner Tree on Sparse Graphs.
SIAM J. Discrete Math., 2017

Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth.
SIAM J. Comput., 2017

Irrelevant vertices for the planar Disjoint Paths Problem.
J. Comb. Theory, Ser. B, 2017

Faster exact algorithms for some terminal set problems.
J. Comput. Syst. Sci., 2017

Parameterized Complexity and Approximability of Directed Odd Cycle Transversal.
CoRR, 2017

The Half-integral Erdös-Pósa Property for Non-null Cycles.
CoRR, 2017

Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms.
CoRR, 2017

Packing Cycles Faster Than Erdős-Pósa.
CoRR, 2017

The complexity of independent set reconfiguration on bipartite graphs.
CoRR, 2017

Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs.
CoRR, 2017

Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion.
CoRR, 2017

Polylogarithmic Approximation Algorithms for Weighted-$\mathcal{F}$-Deletion Problems.
CoRR, 2017

Quick but Odd Growth of Cacti.
Algorithmica, 2017

Lossy kernelization.
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

Matrix Rigidity from the Viewpoint of Parameterized Complexity.
Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

Split Contraction: The Untold Story.
Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

Beating Brute Force for Systems of Polynomial Equations over Finite Fields.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Fully polynomial-time parameterized computations for graphs and matrices of low treewidth.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Spanning Circuits in Regular Matroids.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Packing Cycles Faster Than Erdos-Posa.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Covering Vectors by Spaces: Regular Matroids.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

A Linear-Time Parameterized Algorithm for Node Unique Label Cover.
Proceedings of the 25th Annual European Symposium on Algorithms, 2017

2016
Kernelization, Bidimensionality and Kernels.
Encyclopedia of Algorithms, 2016

On Problems as Hard as CNF-SAT.
ACM Trans. Algorithms, 2016

Tree Deletion Set Has a Polynomial Kernel but No OPTO(1) Approximation.
SIAM J. Discrete Math., 2016

Hitting Forbidden Minors: Approximation and Kernelization.
SIAM J. Discrete Math., 2016

A ck n 5-Approximation Algorithm for Treewidth.
SIAM J. Comput., 2016

Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms.
J. ACM, 2016

(Meta) Kernelization.
J. ACM, 2016

A Linear Time Parameterized Algorithm for Node Unique Label Cover.
CoRR, 2016

A Linear Time Parameterized Algorithm for Directed Feedback Vertex Set.
CoRR, 2016

Below all subsets for Minimal Connected Dominating Set.
CoRR, 2016

Lossy Kernelization.
CoRR, 2016

A 2ℓk Kernel for ℓ-Component Order Connectivity.
CoRR, 2016

Bidimensionality and Kernels.
CoRR, 2016

Subexponential parameterized algorithms for planar and apex-minor-free graphs via low treewidth pattern covering.
CoRR, 2016

Spanning Circuits in Regular Matroids.
CoRR, 2016

On the Ordered List Subgraph Embedding Problems.
Algorithmica, 2016

Lower Bounds for Approximation Schemes for Closest String.
Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory, 2016

Exact algorithms via monotone local search.
Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

Faster Exact and Parameterized Algorithm for Feedback Vertex Set in Tournaments.
Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

Kernelization and Sparseness: the Case of Dominating Set.
Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

Simultaneous Feedback Vertex Set: A Parameterized Perspective.
Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

Independence and Efficient Domination on P6-free Graphs.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

A New Perspective on FO Model Checking of Dense Graph Classes.
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

A Faster FPT Algorithm and a Smaller Kernel for Block Graph Vertex Deletion.
Proceedings of the LATIN 2016: Theoretical Informatics, 2016

A 2lk Kernel for l-Component Order Connectivity.
Proceedings of the 11th International Symposium on Parameterized and Exact Computation, 2016

Kernelization of Cycle Packing with Relaxed Disjointness Constraints.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Faster Exact and Parameterized Algorithm for Feedback Vertex Set in Bipartite Tournaments.
Proceedings of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2016

Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering.
Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems.
Proceedings of the 32nd International Symposium on Computational Geometry, 2016

2015
Independence and Efficient Domination on P6-free Graph.
CoRR, 2015

Reconfiguration on sparse graphs.
CoRR, 2015

Parameterized Integer Quadratic Programming: Variables and Coefficients.
CoRR, 2015

Faster Exact and Parameterized Algorithm for Feedback Vertex Set in Tournaments.
CoRR, 2015

Uniform Kernelization Complexity of Hitting Forbidden Minors.
CoRR, 2015

FO Model Checking on Posets of Bounded Width.
CoRR, 2015

Fully polynomial-time parameterized computations for graphs and matrices of low treewidth.
CoRR, 2015

Exact Algorithms via Monotone Local Search.
CoRR, 2015

On the Threshold of Intractability.
CoRR, 2015

Lower bounds for approximation schemes for Closest String.
CoRR, 2015

Simultaneous Feedback Vertex Set: A Parameterized Perspective.
CoRR, 2015

A faster FPT Algorithm and a smaller Kernel for Block Graph Vertex Deletion.
CoRR, 2015

Reconfiguration on Sparse Graphs.
Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Solving d-SAT via Backdoors to Small Treewidth.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Quick but Odd Growth of Cacti.
Proceedings of the 10th International Symposium on Parameterized and Exact Computation, 2015

Linear Time Parameterized Algorithms for Subset Feedback Vertex Set.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

Deterministic Truncation of Linear Matroids.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

Uniform Kernelization Complexity of Hitting Forbidden Minors.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

FO Model Checking on Posets of Bounded Width.
Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

Fast Algorithms for Parameterized Problems with Relaxed Disjointness Constraints.
Proceedings of the Algorithms - ESA 2015, 2015

On the Threshold of Intractability.
Proceedings of the Algorithms - ESA 2015, 2015

Consensus Patterns (Probably) Has no EPTAS.
Proceedings of the Algorithms - ESA 2015, 2015

Parameterized Algorithms
Springer, ISBN: 978-3-319-21275-3, 2015

2014
SeeSite: Characterizing Relationships between Splice Junctions and Splicing Enhancers.
IEEE/ACM Trans. Comput. Biology Bioinform., 2014

Faster Parameterized Algorithms Using Linear Programming.
ACM Trans. Algorithms, 2014

Kernelization Lower Bounds Through Colors and IDs.
ACM Trans. Algorithms, 2014

Almost Optimal Lower Bounds for Problems Parameterized by Clique-Width.
SIAM J. Comput., 2014

On the Hardness of Losing Width.
Theory Comput. Syst., 2014

Optimality and tight results in parameterized complexity (Dagstuhl Seminar 14451).
Dagstuhl Reports, 2014

Graph Modification Problems (Dagstuhl Seminar 14071).
Dagstuhl Reports, 2014

Fixed-parameter tractable canonization and isomorphism test for graphs of bounded treewidth.
CoRR, 2014

Deterministic Truncation of Linear Matroids.
CoRR, 2014

On the Ordered List Subgraph Embedding Problems.
CoRR, 2014

Representative sets for multisets.
CoRR, 2014

Representative Sets of Product Families.
CoRR, 2014

Parameterized Complexity of Bandwidth on Trees.
CoRR, 2014

Kernelization and Sparseness: the case of Dominating Set.
CoRR, 2014

Contracting Graphs to Paths and Trees.
Algorithmica, 2014

On Cutwidth Parameterized by Vertex Cover.
Algorithmica, 2014

Minimum bisection is fixed parameter tractable.
Proceedings of the Symposium on Theory of Computing, 2014

Independent Set in P5-Free Graphs in Polynomial Time.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

A Near-Optimal Planarization Algorithm.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Efficient Computation of Representative Sets with Applications in Parameterized and Exact Algorithms.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Parameterized Complexity of Bandwidth on Trees.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Tree Deletion Set Has a Polynomial Kernel (but no OPT^O(1) Approximation).
Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth.
Proceedings of the 55th IEEE Annual Symposium on Foundations of Computer Science, 2014

Solving Multicut Faster Than 2 n.
Proceedings of the Algorithms - ESA 2014, 2014

Representative Sets of Product Families.
Proceedings of the Algorithms - ESA 2014, 2014

2013
Distortion is Fixed Parameter Tractable.
TOCT, 2013

Obtaining a Bipartite Graph by Contracting Few Edges.
SIAM J. Discrete Math., 2013

Quadratic Upper Bounds on the Erdős-Pósa Property for a Generalization of Packing and Covering Cycles.
Journal of Graph Theory, 2013

Imbalance is fixed parameter tractable.
Inf. Process. Lett., 2013

Clustering with local restrictions.
Inf. Comput., 2013

Fixed-parameter algorithms for Cochromatic Number and Disjoint Rectangle Stabbing via iterative localization.
Inf. Comput., 2013

Beyond bidimensionality: Parameterized subexponential algorithms on directed graphs.
Inf. Comput., 2013

A O(c^k n) 5-Approximation Algorithm for Treewidth
CoRR, 2013

Efficient Computation of Representative Sets with Applications in Parameterized and Exact Algorithms
CoRR, 2013

Tree Deletion Set has a Polynomial Kernel (but no OPT^O(1) approximation).
CoRR, 2013

Minimum Bisection is fixed parameter tractable.
CoRR, 2013

Irrelevant Vertices for the Planar Disjoint Paths Problem.
CoRR, 2013

Computing Optimal Steiner Trees in Polynomial Space.
Algorithmica, 2013

Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs.
Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

On the Hardness of Eliminating Small Induced Subgraphs by Contracting Edges.
Proceedings of the Parameterized and Exact Computation - 8th International Symposium, 2013

Hardness of r-dominating set on Graphs of Diameter (r + 1).
Proceedings of the Parameterized and Exact Computation - 8th International Symposium, 2013

On the Ordered List Subgraph Embedding Problems.
Proceedings of the Parameterized and Exact Computation - 8th International Symposium, 2013

Faster Exact Algorithms for Some Terminal Set Problems.
Proceedings of the Parameterized and Exact Computation - 8th International Symposium, 2013

The Fine Details of Fast Dynamic Programming over Tree Decompositions.
Proceedings of the Parameterized and Exact Computation - 8th International Symposium, 2013

Near-Optimal Bounds for Cross-Validation via Loss Stability.
Proceedings of the 30th International Conference on Machine Learning, 2013

An O(c^k n) 5-Approximation Algorithm for Treewidth.
Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

Parameterized Complexity of Directed Steiner Tree on Sparse Graphs.
Proceedings of the Algorithms - ESA 2013, 2013

2012
Kernel(s) for problems with no kernel: On out-trees with many leaves.
ACM Trans. Algorithms, 2012

Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time.
SIAM J. Discrete Math., 2012

Cops and Robber Game Without Recharging.
Theory Comput. Syst., 2012

Faster algorithms for finding and counting subgraphs.
J. Comput. Syst. Sci., 2012

Local search: Is brute-force avoidable?
J. Comput. Syst. Sci., 2012

Parameterized Complexity of Directed Steiner Tree on Sparse Graphs
CoRR, 2012

Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs
CoRR, 2012

Planar F-Deletion: Approximation and Optimal FPT Algorithms
CoRR, 2012

Faster Parameterized Algorithms using Linear Programming
CoRR, 2012

Sharp Separation and Applications to Exact and Parameterized Algorithms.
Algorithmica, 2012

Linear kernels for (connected) dominating set on H-minor-free graphs.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Bidimensionality and geometric graphs.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Parameterized Tractability of Multiway Cut with Parity Constraints.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

Subexponential Parameterized Odd Cycle Transversal on Planar Graphs.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012

Planar F-Deletion: Approximation, Kernelization and Optimal FPT Algorithms.
Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

On Problems as Hard as CNF-SAT.
Proceedings of the 27th Conference on Computational Complexity, 2012

Kernelization - Preprocessing with a Guarantee.
Proceedings of the Multivariate Algorithmic Revolution and Beyond, 2012

2011
A linear kernel for a planar connected dominating set.
Theor. Comput. Sci., 2011

Bandwidth on AT-free graphs.
Theor. Comput. Sci., 2011

An exact algorithm for minimum distortion embedding.
Theor. Comput. Sci., 2011

Guard games on graphs: Keep the intruder out!
Theor. Comput. Sci., 2011

Cutwidth of Split Graphs and Threshold Graphs.
SIAM J. Discrete Math., 2011

On the complexity of reconstructing H-free graphs from their Star Systems.
Journal of Graph Theory, 2011

Subexponential algorithms for partial cover problems.
Inf. Process. Lett., 2011

On the complexity of some colorful problems parameterized by treewidth.
Inf. Comput., 2011

Lower bounds based on the Exponential Time Hypothesis.
Bulletin of the EATCS, 2011

On the directed Full Degree Spanning Tree problem.
Discrete Optimization, 2011

Treewidth governs the complexity of target set selection.
Discrete Optimization, 2011

On Problems as Hard as CNFSAT
CoRR, 2011

Outlier Detection for DNA Fragment Assembly
CoRR, 2011

Bidimensionality and Geometric Graphs
CoRR, 2011

Contracting Graphs to Paths and Trees
CoRR, 2011

Obtaining a Bipartite Graph by Contracting Few Edges
CoRR, 2011

Planar k-Path in Subexponential Time and Polynomial Space.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2011

Feedback Vertex Set in Mixed Graphs.
Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011

Hitting forbidden minors: Approximation and Kernelization.
Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011

Known Algorithms on Graphs on Bounded Treewidth are Probably Optimal.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Slightly Superexponential Parameterized Problems.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Bidimensionality and EPTAS.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Contracting Graphs to Paths and Trees.
Proceedings of the Parameterized and Exact Computation - 6th International Symposium, 2011

On Cutwidth Parameterized by Vertex Cover.
Proceedings of the Parameterized and Exact Computation - 6th International Symposium, 2011

On the Hardness of Losing Width.
Proceedings of the Parameterized and Exact Computation - 6th International Symposium, 2011

Clustering with Local Restrictions.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

Tight Bounds for Linkages in Planar Graphs.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

Obtaining a Bipartite Graph by Contracting Few Edges.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011

Kernelization: An Overview.
Proceedings of the Fundamentals of Computation Theory - 18th International Symposium, 2011

2010
Intractability of Clique-Width Parameterizations.
SIAM J. Comput., 2010

Characterizing and computing minimal cograph completions.
Discrete Applied Mathematics, 2010

On the complexity of computing treelength.
Discrete Applied Mathematics, 2010

Feedback Vertex Set in Mixed Graphs
CoRR, 2010

Hitting forbidden minors: Approximation and Kernelization
CoRR, 2010

Known Algorithms on Graphs of Bounded Treewidth are Probably Optimal
CoRR, 2010

Bidimensionality and EPTAS
CoRR, 2010

Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs
CoRR, 2010

Generalized Graph Clustering: Recognizing (p, q)-Cluster Graphs.
Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time.
Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing.
Proceedings of the Algorithm Theory, 2010

Cops and Robber Game without Recharging.
Proceedings of the Algorithm Theory, 2010

Saving space by algebraization.
Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs.
Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010

Bidimensionality and Kernels.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Algorithmic Lower Bounds for Problems Parameterized with Clique-Width.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Algorithmic Lower Bounds for Problems on Decomposable Graphs.
Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

Sharp Separation and Applications to Exact and Parameterized Algorithms.
Proceedings of the LATIN 2010: Theoretical Informatics, 2010

Ranking and Drawing in Subexponential Time.
Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

Determining the Winner of a Dodgson Election is Hard.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

Imbalance Is Fixed Parameter Tractable.
Proceedings of the Computing and Combinatorics, 16th Annual International Conference, 2010

Fast Local Search Algorithm for Weighted Feedback Arc Set in Tournaments.
Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

2009
The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number.
Theory Comput. Syst., 2009

Finding the longest isometric cycle in a graph.
Discrete Applied Mathematics, 2009

Faster Algorithms for Finding and Counting Subgraphs
CoRR, 2009

(Meta) Kernelization
CoRR, 2009

An Exact Algorithm for Minimum Distortion Embedding.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2009

Guard Games on Graphs: Keep the Intruder Out!
Proceedings of the Approximation and Online Algorithms, 7th International Workshop, 2009

Linear Kernel for Planar Connected Dominating Set.
Proceedings of the Theory and Applications of Models of Computation, 6th Annual Conference, 2009

Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves.
Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

Clique-width: on the price of generality.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

An exact almost optimal algorithm for target set selection in social networks.
Proceedings of the Proceedings 10th ACM Conference on Electronic Commerce (EC-2009), 2009

Even Faster Algorithm for Set Splitting!
Proceedings of the Parameterized and Exact Computation, 4th International Workshop, 2009

On the Directed Degree-Preserving Spanning Tree Problem.
Proceedings of the Parameterized and Exact Computation, 4th International Workshop, 2009

Planar Capacitated Dominating Set Is W[1]-Hard.
Proceedings of the Parameterized and Exact Computation, 4th International Workshop, 2009

Simpler Parameterized Algorithm for OCT.
Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

Bandwidth on AT-Free Graphs.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Local Search: Is Brute-Force Avoidable?
Proceedings of the IJCAI 2009, 2009

Distortion Is Fixed Parameter Tractable.
Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009

Incompressibility through Colors and IDs.
Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009

Fast FAST.
Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009

Subexponential Algorithms for Partial Cover Problems.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2009

(Meta) Kernelization.
Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009

2008
Kernel(s) for Problems With no Kernel: On Out-Trees With Many Leaves
CoRR, 2008

Parameterized Low-distortion Embeddings - Graph metrics into lines and trees
CoRR, 2008

Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2008

On the Complexity of Reconstructing H -free Graphs from Their Star Systems.
Proceedings of the LATIN 2008: Theoretical Informatics, 2008

Wheel-Free Deletion Is W[2]-Hard.
Proceedings of the Parameterized and Exact Computation, Third International Workshop, 2008

Capacitated Domination and Covering: A Parameterized Perspective.
Proceedings of the Parameterized and Exact Computation, Third International Workshop, 2008

Graph Layout Problems Parameterized by Vertex Cover.
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

Characterizing and Computing Minimal Cograph Completions.
Proceedings of the Frontiers in Algorithmics, Second Annual International Workshop, 2008

2007
On the Complexity of Computing Treelength.
Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

On the Complexity of Some Colorful Problems Parameterized by Treewidth.
Proceedings of the Combinatorial Optimization and Applications, 2007

2006
Optimal broadcast domination in polynomial time.
Discrete Mathematics, 2006

2005
Optimal Broadcast Domination of Arbitrary Graphs in Polynomial Time.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005

Fixed Parameter Set Splitting, Linear Kernel and Improved Running Time.
Proceedings of the Algorithms and Complexity in Durham 2005, 2005


  Loading...