Stefan Kratsch

Srinivasa Rao Satti

Dagstuhl Reports, 2018

Multi-Budgeted Directed Cuts.

[BibT_eX]

[DOI]

Proceedings of the 13th International Symposium on Parameterized and Exact Computation, 2018

Efficient and Adaptive Parameterized Algorithms on Modular Decompositions.

[BibT_eX]

[DOI]

Florian Nelles

Proceedings of the 26th Annual European Symposium on Algorithms, 2018

Bipartite Graphs of Small Readability.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

2017

On the complexity of the identifiable subgraph problem, revisited.

[BibT_eX]

[DOI]

Martin Milanic

Discret. Appl. Math., 2017

Characterizing width two for variants of treewidth.

[BibT_eX]

[DOI]

Vincent J. C. Kreuzen

O-joung Kwon

Seongmin Ok

Discret. Appl. Math., 2017

Robust and Adaptive Search.

[BibT_eX]

[DOI]

Yann Disser

Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

The Parameterized Complexity of Finding a 2-Sphere in a Simplicial Complex.

[BibT_eX]

[DOI]

Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

Smaller Parameters for Vertex Cover Kernelization.

[BibT_eX]

[DOI]

Eva-Maria C. Hols

Proceedings of the 12th International Symposium on Parameterized and Exact Computation, 2017

Revenue Maximization in Stackelberg Pricing Games: Beyond the Combinatorial Setting.

[BibT_eX]

[DOI]

Toni Böhnlein

Oliver Schaudt

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Assessing the Computational Complexity of Multi-layer Subgraph Detection.

[BibT_eX]

[DOI]

Robert Bredereck

Christian Komusiewicz

Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

2016

Kernelization, Preprocessing for Treewidth.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Kernelization, Polynomial Lower Bounds.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

A Randomized Polynomial Kernel for Subset Feedback Vertex Set.

[BibT_eX]

[DOI]

Eva-Maria C. Hols

Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

Preprocessing Under Uncertainty.

[BibT_eX]

[DOI]

Vuong Anh Quyen

Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

Preprocessing Under Uncertainty: Matroid Intersection.

[BibT_eX]

[DOI]

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

A Randomized Polynomial Kernelization for Vertex Cover with a Smaller Parameter.

[BibT_eX]

[DOI]

Proceedings of the 24th Annual European Symposium on Algorithms, 2016

Parameterized Complexity of Team Formation in Social Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2016

2015

Approximability and parameterized complexity of multicover by c-intervals.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2015

An Experimental Analysis of a Polynomial Compression for the Steiner Cycle Problem.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms - 14th International Symposium, 2015

A Shortcut to (Sun)Flowers: Kernels in Logarithmic Space or Linear Time.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

Polynomial Kernels for Weighted Problems.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

On Kernelization and Approximation for the Vector Connectivity Problem.

[BibT_eX]

[DOI]

Manuel Sorge

Proceedings of the 10th International Symposium on Parameterized and Exact Computation, 2015

The Parameterized Complexity of the Minimum Shared Edges Problem.

[BibT_eX]

[DOI]

Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015

A Structural Approach to Kernels for ILPs: Treewidth and Total Unimodularity.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2015, 2015

2014

Kernelization Lower Bounds by Cross-Composition.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2014

Tight bounds for parameterized complexity of Cluster Editing with a small number of clusters.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2014

A Multivariate Complexity Analysis of Lobbying in Multiple Referenda.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2014

Recent developments in kernelization: A survey.

[BibT_eX]

[DOI]

Bull. EATCS, 2014

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

[BibT_eX]

[DOI]

Dagstuhl Reports, 2014

Colouring Reconfiguration Is Fixed-Parameter Tractable.

[BibT_eX]

[DOI]

CoRR, 2014

The Minimum Feasible Tileset Problem.

[BibT_eX]

[DOI]

Yann Disser

Manuel Sorge

Proceedings of the Approximation and Online Algorithms - 12th International Workshop, 2014

Point Line Cover: The Easy Kernel is Essentially Tight.

[BibT_eX]

[DOI]

Geevarghese Philip

Saurabh Ray

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Streaming Kernelization.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

On Kernels for Covering and Packing ILPs with Small Coefficients.

[BibT_eX]

[DOI]

Vuong Anh Quyen

Proceedings of the Parameterized and Exact Computation - 9th International Symposium, 2014

Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem.

[BibT_eX]

[DOI]

Gregory Z. Gutin

Proceedings of the Parameterized and Exact Computation - 9th International Symposium, 2014

Finding Shortest Paths Between Graph Colourings.

[BibT_eX]

[DOI]

Proceedings of the Parameterized and Exact Computation - 9th International Symposium, 2014

2013

Fixed-Parameter Tractability and Characterizations of Small Special Treewidth.

[BibT_eX]

[DOI]

Vincent J. C. Kreuzen

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2013

Fast hamiltonicity checking via bases of perfect matchings.

[BibT_eX]

[DOI]

Marek Cygan

Jesper Nederlof

Proceedings of the Symposium on Theory of Computing Conference, 2013

On Polynomial Kernels for Sparse Integer Linear Programs.

[BibT_eX]

[DOI]

Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

Tight bounds for Parameterized Complexity of Cluster Editing.

[BibT_eX]

[DOI]

Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

The Jump Number Problem: Exact and Parameterized.

[BibT_eX]

[DOI]

Dieter Kratsch

Proceedings of the Parameterized and Exact Computation - 8th International Symposium, 2013

A Completeness Theory for Polynomial (Turing) Kernelization.

[BibT_eX]

[DOI]

Proceedings of the Parameterized and Exact Computation - 8th International Symposium, 2013

Deterministic Single Exponential Time Algorithms for Connectivity Problems Parameterized by Treewidth.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

On Polynomial Kernels for Integer Linear Programs: Covering, Packing and Feasibility.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2013, 2013

How to Put through Your Agenda in Collective Binary Decisions.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Decision Theory - Third International Conference, 2013

2012

Solving weighted and counting variants of connectivity problems parameterized by treewidth deterministically in single exponential time

[BibT_eX]

[DOI]

CoRR, 2012

Polynomial Kernelizations for MIN F+Π1 and MAX NP.

[BibT_eX]

[DOI]

Algorithmica, 2012

Graph Isomorphism for Graph Classes Characterized by Two Forbidden Induced Subgraphs.

[BibT_eX]

[DOI]

Pascal Schweitzer

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012

Kernel Lower Bounds Using Co-nondeterminism: Finding Induced Hereditary Subgraphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory - SWAT 2012, 2012

Kernel Bounds for Structural Parameterizations of Pathwidth.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory - SWAT 2012, 2012

Compression via matroids: a randomized polynomial kernel for odd cycle transversal.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Co-nondeterminism in compositions: a kernelization lower bound for a Ramsey-type problem.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

Clique Cover and Graph Separation: New Incompressibility Results.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

Representative Sets and Irrelevant Vertices: New Tools for Kernelization.

[BibT_eX]

[DOI]

Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

A Multivariate Complexity Analysis of Lobbying in Multiple Referenda.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011

Subexponential fixed-parameter tractability of cluster editing

[BibT_eX]

[DOI]

CoRR, 2011

Hierarchies of Inefficient Kernelizability

[BibT_eX]

[DOI]

CoRR, 2011

Parameterized Two-Player Nash Equilibrium.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2011

Cross-Composition: A New Technique for Kernelization Lower Bounds.

[BibT_eX]

[DOI]

Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011

On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal.

[BibT_eX]

[DOI]

Proceedings of the Parameterized and Exact Computation - 6th International Symposium, 2011

Safe Approximation and Its Relation to Kernelization.

[BibT_eX]

[DOI]

Jiong Guo

Iyad A. Kanj

Proceedings of the Parameterized and Exact Computation - 6th International Symposium, 2011

Kernel Bounds for Path and Cycle Problems.

[BibT_eX]

[DOI]

Proceedings of the Parameterized and Exact Computation - 6th International Symposium, 2011

Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

Data Reduction for Graph Coloring Problems.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory - 18th International Symposium, 2011

Parameterized Complexity of Vertex Deletion into Perfect Graph Classes.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory - 18th International Symposium, 2011

2010

Kernelization of generic problems: upper and lower bounds.

[BibT_eX]

[DOI]

PhD thesis, 2010

Isomorphism for Graphs of Bounded Feedback Vertex Set Number.

[BibT_eX]

[DOI]

Pascal Schweitzer

Proceedings of the Algorithm Theory, 2010

Bin Packing with Fixed Number of Bins Revisited.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2010

Fixed Parameter Evolutionary Algorithms and Maximum Leaf Spanning Trees: A Matter of Mutation.

[BibT_eX]

[DOI]

Per Kristian Lehre

Frank Neumann

Pietro Simone Oliveto

Proceedings of the Parallel Problem Solving from Nature, 2010

Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems.

[BibT_eX]

[DOI]

Dániel Marx

Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

Preprocessing of Min Ones Problems: A Dichotomy.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

2009

Polynomial Kernelizations for $\MINF_1$ and $\MNP$

[BibT_eX]

[DOI]

CoRR, 2009

Polynomial Kernelizations for MIN F<sup>+</sup>Pi<sub>1</sub> and MAX NP.

[BibT_eX]

[DOI]

Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

Two Edge Modification Problems without Polynomial Kernels.

[BibT_eX]

[DOI]

Proceedings of the Parameterized and Exact Computation, 4th International Workshop, 2009

Fixed-parameter evolutionary algorithms and the vertex cover problem.

[BibT_eX]

[DOI]