| Publication | Date of Publication | Type |
|---|
Minimizing the weighted number of tardy jobs via \((\max,+)\)-convolutions
INFORMS Journal on Computing | 2024-07-29 | Paper |
On the parameterized complexity of interval scheduling with eligible machine sets
Journal of Computer and System Sciences | 2024-07-01 | Paper |
A note on clustering aggregation for binary clusterings
Operations Research Letters | 2024-06-17 | Paper |
scientific article; zbMATH DE number 7788388 (Why is no real title available?)
| 2024-01-15 | Paper |
Approximating sparse quadratic programs
Theoretical Computer Science | 2024-01-02 | Paper |
SETH-based Lower Bounds for Subset Sum and Bicriteria Path
ACM Transactions on Algorithms | 2023-10-31 | Paper |
No Polynomial Kernels for Knapsack
| 2023-08-24 | Paper |
Equitable scheduling on a single machine
Journal of Scheduling | 2023-06-27 | Paper |
Temporal interval cliques and independent sets
Theoretical Computer Science | 2023-05-23 | Paper |
Computing the \(k\) densest subgraphs of a graph
Information Processing Letters | 2022-10-28 | Paper |
Hans Bodlaender and the Theory of Kernelization Lower Bounds
Treewidth, Kernels, and Algorithms | 2022-10-19 | Paper |
A general scheme for solving a large set of scheduling problems with rejection in FPT time
Journal of Scheduling | 2022-05-27 | Paper |
scientific article; zbMATH DE number 7525465 (Why is no real title available?)
| 2022-05-11 | Paper |
Faster minimization of tardy processing time on a single machine
Algorithmica | 2022-05-03 | Paper |
Scheduling lower bounds via AND subset sum
Journal of Computer and System Sciences | 2022-04-04 | Paper |
Efficient enumeration of maximal induced bicliques
Discrete Applied Mathematics | 2021-09-15 | Paper |
How hard is it to satisfy (almost) all roommates?
| 2021-07-28 | Paper |
New algorithms for minimizing the weighted number of tardy jobs on a single machine
Annals of Operations Research | 2021-05-05 | Paper |
Diminishable parameterized problems and strict polynomial kernelization
Computability | 2020-09-08 | Paper |
Parameterized multi-scenario single-machine scheduling problems
Algorithmica | 2020-09-03 | Paper |
Lossy Kernels for Hitting Subgraphs
| 2020-05-26 | Paper |
The clever shopper problem
Theory of Computing Systems | 2020-02-27 | Paper |
On the parameterized tractability of the just-in-time flow-shop scheduling problem
Journal of Scheduling | 2020-02-12 | Paper |
Tractable parameterizations for the minimum linear arrangement problem
ACM Transactions on Computation Theory | 2019-12-06 | Paper |
Domination when the stars are out
ACM Transactions on Algorithms | 2019-11-25 | Paper |
SETH-based lower bounds for subset sum and bicriteria path
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
On approximate preprocessing for domination and hitting subgraphs with connected deletion sets
Journal of Computer and System Sciences | 2019-08-07 | Paper |
scientific article; zbMATH DE number 7053262 (Why is no real title available?)
| 2019-05-10 | Paper |
The clever shopper problem
Computer Science – Theory and Applications | 2018-11-28 | Paper |
Tight kernel bounds for problems on graphs with small degeneracy
ACM Transactions on Algorithms | 2018-11-12 | Paper |
On the parameterized tractability of single machine scheduling with rejection
European Journal of Operational Research | 2018-10-30 | Paper |
Diminishable parameterized problems and strict polynomial kernelization
| 2018-09-06 | Paper |
Fractals for kernelization lower bounds
SIAM Journal on Discrete Mathematics | 2018-03-26 | Paper |
A biclique approach to reference anchored gene blocks and its applications to pathogenicity islands
| 2018-03-23 | Paper |
Fractals for kernelization lower bounds, with an application to length-bounded cut problems
| 2017-12-19 | Paper |
Scheduling two competing agents when one agent has significantly fewer jobs
| 2017-09-29 | Paper |
Parameterized complexity of critical node cuts
| 2017-09-29 | Paper |
Parameterized complexity of critical node cuts
Theoretical Computer Science | 2017-03-16 | Paper |
Parameterized complexity dichotomy for Steiner Multicut
| 2017-01-24 | Paper |
Parameterized complexity dichotomy for \textsc{Steiner Multicut}
Journal of Computer and System Sciences | 2016-06-13 | Paper |
Binary jumbled pattern matching on trees and tree-like structures
Algorithmica | 2015-11-19 | Paper |
Parameterized complexity analysis for the closest string with wildcards problem
Theoretical Computer Science | 2015-09-16 | Paper |
On the average-case complexity of parameterized clique
Theoretical Computer Science | 2015-05-18 | Paper |
A completeness theory for polynomial (Turing) kernelization
Algorithmica | 2015-05-04 | Paper |
Parameterized complexity of induced graph matching on claw-free graphs
Algorithmica | 2015-01-19 | Paper |
Optimization problems in multiple-interval graphs
| 2014-12-18 | Paper |
Optimization problems in multiple-interval graphs
ACM Transactions on Algorithms | 2014-11-18 | Paper |
Optimization problems in dotted interval graphs
Discrete Applied Mathematics | 2014-08-22 | Paper |
Parameterized Complexity Analysis for the Closest String with Wildcards Problem
Combinatorial Pattern Matching | 2014-06-30 | Paper |
Local search for string problems: brute-force is essentially optimal
Theoretical Computer Science | 2014-03-13 | Paper |
A completeness theory for polynomial (Turing) kernelization
Parameterized and Exact Computation | 2013-12-10 | Paper |
Tractable parameterizations for the minimum linear arrangement problem
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Tight Kernel Bounds for Problems on Graphs with Small Degeneracy
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Binary jumbled pattern matching on trees and tree-like structures
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Local search for string problems: brute force is essentially optimal
Combinatorial Pattern Matching | 2013-06-14 | Paper |
Parameterized two-player Nash equilibrium
Algorithmica | 2013-05-16 | Paper |
Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph
Algorithms and Computation | 2013-03-21 | Paper |
Unified compression-based acceleration of edit-distance computation
Algorithmica | 2013-03-05 | Paper |
Constraint satisfaction problems: convexity makes AllDifferent constraints tractable
Theoretical Computer Science | 2013-03-04 | Paper |
Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications
Algorithmica | 2012-11-21 | Paper |
Optimization problems in dotted interval graphs
Graph-Theoretic Concepts in Computer Science | 2012-11-06 | Paper |
Parameterized complexity of induced \(H\)-matching on claw-free graphs
Algorithms – ESA 2012 | 2012-09-25 | Paper |
Mod/Resc parsimony inference: theory and application
Information and Computation | 2012-05-24 | Paper |
A unified algorithm for accelerating edit-distance computation via text-compression
| 2012-04-24 | Paper |
Parameterized two-player Nash equilibrium
Lecture Notes in Computer Science | 2011-12-16 | Paper |
Minimum vertex cover in rectangle graphs
Computational Geometry | 2011-07-20 | Paper |
Distance oracles for vertex-labeled graphs
Automata, Languages and Programming | 2011-07-07 | Paper |
Domination when the stars are out
Lecture Notes in Computer Science | 2011-07-06 | Paper |
Upper and lower bounds for finding connected motifs in vertex-colored graphs
Journal of Computer and System Sciences | 2011-04-28 | Paper |
Optimization problems in multiple subtree graphs
Discrete Applied Mathematics | 2011-04-19 | Paper |
An extension of the Nemhauser-Trotter theorem to generalized vertex cover with applications
SIAM Journal on Discrete Mathematics | 2011-03-15 | Paper |
Minimum vertex cover in rectangle graphs
Algorithms – ESA 2010 | 2010-09-06 | Paper |
Mod/Resc parsimony inference
Combinatorial Pattern Matching | 2010-07-26 | Paper |
Finding common structured patterns in linear graphs
Theoretical Computer Science | 2010-06-07 | Paper |
Extension of the Nemhauser and Trotter Theorem to Generalized Vertex Cover with Applications
Approximation and Online Algorithms | 2010-05-11 | Paper |
Optimization problems in multiple subtree graphs
Approximation and Online Algorithms | 2010-05-11 | Paper |
W-hierarchies defined by symmetric gates
Theory of Computing Systems | 2010-05-10 | Paper |
Well-quasi-orders in subclasses of bounded treewidth graphs
Parameterized and Exact Computation | 2010-01-14 | Paper |
On problems without polynomial kernels
Journal of Computer and System Sciences | 2009-11-10 | Paper |
Haplotype Inference Constrained by Plausible Haplotype Data
Combinatorial Pattern Matching | 2009-07-07 | Paper |
Fixed-parameter algorithms for protein similarity search under mRNA structure constraints
Journal of Discrete Algorithms | 2009-02-23 | Paper |
On the parameterized complexity of multiple-interval graph problems
Theoretical Computer Science | 2009-02-19 | Paper |
The minimum substring cover problem
Information and Computation | 2008-12-03 | Paper |
On Problems without Polynomial Kernels (Extended Abstract)
Automata, Languages and Programming | 2008-08-28 | Paper |
Approximating the 2-interval pattern problem
Theoretical Computer Science | 2008-07-10 | Paper |
Constrained LCS: Hardness and Approximation
Combinatorial Pattern Matching | 2008-06-17 | Paper |
Common Structured Patterns in Linear Graphs: Approximation and Combinatorics
Combinatorial Pattern Matching | 2008-06-17 | Paper |
A Purely Democratic Characterization of W[1]
Parameterized and Exact Computation | 2008-06-05 | Paper |
The Minimum Substring Cover Problem
Approximation and Online Algorithms | 2008-02-20 | Paper |
Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs
Automata, Languages and Programming | 2007-11-28 | Paper |
Local Alignment of RNA Sequences with Arbitrary Scoring Schemes
Combinatorial Pattern Matching | 2007-09-14 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | Paper |
