Danny Hermelin

CoRR, 2024

2023

Temporal interval cliques and independent sets.

[BibT_eX]

[DOI]

Theor. Comput. Sci., June, 2023

Equitable scheduling on a single machine.

[BibT_eX]

[DOI]

J. Sched., 2023

Computing the <i>k</i> densest subgraphs of a graph.

[BibT_eX]

[DOI]

Riccardo Dondi

Inf. Process. Lett., 2023

No Polynomial Kernels for Knapsack.

[BibT_eX]

[DOI]

CoRR, 2023

Single Machine Scheduling with Few Deadlines.

[BibT_eX]

[DOI]

Klaus Heeger

Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

2022

SETH-based Lower Bounds for Subset Sum and Bicriteria Path.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2022

A general scheme for solving a large set of scheduling problems with rejection in FPT time.

[BibT_eX]

[DOI]

J. Sched., 2022

Scheduling lower bounds via AND subset sum.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2022

Single Machine Weighted Number of Tardy Jobs Minimization With Small Weights.

[BibT_eX]

[DOI]

Hendrik Molter

CoRR, 2022

Faster Minimization of Tardy Processing Time on a Single Machine.

[BibT_eX]

[DOI]

Algorithmica, 2022

Temporal Unit Interval Independent Sets.

[BibT_eX]

[DOI]

Proceedings of the 1st Symposium on Algorithmic Foundations of Dynamic Networks, 2022

Hardness of Interval Scheduling on Unrelated Machines.

[BibT_eX]

[DOI]

Proceedings of the 17th International Symposium on Parameterized and Exact Computation, 2022

2021

Collective multi agent deployment for wireless sensor network maintenance.

[BibT_eX]

[DOI]

Harel Yedidsion

Michael Segal

Eng. Appl. Artif. Intell., 2021

Efficient enumeration of maximal induced bicliques.

[BibT_eX]

[DOI]

George Manoussakis

Discret. Appl. Math., 2021

Equitable Scheduling for the Total Completion Time Objective.

[BibT_eX]

[DOI]

CoRR, 2021

Polynomial Turing Kernels for Clique with an Optimal Number of Queries.

[BibT_eX]

[DOI]

Till Fluschnik

Klaus Heeger

CoRR, 2021

New algorithms for minimizing the weighted number of tardy jobs on a single machine.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2021

Efficient fully dynamic elimination forests with applications to detecting long paths and cycles.

[BibT_eX]

[DOI]

Wojciech Czerwinski

Yann Disser

Andreas Emil Feldmann

Bartlomiej Wróblewski

Anna Zych-Pawlewicz

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

2020

The Clever Shopper Problem.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2020

On Dynamic Parameterized k-Path.

[BibT_eX]

[DOI]

Wojciech Czerwinski

Yann Disser

Andreas Emil Feldmann

Bartlomiej Wróblewski

Anna Zych-Pawlewicz

CoRR, 2020

Computing the k Densest Subgraphs of a Graph.

[BibT_eX]

[DOI]

Riccardo Dondi

CoRR, 2020

Diminishable parameterized problems and strict polynomial kernelization.

[BibT_eX]

[DOI]

Comput., 2020

Parameterized Multi-Scenario Single-Machine Scheduling Problems.

[BibT_eX]

[DOI]

Algorithmica, 2020

Hans Bodlaender and the Theory of Kernelization Lower Bounds.

[BibT_eX]

[DOI]

Proceedings of the Treewidth, Kernels, and Algorithms, 2020

2019

Domination When the Stars Are Out.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2019

On the parameterized tractability of the just-in-time flow-shop scheduling problem.

[BibT_eX]

[DOI]

Nimrod Talmon

J. Sched., 2019

On approximate preprocessing for domination and hitting subgraphs with connected deletion sets.

[BibT_eX]

[DOI]

Eduard Eiben

M. S. Ramanujan

J. Comput. Syst. Sci., 2019

On the parameterized tractability of single machine scheduling with rejection.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2019

Single Machine Batch Scheduling to Minimize the Weighted Number of Tardy Jobs.

[BibT_eX]

[DOI]

Matthias Mnich

Simon Omlor

CoRR, 2019

Foreword: Special Issue on Parameterized and Exact Computation.

[BibT_eX]

[DOI]

Jiong Guo

Algorithmica, 2019

On Computing Centroids According to the p-Norms of Hamming Distance Vectors.

[BibT_eX]

[DOI]

Manuel Sorge

Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018

Fractals for Kernelization Lower Bounds.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2018

A Biclique Approach to Reference-Anchored Gene Blocks and Its Applications to Genomic Islands.

[BibT_eX]

[DOI]

J. Comput. Biol., 2018

A Note on Clustering Aggregation.

[BibT_eX]

[DOI]

Manuel Sorge

CoRR, 2018

How Hard Is It to Satisfy (Almost) All Roommates?.

[BibT_eX]

[DOI]

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

The Clever Shopper Problem.

[BibT_eX]

[DOI]

Proceedings of the Computer Science - Theory and Applications, 2018

2017

Tight Kernel Bounds for Problems on Graphs with Small Degeneracy.

[BibT_eX]

[DOI]

Marek Cygan

Fabrizio Grandoni

ACM Trans. Algorithms, 2017

Randomization in Parameterized Complexity (Dagstuhl Seminar 17041).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2017

New Algorithms for Minimizing the Weighted Number of Tardy Jobs On a Single Machine.

[BibT_eX]

[DOI]

CoRR, 2017

Scheduling Two Agents on a Single Machine: A Parameterized Analysis of NP-hard Problems.

[BibT_eX]

[DOI]

Judith-Madeleine Kubitza

Nimrod Talmon

Gerhard J. Woeginger

CoRR, 2017

Coordination of Mobile Mules via Facility Location Strategies.

[BibT_eX]

[DOI]

Michael Segal

Harel Yedidsion

Proceedings of the Advances in Practical Applications of Cyber-Physical Multi-Agent Systems: The PAAMS Collection, 2017

Lossy Kernels for Hitting Subgraphs.

[BibT_eX]

[DOI]

Eduard Eiben

M. S. Ramanujan

Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

2016

Tractable Parameterizations for the Minimum Linear Arrangement Problem.

[BibT_eX]

[DOI]

ACM Trans. Comput. Theory, 2016

Parameterized complexity of critical node cuts.

[BibT_eX]

[DOI]

Moshe Kaspi

Christian Komusiewicz

Barak Navon

Theor. Comput. Sci., 2016

Parameterized complexity dichotomy for Steiner Multicut.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2016

A Biclique Approach to Reference Anchored Gene Blocks and Its Applications to Pathogenicity Islands.

[BibT_eX]

[DOI]

Proceedings of the Algorithms in Bioinformatics - 16th International Workshop, 2016

Fractals for Kernelization Lower Bounds, With an Application to Length-Bounded Cut Problems.

[BibT_eX]

[DOI]

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015

Parameterized complexity analysis for the Closest String with Wildcards problem.

[BibT_eX]

[DOI]

Liat Rozenberg

Theor. Comput. Sci., 2015

On the average-case complexity of parameterized clique.

[BibT_eX]

[DOI]

Nikolaos Fountoulakis

Tobias Friedrich

Theor. Comput. Sci., 2015

A Completeness Theory for Polynomial (Turing) Kernelization.

[BibT_eX]

[DOI]

Algorithmica, 2015

Binary Jumbled Pattern Matching on Trees and Tree-Like Structures.

[BibT_eX]

[DOI]

Algorithmica, 2015

Scheduling Two Competing Agents When One Agent Has Significantly Fewer Jobs.

[BibT_eX]

[DOI]

Judith-Madeleine Kubitza

Nimrod Talmon

Gerhard J. Woeginger

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

2014

Local search for string problems: Brute-force is essentially optimal.

[BibT_eX]

[DOI]

Jiong Guo

Christian Komusiewicz

Theor. Comput. Sci., 2014

Optimization problems in dotted interval graphs.

[BibT_eX]

[DOI]

Julián Mestre

Discret. Appl. Math., 2014

Binary Jumbled Pattern Matching via All-Pairs Shortest Paths.

[BibT_eX]

[DOI]

CoRR, 2014

Parameterized Complexity of Induced Graph Matching on Claw-Free Graphs.

[BibT_eX]

[DOI]

Matthias Mnich

Erik Jan van Leeuwen

Algorithmica, 2014

2013

Constraint satisfaction problems: Convexity makes AllDifferent constraints tractable.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Unified Compression-Based Acceleration of Edit-Distance Computation.

[BibT_eX]

[DOI]

Algorithmica, 2013

Parameterized Two-Player Nash Equilibrium.

[BibT_eX]

[DOI]

Algorithmica, 2013

Tight Kernel Bounds for Problems on Graphs with Small Degeneracy - (Extended Abstract).

[BibT_eX]

[DOI]

Marek Cygan

Fabrizio Grandoni

Proceedings of the Algorithms - ESA 2013, 2013

2012

Mod/Resc Parsimony Inference: Theory and application.

[BibT_eX]

[DOI]

Inf. Comput., 2012

Well Quasi Orders in Subclasses of Bounded Treewidth Graphs and Their Algorithmic Applications.

[BibT_eX]

[DOI]

Michael R. Fellows

Frances A. Rosamond

Algorithmica, 2012

Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph.

[BibT_eX]

[DOI]

Romeo Rizzi

Stéphane Vialette

Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

Parameterized Complexity of Induced H-Matching on Claw-Free Graphs.

[BibT_eX]

[DOI]

Matthias Mnich

Erik Jan van Leeuwen

Proceedings of the Algorithms - ESA 2012, 2012

2011

Haplotype Inference Constrained by Plausible Haplotype Data.

[BibT_eX]

[DOI]

IEEE ACM Trans. Comput. Biol. Bioinform., 2011

Upper and lower bounds for finding connected motifs in vertex-colored graphs.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2011

Weak Compositions and Their Applications to Polynomial Lower-Bounds for Kernelization.

[BibT_eX]

[DOI]

Xi Wu

Electron. Colloquium Comput. Complex., 2011

Treewidth governs the complexity of target set selection.

[BibT_eX]

[DOI]

Discret. Optim., 2011

Optimization problems in multiple subtree graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2011

Hierarchies of Inefficient Kernelizability

[BibT_eX]

[DOI]

CoRR, 2011

Minimum vertex cover in rectangle graphs.

[BibT_eX]

[DOI]

Reuven Bar-Yehuda

Comput. Geom., 2011

Distance Oracles for Vertex-Labeled Graphs.

[BibT_eX]

[DOI]

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

2010

Finding common structured patterns in linear graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

Optimization problems in multiple-interval graphs.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2010

An Extension of the Nemhauser--Trotter Theorem to Generalized Vertex Cover with Applications.

[BibT_eX]

[DOI]

Reuven Bar-Yehuda

SIAM J. Discret. Math., 2010

W-Hierarchies Defined by Symmetric Gates.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2010

Restricted LCS.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2010

Mod/Resc Parsimony Inference.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 21st Annual Symposium, 2010

2009

On the parameterized complexity of multiple-interval graph problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

On problems without polynomial kernels.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2009

Extension of the Nemhauser and Trotter Theorem to Generalized Vertex Cover with Applications.

[BibT_eX]

[DOI]

Reuven Bar-Yehuda

Proceedings of the Approximation and Online Algorithms, 7th International Workshop, 2009

A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression.

[BibT_eX]

[DOI]

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

An exact almost optimal algorithm for target set selection in social networks.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 10th ACM Conference on Electronic Commerce (EC-2009), 2009

Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs.

[BibT_eX]

[DOI]

Michael R. Fellows

Frances A. Rosamond

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

2008

Approximating the 2-interval pattern problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

Fixed-parameter algorithms for protein similarity search under mRNA structure constraints.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2008

The Minimum Substring Cover problem.

[BibT_eX]

[DOI]

Inf. Comput., 2008

A Purely Democratic Characterization of W[1].

[BibT_eX]

[DOI]

Proceedings of the Parameterized and Exact Computation, Third International Workshop, 2008

On Problems without Polynomial Kernels (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Constrained LCS: Hardness and Approximation.

[BibT_eX]

[DOI]

Zvi Gotthilf