| Publication | Date of Publication | Type |
|---|
Adapting stable matchings to evolving preferences
Games and Economic Behavior | 2026-03-24 | Paper |
| Parameterized lower bounds for problems in P via fine-grained cross-compositions | 2024-10-08 | Paper |
The role of twins in computing planar supports of hypergraphs
Journal of Graph Algorithms and Applications | 2024-10-08 | Paper |
| Deepening the (parameterized) complexity analysis of incremental stable matching problems | 2024-08-06 | Paper |
| Most classic problems remain NP-hard on relative neighborhood graphs and their relatives | 2024-05-27 | Paper |
| An FPT-algorithm for longest common subsequence parameterized by the maximum number of deletions | 2024-05-06 | Paper |
| Delay-robust routes in temporal graphs | 2024-04-23 | Paper |
Approximating sparse quadratic programs
Theoretical Computer Science | 2024-01-02 | Paper |
| Multistage s-t Path: Confronting Similarity with Dissimilarity in Temporal Graphs | 2023-11-14 | Paper |
A multivariate complexity analysis of the material consumption scheduling problem
Journal of Scheduling | 2023-08-28 | Paper |
Computing maximum matchings in temporal graphs
Journal of Computer and System Sciences | 2023-07-10 | Paper |
Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality
Journal of Graph Algorithms and Applications | 2023-07-03 | Paper |
Multistage \(s-t\) path: confronting similarity with dissimilarity
Algorithmica | 2023-06-28 | Paper |
Equitable scheduling on a single machine
Journal of Scheduling | 2023-06-27 | 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 |
On finding separators in temporal split and permutation graphs
Journal of Computer and System Sciences | 2023-04-21 | Paper |
| On 2-clubs in graph-based data clustering: theory and algorithm engineering | 2023-03-22 | Paper |
Multidimensional stable roommates with master list
(available as arXiv preprint) | 2023-03-21 | Paper |
Polynomial-time data reduction for weighted problems beyond additive goal functions
Discrete Applied Mathematics | 2023-02-22 | Paper |
scientific article; zbMATH DE number 7651119 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-07 | Paper |
Parameterized Algorithms for Matrix Completion with Radius Constraints.
(available as arXiv preprint) | 2023-02-07 | Paper |
Computing maximum matchings in temporal graphs.
(available as arXiv preprint) | 2023-02-07 | Paper |
| Multistage Vertex Cover | 2023-02-03 | Paper |
| Parameterized Complexity of Stable Roommates with Ties and Incomplete Lists Through the Lens of Graph Parameters | 2023-02-03 | Paper |
| Recursively divisible problems | 2023-01-25 | Paper |
The complexity of binary matrix completion under diameter constraints
Journal of Computer and System Sciences | 2023-01-09 | Paper |
| Bribery and control in stable marriage | 2022-12-21 | Paper |
Line-up elections: parallel voting with shared candidate pool
(available as arXiv preprint) | 2022-12-21 | Paper |
Feedback edge sets in temporal graphs
Graph-Theoretic Concepts in Computer Science | 2022-12-21 | Paper |
Towards optimal locality in mesh-indexings
Fundamentals of Computation Theory | 2022-12-09 | Paper |
Parameterized Algorithms for Power-Efficient Connected Symmetric Wireless Sensor Networks
Algorithms for Sensor Systems | 2022-12-09 | Paper |
PRAM's towards realistic parallelism: BRAM's
Fundamentals of Computation Theory | 2022-12-09 | Paper |
Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters
Information and Computation | 2022-12-08 | Paper |
The complexity of gerrymandering over graphs: paths and trees
Discrete Applied Mathematics | 2022-11-11 | Paper |
As Time Goes By: Reflections on Treewidth for Temporal Graphs
Treewidth, Kernels, and Algorithms | 2022-10-19 | Paper |
The Computational Complexity of ReLU Network Training Parameterized by Data Dimensionality
Journal of Artificial Intelligence Research | 2022-10-06 | Paper |
The structural complexity landscape of finding balance-fair shortest paths
Theoretical Computer Science | 2022-09-27 | Paper |
Complexity of shift bribery in committee elections
ACM Transactions on Computation Theory | 2022-09-24 | Paper |
Data Reduction for Maximum Matching on Real-World Graphs
ACM Journal of Experimental Algorithmics | 2022-09-06 | Paper |
| An Adaptive Version of Brandes' Algorithm for Betweenness Centrality | 2022-07-21 | Paper |
| Parameterized Dynamic Cluster Editing | 2022-07-21 | Paper |
Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments
INFORMS Journal on Computing | 2022-06-28 | Paper |
On 2-clubs in graph-based data clustering: theory and algorithm engineering
Journal of Graph Algorithms and Applications | 2022-06-28 | Paper |
Towards classifying the polynomial-time solvability of temporal betweenness centrality
(available as arXiv preprint) | 2022-06-08 | Paper |
The complexity of gerrymandering over graphs: paths and trees
Graph-Theoretic Concepts in Computer Science | 2022-06-08 | Paper |
On finding separators in temporal split and permutation graphs
Fundamentals of Computation Theory | 2022-05-20 | Paper |
Multistage vertex cover
Theory of Computing Systems | 2022-05-09 | Paper |
Envy-free allocations respecting social networks
Artificial Intelligence | 2022-04-11 | Paper |
Combining clickstream analyses and graph-modeled data clustering for identifying common response processes
Psychometrika | 2021-12-16 | Paper |
Feedback edge sets in temporal graphs
Discrete Applied Mathematics | 2021-12-07 | Paper |
Bribery and control in stable marriage
Journal of Artificial Intelligence Research | 2021-10-05 | Paper |
Robustness among multiwinner voting rules
Artificial Intelligence | 2021-08-16 | Paper |
The complexity of finding small separators in temporal graphs
(available as arXiv preprint) | 2021-08-04 | Paper |
Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments
(available as arXiv preprint) | 2021-08-04 | Paper |
| Interference-free Walks in Time: Temporally Disjoint Paths | 2021-05-18 | Paper |
Multistage graph problems on a global budget
Theoretical Computer Science | 2021-05-10 | Paper |
Parameterized dynamic cluster editing
Algorithmica | 2021-02-01 | Paper |
| Weighted tournament solutions | 2020-11-12 | Paper |
The power of linear-time data reduction for maximum matching
Algorithmica | 2020-11-11 | Paper |
An Adaptive Version of Brandes' Algorithm for Betweenness Centrality
Journal of Graph Algorithms and Applications | 2020-11-05 | Paper |
Tight hardness results for consensus problems on circular strings and time series
SIAM Journal on Discrete Mathematics | 2020-10-27 | Paper |
Diminishable parameterized problems and strict polynomial kernelization
Computability | 2020-09-08 | Paper |
| The Power of Linear-Time Data Reduction for Maximum Matching | 2020-05-26 | Paper |
Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting
Theoretical Computer Science | 2020-03-12 | Paper |
Efficient algorithms for measuring the funnel-likeness of DAGs
Journal of Combinatorial Optimization | 2020-02-03 | Paper |
Temporal graph classes: a view through temporal separators
Theoretical Computer Science | 2020-01-16 | Paper |
The complexity of finding small separators in temporal graphs
Journal of Computer and System Sciences | 2019-11-29 | Paper |
Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review
Journal of Scheduling | 2019-10-08 | Paper |
Polynomial-Time Data Reduction for Weighted Problems Beyond Additive Goal Functions
(available as arXiv preprint) | 2019-10-01 | Paper |
Data reduction, exact, and heuristic algorithms for clique cover
2006 Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-11 | Paper |
The parameterized complexity of the minimum shared edges problem
Journal of Computer and System Sciences | 2019-08-30 | Paper |
| Multivariate algorithmics for NP-hard string problems | 2019-07-03 | Paper |
Parameterized aspects of triangle enumeration
Journal of Computer and System Sciences | 2019-06-25 | Paper |
When can graph hyperbolicity be computed in linear time?
Algorithmica | 2019-05-07 | Paper |
A parameterized algorithmics framework for degree sequence completion problems in directed graphs
Algorithmica | 2019-04-25 | Paper |
The parameterized complexity of the rainbow subgraph problem
Algorithms | 2019-03-26 | Paper |
Pattern-guided \(k\)-anonymity
Algorithms | 2019-03-26 | Paper |
Co-clustering under the maximum norm
Algorithms | 2019-03-26 | Paper |
A more fine-grained complexity analysis of finding the most vital edges for undirected shortest paths
Networks | 2019-03-06 | Paper |
Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: theory and experiments
European Journal of Operational Research | 2019-02-11 | Paper |
A linear-time algorithm for maximum-cardinality matching on cocomparability graphs
SIAM Journal on Discrete Mathematics | 2018-12-05 | Paper |
Temporal graph classes: a view through temporal separators
Lecture Notes in Computer Science | 2018-11-22 | Paper |
Stable roommate with narcissistic, single-peaked, and single-crossing preferences
(available as arXiv preprint) | 2018-10-25 | Paper |
Diminishable parameterized problems and strict polynomial kernelization
(available as arXiv preprint) | 2018-09-06 | Paper |
Efficient algorithms for measuring the funnel-likeness of DAGs
Lecture Notes in Computer Science | 2018-08-17 | Paper |
h-Index Manipulation by Undoing Merges
(available as arXiv preprint) | 2018-07-12 | Paper |
A parameterized algorithmics framework for degree sequence completion problems in directed graphs
(available as arXiv preprint) | 2018-04-10 | Paper |
Fractals for kernelization lower bounds
SIAM Journal on Discrete Mathematics | 2018-03-26 | Paper |
Finding points in general position
International Journal of Computational Geometry & Applications | 2018-02-22 | Paper |
Robustness among multiwinner voting rules
Algorithmic Game Theory | 2018-02-13 | Paper |
Elections with few voters: candidate control can be easy
Journal of Artificial Intelligence Research | 2018-01-12 | Paper |
Elections with few voters: candidate control can be easy
Journal of Artificial Intelligence Research | 2018-01-12 | Paper |
| Fractals for kernelization lower bounds, with an application to length-bounded cut problems | 2017-12-19 | Paper |
Optimal average case sorting on arrays
STACS 95 | 2017-12-04 | Paper |
Parameterized aspects of triangle enumeration
Lecture Notes in Computer Science | 2017-11-22 | Paper |
| Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs | 2017-09-29 | Paper |
When can graph hyperbolicity be computed in linear time?
Lecture Notes in Computer Science | 2017-09-22 | Paper |
When can graph hyperbolicity be computed in linear time?
Lecture Notes in Computer Science | 2017-09-22 | Paper |
Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs
Theoretical Computer Science | 2017-09-07 | Paper |
Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs
Theoretical Computer Science | 2017-09-07 | Paper |
A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack
Journal of Scheduling | 2017-09-01 | Paper |
Assessing the computational complexity of multi-layer subgraph detection
Lecture Notes in Computer Science | 2017-07-21 | Paper |
Assessing the computational complexity of multi-layer subgraph detection
Lecture Notes in Computer Science | 2017-07-21 | Paper |
Parliamentary voting procedures: agenda control, manipulation, and uncertainty
Journal of Artificial Intelligence Research | 2017-07-13 | Paper |
The parameterized complexity of the minimum shared edges problem
(available as arXiv preprint) | 2017-07-13 | Paper |
| The complexity of arc routing problems | 2017-07-11 | Paper |
Partitioning perfect graphs into stars
Journal of Graph Theory | 2017-07-05 | Paper |
On making a distinguished vertex of minimum degree by vertex deletion
Algorithmica | 2017-05-17 | Paper |
The complexity of finding effectors
Theory of Computing Systems | 2017-03-31 | Paper |
Twins in Subdivision Drawings of Hypergraphs
Lecture Notes in Computer Science | 2017-02-21 | Paper |
Prices matter for the parameterized complexity of shift bribery
Information and Computation | 2016-11-18 | Paper |
\(\mathrm{H}\)-index manipulation by merging articles: models, theory, and experiments
Artificial Intelligence | 2016-10-21 | Paper |
Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics
Graph-Theoretic Concepts in Computer Science | 2016-10-21 | Paper |
Win-win kernelization for degree sequence completion problems
Journal of Computer and System Sciences | 2016-06-13 | Paper |
Large-scale election campaigns: combinatorial shift bribery
The Journal of Artificial Intelligence Research (JAIR) | 2016-04-19 | Paper |
Exploiting hidden structure in selecting dimensions that distinguish vectors
Journal of Computer and System Sciences | 2015-12-30 | Paper |
The complexity of degree anonymization by vertex addition
Theoretical Computer Science | 2015-12-08 | Paper |
Polynomial-time data reduction for the subset interconnection design problem
SIAM Journal on Discrete Mathematics | 2015-11-27 | Paper |
Interval scheduling and colorful independent sets
Journal of Scheduling | 2015-11-12 | Paper |
Elections with few candidates: prices, weights, and covering problems
Algorithmic Decision Theory | 2015-11-04 | Paper |
The complexity of finding effectors
Lecture Notes in Computer Science | 2015-09-30 | Paper |
A complexity dichotomy for finding disjoint solutions of vertex deletion problems
ACM Transactions on Computation Theory | 2015-09-24 | Paper |
A refined complexity analysis of finding the most vital edges for undirected shortest paths
Lecture Notes in Computer Science | 2015-09-21 | Paper |
Co-clustering under the maximum norm
Algorithms and Computation | 2015-09-11 | Paper |
Co-clustering under the maximum norm
Algorithms and Computation | 2015-09-11 | Paper |
The parameterized complexity of the rainbow subgraph problem
Graph-Theoretic Concepts in Computer Science | 2015-09-09 | Paper |
Pattern matching for arc-annotated sequences
ACM Transactions on Algorithms | 2015-09-02 | Paper |
| Well-Formed Separator Sequences, with an Application to Hypergraph Drawing | 2015-07-08 | Paper |
A refined complexity analysis of degree anonymization in graphs
Information and Computation | 2015-06-09 | Paper |
Network-based vertex dissolution
SIAM Journal on Discrete Mathematics | 2015-06-08 | Paper |
Combinatorial voter control in elections
Theoretical Computer Science | 2015-06-01 | Paper |
Using patterns to form homogeneous teams
Algorithmica | 2015-05-26 | Paper |
The complexity of degree anonymization by vertex addition
Algorithmic Aspects in Information and Management | 2015-05-20 | Paper |
On explaining integer vectors by few homogeneous segments
Journal of Computer and System Sciences | 2015-02-20 | Paper |
Constant thresholds can make target set selection tractable
Theory of Computing Systems | 2015-02-05 | Paper |
Exploiting a hypergraph model for finding Golomb rulers
Acta Informatica | 2014-11-14 | Paper |
Network-based dissolution
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
Combinatorial voter control in elections
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
Win-win kernelization for degree sequence completion problems
Algorithm Theory – SWAT 2014 | 2014-09-02 | Paper |
A Multivariate Complexity Analysis of Lobbying in Multiple Referenda
Journal of Artificial Intelligence Research | 2014-07-30 | Paper |
Star partitions of perfect graphs
Lecture Notes in Computer Science | 2014-07-01 | Paper |
Pattern-guided \(k\)-anonymity
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2014-04-03 | Paper |
Data reduction and exact algorithms for clique cover
ACM Journal of Experimental Algorithmics | 2014-04-01 | Paper |
The effect of homogeneity on the computational complexity of combinatorial data anonymization
Data Mining and Knowledge Discovery | 2014-02-19 | Paper |
Effective and efficient data reduction for the subset interconnection design problem
Algorithms and Computation | 2014-01-14 | Paper |
Incremental list coloring of graphs, parameterized by conservation
Theoretical Computer Science | 2014-01-10 | Paper |
How to Put through Your Agenda in Collective Binary Decisions
Algorithmic Decision Theory | 2013-12-17 | Paper |
The parameterized complexity of local search for TSP, more refined
Algorithmica | 2013-11-11 | Paper |
Confluence in data reduction: bridging graph transformation and kernelization
Computability | 2013-10-10 | Paper |
A parameterized complexity analysis of combinatorial feature selection problems
Mathematical Foundations of Computer Science 2013 | 2013-09-20 | Paper |
On explaining integer vectors by few homogenous segments
Lecture Notes in Computer Science | 2013-08-12 | Paper |
A refined complexity analysis of degree anonymization in graphs
Automata, Languages, and Programming | 2013-08-07 | Paper |
Efficient algorithms for Eulerian extension and rural Postman
SIAM Journal on Discrete Mathematics | 2013-06-27 | Paper |
Constant thresholds can make target set selection tractable
Lecture Notes in Computer Science | 2013-04-19 | Paper |
Interval scheduling and colorful independent sets
Lecture Notes in Computer Science | 2013-03-21 | Paper |
A new view on rural postman based on Eulerian extension and matching
Journal of Discrete Algorithms | 2013-01-18 | Paper |
Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes
Journal of Combinatorial Optimization | 2013-01-03 | Paper |
Exploiting a Hypergraph Model for Finding Golomb Rulers
Lecture Notes in Computer Science | 2012-11-02 | Paper |
Graph-based data clustering with overlaps
Discrete Optimization | 2012-10-16 | Paper |
New races in parameterized algorithmics
Mathematical Foundations of Computer Science 2012 | 2012-09-25 | Paper |
Studies in Computational Aspects of Voting
The Multivariate Algorithmic Revolution and Beyond | 2012-09-05 | Paper |
Confluence in data reduction: bridging graph transformation and kernelization
Lecture Notes in Computer Science | 2012-08-14 | Paper |
Partitioning into colorful components by minimum edge deletions
Combinatorial Pattern Matching | 2012-08-14 | Paper |
Linear-time computation of a linear problem kernel for dominating set on planar graphs
Parameterized and Exact Computation | 2012-06-15 | Paper |
On making directed graphs transitive
Journal of Computer and System Sciences | 2012-05-11 | Paper |
Approximation and tidying -- a problem kernel for \(s\)-plex cluster vertex deletion
Algorithmica | 2012-04-26 | Paper |
| A generalization of Nemhauser and Trotter's local optimization theorem | 2012-04-24 | Paper |
Aspects of a multivariate complexity analysis for rectangle tiling
Operations Research Letters | 2012-04-05 | Paper |
On bounded-degree vertex deletion parameterized by treewidth
Discrete Applied Mathematics | 2012-03-19 | Paper |
| Reflections on multivariate algorithmics and problem parameterization | 2012-01-23 | Paper |
A new view on rural postman based on Eulerian extension and matching
Lecture Notes in Computer Science | 2012-01-13 | Paper |
A generalization of Nemhauser and Trotter's local optimization theorem
Journal of Computer and System Sciences | 2012-01-11 | Paper |
From few components to an Eulerian graph by adding ARCS
Graph-Theoretic Concepts in Computer Science | 2011-12-16 | Paper |
The parameterized complexity of local search for TSP, more refined
Algorithms and Computation | 2011-12-16 | Paper |
Parameterized complexity of arc-weighted directed Steiner problems
SIAM Journal on Discrete Mathematics | 2011-10-27 | Paper |
The effect of homogeneity on the complexity of \(k\)-anonymity
Fundamentals of Computation Theory | 2011-08-19 | Paper |
Pattern-Guided Data Anonymization and Clustering
Mathematical Foundations of Computer Science 2011 | 2011-08-17 | Paper |
A more relaxed model for graph-based data clustering: \(s\)-plex cluster editing
SIAM Journal on Discrete Mathematics | 2011-07-18 | Paper |
Exploiting Bounded Signal Flow for Graph Orientation Based on Cause–Effect Pairs
Theory and Practice of Algorithms in (Computer) Systems | 2011-05-12 | Paper |
Deconstructing intractability-A multivariate complexity analysis of interval constrained coloring
Journal of Discrete Algorithms | 2011-05-03 | Paper |
Average parameterization and partial kernelization for computing medians
Journal of Computer and System Sciences | 2011-04-28 | Paper |
On making a distinguished vertex minimum degree by vertex deletion
SOFSEM 2011: Theory and Practice of Computer Science | 2011-02-15 | Paper |
Separator-based data reduction for signed graph balancing
Journal of Combinatorial Optimization | 2010-12-21 | Paper |
On tractable cases of target set selection
Algorithms and Computation | 2010-12-09 | Paper |
Partial kernelization for rank aggregation: theory and experiments
Parameterized and Exact Computation | 2010-12-07 | Paper |
Fixed-parameter tractability results for full-degree spanning tree and its dual
Networks | 2010-11-24 | Paper |
Efficient algorithms for Eulerian extension
Graph Theoretic Concepts in Computer Science | 2010-11-16 | Paper |
Measuring indifference: unit interval vertex deletion
Graph Theoretic Concepts in Computer Science | 2010-11-16 | Paper |
Polynomial-time data reduction for dominating set
Journal of the ACM | 2010-08-17 | Paper |
Fixed-parameter algorithms for cluster vertex deletion
Theory of Computing Systems | 2010-08-13 | Paper |
Extended islands of tractability for parsimony haplotyping
Combinatorial Pattern Matching | 2010-07-26 | Paper |
Incremental list coloring of graphs, parameterized by conservation
Lecture Notes in Computer Science | 2010-06-17 | Paper |
Approximation and fixed-parameter algorithms for consecutive ones submatrix problems
Journal of Computer and System Sciences | 2010-05-25 | Paper |
Average parameterization and partial kernelization for computing medians
LATIN 2010: Theoretical Informatics | 2010-04-27 | Paper |
Kernelization through Tidying
LATIN 2010: Theoretical Informatics | 2010-04-27 | Paper |
Fundamentals of Computation Theory
Lecture Notes in Computer Science | 2010-04-20 | Paper |
Two fixed-parameter algorithms for vertex covering by paths on trees
Information Processing Letters | 2010-04-19 | Paper |
Automated generation of search tree algorithms for graph modification problems
Lecture Notes in Computer Science | 2010-03-03 | Paper |
Fixed-parameter tractability results for feedback set problems in tournaments
Journal of Discrete Algorithms | 2010-02-26 | Paper |
Parameterized computational complexity of Dodgson and Young elections
Information and Computation | 2010-02-26 | Paper |
A fixed-parameter tractability result for multicommodity demand flow in trees
Information Processing Letters | 2009-12-18 | Paper |
Parameterized complexity of arc-weighted directed Steiner problems
Algorithms and Computation | 2009-12-17 | Paper |
Isolation concepts for clique enumeration: comparison and computational experiments
Theoretical Computer Science | 2009-11-25 | Paper |
Fixed-parameter algorithms for Kemeny rankings
Theoretical Computer Science | 2009-11-04 | Paper |
On Making Directed Graphs Transitive
Lecture Notes in Computer Science | 2009-10-20 | Paper |
A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems
Mathematical Foundations of Computer Science 2009 | 2009-10-16 | Paper |
Isolation concepts for efficiently enumerating dense subgraphs
Theoretical Computer Science | 2009-09-10 | Paper |
Graph-Based Data Clustering with Overlaps
Lecture Notes in Computer Science | 2009-07-23 | Paper |
Iterative Compression for Exactly Solving NP-Hard Minimization Problems
Algorithmics of Large and Complex Networks | 2009-07-09 | Paper |
Deconstructing Intractability: A Case Study for Interval Constrained Coloring
Combinatorial Pattern Matching | 2009-07-07 | Paper |
A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing
Algorithmic Aspects in Information and Management | 2009-07-02 | Paper |
SOFSEM 2004: Theory and Practice of Computer Science
Lecture Notes in Computer Science | 2009-06-04 | Paper |
Algorithms for compact letter displays: comparison and evaluation
Computational Statistics and Data Analysis | 2009-06-02 | Paper |
Red-blue covering problems and the consecutive ones property
Journal of Discrete Algorithms | 2009-05-13 | Paper |
Isolation Concepts for Enumerating Dense Subgraphs
Lecture Notes in Computer Science | 2009-03-06 | Paper |
Closest 4-leaf power is fixed-parameter tractable
Discrete Applied Mathematics | 2009-03-04 | Paper |
Enumerating Isolated Cliques in Synthetic and Financial Networks
Combinatorial Optimization and Applications | 2009-01-27 | Paper |
Improved algorithms and complexity results for power domination in graphs
Algorithmica | 2008-12-02 | Paper |
Parameterized Computational Complexity of Dodgson and Young Elections
Algorithm Theory – SWAT 2008 | 2008-07-15 | Paper |
Fixed-Parameter Algorithms for Kemeny Scores
Algorithmic Aspects in Information and Management | 2008-07-10 | Paper |
Parameterized Algorithms and Hardness Results for Some Graph Motif Problems
Combinatorial Pattern Matching | 2008-06-17 | Paper |
Fixed-Parameter Tractability Results for Full-Degree Spanning Tree and Its Dual
Parameterized and Exact Computation | 2008-06-03 | Paper |
Speeding up Dynamic Programming for Some NP-Hard Graph Recoloring Problems
Lecture Notes in Computer Science | 2008-05-27 | Paper |
Fixed-Parameter Algorithms for Cluster Vertex Deletion
Lecture Notes in Computer Science | 2008-04-15 | Paper |
Tree decompositions of graphs: saving memory in dynamic programming
Discrete Optimization | 2008-01-11 | Paper |
Probe Matrix Problems: Totally Balanced Matrices
Algorithmic Aspects in Information and Management | 2008-01-04 | Paper |
Optimal Edge Deletions for Signed Graph Balancing
Experimental Algorithms | 2008-01-02 | Paper |
Parameterized complexity of Vertex Cover variants
Theory of Computing Systems | 2007-12-19 | Paper |
Linear Problem Kernels for NP-Hard Problems on Planar Graphs
Automata, Languages and Programming | 2007-11-28 | Paper |
Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs
European Journal of Operational Research | 2007-11-23 | Paper |
Approximability and Parameterized Complexity of Consecutive Ones Submatrix Problems
Lecture Notes in Computer Science | 2007-11-13 | Paper |
Minimum Membership Set Covering and the Consecutive Ones Property
Algorithm Theory – SWAT 2006 | 2007-09-07 | Paper |
Tree Decompositions of Graphs: Saving Memory in Dynamic Programming
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments
Lecture Notes in Computer Science | 2007-05-02 | Paper |
An efficient fixed-parameter algorithm for 3-hitting set
Journal of Discrete Algorithms | 2007-04-26 | Paper |
Exact algorithms and applications for tree-like Weighted Set Cover
Journal of Discrete Algorithms | 2007-02-14 | Paper |
THE COMPUTATIONAL COMPLEXITY OF AVOIDING FORBIDDEN SUBMATRICES BY ROW DELETIONS
International Journal of Foundations of Computer Science | 2007-02-08 | Paper |
Experiments on data reduction for optimal domination in networks
Annals of Operations Research | 2007-02-05 | Paper |
On the parameterized intractability of motif search problems
Combinatorica | 2007-01-08 | Paper |
Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
Journal of Computer and System Sciences | 2006-12-07 | Paper |
SOFSEM 2006: Theory and Practice of Computer Science
Lecture Notes in Computer Science | 2006-11-14 | Paper |
SOFSEM 2006: Theory and Practice of Computer Science
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Parameterized intractability of distinguishing substring selection
Theory of Computing Systems | 2006-10-25 | Paper |
Algorithms and Data Structures
Lecture Notes in Computer Science | 2006-10-25 | Paper |
Algorithms and Data Structures
Lecture Notes in Computer Science | 2006-10-25 | Paper |
Fundamentals of Computation Theory
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Error compensation in leaf power problems
Algorithmica | 2006-08-16 | Paper |
Graph-modeled data clustering: Exact algorithms for clique generation
Theory of Computing Systems | 2006-02-08 | Paper |
Fixed-parameter tractability and data reduction for multicut in trees
Networks | 2006-01-23 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
A refined search tree technique for dominating set on planar graphs
Journal of Computer and System Sciences | 2005-12-07 | Paper |
| scientific article; zbMATH DE number 2234775 (Why is no real title available?) | 2005-12-01 | Paper |
Parameterized and Exact Computation
Lecture Notes in Computer Science | 2005-08-23 | Paper |
Mathematical Foundations of Computer Science 2004
Lecture Notes in Computer Science | 2005-08-22 | Paper |
Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs
Discrete Applied Mathematics | 2005-02-22 | Paper |
Parameterized complexity: exponential speed-up for planar graph problems
Journal of Algorithms | 2004-11-23 | Paper |
Computing the similarity of two sequences with nested arc annotations
Theoretical Computer Science | 2004-10-27 | Paper |
Automated generation of search tree algorithms for hard graphs modification problems
Algorithmica | 2004-10-01 | Paper |
A fixed-parameter algorithm for minimum quartet inconsistency
Journal of Computer and System Sciences | 2004-08-19 | Paper |
Graph separators: A parameterized view
Journal of Computer and System Sciences | 2004-08-19 | Paper |
| scientific article; zbMATH DE number 2089218 (Why is no real title available?) | 2004-08-12 | Paper |
| scientific article; zbMATH DE number 2086260 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2086391 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2087047 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2081011 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2080245 (Why is no real title available?) | 2004-08-04 | Paper |
Fixed-parameter algorithms for CLOSEST STRING and related problems
Algorithmica | 2004-03-11 | Paper |
| scientific article; zbMATH DE number 2011849 (Why is no real title available?) | 2003-12-02 | Paper |
Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT.
Discrete Applied Mathematics | 2003-09-15 | Paper |
On efficient fixed-parameter algorithms for weighted vertex cover
Journal of Algorithms | 2003-08-17 | Paper |
| scientific article; zbMATH DE number 1954383 (Why is no real title available?) | 2003-07-28 | Paper |
| scientific article; zbMATH DE number 1882054 (Why is no real title available?) | 2003-03-13 | Paper |
Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs
Algorithmica | 2002-12-01 | Paper |
| scientific article; zbMATH DE number 1834643 (Why is no real title available?) | 2002-11-25 | Paper |
| scientific article; zbMATH DE number 1796976 (Why is no real title available?) | 2002-09-05 | Paper |
| scientific article; zbMATH DE number 1786463 (Why is no real title available?) | 2002-08-21 | Paper |
A general method to speed up fixed-parameter-tractable algorithms
Information Processing Letters | 2002-07-25 | Paper |
| scientific article; zbMATH DE number 1756013 (Why is no real title available?) | 2002-06-16 | Paper |
Towards optimal locality in mesh-indexings
Discrete Applied Mathematics | 2002-05-15 | Paper |
| scientific article; zbMATH DE number 1629855 (Why is no real title available?) | 2001-11-04 | Paper |
| SIMPLE MAX-CUT for unit interval graphs and graphs with few \(P4\)s | 2001-09-23 | Paper |
An efficient exact algorithm for constraint bipartite vertex cover
Journal of Algorithms | 2001-07-23 | Paper |
| scientific article; zbMATH DE number 1617251 (Why is no real title available?) | 2001-07-11 | Paper |
Faster exact algorithms for hard problems: A parameterized point of view
Discrete Mathematics | 2001-07-05 | Paper |
New Upper Bounds for Maximum Satisfiability
Journal of Algorithms | 2001-05-06 | Paper |
On multidimensional curves with Hilbert property
Theory of Computing Systems | 2000-12-07 | Paper |
| scientific article; zbMATH DE number 1405665 (Why is no real title available?) | 2000-10-17 | Paper |
Optimal deterministic sorting and routing on grids and tori with diagonals
Algorithmica | 2000-05-28 | Paper |
Data independence of read, write, and control structures in PRAM computations
Journal of Computer and System Sciences | 2000-05-08 | Paper |
| scientific article; zbMATH DE number 1418354 (Why is no real title available?) | 2000-03-19 | Paper |
| scientific article; zbMATH DE number 1414311 (Why is no real title available?) | 2000-03-16 | Paper |
| scientific article; zbMATH DE number 1304341 (Why is no real title available?) | 1999-09-24 | Paper |
| scientific article; zbMATH DE number 1222847 (Why is no real title available?) | 1999-05-02 | Paper |
Unambiguous computations and locally definable acceptance types
Theoretical Computer Science | 1998-08-13 | Paper |
| scientific article; zbMATH DE number 996551 (Why is no real title available?) | 1997-04-03 | Paper |
Unambiguous auxiliary pushdown automata and semi-unbounded fan-in circuits
Information and Computation | 1995-07-10 | Paper |
| scientific article; zbMATH DE number 512853 (Why is no real title available?) | 1994-06-13 | Paper |
