Rolf Niedermeier

Soc. Netw. Anal. Min., December, 2024

Equilibria in schelling games: computational hardness and robustness.

[BibT_eX]

[DOI]

Auton. Agents Multi Agent Syst., June, 2024

Fast Parameterized Preprocessing for Polynomial-Time Solvable Graph Problems.

[BibT_eX]

[DOI]

Commun. ACM, April, 2024

Approximating sparse quadratic programs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., February, 2024

Algorithmic aspects of temporal betweenness.

[BibT_eX]

[DOI]

Netw. Sci., 2024

The role of twins in computing planar supports of hypergraphs.

[BibT_eX]

[DOI]

Iyad Kanj

J. Graph Algorithms Appl., 2024

2023

Computing maximum matchings in temporal graphs.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., November, 2023

A multivariate complexity analysis of the material consumption scheduling problem.

[BibT_eX]

[DOI]

J. Sched., August, 2023

On finding separators in temporal split and permutation graphs.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., August, 2023

Multistage s-t Path: Confronting Similarity with Dissimilarity.

[BibT_eX]

[DOI]

Algorithmica, July, 2023

Temporal interval cliques and independent sets.

[BibT_eX]

[DOI]

Theor. Comput. Sci., June, 2023

Polynomial-time data reduction for weighted problems beyond additive goal functions.

[BibT_eX]

[DOI]

Discret. Appl. Math., March, 2023

Equitable scheduling on a single machine.

[BibT_eX]

[DOI]

J. Sched., 2023

Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2023

The complexity of binary matrix completion under diameter constraints.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2023

Improving Resource Allocations by Sharing in Pairs.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2023

The complexity of gerrymandering over graphs: Paths and trees.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2023

Interference-free walks in time: temporally disjoint paths.

[BibT_eX]

[DOI]

Auton. Agents Multi Agent Syst., 2023

A refined complexity analysis of fair districting over graphs.

[BibT_eX]

[DOI]

Auton. Agents Multi Agent Syst., 2023

Parameterized Lower Bounds for Problems in P via Fine-Grained Cross-Compositions.

[BibT_eX]

[DOI]

Klaus Heeger

Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023

High-Multiplicity Fair Allocation Using Parametric Integer Linear Programming.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland, 2023

Parameterized Algorithms for Colored Clustering.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

Fair Short Paths in Vertex-Colored Graphs.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

The structural complexity landscape of finding balance-fair shortest paths.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

Multistage Vertex Cover.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2022

The Computational Complexity of ReLU Network Training Parameterized by Data Dimensionality.

[BibT_eX]

[DOI]

Christoph Hertrich

J. Artif. Intell. Res., 2022

Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2022

Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters.

[BibT_eX]

[DOI]

Inf. Comput., 2022

Feedback edge sets in temporal graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2022

Finding Balance-Fair Short Paths in Graphs.

[BibT_eX]

[DOI]

CoRR, 2022

Envy-free allocations respecting social networks.

[BibT_eX]

[DOI]

Andrzej Kaczmarczyk

Artif. Intell., 2022

Most Classic Problems Remain NP-Hard on Relative Neighborhood Graphs and Their Relatives.

[BibT_eX]

[DOI]

Proceedings of the 18th Scandinavian Symposium and Workshops on Algorithm Theory, 2022

Delay-Robust Routes in Temporal Graphs.

[BibT_eX]

[DOI]

Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

Temporal Unit Interval Independent Sets.

[BibT_eX]

[DOI]

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

Temporal Connectivity: Coping with Foreseen and Unforeseen Delays.

[BibT_eX]

[DOI]

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

Deepening the (Parameterized) Complexity Analysis of Incremental Stable Matching Problems.

[BibT_eX]

[DOI]

Klaus Heeger

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

Applying a Cut-Based Data Reduction Rule for Weighted Cluster Editing in Polynomial Time.

[BibT_eX]

[DOI]

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

Understanding Distance Measures Among Elections.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

There and Back Again: On Applying Data Reduction Rules by Undoing Others.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

A Quantitative and Qualitative Analysis of the Robustness of (Real-World) Election Winners.

[BibT_eX]

[DOI]

Proceedings of the Equity and Access in Algorithms, Mechanisms, and Optimization, 2022

An FPT-Algorithm for Longest Common Subsequence Parameterized by the Maximum Number of Deletions.

[BibT_eX]

[DOI]

Proceedings of the 33rd Annual Symposium on Combinatorial Pattern Matching, 2022

On Improving Resource Allocations by Sharing.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

Theory of and Experiments on Minimally Invasive Stability Preservation in Changing Two-Sided Matching Markets.

[BibT_eX]

[DOI]

Klaus Heeger

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

Isolation concepts applied to temporal clique enumeration.

[BibT_eX]

[DOI]

Hendrik Molter

Malte Renken

Netw. Sci., October, 2021

Complexity of Shift Bribery in Committee Elections.

[BibT_eX]

[DOI]

ACM Trans. Comput. Theory, 2021

Multistage graph problems on a global budget.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Preface of STACS 2019 Special Issue.

[BibT_eX]

[DOI]

Christophe Paul

Theory Comput. Syst., 2021

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

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2021

Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments.

[BibT_eX]

[DOI]

Viatcheslav Korenwein

Philipp Zschoche

ACM J. Exp. Algorithmics, 2021

Bribery and Control in Stable Marriage.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2021

Temporal Graphs: Structure, Algorithms, Applications (Dagstuhl Seminar 21171).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2021

Equitable Scheduling for the Total Completion Time Objective.

[BibT_eX]

[DOI]

CoRR, 2021

Equilibria in Schelling Games: Computational Complexity and Robustness.

[BibT_eX]

[DOI]

CoRR, 2021

Parameterized Dynamic Cluster Editing.

[BibT_eX]

[DOI]

Algorithmica, 2021

Robustness among multiwinner voting rules.

[BibT_eX]

[DOI]

Artif. Intell., 2021

On coalitional manipulation for multiwinner elections: shortlisting.

[BibT_eX]

[DOI]

Andrzej Kaczmarczyk

Auton. Agents Multi Agent Syst., 2021

Binary Matrix Completion Under Diameter Constraints.

[BibT_eX]

[DOI]

Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021

Optimal Virtual Network Embeddings for Tree Topologies.

[BibT_eX]

[DOI]

Proceedings of the SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures, 2021

Two Influence Maximization Games on Graphs Made Temporal.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Putting a Compass on the Map of Elections.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Winner Robustness via Swap- and Shift-Bribery: Parameterized Counting Complexity and Experiments.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

High-Multiplicity Fair Allocation Made More Practical.

[BibT_eX]

[DOI]

Proceedings of the AAMAS '21: 20th International Conference on Autonomous Agents and Multiagent Systems, 2021

Broadening the Research Agenda for Computational Social Choice: Multiple Preference Profiles and Multiple Solutions.

[BibT_eX]

[DOI]

Proceedings of the AAMAS '21: 20th International Conference on Autonomous Agents and Multiagent Systems, 2021

2020

Temporal graph classes: A view through temporal separators.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Mixed integer programming with convex/concave constraints: Fixed-parameter tractability and applications to multicovering and voting.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Comparing temporal graphs using dynamic time warping.

[BibT_eX]

[DOI]

Soc. Netw. Anal. Min., 2020

Tight Hardness Results for Consensus Problems on Circular Strings and Time Series.

[BibT_eX]

[DOI]

Laurent Bulteau

SIAM J. Discret. Math., 2020

h-Index manipulation by undoing merges.

[BibT_eX]

[DOI]

Quant. Sci. Stud., 2020

Preface of the Special Issue on Theoretical Aspects of Computer Science (2018).

[BibT_eX]

[DOI]

Brigitte Vallée

Theory Comput. Syst., 2020

An Adaptive Version of Brandes' Algorithm for Betweenness Centrality.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2020

The complexity of finding small separators in temporal graphs.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2020

Efficient algorithms for measuring the funnel-likeness of DAGs.

[BibT_eX]

[DOI]

Marcelo Garlet Millani

Hendrik Molter

J. Comb. Optim., 2020

On the Robustness of Winners: Counting Briberies in Elections.

[BibT_eX]

[DOI]

CoRR, 2020

Complexity of Combinatorial Matrix Completion With Diameter Constraints.

[BibT_eX]

[DOI]

CoRR, 2020

Diminishable parameterized problems and strict polynomial kernelization.

[BibT_eX]

[DOI]

Comput., 2020

Efficient computation of optimal temporal walks under waiting-time constraints.

[BibT_eX]

[DOI]

Appl. Netw. Sci., 2020

The Power of Linear-Time Data Reduction for Maximum Matching.

[BibT_eX]

[DOI]

Algorithmica, 2020

Stable roommates with narcissistic, single-peaked, and single-crossing preferences.

[BibT_eX]

[DOI]

Auton. Agents Multi Agent Syst., 2020

Multidimensional Stable Roommates with Master List.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 16th International Conference, 2020

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

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory - 13th International Symposium, 2020

Multistage s-t Path: Confronting Similarity with Dissimilarity in Temporal Graphs.

[BibT_eX]

[DOI]

Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

Faster Binary Mean Computation Under Dynamic Time Warping.

[BibT_eX]

[DOI]

Nathan Schaar

Proceedings of the 31st Annual Symposium on Combinatorial Pattern Matching, 2020

Parameterized Algorithms for Matrix Completion with Radius Constraints.

[BibT_eX]

[DOI]

Proceedings of the 31st Annual Symposium on Combinatorial Pattern Matching, 2020

As Time Goes By: Reflections on Treewidth for Temporal Graphs.

[BibT_eX]

[DOI]

Proceedings of the Treewidth, Kernels, and Algorithms, 2020

Parameterized Algorithms for Finding a Collective Set of Items.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

Adapting Stable Matchings to Evolving Preferences.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

Electing Successive Committees: Complexity and Algorithms.

[BibT_eX]

[DOI]

Andrzej Kaczmarczyk

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.

[BibT_eX]

[DOI]

J. Sched., 2019

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

[BibT_eX]

[DOI]

Networks, 2019

Assessing the computational complexity of multilayer subgraph detection.

[BibT_eX]

[DOI]

Netw. Sci., 2019

Listing All Maximal k-Plexes in Temporal Graphs.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2019

The parameterized complexity of the minimum shared edges problem.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2019

Parameterized aspects of triangle enumeration.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2019

Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: Theory and experiments.

[BibT_eX]

[DOI]

Marten Picker

Eur. J. Oper. Res., 2019

Exact mean computation in dynamic time warping spaces.

[BibT_eX]

[DOI]

Data Min. Knowl. Discov., 2019

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

[BibT_eX]

[DOI]

Umberto Grandi

Stefan Napel

Kristen Brent Venable

Dagstuhl Reports, 2019

Algorithms and Complexity in Phylogenetics (Dagstuhl Seminar 19443).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2019

Multistage Problems on a Global Budget.

[BibT_eX]

[DOI]

CoRR, 2019

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

[BibT_eX]

[DOI]

CoRR, 2019

When Can Graph Hyperbolicity be Computed in Linear Time?

[BibT_eX]

[DOI]

Till Fluschnik

Algorithmica, 2019

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

[BibT_eX]

[DOI]

Marcel Koseler

Marcelo Garlet Millani

Algorithmica, 2019

An Experimental View on Committees Providing Justified Representation.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

High-Multiplicity Fair Allocation: Lenstra Empowered by N-fold Integer Programming.

[BibT_eX]

[DOI]

Proceedings of the 2019 ACM Conference on Economics and Computation, 2019

Enumerating Isolated Cliques in Temporal Networks.

[BibT_eX]

[DOI]

Hendrik Molter

Malte Renken

Proceedings of the Complex Networks and Their Applications VIII, 2019

2018

A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2018

Fractals for Kernelization Lower Bounds.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2018

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

[BibT_eX]

[DOI]

Marten Picker

CoRR, 2018

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

[BibT_eX]

[DOI]

Laurent Bulteau

CoRR, 2018

Towards Improving Brandes' Algorithm for Betweenness Centrality.

[BibT_eX]

[DOI]

CoRR, 2018

Temporal Graph Classes: A View Through Temporal Separators.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2018

Stable Marriage with Multi-Modal Preferences.

[BibT_eX]

[DOI]

Piotr Skowron

Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments.

[BibT_eX]

[DOI]

Viatcheslav Korenwein

Archontia C. Giannopoulou

Philipp Zschoche

Proceedings of the 26th Annual European Symposium on Algorithms, 2018

Listing All Maximal k-Plexes in Temporal Graphs.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Adapting the Bron-Kerbosch algorithm for enumerating maximal cliques in temporal graphs.

[BibT_eX]

[DOI]

Soc. Netw. Anal. Min., 2017

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

[BibT_eX]

[DOI]

J. Sched., 2017

The Complexity of Finding Effectors.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2017

Partitioning Perfect Graphs into Stars.

[BibT_eX]

[DOI]

J. Graph Theory, 2017

Elections with Few Voters: Candidate Control Can Be Easy.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2017

Parliamentary Voting Procedures: Agenda Control, Manipulation, and Uncertainty.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2017

Finding Points in General Position.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2017

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

[BibT_eX]

[DOI]

CoRR, 2017

The Computational Complexity of Finding Separators in Temporal Graphs.

[BibT_eX]

[DOI]

CoRR, 2017

Assessing the Computational Complexity of Multi-layer Subgraph Detection.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

Parameterized Algorithms for Power-Efficient Connected Symmetric Wireless Sensor Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Sensor Systems, 2017

Stable Roommate with Narcissistic, Single-Peaked, and Single-Crossing Preferences.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Decision Theory - 5th International Conference, 2017

Teams in Online Scheduling Polls: Game-Theoretic Aspects.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016

Weighted Tournament Solutions.

[BibT_eX]

[DOI]

Felix A. Fischer

Olivier Hudry

Proceedings of the Handbook of Computational Social Choice, 2016

Data Reduction for Domination in Graphs.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Parameterization in Computational Social Choice.

[BibT_eX]

[DOI]

Piotr Faliszewski

Encyclopedia of Algorithms, 2016

Win-win kernelization for degree sequence completion problems.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2016

Exploiting hidden structure in selecting dimensions that distinguish vectors.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2016

Large-Scale Election Campaigns: Combinatorial Shift Bribery.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2016

Prices matter for the parameterized complexity of shift bribery.

[BibT_eX]

[DOI]

Inf. Comput., 2016

Fine-Grained Algorithm Design for Matching.

[BibT_eX]

[DOI]

CoRR, 2016

A Parameterized Algorithmics Framework for Digraph Degree Sequence Completion Problems.

[BibT_eX]

[DOI]

Marcel Koseler

Marcelo Garlet Millani

CoRR, 2016

Co-Clustering under the Maximum Norm.

[BibT_eX]

[DOI]

Algorithms, 2016

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

[BibT_eX]

[DOI]

Toby Walsh

Artif. Intell., 2016

Complexity of Efficient and Envy-Free Resource Allocation: Few Agents, Resources, or Utility Levels.

[BibT_eX]

[DOI]

Bernhard Bliem

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.

[BibT_eX]

[DOI]

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

Twins in Subdivision Drawings of Hypergraphs.

[BibT_eX]

[DOI]

Iyad A. Kanj

Proceedings of the Graph Drawing and Network Visualization - 24th International Symposium, 2016

Enumerating maximal cliques in temporal graphs.

[BibT_eX]

[DOI]

Proceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2016

2015

How to Put Through Your Agenda in Collective Binary Decisions.

[BibT_eX]

[DOI]

ACM Trans. Economics and Comput., 2015

Combinatorial voter control in elections.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

The complexity of degree anonymization by vertex addition.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Polynomial-Time Data Reduction for the Subset Interconnection Design Problem.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2015

Network-Based Vertex Dissolution.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2015

Interval scheduling and colorful independent sets.

[BibT_eX]

[DOI]

J. Sched., 2015

On explaining integer vectors by few homogeneous segments.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2015

A refined complexity analysis of degree anonymization in graphs.

[BibT_eX]

[DOI]

Inf. Comput., 2015

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

[BibT_eX]

[DOI]

Iyad A. Kanj

CoRR, 2015

The Parameterized Complexity of the Rainbow Subgraph Problem.

[BibT_eX]

[DOI]

Martin Rötzschke

Algorithms, 2015

Using Patterns to Form Homogeneous Teams.

[BibT_eX]

[DOI]

Algorithmica, 2015

Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2015

A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths.

[BibT_eX]

[DOI]

Cristina Bazgan

Proceedings of the Algorithms and Complexity - 9th International Conference, 2015

Elections with Few Candidates: Prices, Weights, and Covering Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Decision Theory - 4th International Conference, 2015

2014

Partitioning Biological Networks into Highly Connected Clusters with Maximum Edge Coverage.

[BibT_eX]

[DOI]

Adrian Liebtrau

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

Constant Thresholds Can Make Target Set Selection Tractable.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2014

A Multivariate Complexity Analysis of Lobbying in Multiple Referenda.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2014

Multivariate Algorithmics for NP-Hard String Problems.

[BibT_eX]

[DOI]

Laurent Bulteau

Bull. EATCS, 2014

The effect of homogeneity on the computational complexity of combinatorial data anonymization.

[BibT_eX]

[DOI]

Data Min. Knowl. Discov., 2014

Parameterized Algorithmics for Computational Social Choice: Nine Research Challenges.

[BibT_eX]

[DOI]

CoRR, 2014

On Google Scholar H-Index Manipulation by Merging Articles.

[BibT_eX]

[DOI]

Toby Walsh

CoRR, 2014

On Making a Distinguished Vertex of Minimum Degree by Vertex Deletion.

[BibT_eX]

[DOI]

Algorithmica, 2014

Exploiting a hypergraph model for finding Golomb rulers.

[BibT_eX]

[DOI]

Acta Informatica, 2014

Theoretical and empirical evaluation of data reduction for exact Kemeny Rank Aggregation.

[BibT_eX]

[DOI]

Auton. Agents Multi Agent Syst., 2014

Combinatorial Voter Control in Elections.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

Network-Based Dissolution.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

Star Partitions of Perfect Graphs.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013

Incremental list coloring of graphs, parameterized by conservation.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

On tractable cases of Target Set Selection.

[BibT_eX]

[DOI]

Soc. Netw. Anal. Min., 2013

Efficient Algorithms for Eulerian Extension and Rural Postman.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2013

Confluence in Data Reduction: Bridging Graph Transformation and Kernelization.

[BibT_eX]

[DOI]

Comput., 2013

Pattern-Guided k-Anonymity.

[BibT_eX]

[DOI]

Algorithms, 2013

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

[BibT_eX]

[DOI]

Algorithmica, 2013

Evaluation of ILP-Based Approaches for Partitioning into Colorful Components.

[BibT_eX]

[DOI]

Sharon Bruckner

Proceedings of the Experimental Algorithms, 12th International Symposium, 2013

On Explaining Integer Vectors by Few Homogenous Segments.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

A Parameterized Complexity Analysis of Combinatorial Feature Selection Problems.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

Effective and Efficient Data Reduction for the Subset Interconnection Design Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

2012

Parameterized computational complexity of finding small-diameter subgraphs.

[BibT_eX]

[DOI]

Alexander Schäfer

Optim. Lett., 2012

A new view on Rural Postman based on Eulerian Extension and Matching.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2012

On making directed graphs transitive.

[BibT_eX]

[DOI]

Mathias Weller

J. Comput. Syst. Sci., 2012

Exact combinatorial algorithms and experiments for finding maximum k-plexes.

[BibT_eX]

[DOI]

J. Comb. Optim., 2012

On Bounded-Degree Vertex Deletion parameterized by treewidth.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

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

[BibT_eX]

[DOI]

Algorithmica, 2012

New Races in Parameterized Algorithmics.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

Partitioning into Colorful Components by Minimum Edge Deletions.

[BibT_eX]

[DOI]

Sharon Bruckner

Sven Thiel

Proceedings of the Combinatorial Pattern Matching - 23rd Annual Symposium, 2012

Studies in Computational Aspects of Voting - A Parameterized Complexity Perspective.

[BibT_eX]

[DOI]

Proceedings of the Multivariate Algorithmic Revolution and Beyond, 2012

A Multivariate Complexity Analysis of Lobbying in Multiple Referenda.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011

A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems.

[BibT_eX]

[DOI]

ACM Trans. Comput. Theory, 2011

Parameterized Algorithmics for Finding Connected Motifs in Biological Networks.

[BibT_eX]

[DOI]

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

Parameterized Complexity of Arc-Weighted Directed Steiner Problems.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2011

Aspects of a multivariate complexity analysis for Rectangle Tiling.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2011

Deconstructing intractability - A multivariate complexity analysis of interval constrained coloring.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2011

A generalization of Nemhauser and Trotterʼs local optimization theorem.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2011

Average parameterization and partial kernelization for computing medians.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2011

Graph-based data clustering with overlaps.

[BibT_eX]

[DOI]

Discret. Optim., 2011

Exploiting bounded signal flow for graph orientation based on cause-effect pairs.

[BibT_eX]

[DOI]

Algorithms Mol. Biol., 2011

From Few Components to an Eulerian Graph by Adding Arcs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2011

On Making a Distinguished Vertex Minimum Degree by Vertex Deletion.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2011: Theory and Practice of Computer Science, 2011

Pattern-Guided Data Anonymization and Clustering.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Parameterized and Exact Computation - 6th International Symposium, 2011

Unweighted Coalitional Manipulation under the Borda Rule Is NP-Hard.

[BibT_eX]

[DOI]

Gerhard J. Woeginger

Proceedings of the IJCAI 2011, 2011

The Effect of Homogeneity on the Complexity of k-Anonymity.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory - 18th International Symposium, 2011

Depth-First Search (Ariadne & Co.).

[BibT_eX]

[DOI]

Proceedings of the Algorithms Unplugged, 2011

2010

A More Relaxed Model for Graph-Based Data Clustering: s-Plex Cluster Editing.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2010

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

[BibT_eX]

[DOI]

Networks, 2010

Fixed-Parameter Algorithms for Cluster Vertex Deletion.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2010

Fixed-parameter tractability results for feedback set problems in tournaments.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2010

Approximation and fixed-parameter algorithms for consecutive ones submatrix problems.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2010

Separator-based data reduction for signed graph balancing.

[BibT_eX]

[DOI]

J. Comb. Optim., 2010

Parameterized computational complexity of Dodgson and Young elections.

[BibT_eX]

[DOI]

Inf. Comput., 2010

Efficient Algorithms for Eulerian Extension.

[BibT_eX]

[DOI]

Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

Measuring Indifference: Unit Interval Vertex Deletion.

[BibT_eX]

[DOI]

Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

Reflections on Multivariate Algorithmics and Problem Parameterization.

[BibT_eX]

[DOI]

Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010

Kernelization through Tidying.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2010: Theoretical Informatics, 2010

Partial Kernelization for Rank Aggregation: Theory and Experiments.

[BibT_eX]

[DOI]

Proceedings of the Parameterized and Exact Computation - 5th International Symposium, 2010

Extended Islands of Tractability for Parsimony Haplotyping.

[BibT_eX]

[DOI]

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

Exact Algorithms and Experiments for Hierarchical Tree Clustering.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

2009

Isolation concepts for efficiently enumerating dense subgraphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Isolation concepts for clique enumeration: Comparison and computational experiments.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Fixed-parameter algorithms for Kemeny rankings.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Algorithms and Experiments for Clique Relaxations-Finding Maximum s-Plexes.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms, 8th International Symposium, 2009

A Generalization of Nemhauser and Trotter's Local Optimization Theorem.

[BibT_eX]

[DOI]

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

A Multivariate Complexity Analysis of Determining Possible Winners Given Incomplete Votes.

[BibT_eX]

[DOI]

Susanne Hemmann

Proceedings of the IJCAI 2009, 2009

Iterative Compression for Exactly Solving NP-Hard Minimization Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithmics of Large and Complex Networks - Design, 2009

09171 Executive Summary - Adaptive, Output Sensitive, Online and Parameterized Algorithms.

[BibT_eX]

[DOI]

Jérémy Barbay

Rolf Klein

Alejandro López-Ortiz

Proceedings of the Adaptive, Output Sensitive, Online and Parameterized Algorithms, 19.04., 2009

09171 Abstracts Collection - Adaptive, Output Sensitive, Online and Parameterized Algorithms.

[BibT_eX]

[DOI]

Jérémy Barbay

Rolf Klein

Alejandro López-Ortiz

Proceedings of the Adaptive, Output Sensitive, Online and Parameterized Algorithms, 19.04., 2009

Deconstructing Intractability: A Case Study for Interval Constrained Coloring.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 20th Annual Symposium, 2009

How similarity helps to efficiently compute Kemeny rankings.

[BibT_eX]

[DOI]

Proceedings of the 8th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2009), 2009

A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2009

2008

Data Reduction for Domination in Graphs.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Tiefensuche (Ariadne und Co.).

[BibT_eX]

[DOI]

Proceedings of the Taschenbuch der Algorithmen, 2008

Data reduction and exact algorithms for clique cover.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2008

Red-blue covering problems and the consecutive ones property.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2008

Two fixed-parameter algorithms for Vertex Covering by Paths on Trees.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2008

Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2008

Closest 4-leaf power is fixed-parameter tractable.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2008

Techniques for Practical Fixed-Parameter Algorithms.

[BibT_eX]

[DOI]

Comput. J., 2008

Improved Algorithms and Complexity Results for Power Domination in Graphs.

[BibT_eX]

[DOI]

Daniel Raible

Algorithmica, 2008

Speeding up Dynamic Programming for Some NP-Hard Graph Recoloring Problems.

[BibT_eX]

[DOI]

Oriana Ponta

Proceedings of the Theory and Applications of Models of Computation, 2008

Parameterized Algorithms and Hardness Results for Some Graph Motif Problems.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 19th Annual Symposium, 2008

Enumerating Isolated Cliques in Synthetic and Financial Networks.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2008

Fixed-Parameter Algorithms for Kemeny Scores.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2008

2007

Invitation to data reduction and problem kernelization.

[BibT_eX]

[DOI]

SIGACT News, 2007

Parameterized Complexity of Vertex Cover Variants.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2007

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

[BibT_eX]

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

[BibT_eX]

Algorithms for compact letter displays: Comparison and evaluation.

[BibT_eX]

[DOI]

Comput. Stat. Data Anal., 2007

Optimal Edge Deletions for Signed Graph Balancing.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms, 6th International Workshop, 2007

Approximability and Parameterized Complexity of Consecutive Ones Submatrix Problems.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2007

Linear Problem Kernels for NP-Hard Problems on Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

Isolation Concepts for Enumerating Dense Subgraphs.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

Probe Matrix Problems: Totally Balanced Matrices.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2007

2006

Editorial.

[BibT_eX]

[DOI]

Rod Downey

Michael A. Langston

Theor. Comput. Sci., 2006

Pattern matching for arc-annotated sequences.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2006

Parameterized Intractability of Distinguishing Substring Selection.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2006

Exact algorithms and applications for Tree-like Weighted Set Cover.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2006

Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2006

A fixed-parameter tractability result for multicommodity demand flow in trees.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2006

The Computational Complexity of Avoiding Forbidden Submatrices by Row Deletions.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2006

Tree decompositions of graphs: Saving memory in dynamic programming.

[BibT_eX]

[DOI]

Discret. Optim., 2006

On The Parameterized Intractability Of Motif Search Problems.

[BibT_eX]

[DOI]

Comb., 2006

Experiments on data reduction for optimal domination in networks.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2006

Error Compensation in Leaf Power Problems.

[BibT_eX]

[DOI]

Algorithmica, 2006

Minimum Membership Set Covering and the Consecutive Ones Property.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2006

Complexity and Exact Algorithms for Multicut.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2006: Theory and Practice of Computer Science, 2006

A General Data Reduction Scheme for Domination in Graphs.

[BibT_eX]

[DOI]

Britta Dorn

Proceedings of the SOFSEM 2006: Theory and Practice of Computer Science, 2006

Data Reduction, Exact, and Heuristic Algorithms for Clique Cover.

[BibT_eX]

[DOI]

Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments, 2006

Matrix Robustness, with an Application to Power System Observability.

[BibT_eX]

Proceedings of the Algorithms and Complexity in Durham 2006, 2006

Invitation to Fixed-Parameter Algorithms

[BibT_eX]

[DOI]

Oxford University Press, ISBN: 9780198566076, 2006

2005

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

[BibT_eX]

[DOI]

Networks, 2005

Graph-Modeled Data Clustering: Exact Algorithms for Clique Generation.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2005

A refined search tree technique for Dominating Set on planar graphs.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2005

Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs.

[BibT_eX]

[DOI]

Frederic Dorn

Discret. Appl. Math., 2005

Extending the Tractability Border for Closest Leaf Powers.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005

Parameterized Complexity of Generalized Vertex Cover Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 9th International Workshop, 2005

Improved Fixed-Parameter Algorithms for Two Feedback Set Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 9th International Workshop, 2005

Bounded Degree Closest k-Tree Power Is NP-Complete.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004

Computing the similarity of two sequences with nested arc annotations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

Polynomial-time data reduction for dominating set.

[BibT_eX]

[DOI]

Celina M. H. de Figueiredo

J. ACM, 2004

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

[BibT_eX]

[DOI]

Algorithmica, 2004

Simple Max-Cut for Split-Indifference Graphs and Graphs with Few P4's.

[BibT_eX]

[DOI]

Hans L. Bodlaender

Marisa Gutierrez

Ton Kloks

Proceedings of the Experimental and Efficient Algorithms, Third International Workshop, 2004

Avoiding Forbidden Submatrices by Row Deletions.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2004: Theory and Practice of Computer Science, 2004

Ubiquitous Parameterization - Invitation to Fixed-Parameter Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

A Structural View on Parameterizing Problems: Distance from Triviality.

[BibT_eX]

[DOI]

Proceedings of the Parameterized and Exact Computation, First International Workshop, 2004

Error Compensation in Leaf Root Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

2003

An efficient fixed-parameter algorithm for 3-Hitting Set.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2003

A fixed-parameter algorithm for minimum quartet inconsistency.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2003

Graph separators: a parameterized view.

[BibT_eX]

[DOI]

Henning Fernau

J. Comput. Syst. Sci., 2003

On efficient fixed-parameter algorithms for weighted vertex cover.

[BibT_eX]

[DOI]

J. Algorithms, 2003

Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2003

Fixed-Parameter Algorithms for CLOSEST STRING and Related Problems.

[BibT_eX]

[DOI]

Algorithmica, 2003

On Exact and Approximation Algorithms for Distinguishing Substring Selection.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 14th International Symposium, 2003

Automated Generation of Search Tree Algorithms for Graph Modification Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2003

Graph-Modeled Data Clustering: Fixed-Parameter Algorithms for Clique Generation.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity, 5th Italian Conference, 2003

2002

Towards optimal locality in mesh-indexings.

[BibT_eX]

[DOI]

Klaus Reinhardt

Peter Sanders

Discret. Appl. Math., 2002

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

[BibT_eX]

[DOI]

Algorithmica, 2002

Efficient Data Reduction for DOMINATING SET: A Linear Problem Kernel for the Planar Case.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2002

On the Parameterized Intractability of CLOSEST SUBSTRINGsize and Related Problems.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2002: Theoretical Informatics, 2002

Breakpoint medians and breakpoint phylogenies: A fixed-parameter approach.

[BibT_eX]

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.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 13th Annual Symposium, 2002

2001

An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover.

[BibT_eX]

[DOI]

Henning Fernau

J. Algorithms, 2001

Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems

[BibT_eX]

[DOI]

Henning Fernau

Electron. Colloquium Comput. Complex., 2001

Faster exact algorithms for hard problems: A parameterized point of view.

[BibT_eX]

[DOI]

Discret. Math., 2001

Finding Optimal Solutions to Atomix.

[BibT_eX]

[DOI]

Proceedings of the KI 2001: Advances in Artificial Intelligence, 2001

Exact Solutions for CLOSEST STRING and Related Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

Minimum Quartet Inconsistency Is Fixed Parameter Tractable.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 12th Annual Symposium, 2001

2000

On Multidimensional Curves with Hilbert Property.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2000

Data Independence of Read, Write, and Control Structures in PRAM Computations.

[BibT_eX]

[DOI]

Klaus-Jörn Lange

J. Comput. Syst. Sci., 2000

New Upper Bounds for Maximum Satisfiability.

[BibT_eX]

[DOI]

J. Algorithms, 2000

A general method to speed up fixed-parameter-tractable algorithms.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2000

New Worst-Case Upper Bounds for MAX-2-SAT with Application to MAX-CUT

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2000

Fixed Parameter Algorithms for PLANAR DOMINATING SET and Related Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2000

Faster Exact Solutions for MAX2SAT.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity, 4th Italian Conference, 2000

1999

SIMPLE MAX-CUT for unit interval graphs and graphs with few P4s.

[BibT_eX]

[DOI]

Hans L. Bodlaender

Ton Kloks

Electron. Notes Discret. Math., 1999

Optimal Deterministic Sorting and Routing on Grids and Tori with Diagonals.

[BibT_eX]

[DOI]

Algorithmica, 1999

Upper Bounds for Vertex Cover Further Improved.

[BibT_eX]

[DOI]

Proceedings of the STACS 99, 1999

New Upper Bounds for MaxSat.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1999

1998

Unambiguous Computations and Locally Definable Acceptance Types.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1998

Some Prospects for Efficient Fixed Parameter Algorithms.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM '98: Theory and Practice of Informatics, 1998

On Multi-dimensional Hilbert Indexings.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 4th Annual International Conference, 1998

1996

Towards realistic and simple models of parallel computation.

[BibT_eX]

[DOI]

PhD thesis, 1996

Recursively Divisible Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 7th International Symposium, 1996

1995

Unambiguous Auxiliary Pushdown Automata and Semi-unbounded Fan-in Circuits

[BibT_eX]

[DOI]

Inf. Comput., May, 1995

On Optimal Orow-Pram Algorithms for Computing Recursively Defined Functions.

[BibT_eX]

[DOI]

Parallel Process. Lett., 1995

Optimal Average Case Sorting on Arrays.

[BibT_eX]

[DOI]

Proceedings of the STACS 95, 1995

PRAM's Towards Realistic Parallelism: BRAM's.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 10th International Symposium, 1995

1993

Faster sorting and routing on grids with diagonals

[BibT_eX]

[DOI]

Manfred Kunde

Forschungsberichte, TU Munich, 1993

Extended Locally Definable Acceptance Types (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the STACS 93, 1993

On the Power of Reading and Writing Simultaneously in Parallel Computation.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 4th International Symposium, 1993

Data-Independences of Parallel Random Access Machines.

[BibT_eX]

[DOI]

Klaus-Jörn Lange

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1993

1992

Optimal parallel algorithms for computing recursively defined functions

[BibT_eX]

[DOI]

Forschungsberichte, TU Munich, 1992

Unambiguous Simulations of Auxiliary Pushdown Automata and Circuits (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the LATIN '92, 1992

1990

Unambiguous simulations of auxiliary pushdown automata and circuits

[BibT_eX]

[DOI]