Saket Saurabh

Orcid: 0000-0001-7847-6402

Affiliations:
  • Institute of Mathematical Sciences, Chennai, India


According to our database1, Saket Saurabh authored at least 434 papers between 2002 and 2024.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Diverse collections in matroids and graphs.
Math. Program., March, 2024

The Parameterized Complexity of Guarding Almost Convex Polygons.
Discret. Comput. Geom., March, 2024

Partitioning subclasses of chordal graphs with few deletions.
Theor. Comput. Sci., February, 2024

Odd Cycle Transversal on P<sub>5</sub>-free Graphs in Polynomial Time.
CoRR, 2024

On the Parameterized Complexity of Minus Domination.
Proceedings of the SOFSEM 2024: Theory and Practice of Computer Science, 2024

Parameterized Approximation Algorithms for Weighted Vertex Cover.
Proceedings of the LATIN 2024: Theoretical Informatics, 2024

Max-SAT with Cardinality Constraint Parameterized by the Number of Clauses.
Proceedings of the LATIN 2024: Theoretical Informatics, 2024

Quick-Sort Style Approximation Algorithms for Generalizations of Feedback Vertex Set in Tournaments.
Proceedings of the LATIN 2024: Theoretical Informatics, 2024

Kernelization of Counting Problems.
Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

Exponential-Time Approximation Schemes via Compression.
Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

2023
Further Exploiting <i>c</i>-Closure for FPT Algorithms and Kernels for Domination Problems.
SIAM J. Discret. Math., December, 2023

Small Vertex Cover Helps in Fixed-Parameter Tractability of Graph Deletion Problems over Data Streams.
Theory Comput. Syst., December, 2023

Even More Effort Towards Improved Bounds and Fixed-Parameter Tractability for Multiwinner Rules.
Algorithmica, December, 2023

Detours in directed graphs.
J. Comput. Syst. Sci., November, 2023

Almost optimal query algorithm for hitting set using a subset query.
J. Comput. Syst. Sci., November, 2023

Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number.
Algorithmica, July, 2023

Polynomial Kernel for Interval Vertex Deletion.
ACM Trans. Algorithms, April, 2023

Kernelization of Arc Disjoint Cycle Packing in α-Bounded Digraphs.
Theory Comput. Syst., April, 2023

Erdős-Pósa property of obstructions to interval graphs.
J. Graph Theory, April, 2023

On the optimality of pseudo-polynomial algorithms for integer programming.
Math. Program., March, 2023

Parameterized algorithms for finding highly connected solution.
Theor. Comput. Sci., 2023

Parameterized complexity of multi-node hubs.
J. Comput. Syst. Sci., 2023

Clustering what Matters: Optimal Approximation for Clustering with Outliers.
J. Artif. Intell. Res., 2023

Euclidean Bottleneck Steiner Tree is Fixed-Parameter Tractable.
CoRR, 2023

How to assign volunteers to tasks compatibly ? A graph theoretic and parameterized approach.
CoRR, 2023

Meta-theorems for Parameterized Streaming Algorithms.
CoRR, 2023

Hitting Subgraphs in Sparse Graphs and Geometric Intersection Graphs.
CoRR, 2023

An Improved Exact Algorithm for Knot-Free Vertex Deletion.
CoRR, 2023

An ETH-Tight Algorithm for Bidirected Steiner Connectivity.
Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

Balanced Substructures in Bicolored Graphs.
Proceedings of the SOFSEM 2023: Theory and Practice of Computer Science, 2023

A Framework for Approximation Schemes on Disk Graphs.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Parameterized Approximation Scheme for Biclique-free Max <i>k</i>-Weight SAT and Max Coverage.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Parameterized Approximation Scheme for Feedback Vertex Set.
Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

Fixed-Parameter Algorithms for Fair Hitting Set Problems.
Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

Difference Determines the Degree: Structural Kernelizations of Component Order Connectivity.
Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

Parameterized Algorithms for Eccentricity Shortest Path Problem.
Proceedings of the Combinatorial Algorithms - 34th International Workshop, 2023

Burn and Win.
Proceedings of the Combinatorial Algorithms - 34th International Workshop, 2023

On the Complexity of the Eigenvalue Deletion Problem.
Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

Breaking the All Subsets Barrier for Min k-Cut.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

FPT Approximations for Packing and Covering Problems Parameterized by Elimination Distance and Even Less.
Proceedings of the 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2023

Lossy Kernelization for (Implicit) Hitting Set Problems.
Proceedings of the 31st Annual European Symposium on Algorithms, 2023

Kernelization for Spreading Points.
Proceedings of the 31st Annual European Symposium on Algorithms, 2023

A Parameterized Algorithm for Vertex Connectivity Survivable Network Design Problem with Uniform Demands.
Proceedings of the 31st Annual European Symposium on Algorithms, 2023

Parameterized Complexity of Fair Bisection: (FPT-Approximation meets Unbreakability).
Proceedings of the 31st Annual European Symposium on Algorithms, 2023

FPT Constant-Approximations for Capacitated Clustering to Minimize the Sum of Cluster Radii.
Proceedings of the 39th International Symposium on Computational Geometry, 2023

Minimum-Membership Geometric Set Cover, Revisited.
Proceedings of the 39th International Symposium on Computational Geometry, 2023

2022
Resolute control: Forbidding candidates from winning an election is hard.
Theor. Comput. Sci., 2022

On the complexity of singly connected vertex deletion.
Theor. Comput. Sci., 2022

On Treewidth and Stable Marriage: Parameterized Algorithms and Hardness Results (Complete Characterization).
SIAM J. Discret. Math., 2022

A Fixed-Parameter Tractable Algorithm for Elimination Distance to Bounded Degree Graphs.
SIAM J. Discret. Math., 2022

Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering.
SIAM J. Comput., 2022

Exact Multi-Covering Problems with Geometric Sets.
Theory Comput. Syst., 2022

On the parameterized complexity of Grid Contraction.
J. Comput. Syst. Sci., 2022

(Re)packing Equal Disks into Rectangle.
CoRR, 2022

Highly unbreakable graph with a fixed excluded minor are almost rigid.
CoRR, 2022

Parameterized Algorithms for Locally Minimal Defensive Alliance.
CoRR, 2022

Maximum Minimal Feedback Vertex Set: A Parameterized Perspective.
CoRR, 2022

Parameterized Complexity of Graph Partitioning into Connected Clusters.
CoRR, 2022

Theory research in India: 2019-2022.
Commun. ACM, 2022

On the Parameterized Complexity of Maximum Degree Contraction Problem.
Algorithmica, 2022

Parameterized Complexity of Directed Spanner Problems.
Algorithmica, 2022

A Polynomial Kernel for Bipartite Permutation Vertex Deletion.
Algorithmica, 2022

Fast Exact Algorithms for Survivable Network Design with Uniform Requirements.
Algorithmica, 2022

Parameterized Complexity of Maximum Edge Colorable Subgraph.
Algorithmica, 2022

Fixed-parameter tractability of graph isomorphism in graphs with an excluded minor.
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems.
Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

Subexponential Parameterized Algorithms on Disk Graphs (Extended Abstract).
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Subexponential Parameterized Algorithms for Cut and Cycle Hitting Problems on H<-Minor-Free Graphs.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Deleting, Eliminating and Decomposing to Hereditary Classes Are All FPT-Equivalent.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Gehrlein Stable Committee with Multi-modal Preferences.
Proceedings of the Algorithmic Game Theory - 15th International Symposium, 2022

An Exact Algorithm for Knot-Free Vertex Deletion.
Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

Parameterized Complexity of Non-Separating and Non-Disconnecting Paths and Sets.
Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

List Homomorphism: Beyond the Known Boundaries.
Proceedings of the LATIN 2022: Theoretical Informatics, 2022

Exact Exponential Algorithms for Clustering Problems.
Proceedings of the 17th International Symposium on Parameterized and Exact Computation, 2022

A Finite Algorithm for the Realizabilty of a Delaunay Triangulation.
Proceedings of the 17th International Symposium on Parameterized and Exact Computation, 2022

Parameterized Analysis for the Group Activity Selection Problem on Graphs.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics 2022 (ISAIM 2022), 2022

Parameterized Complexity of Set-Restricted Disjoint Paths on Chordal Graphs.
Proceedings of the Computer Science - Theory and Applications, 2022

Output Sensitive Fault Tolerant Maximum Matching.
Proceedings of the Computer Science - Theory and Applications, 2022

True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk Graphs.
Proceedings of the 38th International Symposium on Computational Geometry, 2022

Point Separation and Obstacle Removal by Finding and Hitting Odd Cycles.
Proceedings of the 38th International Symposium on Computational Geometry, 2022

2021
On the Parameterized Approximability of Contraction to Classes of Chordal Graphs.
ACM Trans. Comput. Theory, 2021

Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds.
ACM Trans. Comput. Theory, 2021

Multiplicative Parameterization Above a Guarantee.
ACM Trans. Comput. Theory, 2021

Parameterized complexity of fair feedback vertex set problem.
Theor. Comput. Sci., 2021

Balanced stable marriage: How close is close enough?
Theor. Comput. Sci., 2021

Paths to trees and cacti.
Theor. Comput. Sci., 2021

2-Approximating Feedback Vertex Set in Tournaments.
ACM Trans. Algorithms, 2021

Approximate Counting of <i>k</i>-Paths: Simpler, Deterministic, and in Polynomial Space.
ACM Trans. Algorithms, 2021

Randomized Contractions Meet Lean Decompositions.
ACM Trans. Algorithms, 2021

ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs.
J. Comput. Geom., 2021

Parameterized and exact algorithms for class domination coloring.
Discret. Appl. Math., 2021

Space-Efficient FPT Algorithms.
CoRR, 2021

α-approximate Reductions: a Novel Source of Heuristics for Better Approximation Algorithms.
CoRR, 2021

Elimination Distance to Topological-minor-free Graphs is FPT.
CoRR, 2021

Approximation in (Poly-) Logarithmic Space.
Algorithmica, 2021

Packing Arc-Disjoint Cycles in Tournaments.
Algorithmica, 2021

Simultaneous Feedback Edge Set: A Parameterized Perspective.
Algorithmica, 2021

Odd Cycle Transversal in Mixed Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2021

Exploiting Dense Structures in Parameterized Complexity.
Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021

An FPT Algorithm for Elimination Distance to Bounded Degree Graphs.
Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021

Efficient Computation of Representative Weight Functions with Applications to Parameterized Counting (Extended Version).
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

FPT-approximation for FPT Problems.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

A Constant Factor Approximation for Navigating Through Connected Obstacles in the Plane.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Strong Connectivity Augmentation is FPT.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Gerrymandering on Graphs: Computational Complexity and Parameterized Algorithms.
Proceedings of the Algorithmic Game Theory - 14th International Symposium, 2021

A Polynomial Kernel for Bipartite Permutation Vertex Deletion.
Proceedings of the 16th International Symposium on Parameterized and Exact Computation, 2021

A Polynomial Kernel for Deletion to Ptolemaic Graphs.
Proceedings of the 16th International Symposium on Parameterized and Exact Computation, 2021

An ETH-Tight Algorithm for Multi-Team Formation.
Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2021

ETH Tight Algorithms for Geometric Intersection Graphs: Now in Polynomial Space.
Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2021

k-Distinct Branchings Admits a Polynomial Kernel.
Proceedings of the 29th Annual European Symposium on Algorithms, 2021

Circumventing Connectivity for Kernelization.
Proceedings of the Algorithms and Complexity - 12th International Conference, 2021

2020
Linear representation of transversal matroids and gammoids parameterized by rank.
Theor. Comput. Sci., 2020

Fixed-parameter tractable algorithms for Tracking Shortest Paths.
Theor. Comput. Sci., 2020

Fully dynamic arboricity maintenance.
Theor. Comput. Sci., 2020

Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms.
ACM Trans. Algorithms, 2020

Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems.
ACM Trans. Algorithms, 2020

Approximation Schemes for Low-rank Binary Matrix Approximation Problems.
ACM Trans. Algorithms, 2020

Polylogarithmic Approximation Algorithms for Weighted-ℱ-deletion Problems.
ACM Trans. Algorithms, 2020

Going Far from Degeneracy.
SIAM J. Discret. Math., 2020

Path Contraction Faster than 2<sup>n</sup>.
SIAM J. Discret. Math., 2020

Bidimensionality and Kernels.
SIAM J. Comput., 2020

Fixed-Parameter Tractable Algorithm and Polynomial Kernel for Max-Cut Above Spanning Tree.
Theory Comput. Syst., 2020

Subexponential algorithm for <i>d</i>-cluster edge deletion: Exception or rule?
J. Comput. Syst. Sci., 2020

Faster Graph bipartization.
J. Comput. Syst. Sci., 2020

A characterization of König-Egerváry graphs with extendable vertex covers.
Inf. Process. Lett., 2020

Popular Matching in Roommates Setting is NP-hard.
Bull. EATCS, 2020

On the Parameterized Complexity of \textsc{Maximum Degree Contraction} Problem.
CoRR, 2020

Approximation algorithms for geometric conflict free covering problems.
Comput. Geom., 2020

On the Approximate Compressibility of Connected Vertex Cover.
Algorithmica, 2020

Quadratic Vertex Kernel for Rainbow Matching.
Algorithmica, 2020

Parameterized Complexity of Geometric Covering Problems Having Conflicts.
Algorithmica, 2020

A Polynomial Sized Kernel for Tracking Paths Problem.
Algorithmica, 2020

Parameterized Complexity of Conflict-Free Matchings and Paths.
Algorithmica, 2020

Gehrlein stability in committee selection: parameterized hardness and algorithms.
Auton. Agents Multi Agent Syst., 2020

An exponential time parameterized algorithm for planar disjoint paths.
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

Hitting topological minors is FPT.
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

Parameterized Complexity and Approximability of Directed Odd Cycle Transversal.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Approximation Schemes via Width/Weight Trade-offs on Minor-free Graphs.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

On the Parameterized Complexity of Deletion to ℋ-Free Strong Components.
Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

Quick Separation in Chordal and Split Graphs.
Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

Graph Hamiltonicity Parameterized by Proper Interval Deletion Set.
Proceedings of the LATIN 2020: Theoretical Informatics, 2020

A Polynomial Kernel for Paw-Free Editing.
Proceedings of the 15th International Symposium on Parameterized and Exact Computation, 2020

Improved FPT Algorithms for Deletion to Forest-Like Structures.
Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

Fault Tolerant Subgraphs with Applications in Kernelization.
Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

Parameterization Above a Multiplicative Guarantee.
Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

Well-Structured Committees.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

A (2 + ε)-Factor Approximation Algorithm for Split Vertex Deletion.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

On the (Parameterized) Complexity of Almost Stable Marriage.
Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020

Parameterized Complexity of Feedback Vertex Sets on Hypergraphs.
Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020

Optimal Output Sensitive Fault Tolerant Cuts.
Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020

A Parameterized Approximation Scheme for Min $k$-Cut.
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

Fixed Parameter Tractability of Graph Deletion Problems over Data Streams.
Proceedings of the Computing and Combinatorics - 26th International Conference, 2020

Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths.
Proceedings of the Treewidth, Kernels, and Algorithms, 2020

Parameterized Algorithms.
Proceedings of the Beyond the Worst-Case Analysis of Algorithms, 2020

2019
Communication Complexity and Graph Families.
ACM Trans. Comput. Theory, 2019

Split Contraction: The Untold Story.
ACM Trans. Comput. Theory, 2019

The parameterized complexity landscape of finding 2-partitions of digraphs.
Theor. Comput. Sci., 2019

Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems.
ACM Trans. Algorithms, 2019

Clique-width III: Hamiltonian Cycle and the Odd Case of Graph Coloring.
ACM Trans. Algorithms, 2019

Spanning Circuits in Regular Matroids.
ACM Trans. Algorithms, 2019

Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion.
ACM Trans. Algorithms, 2019

Rank Vertex Cover as a Natural Problem for Algebraic Compression.
SIAM J. Discret. Math., 2019

Balanced Judicious Bipartition is Fixed-Parameter Tractable.
SIAM J. Discret. Math., 2019

Packing Cycles Faster Than Erdos-Posa.
SIAM J. Discret. Math., 2019

Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree.
SIAM J. Discret. Math., 2019

Editing to Connected F-Degree Graph.
SIAM J. Discret. Math., 2019

Minimum Bisection Is Fixed-Parameter Tractable.
SIAM J. Comput., 2019

On the Parameterized Complexity of Contraction to Generalization of Trees.
Theory Comput. Syst., 2019

Exact Algorithms via Monotone Local Search.
J. ACM, 2019

Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs.
Discret. Comput. Geom., 2019

New Horizons in Parameterized Complexity (Dagstuhl Seminar 19041).
Dagstuhl Reports, 2019

FPT Algorithms for Conflict-free Coloring of Graphs and Chromatic Terrain Guarding.
CoRR, 2019

A Brief Note on Single Source Fault Tolerant Reachability.
CoRR, 2019

Reducing Topological Minor Containment to the Unique Linkage Theorem.
CoRR, 2019

Subset Feedback Vertex Set in Chordal and Split Graphs.
Algorithmica, 2019

Parameterized Algorithms for List K-Cycle.
Algorithmica, 2019

Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs.
Algorithmica, 2019

The Parameterized Complexity of Cycle Packing: Indifference is Not an Issue.
Algorithmica, 2019

Parameterized Algorithms and Kernels for Rainbow Matching.
Algorithmica, 2019

Stability in barter exchange markets.
Auton. Agents Multi Agent Syst., 2019

Parameterized Computational Geometry via Decomposition Theorems.
Proceedings of the WALCOM: Algorithms and Computation - 13th International Conference, 2019

Wannabe Bounded Treewidth Graphs Admit a Polynomial Kernel for DFVS.
Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

Contraction Decomposition in Unit Disk Graphs and Algorithmic Applications in Parameterized Complexity.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Interval Vertex Deletion Admits a Polynomial Kernel.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Solving Group Interval Scheduling Efficiently.
Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019

Parameterized Complexity Classification of Deletion to List Matrix-Partition for Low-Order Matrices.
Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

On Succinct Encodings for the Tournament Fixing Problem.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Decomposition of Map Graphs with Applications.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Approximate Counting of k-Paths: Deterministic and in Polynomial Space.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Parameterized Streaming Algorithms for Min-Ones d-SAT.
Proceedings of the 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2019

Exact and Approximate Digraph Bandwidth.
Proceedings of the 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2019

On the Parameterized Complexity of Edge-Linked Paths.
Proceedings of the Computer Science - Theory and Applications, 2019

On the Complexity of Mixed Dominating Set.
Proceedings of the Computer Science - Theory and Applications, 2019

Connecting the Dots (with Minimum Crossings).
Proceedings of the 35th International Symposium on Computational Geometry, 2019

An Erdős-Pósa Theorem on Neighborhoods and Domination Number.
Proceedings of the Computing and Combinatorics - 25th International Conference, 2019

2018
Simultaneous Feedback Vertex Set: A Parameterized Perspective.
ACM Trans. Comput. Theory, 2018

Bivariate complexity analysis of Almost Forest Deletion.
Theor. Comput. Sci., 2018

On the kernelization complexity of string problems.
Theor. Comput. Sci., 2018

Parameterized algorithms for stable matching with ties and incomplete lists.
Theor. Comput. Sci., 2018

Linear Time Parameterized Algorithms for Subset Feedback Vertex Set.
ACM Trans. Algorithms, 2018

Known Algorithms on Graphs of Bounded Treewidth Are Probably Optimal.
ACM Trans. Algorithms, 2018

Deterministic Truncation of Linear Matroids.
ACM Trans. Algorithms, 2018

Kernels for (Connected) Dominating Set on Graphs with Excluded Topological Minors.
ACM Trans. Algorithms, 2018

Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth.
ACM Trans. Algorithms, 2018

Editorial: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2016 Special Issue.
ACM Trans. Algorithms, 2018

Exact Algorithms for Terrain Guarding.
ACM Trans. Algorithms, 2018

Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel.
SIAM J. Discret. Math., 2018

Below All Subsets for Minimal Connected Dominating Set.
SIAM J. Discret. Math., 2018

Matrix Rigidity from the Viewpoint of Parameterized Complexity.
SIAM J. Discret. Math., 2018

Covering Vectors by Spaces: Regular Matroids.
SIAM J. Discret. Math., 2018

Exact and Fixed Parameter Tractable Algorithms for Max-Conflict-Free Coloring in Hypergraphs.
SIAM J. Discret. Math., 2018

Kernelization of Cycle Packing with Relaxed Disjointness Constraints.
SIAM J. Discret. Math., 2018

Slightly Superexponential Parameterized Problems.
SIAM J. Comput., 2018

Polynomial Kernels for Vertex Cover Parameterized by Small Degree Modulators.
Theory Comput. Syst., 2018

Parameterised Algorithms for Deletion to Classes of DAGs.
Theory Comput. Syst., 2018

Reconfiguration on sparse graphs.
J. Comput. Syst. Sci., 2018

Finding even subgraphs even faster.
J. Comput. Syst. Sci., 2018

Kernels for deletion to classes of acyclic digraphs.
J. Comput. Syst. Sci., 2018

Excluded Grid Minors and Efficient Polynomial-Time Approximation Schemes.
J. ACM, 2018

Long directed (<i>s</i>, <i>t</i>)-path: FPT algorithm.
Inf. Process. Lett., 2018

Randomized contractions meet lean decompositions.
CoRR, 2018

A 2-Approximation Algorithm for Feedback Vertex Set in Tournaments.
CoRR, 2018

The Parameterized Complexity of Packing Arc-Disjoint Cycles in Tournaments.
CoRR, 2018

$$(k, n-k)$$ ( k , n - k ) -Max-Cut: An $$\mathcal{O}^*(2^p)$$ O ∗ ( 2 p ) -Time Algorithm and a Polynomial Kernel.
Algorithmica, 2018

Rank Reduction of Oriented Graphs by Vertex and Edge Deletions.
Algorithmica, 2018

Preface to Special Issue Dedicated to the 60th Birthday of Gregory Gutin.
Algorithmica, 2018

When Recursion is Better than Iteration: A Linear-Time Algorithm for Acyclicity with Few Error Vertices.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Cliquewidth III: The Odd Case of Graph Coloring Parameterized by Cliquewidth.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Parameterized Algorithms for Survivable Network Design with Uniform Demands.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Conflict Free Feedback Vertex Set: A Parameterized Dichotomy.
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

A Strongly-Uniform Slicewise Polynomial-Time Algorithm for the Embedded Planar Diameter Improvement Problem.
Proceedings of the 13th International Symposium on Parameterized and Exact Computation, 2018

Exploring the Kernelization Borders for Hitting Cycles.
Proceedings of the 13th International Symposium on Parameterized and Exact Computation, 2018

Parameterized Query Complexity of Hitting Set Using Stability of Sunflowers.
Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

Quasipolynomial Representation of Transversal Matroids with Applications in Parameterized Complexity.
Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018

Winning a Tournament by Any Means Necessary.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

When Rigging a Tournament, Let Greediness Blind You.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Reducing CMSO Model Checking to Highly Connected Graphs.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Brief Announcement: Treewidth Modulator: Emergency Exit for DFVS.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

A parameterized runtime analysis of randomized local search and evolutionary algorithm for max <i>l</i>-uncut.
Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2018

Max-Cut Above Spanning Tree is Fixed-Parameter Tractable.
Proceedings of the Computer Science - Theory and Applications, 2018

Algorithms for Low-Distortion Embeddings into Arbitrary 1-Dimensional Spaces.
Proceedings of the 34th International Symposium on Computational Geometry, 2018

Hitting and Covering Partially.
Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

2017
On approximability of optimization problems related to Red/Blue-split graphs.
Theor. Comput. Sci., 2017

Parameterized complexity of Strip Packing and Minimum Volume Packing.
Theor. Comput. Sci., 2017

Linear-Time Parameterized Algorithms via Skew-Symmetric Multicuts.
ACM Trans. Algorithms, 2017

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

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

Hitting Selected (Odd) Cycles.
SIAM J. Discret. Math., 2017

Parameterized Complexity of Directed Steiner Tree on Sparse Graphs.
SIAM J. Discret. 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

On the parameterized complexity of b-chromatic number.
J. Comput. Syst. Sci., 2017

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

Balanced Judicious Partition is Fixed-Parameter Tractable.
CoRR, 2017

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

On Treewidth and Stable Marriage.
CoRR, 2017

On finding highly connected spanning subgraphs.
CoRR, 2017

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

Quick but Odd Growth of Cacti.
Algorithmica, 2017

Parameterized Complexity of Superstring Problems.
Algorithmica, 2017

Multivariate Complexity Analysis of Geometric Red Blue Set Cover.
Algorithmica, 2017

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

Group Activity Selection on Graphs: Parameterized Analysis.
Proceedings of the Algorithmic Game Theory - 10th International Symposium, 2017

Communication Complexity of Pairs of Graph Families with Applications.
Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

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

2016
Matroids in Parameterized Complexity and Exact Algorithms.
Encyclopedia of Algorithms, 2016

Reducing rank of the adjacency matrix by graph modification.
Theor. Comput. Sci., 2016

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

Tree Deletion Set Has a Polynomial Kernel but No OPT<sup><i>O</i>(1)</sup> Approximation.
SIAM J. Discret. Math., 2016

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

Partially Polynomial Kernels for Set Cover and Test Cover.
SIAM J. Discret. Math., 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 Directed Feedback Vertex Set.
CoRR, 2016

Fine-grained complexity of integer programming: The case of bounded branch-width and rank.
CoRR, 2016

Backdoors to q-Horn.
Algorithmica, 2016

Parameterized Algorithms for Non-separating Trees and Branchings in Digraphs.
Algorithmica, 2016

Algorithms and Kernels for Feedback Set Problems in Generalizations of Tournaments.
Algorithmica, 2016

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

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

Parameterized Algorithms on Perfect Graphs for Deletion to (r, l)-Graphs.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

(k, n-k)-Max-Cut: An 𝒪<sup>∗</sup>(2<sup>p</sup>)-Time Algorithm and a Polynomial Kernel.
Proceedings of the LATIN 2016: Theoretical Informatics, 2016

Rank Reduction of Directed Graphs by Vertex and Edge Deletions.
Proceedings of the LATIN 2016: Theoretical Informatics, 2016

Parameterized Complexity of Red Blue Set Cover for Lines.
Proceedings of the LATIN 2016: Theoretical Informatics, 2016

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

A Parameterized Algorithm for Mixed-Cut.
Proceedings of the LATIN 2016: Theoretical Informatics, 2016

Improved Algorithms and Combinatorial Bounds for Independent Feedback Vertex Set.
Proceedings of the 11th International Symposium on Parameterized and Exact Computation, 2016

Kernelizing Buttons and Scissors.
Proceedings of the 28th Canadian Conference on Computational Geometry, 2016

2015
On the parameterized complexity of vertex cover and edge cover with connectivity constraints.
Theor. Comput. Sci., 2015

Multivariate Complexity Analysis of Geometric {\sc Red Blue Set Cover}.
CoRR, 2015

On the Parameterized Complexity of Girth and Connectivity Problems on Linear Matroids.
Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

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

B-Chromatic Number: Beyond NP-Hardness.
Proceedings of the 10th International Symposium on Parameterized and Exact Computation, 2015

Kernels for Structural Parameterizations of Vertex Cover - Case of Small Degree Modulators.
Proceedings of the 10th International Symposium on Parameterized and Exact Computation, 2015

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

Graph Modification Problems: A Modern Perspective.
Proceedings of the Frontiers in Algorithmics - 9th International Workshop, 2015

Time-Space Tradeoffs for Dynamic Programming Algorithms in Trees and Bounded Treewidth Graphs.
Proceedings of the Computing and Combinatorics - 21st International Conference, 2015

Unique Covering Problems with Geometric Sets.
Proceedings of the Computing and Combinatorics - 21st International Conference, 2015


2014
Approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization.
Theor. Comput. Sci., 2014

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

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

Hitting and Harvesting Pumpkins.
SIAM J. Discret. Math., 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

Beyond Max-Cut: λ-extendible properties parameterized above the Poljak-Turzík bound.
J. Comput. Syst. Sci., 2014

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

The Kernelization Complexity of Connected Domination in Graphs with (no) Small Cycles.
Algorithmica, 2014

On Cutwidth Parameterized by Vertex Cover.
Algorithmica, 2014

Fixed-Parameter Tractability of Satisfying Beyond the Number of Variables.
Algorithmica, 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 Approximations via d-Skew-Symmetric Multicut.
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

Parameterized Algorithms to Preserve Connectivity.
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

Connecting Vertices by Independent Trees.
Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical 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

Kernelization Methods for Fixed-Parameter Tractability.
Proceedings of the Tractability: Practical Approaches to Hard Problems, 2014

2013
Distortion is Fixed Parameter Tractable.
ACM Trans. Comput. Theory, 2013

Parameterized complexity of MaxSat Above Average.
Theor. Comput. Sci., 2013

A Polynomial Kernel for Proper Interval Vertex Deletion.
SIAM J. Discret. Math., 2013

A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments.
Theory Comput. Syst., 2013

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

An FPT algorithm for Tree Deletion Set.
J. Graph Algorithms Appl., 2013

A linear vertex kernel for maximum internal spanning tree.
J. Comput. Syst. Sci., 2013

Imbalance is fixed parameter tractable.
Inf. Process. Lett., 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

Polynomial Kernels for λ-extendible Properties Parameterized Above the Poljak-Turzík Bound.
CoRR, 2013

Guest Editorial: Special Issue on Parameterized and Exact Computation, Part II.
Algorithmica, 2013

The Parameterized Complexity of Unique Coverage and Its Variants.
Algorithmica, 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

Subexponential Algorithm for d-Cluster Edge Deletion: Exception or Rule?
Proceedings of the Mathematical Foundations of Computer Science 2013, 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

Polynomial Kernels for lambda-extendible Properties Parameterized Above the Poljak-Turzik Bound.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2013

2012
On Parameterized Independent Feedback Vertex Set.
Theor. Comput. Sci., 2012

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

Maximum r-Regular Induced Subgraph Problem: Fast Exponential Algorithms and Combinatorial Bounds.
SIAM J. Discret. Math., 2012

Counting Subgraphs via Homomorphisms.
SIAM J. Discret. Math., 2012

Parameterized complexity of finding small degree-constrained subgraphs.
J. Discrete Algorithms, 2012

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

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

FPT algorithms for Connected Feedback Vertex Set.
J. Comb. Optim., 2012

On the approximability of some degree-constrained subgraph problems.
Discret. Appl. Math., 2012

Data Reduction and Problem Kernels (Dagstuhl Seminar 12241).
Dagstuhl Reports, 2012

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

Guest Editorial: Special Issue on Parameterized and Exact Computation, Part I.
Algorithmica, 2012

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

Parameterized Algorithms for Even Cycle Transversal.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012

LP can be a cure for Parameterized Problems.
Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012

Linear kernels for (connected) dominating set on <i>H</i>-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 Study of the Test Cover Problem.
Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

New Lower Bound on Max Cut of Hypergraphs with an Application to r -Set Splitting.
Proceedings of the LATIN 2012: Theoretical Informatics, 2012

Beyond Max-Cut: lambda-Extendible Properties Parameterized Above the Poljak-Turzik Bound.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 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

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

Don't Be Strict in Local Search!
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011
A linear kernel for 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

Strengthening Erdös-Pósa property for minor-closed graph classes.
J. Graph Theory, 2011

Kernels for feedback arc set in tournaments.
J. Comput. Syst. Sci., 2011

Implicit branching and parameterized partial cover problems.
J. Comput. Syst. Sci., 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.
Bull. EATCS, 2011

Lower bounds on kernelization.
Discret. Optim., 2011

On the directed Full Degree Spanning Tree problem.
Discret. Optim., 2011

On Problems as Hard as CNFSAT
CoRR, 2011

The Complexity of König Subgraph Problems and Above-Guarantee Vertex Cover.
Algorithmica, 2011

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

Approximation Algorithms for Minimum Chain Vertex Deletion.
Proceedings of the WALCOM: Algorithms and Computation - 5th International Workshop, 2011

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

Algorithmic Aspects of Dominator Colorings in Graphs.
Proceedings of the Combinatorial Algorithms - 22nd International Workshop, 2011

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

Paths, Flowers and Vertex Cover.
Proceedings of the Algorithms - ESA 2011, 2011

2010
Iterative compression and exact algorithms.
Theor. Comput. Sci., 2010

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

Algorithm for finding k-vertex out-trees and its application to k-internal out-branching problem.
J. Comput. Syst. Sci., 2010

Parameterized algorithm for eternal vertex cover.
Inf. Process. Lett., 2010

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

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

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

Parameterized Algorithms for Boxicity.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

The effect of girth on the kernelization complexity of Connected Dominating Set.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 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

The Curse of Connectivity: <i>t</i>-Total Vertex (Edge) Cover.
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
Spanning Directed Trees with Many Leaves.
SIAM J. Discret. Math., 2009

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

On Two Techniques of Combining Branching and Treewidth.
Algorithmica, 2009

Clique-width: on the price of generality.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 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

Simpler Parameterized Algorithm for OCT.
Proceedings of the Combinatorial Algorithms, 20th International Workshop, 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

The Budgeted Unique Coverage Problem and Color-Coding.
Proceedings of the Computer Science, 2009

Algorithm for Finding <i>k</i>-Vertex Out-trees and Its Application to <i>k</i>-Internal Out-branching Problem.
Proceedings of the Computing and Combinatorics, 15th Annual International Conference, 2009

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

Parameterized Algorithms for Partial Cover Problems
CoRR, 2008

Short Cycles Make <i>W</i> -hard Problems Hard: FPT Algorithms for <i>W</i> -hard Problems in Graphs with no Short Cycles.
Algorithmica, 2008

Degree-Constrained Subgraph Problems: Hardness and Approximation Results.
Proceedings of the Approximation and Online Algorithms, 6th International Workshop, 2008

A Moderately Exponential Time Algorithm for Full Degree Spanning Tree.
Proceedings of the Theory and Applications of Models of Computation, 2008

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

Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem.
Proceedings of the Parameterized and Exact Computation, Third International Workshop, 2008

König Deletion Sets and Vertex Covers above the Matching Size.
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

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

Implicit Branching and Parameterized Partial Cover Problems (Extended Abstract).
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2008

Improving the gap of Erdös-Pósa property for minor-closed graph classes.
Proceedings of the Seventh Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2008

Parameterized Algorithms for Generalized Domination.
Proceedings of the Combinatorial Optimization and Applications, 2008

2007
Efficient Exact Algorithms through Enumerating Maximal Independent Sets and Other Techniques.
Theory Comput. Syst., 2007

Improved fixed parameter tractable algorithms for two "edge" problems: MAXCUT and MAXDAG.
Inf. Process. Lett., 2007

The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number.
Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

Parameterized Algorithms for Directed Maximum Leaf Problems.
Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

Better Algorithms and Bounds for Directed Maximum Leaf Problems.
Proceedings of the FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007

Improved Exact Algorithms for Counting 3- and 4-Colorings.
Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

2006
Parameterized algorithms for feedback set problems and their duals in tournaments.
Theor. Comput. Sci., 2006

Faster fixed parameter tractable algorithms for finding feedback vertex sets.
ACM Trans. Algorithms, 2006

Triangles, 4-Cycles and Parameterized (In-)Tractability.
Proceedings of the Algorithm Theory, 2006

Branching and Treewidth Based Exact Algorithms.
Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

Fast Exponential Algorithms for Maximum <i>r</i>-Regular Induced Subgraph Problems.
Proceedings of the FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science, 2006

2005
Faster algorithms for feedback vertex set.
Electron. Notes Discret. Math., 2005

Improved Exact Exponential Algorithms for Vertex Bipartization and Other Problems.
Proceedings of the Theoretical Computer Science, 9th Italian Conference, 2005

2004
Improved Parameterized Algorithms for Feedback Set Problems in Weighted Tournaments.
Proceedings of the Parameterized and Exact Computation, First International Workshop, 2004

2003
Parameterized Complexity of Directed Feedback Set Problems in Tournaments.
Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003

2002
Faster Fixed Parameter Tractable Algorithms for Undirected Feedback Vertex Set.
Proceedings of the Algorithms and Computation, 13th International Symposium, 2002


  Loading...