Rolf Niedermeier

According to our database1, Rolf Niedermeier authored at least 282 papers between 1992 and 2020.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
Temporal graph classes: A view through temporal separators.
Theor. Comput. Sci., 2020

Mixed integer programming with convex/concave constraints: Fixed-parameter tractability and applications to multicovering and voting.
Theor. Comput. Sci., 2020

Comparing temporal graphs using dynamic time warping.
Social Netw. Analys. Mining, 2020

Preface of the Special Issue on Theoretical Aspects of Computer Science (2018).
Theory Comput. Syst., 2020

The complexity of finding small separators in temporal graphs.
J. Comput. Syst. Sci., 2020

Efficient algorithms for measuring the funnel-likeness of DAGs.
J. Comb. Optim., 2020

Line-Up Elections: Parallel Voting with Shared Candidate Pool.
CoRR, 2020

Bribery and Control in Stable Marriage.
CoRR, 2020

Approximating Sparse Quadratic Programs.
CoRR, 2020

On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering.
CoRR, 2020

Algorithmic Aspects of Temporal Betweenness.
CoRR, 2020

High-Multiplicity Fair Allocation Using Parametric Integer Linear Programming.
CoRR, 2020

Feedback Edge Sets in Temporal Graphs.
CoRR, 2020

Multistage s-t Path: Confronting Similarity with Dissimilarity.
CoRR, 2020

Complexity of Combinatorial Matrix Completion With Diameter Constraints.
CoRR, 2020

Diminishable parameterized problems and strict polynomial kernelization.
Computability, 2020

Computing Maximum Matchings in Temporal Graphs.
Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science, 2020

Faster Binary Mean Computation Under Dynamic Time Warping.
Proceedings of the 31st Annual Symposium on Combinatorial Pattern Matching, 2020

Parameterized Algorithms for Matrix Completion with Radius Constraints.
Proceedings of the 31st Annual Symposium on Combinatorial Pattern Matching, 2020

As Time Goes By: Reflections on Treewidth for Temporal Graphs.
Proceedings of the Treewidth, Kernels, and Algorithms, 2020

Parameterized Algorithms for Finding a Collective Set of Items.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

Adapting Stable Matchings to Evolving Preferences.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

Electing Successive Committees: Complexity and Algorithms.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
Inductive $$k$$ k -independent graphs and c-colorable subgraphs in scheduling: a review.
J. Sched., 2019

A more fine-grained complexity analysis of finding the most vital edges for undirected shortest paths.
Networks, 2019

Assessing the computational complexity of multilayer subgraph detection.
Netw. Sci., 2019

Listing All Maximal <i>k</i>-Plexes in Temporal Graphs.
ACM J. Exp. Algorithmics, 2019

The parameterized complexity of the minimum shared edges problem.
J. Comput. Syst. Sci., 2019

Parameterized aspects of triangle enumeration.
J. Comput. Syst. Sci., 2019

Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: Theory and experiments.
Eur. J. Oper. Res., 2019

Exact mean computation in dynamic time warping spaces.
Data Min. Knowl. Discov., 2019

Application-Oriented Computational Social Choice (Dagstuhl Seminar 19381).
Dagstuhl Reports, 2019

Algorithms and Complexity in Phylogenetics (Dagstuhl Seminar 19443).
Dagstuhl Reports, 2019

Multistage Problems on a Global Budget.
CoRR, 2019

Polynomial-Time Preprocessing for Weighted Problems Beyond Additive Goal Functions.
CoRR, 2019

Stable Roommates with Narcissistic, Single-Peaked, and Single-Crossing Preferences.
CoRR, 2019

When Can Graph Hyperbolicity be Computed in Linear Time?
Algorithmica, 2019

A Parameterized Algorithmics Framework for Degree Sequence Completion Problems in Directed Graphs.
Algorithmica, 2019

Multistage Vertex Cover.
Proceedings of the 14th International Symposium on Parameterized and Exact Computation, 2019

Parameterized Complexity of Stable Roommates with Ties and Incomplete Lists Through the Lens of Graph Parameters.
Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

An Experimental View on Committees Providing Justified Representation.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

High-Multiplicity Fair Allocation: Lenstra Empowered by N-fold Integer Programming.
Proceedings of the 2019 ACM Conference on Economics and Computation, 2019

Enumerating Isolated Cliques in Temporal Networks.
Proceedings of the Complex Networks and Their Applications VIII, 2019

Efficient Computation of Optimal Temporal Walks Under Waiting-Time Constraints.
Proceedings of the Complex Networks and Their Applications VIII, 2019

2018
A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs.
SIAM J. Discret. Math., 2018

Fractals for Kernelization Lower Bounds.
SIAM J. Discret. Math., 2018

Exact Algorithms for Finding Well-Connected 2-Clubs in Real-World Graphs: Theory and Experiments.
CoRR, 2018

Hardness of Consensus Problems for Circular Strings and Time Series Averaging.
CoRR, 2018

Towards Improving Brandes' Algorithm for Betweenness Centrality.
CoRR, 2018

Temporal Graph Classes: A View Through Temporal Separators.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2018

Stable Marriage with Multi-Modal Preferences.
Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

An Adaptive Version of Brandes' Algorithm for Betweenness Centrality.
Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

Parameterized Dynamic Cluster Editing.
Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2018

Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments.
Proceedings of the 26th Annual European Symposium on Algorithms, 2018

Envy-Free Allocations Respecting Social Networks.
Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

Listing All Maximal k-Plexes in Temporal Graphs.
Proceedings of the IEEE/ACM 2018 International Conference on Advances in Social Networks Analysis and Mining, 2018

2017
Polynomial fixed-parameter algorithms: A case study for longest path on interval graphs.
Theor. Comput. Sci., 2017

Adapting the Bron-Kerbosch algorithm for enumerating maximal cliques in temporal graphs.
Social Netw. Analys. Mining, 2017

A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack.
J. Sched., 2017

The Complexity of Finding Effectors.
Theory Comput. Syst., 2017

Partitioning Perfect Graphs into Stars.
Journal of Graph Theory, 2017

Elections with Few Voters: Candidate Control Can Be Easy.
J. Artif. Intell. Res., 2017

Parliamentary Voting Procedures: Agenda Control, Manipulation, and Uncertainty.
J. Artif. Intell. Res., 2017

Finding Points in General Position.
Int. J. Comput. Geom. Appl., 2017

(Wireless) Scheduling, Graph Classes, and c-Colorable Subgraphs.
CoRR, 2017

The Computational Complexity of Finding Separators in Temporal Graphs.
CoRR, 2017

Robustness Among Multiwinner Voting Rules.
Proceedings of the Algorithmic Game Theory - 10th International Symposium, 2017

The Power of Linear-Time Data Reduction for Maximum Matching.
Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

On Coalitional Manipulation for Multiwinner Elections: Shortlisting.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Assessing the Computational Complexity of Multi-layer Subgraph Detection.
Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

Parameterized Algorithms for Power-Efficient Connected Symmetric Wireless Sensor Networks.
Proceedings of the Algorithms for Sensor Systems, 2017

Stable Roommate with Narcissistic, Single-Peaked, and Single-Crossing Preferences.
Proceedings of the Algorithmic Decision Theory - 5th International Conference, 2017

Teams in Online Scheduling Polls: Game-Theoretic Aspects.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
Weighted Tournament Solutions.
Proceedings of the Handbook of Computational Social Choice, 2016

Data Reduction for Domination in Graphs.
Encyclopedia of Algorithms, 2016

Parameterization in Computational Social Choice.
Encyclopedia of Algorithms, 2016

Win-win kernelization for degree sequence completion problems.
J. Comput. Syst. Sci., 2016

Exploiting hidden structure in selecting dimensions that distinguish vectors.
J. Comput. Syst. Sci., 2016

Large-Scale Election Campaigns: Combinatorial Shift Bribery.
J. Artif. Intell. Res., 2016

Prices matter for the parameterized complexity of shift bribery.
Inf. Comput., 2016

Fine-Grained Algorithm Design for Matching.
CoRR, 2016

A Parameterized Algorithmics Framework for Digraph Degree Sequence Completion Problems.
CoRR, 2016

Co-Clustering under the Maximum Norm.
Algorithms, 2016

H-index manipulation by merging articles: Models, theory, and experiments.
Artif. Intell., 2016

Complexity of Efficient and Envy-Free Resource Allocation: Few Agents, Resources, or Utility Levels.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Fractals for Kernelization Lower Bounds, With an Application to Length-Bounded Cut Problems.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Twins in Subdivision Drawings of Hypergraphs.
Proceedings of the Graph Drawing and Network Visualization, 2016

h-Index Manipulation by Undoing Merges.
Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016

Enumerating maximal cliques in temporal graphs.
Proceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2016

Complexity of Shift Bribery in Committee Elections.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015
How to Put Through Your Agenda in Collective Binary Decisions.
ACM Trans. Economics and Comput., 2015

Combinatorial voter control in elections.
Theor. Comput. Sci., 2015

The complexity of degree anonymization by vertex addition.
Theor. Comput. Sci., 2015

Polynomial-Time Data Reduction for the Subset Interconnection Design Problem.
SIAM J. Discret. Math., 2015

Network-Based Vertex Dissolution.
SIAM J. Discret. Math., 2015

Interval scheduling and colorful independent sets.
J. Sched., 2015

On explaining integer vectors by few homogeneous segments.
J. Comput. Syst. Sci., 2015

A refined complexity analysis of degree anonymization in graphs.
Inf. Comput., 2015

Well-Formed Separator Sequences, with an Application to Hypergraph Drawing.
CoRR, 2015

The Parameterized Complexity of the Rainbow Subgraph Problem.
Algorithms, 2015

Using Patterns to Form Homogeneous Teams.
Algorithmica, 2015

Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2015

A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths.
Proceedings of the Algorithms and Complexity - 9th International Conference, 2015

Elections with Few Candidates: Prices, Weights, and Covering Problems.
Proceedings of the Algorithmic Decision Theory - 4th International Conference, 2015

2014
Partitioning Biological Networks into Highly Connected Clusters with Maximum Edge Coverage.
IEEE/ACM Trans. Comput. Biology Bioinform., 2014

Constant Thresholds Can Make Target Set Selection Tractable.
Theory Comput. Syst., 2014

A Multivariate Complexity Analysis of Lobbying in Multiple Referenda.
J. Artif. Intell. Res., 2014

Multivariate Algorithmics for NP-Hard String Problems.
Bull. EATCS, 2014

The effect of homogeneity on the computational complexity of combinatorial data anonymization.
Data Min. Knowl. Discov., 2014

Parameterized Algorithmics for Computational Social Choice: Nine Research Challenges.
CoRR, 2014

On Google Scholar H-Index Manipulation by Merging Articles.
CoRR, 2014

On Making a Distinguished Vertex of Minimum Degree by Vertex Deletion.
Algorithmica, 2014

Exploiting a hypergraph model for finding Golomb rulers.
Acta Informatica, 2014

Theoretical and empirical evaluation of data reduction for exact Kemeny Rank Aggregation.
Auton. Agents Multi Agent Syst., 2014

Combinatorial Voter Control in Elections.
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

Network-Based Dissolution.
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

Star Partitions of Perfect Graphs.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013
Incremental list coloring of graphs, parameterized by conservation.
Theor. Comput. Sci., 2013

On tractable cases of Target Set Selection.
Social Netw. Analys. Mining, 2013

Efficient Algorithms for Eulerian Extension and Rural Postman.
SIAM J. Discret. Math., 2013

Confluence in Data Reduction: Bridging Graph Transformation and Kernelization.
Computability, 2013

Pattern-Guided <i>k</i>-Anonymity.
Algorithms, 2013

The Parameterized Complexity of Local Search for TSP, More Refined.
Algorithmica, 2013

Evaluation of ILP-Based Approaches for Partitioning into Colorful Components.
Proceedings of the Experimental Algorithms, 12th International Symposium, 2013

On Explaining Integer Vectors by Few Homogenous Segments.
Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

A Parameterized Complexity Analysis of Combinatorial Feature Selection Problems.
Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

Effective and Efficient Data Reduction for the Subset Interconnection Design Problem.
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

2012
Parameterized computational complexity of finding small-diameter subgraphs.
Optim. Lett., 2012

A new view on Rural Postman based on Eulerian Extension and Matching.
J. Discrete Algorithms, 2012

On making directed graphs transitive.
J. Comput. Syst. Sci., 2012

Exact combinatorial algorithms and experiments for finding maximum k-plexes.
J. Comb. Optim., 2012

On Bounded-Degree Vertex Deletion parameterized by treewidth.
Discret. Appl. Math., 2012

Approximation and Tidying - A Problem Kernel for s-Plex Cluster Vertex Deletion.
Algorithmica, 2012

New Races in Parameterized Algorithmics.
Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

Partitioning into Colorful Components by Minimum Edge Deletions.
Proceedings of the Combinatorial Pattern Matching - 23rd Annual Symposium, 2012

Studies in Computational Aspects of Voting - A Parameterized Complexity Perspective.
Proceedings of the Multivariate Algorithmic Revolution and Beyond, 2012

A Multivariate Complexity Analysis of Lobbying in Multiple Referenda.
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011
A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems.
ACM Trans. Comput. Theory, 2011

Parameterized Algorithmics for Finding Connected Motifs in Biological Networks.
IEEE/ACM Trans. Comput. Biology Bioinform., 2011

Parameterized Complexity of Arc-Weighted Directed Steiner Problems.
SIAM J. Discret. Math., 2011

Aspects of a multivariate complexity analysis for Rectangle Tiling.
Oper. Res. Lett., 2011

Deconstructing intractability - A multivariate complexity analysis of interval constrained coloring.
J. Discrete Algorithms, 2011

A generalization of Nemhauser and Trotterʼs local optimization theorem.
J. Comput. Syst. Sci., 2011

Average parameterization and partial kernelization for computing medians.
J. Comput. Syst. Sci., 2011

Graph-based data clustering with overlaps.
Discret. Optim., 2011

Exploiting bounded signal flow for graph orientation based on cause-effect pairs.
Algorithms Mol. Biol., 2011

From Few Components to an Eulerian Graph by Adding Arcs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2011

On Making a Distinguished Vertex Minimum Degree by Vertex Deletion.
Proceedings of the SOFSEM 2011: Theory and Practice of Computer Science, 2011

Pattern-Guided Data Anonymization and Clustering.
Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs.
Proceedings of the Parameterized and Exact Computation - 6th International Symposium, 2011

Unweighted Coalitional Manipulation under the Borda Rule Is NP-Hard.
Proceedings of the IJCAI 2011, 2011

The Effect of Homogeneity on the Complexity of k-Anonymity.
Proceedings of the Fundamentals of Computation Theory - 18th International Symposium, 2011

Depth-First Search (Ariadne & Co.).
Proceedings of the Algorithms Unplugged, 2011

2010
A More Relaxed Model for Graph-Based Data Clustering: s-Plex Cluster Editing.
SIAM J. Discret. Math., 2010

Fixed-parameter tractability results for full-degree spanning tree and its dual.
Networks, 2010

Fixed-Parameter Algorithms for Cluster Vertex Deletion.
Theory Comput. Syst., 2010

Fixed-parameter tractability results for feedback set problems in tournaments.
J. Discrete Algorithms, 2010

Approximation and fixed-parameter algorithms for consecutive ones submatrix problems.
J. Comput. Syst. Sci., 2010

Separator-based data reduction for signed graph balancing.
J. Comb. Optim., 2010

Parameterized computational complexity of Dodgson and Young elections.
Inf. Comput., 2010

Efficient Algorithms for Eulerian Extension.
Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

Measuring Indifference: Unit Interval Vertex Deletion.
Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

Reflections on Multivariate Algorithmics and Problem Parameterization.
Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010

Kernelization through Tidying.
Proceedings of the LATIN 2010: Theoretical Informatics, 2010

Partial Kernelization for Rank Aggregation: Theory and Experiments.
Proceedings of the Parameterized and Exact Computation - 5th International Symposium, 2010

Extended Islands of Tractability for Parsimony Haplotyping.
Proceedings of the Combinatorial Pattern Matching, 21st Annual Symposium, 2010

Exact Algorithms and Experiments for Hierarchical Tree Clustering.
Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

2009
Isolation concepts for efficiently enumerating dense subgraphs.
Theor. Comput. Sci., 2009

Isolation concepts for clique enumeration: Comparison and computational experiments.
Theor. Comput. Sci., 2009

Fixed-parameter algorithms for Kemeny rankings.
Theor. Comput. Sci., 2009

Algorithms and Experiments for Clique Relaxations-Finding Maximum s-Plexes.
Proceedings of the Experimental Algorithms, 8th International Symposium, 2009

A Generalization of Nemhauser and Trotter's Local Optimization Theorem.
Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

A Multivariate Complexity Analysis of Determining Possible Winners Given Incomplete Votes.
Proceedings of the IJCAI 2009, 2009

Iterative Compression for Exactly Solving NP-Hard Minimization Problems.
Proceedings of the Algorithmics of Large and Complex Networks - Design, 2009

09171 Executive Summary - Adaptive, Output Sensitive, Online and Parameterized Algorithms.
Proceedings of the Adaptive, Output Sensitive, Online and Parameterized Algorithms, 19.04., 2009

09171 Abstracts Collection - Adaptive, Output Sensitive, Online and Parameterized Algorithms.
Proceedings of the Adaptive, Output Sensitive, Online and Parameterized Algorithms, 19.04., 2009

Deconstructing Intractability: A Case Study for Interval Constrained Coloring.
Proceedings of the Combinatorial Pattern Matching, 20th Annual Symposium, 2009

How similarity helps to efficiently compute Kemeny rankings.
Proceedings of the 8th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2009), 2009

A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing.
Proceedings of the Algorithmic Aspects in Information and Management, 2009

2008
Data Reduction for Domination in Graphs.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Tiefensuche (Ariadne und Co.).
Proceedings of the Taschenbuch der Algorithmen, 2008

Data reduction and exact algorithms for clique cover.
ACM J. Exp. Algorithmics, 2008

Red-blue covering problems and the consecutive ones property.
J. Discrete Algorithms, 2008

Two fixed-parameter algorithms for Vertex Covering by Paths on Trees.
Inf. Process. Lett., 2008

Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs.
Eur. J. Oper. Res., 2008

Closest 4-leaf power is fixed-parameter tractable.
Discret. Appl. Math., 2008

Techniques for Practical Fixed-Parameter Algorithms.
Comput. J., 2008

Improved Algorithms and Complexity Results for Power Domination in Graphs.
Algorithmica, 2008

Speeding up Dynamic Programming for Some NP-Hard Graph Recoloring Problems.
Proceedings of the Theory and Applications of Models of Computation, 2008

Parameterized Algorithms and Hardness Results for Some Graph Motif Problems.
Proceedings of the Combinatorial Pattern Matching, 19th Annual Symposium, 2008

Enumerating Isolated Cliques in Synthetic and Financial Networks.
Proceedings of the Combinatorial Optimization and Applications, 2008

Fixed-Parameter Algorithms for Kemeny Scores.
Proceedings of the Algorithmic Aspects in Information and Management, 2008

2007
Invitation to data reduction and problem kernelization.
SIGACT News, 2007

Parameterized Complexity of Vertex Cover Variants.
Theory Comput. Syst., 2007

Das Knotenüberdeckungsproblem Eine Fallstudie zur Didaktik NP-schwerer Probleme (Teil 2).
LOG IN, 2007

Das Knotenüberdeckungsproblem - Eine Fallstudie zur Didaktik NP-schwerer Probleme (Teil 1).
LOG IN, 2007

Algorithms for compact letter displays: Comparison and evaluation.
Comput. Stat. Data Anal., 2007

Optimal Edge Deletions for Signed Graph Balancing.
Proceedings of the Experimental Algorithms, 6th International Workshop, 2007

Approximability and Parameterized Complexity of Consecutive Ones Submatrix Problems.
Proceedings of the Theory and Applications of Models of Computation, 2007

Linear Problem Kernels for NP-Hard Problems on Planar Graphs.
Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

Isolation Concepts for Enumerating Dense Subgraphs.
Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

Probe Matrix Problems: Totally Balanced Matrices.
Proceedings of the Algorithmic Aspects in Information and Management, 2007

2006
Editorial.
Theor. Comput. Sci., 2006

Pattern matching for arc-annotated sequences.
ACM Trans. Algorithms, 2006

Parameterized Intractability of Distinguishing Substring Selection.
Theory Comput. Syst., 2006

Exact algorithms and applications for Tree-like Weighted Set Cover.
J. Discrete Algorithms, 2006

Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization.
J. Comput. Syst. Sci., 2006

A fixed-parameter tractability result for multicommodity demand flow in trees.
Inf. Process. Lett., 2006

The Computational Complexity of Avoiding Forbidden Submatrices by Row Deletions.
Int. J. Found. Comput. Sci., 2006

On The Parameterized Intractability Of Motif Search Problems.
Comb., 2006

Experiments on data reduction for optimal domination in networks.
Ann. Oper. Res., 2006

Error Compensation in Leaf Power Problems.
Algorithmica, 2006

Minimum Membership Set Covering and the Consecutive Ones Property.
Proceedings of the Algorithm Theory, 2006

Complexity and Exact Algorithms for Multicut.
Proceedings of the SOFSEM 2006: Theory and Practice of Computer Science, 2006

A General Data Reduction Scheme for Domination in Graphs.
Proceedings of the SOFSEM 2006: Theory and Practice of Computer Science, 2006

Data Reduction, Exact, and Heuristic Algorithms for Clique Cover.
Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments, 2006

Matrix Robustness, with an Application to Power System Observability.
Proceedings of the Algorithms and Complexity in Durham 2006, 2006

Invitation to Fixed-Parameter Algorithms
Oxford University Press, ISBN: 9780198566076, 2006

2005
Fixed-parameter tractability and data reduction for multicut in trees.
Networks, 2005

Graph-Modeled Data Clustering: Exact Algorithms for Clique Generation.
Theory Comput. Syst., 2005

A refined search tree technique for Dominating Set on planar graphs.
J. Comput. Syst. Sci., 2005

Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs.
Discret. Appl. Math., 2005

Extending the Tractability Border for Closest Leaf Powers.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005

Parameterized Complexity of Generalized Vertex Cover Problems.
Proceedings of the Algorithms and Data Structures, 9th International Workshop, 2005

Improved Fixed-Parameter Algorithms for Two Feedback Set Problems.
Proceedings of the Algorithms and Data Structures, 9th International Workshop, 2005

Bounded Degree Closest <i>k</i>-Tree Power Is NP-Complete.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004
Computing the similarity of two sequences with nested arc annotations.
Theor. Comput. Sci., 2004

Polynomial-time data reduction for dominating set.
J. ACM, 2004

Tree Decompositions of Graphs: Saving Memory in Dynamic Programming.
Electron. Notes Discret. Math., 2004

Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems.
Algorithmica, 2004

Simple Max-Cut for Split-Indifference Graphs and Graphs with Few P<sub>4</sub>'s.
Proceedings of the Experimental and Efficient Algorithms, Third International Workshop, 2004

Avoiding Forbidden Submatrices by Row Deletions.
Proceedings of the SOFSEM 2004: Theory and Practice of Computer Science, 2004

Ubiquitous Parameterization - Invitation to Fixed-Parameter Algorithms.
Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

A Structural View on Parameterizing Problems: Distance from Triviality.
Proceedings of the Parameterized and Exact Computation, First International Workshop, 2004

Error Compensation in Leaf Root Problems.
Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

2003
An efficient fixed-parameter algorithm for 3-Hitting Set.
J. Discrete Algorithms, 2003

A fixed-parameter algorithm for minimum quartet inconsistency.
J. Comput. Syst. Sci., 2003

Graph separators: a parameterized view.
J. Comput. Syst. Sci., 2003

On efficient fixed-parameter algorithms for weighted vertex cover.
J. Algorithms, 2003

Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT.
Discret. Appl. Math., 2003

Fixed-Parameter Algorithms for CLOSEST STRING and Related Problems.
Algorithmica, 2003

On Exact and Approximation Algorithms for Distinguishing Substring Selection.
Proceedings of the Fundamentals of Computation Theory, 14th International Symposium, 2003

Automated Generation of Search Tree Algorithms for Graph Modification Problems.
Proceedings of the Algorithms, 2003

Graph-Modeled Data Clustering: Fixed-Parameter Algorithms for Clique Generation.
Proceedings of the Algorithms and Complexity, 5th Italian Conference, 2003

2002
Towards optimal locality in mesh-indexings.
Discret. Appl. Math., 2002

Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar Graphs.
Algorithmica, 2002

Efficient Data Reduction for DOMINATING SET: A Linear Problem Kernel for the Planar Case.
Proceedings of the Algorithm Theory, 2002

On the Parameterized Intractability of CLOSEST SUBSTRINGsize and Related Problems.
Proceedings of the STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes, 2002

Improved Tree Decomposition Based Algorithms for Domination-like Problems.
Proceedings of the LATIN 2002: Theoretical Informatics, 2002

Breakpoint medians and breakpoint phylogenies: A fixed-parameter approach.
Proceedings of the European Conference on Computational Biology (ECCB 2002), 2002

Towards Optimally Solving the LONGEST COMMON SUBSEQUENCE Problem for Sequences with Nested Arc Annotations in Linear Time.
Proceedings of the Combinatorial Pattern Matching, 13th Annual Symposium, 2002

2001
An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover.
J. Algorithms, 2001

Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems
Electronic Colloquium on Computational Complexity (ECCC), 2001

Faster exact algorithms for hard problems: A parameterized point of view.
Discret. Math., 2001

Finding Optimal Solutions to Atomix.
Proceedings of the KI 2001: Advances in Artificial Intelligence, 2001

Exact Solutions for CLOSEST STRING and Related Problems.
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

Minimum Quartet Inconsistency Is Fixed Parameter Tractable.
Proceedings of the Combinatorial Pattern Matching, 12th Annual Symposium, 2001

2000
On Multidimensional Curves with Hilbert Property.
Theory Comput. Syst., 2000

Data Independence of Read, Write, and Control Structures in PRAM Computations.
J. Comput. Syst. Sci., 2000

New Upper Bounds for Maximum Satisfiability.
J. Algorithms, 2000

A general method to speed up fixed-parameter-tractable algorithms.
Inf. Process. Lett., 2000

New Worst-Case Upper Bounds for MAX-2-SAT with Application to MAX-CUT
Electronic Colloquium on Computational Complexity (ECCC), 2000

Fixed Parameter Algorithms for PLANAR DOMINATING SET and Related Problems.
Proceedings of the Algorithm Theory, 2000

Faster Exact Solutions for MAX2SAT.
Proceedings of the Algorithms and Complexity, 4th Italian Conference, 2000

1999
SIMPLE MAX-CUT for unit interval graphs and graphs with few P<sub>4</sub>s.
Electron. Notes Discret. Math., 1999

Optimal Deterministic Sorting and Routing on Grids and Tori with Diagonals.
Algorithmica, 1999

Upper Bounds for Vertex Cover Further Improved.
Proceedings of the STACS 99, 1999

New Upper Bounds for MaxSat.
Proceedings of the Automata, 1999

1998
Unambiguous Computations and Locally Definable Acceptance Types.
Theor. Comput. Sci., 1998

Some Prospects for Efficient Fixed Parameter Algorithms.
Proceedings of the SOFSEM '98: Theory and Practice of Informatics, 1998

On Multi-dimensional Hilbert Indexings.
Proceedings of the Computing and Combinatorics, 4th Annual International Conference, 1998

1996
Towards realistic and simple models of parallel computation.
PhD thesis, 1996

Recursively Divisible Problems.
Proceedings of the Algorithms and Computation, 7th International Symposium, 1996

1995
Unambiguous Auxiliary Pushdown Automata and Semi-unbounded Fan-in Circuits
Inf. Comput., May, 1995

On Optimal Orow-Pram Algorithms for Computing Recursively Defined Functions.
Parallel Process. Lett., 1995

Optimal Average Case Sorting on Arrays.
Proceedings of the STACS 95, 1995

PRAM's Towards Realistic Parallelism: BRAM's.
Proceedings of the Fundamentals of Computation Theory, 10th International Symposium, 1995

1994
Faster Sorting and Routing on Grids with Diagonals.
Proceedings of the STACS 94, 1994

1993
Extended Locally Definable Acceptance Types (Extended Abstract).
Proceedings of the STACS 93, 1993

On the Power of Reading and Writing Simultaneously in Parallel Computation.
Proceedings of the Algorithms and Computation, 4th International Symposium, 1993

Data-Independences of Parallel Random Access Machines.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1993

1992
Unambiguous Simulations of Auxiliary Pushdown Automata and Circuits (Extended Abstract).
Proceedings of the LATIN '92, 1992


  Loading...