Rolf Niedermeier

Q: What Schools Are Affiliated With Rolf Niedermeier

Rolf Niedermeier is affiliated with the following schools: University of Tübingen, Technical University of Munich, University of Jena, Technical University of Berlin

Rolf Niedermeier's AcademicInfluence.com Rankings

Rolf Niedermeier

Computer Science

#3756

World Rank

#3948

Historical Rank

Database

#3938

World Rank

#4096

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Why Is Rolf Niedermeier Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Rolf Niedermeier was a professor of computer science, known for his research in computational complexity theory, especially in parameterized complexity, graph theory, computational social choice, and social network analysis.

(See a Problem?)

Rolf Niedermeier's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Invitation to Fixed-Parameter Algorithms (2006) (803)
Invitation to data reduction and problem kernelization (2007) (350)
Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar Graphs (2002) (276)
Polynomial-time data reduction for dominating set (2002) (238)
Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization (2006) (186)
Parameterized complexity: exponential speed-up for planar graph problems (2001) (161)
Fixed-Parameter Algorithms for CLOSEST STRING and Related Problems (2003) (156)
An efficient fixed-parameter algorithm for 3-Hitting Set (2003) (152)
Graph-Modeled Data Clustering: Exact Algorithms for Clique Generation (2005) (144)
A general method to speed up fixed-parameter-tractable algorithms (2000) (142)
Upper Bounds for Vertex Cover Further Improved (1999) (140)
Fixed-parameter tractability results for feedback set problems in tournaments (2006) (139)
Data reduction and exact algorithms for clique cover (2009) (123)
Towards optimal locality in mesh-indexings (1997) (122)
Reflections on Multivariate Algorithmics and Problem Parameterization (2010) (121)
Parameterized Complexity of Vertex Cover Variants (2007) (120)
Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems (2004) (109)
Improved Algorithms and Complexity Results for Power Domination in Graphs (2005) (108)
Techniques for Practical Fixed-Parameter Algorithms (2007) (107)
A Structural View on Parameterizing Problems: Distance from Triviality (2004) (99)
New Upper Bounds for Maximum Satisfiability (2000) (98)
Fixed-Parameter Algorithms for Cluster Vertex Deletion (2010) (97)
On Efficient Fixed Parameter Algorithms for WEIGHTED VERTEX COVER (2000) (96)
Unweighted Coalitional Manipulation under the Borda Rule Is NP-Hard (2011) (93)
Refined Search Tree Technique for DOMINATING SET on Planar Graphs (2001) (91)
Graph-based data clustering with overlaps (2009) (88)
On tractable cases of Target Set Selection (2010) (86)
Experiments on data reduction for optimal domination in networks (2006) (82)
Improved Tree Decomposition Based Algorithms for Domination-like Problems (2002) (80)
Linear Problem Kernels for NP-Hard Problems on Planar Graphs (2007) (78)
Parameterized Complexity of Generalized Vertex Cover Problems (2005) (77)
Faster exact algorithms for hard problems: A parameterized point of view (2001) (77)
Hyper. (1988) (76)
Exact Solutions for CLOSEST STRING and Related Problems (2001) (73)
Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT (2003) (72)
Fixed-parameter algorithms for Kemeny rankings (2009) (72)
Parameterized computational complexity of finding small-diameter subgraphs (2012) (71)
On Multidimensional Curves with Hilbert Property (2000) (71)
A Multivariate Complexity Analysis of Determining Possible Winners Given Incomplete Votes (2009) (71)
New Races in Parameterized Algorithmics (2012) (70)
Graph-Modeled Data Clustering: Fixed-Parameter Algorithms for Clique Generation (2003) (70)
Fixed Parameter Algorithms for PLANAR DOMINATING SET and Related Problems (2000) (68)
Parameterized computational complexity of Dodgson and Young elections (2008) (68)
Constant Thresholds Can Make Target Set Selection Tractable (2012) (63)
Prices matter for the parameterized complexity of shift bribery (2014) (59)
Interval scheduling and colorful independent sets (2012) (58)
Elections with Few Voters: Candidate Control Can Be Easy (2014) (57)
Data Reduction, Exact, and Heuristic Algorithms for Clique Cover (2006) (56)
Fixed-Parameter Algorithms for Cluster Vertex Deletion (2008) (55)
Parameterized Algorithmics for Computational Social Choice: Nine Research Challenges (2014) (55)
Isolation concepts for efficiently enumerating dense subgraphs (2009) (55)
Temporal Graph Classes: A View Through Temporal Separators (2018) (54)
Adapting the Bron–Kerbosch algorithm for enumerating maximal cliques in temporal graphs (2016) (53)
Theoretical and empirical evaluation of data reduction for exact Kemeny Rank Aggregation (2014) (53)
Parameterized Algorithmics for Finding Connected Motifs in Biological Networks (2011) (52)
Separator-based data reduction for signed graph balancing (2010) (51)
Polynomial fixed-parameter algorithms: A case study for longest path on interval graphs (2015) (50)
Fixed-Parameter Algorithms for Kemeny Scores (2008) (48)
Graph separators: a parameterized view (2001) (48)
Studies in Computational Aspects of Voting - A Parameterized Complexity Perspective (2012) (48)
Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs (2005) (48)
An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover (1999) (46)
Parameterized Algorithms and Hardness Results for Some Graph Motif Problems (2008) (45)
On Exact and Approximation Algorithms for Distinguishing Substring Selection (2003) (45)
On The Parameterized Intractability Of Motif Search Problems* (2002) (44)
Average parameterization and partial kernelization for computing medians (2010) (44)
The Complexity of Finding Small Separators in Temporal Graphs (2017) (44)
Weighted Tournament Solutions (2016) (43)
A More Relaxed Model for Graph-Based Data Clustering: s-Plex Cluster Editing (2010) (43)
Robustness Among Multiwinner Voting Rules (2017) (42)
Pattern matching for arc-annotated sequences (2002) (42)
Exact combinatorial algorithms and experiments for finding maximum k-plexes (2012) (42)
Complexity of Shift Bribery in Committee Elections (2016) (41)
Large-Scale Election Campaigns: Combinatorial Shift Bribery (2015) (41)
Efficient Data Reduction for DOMINATING SET: A Linear Problem Kernel for the Planar Case (2002) (41)
On Bounded-Degree Vertex Deletion parameterized by treewidth (2012) (40)
Multivariate Algorithmics for NP-Hard String Problems (2014) (39)
Error Compensation in Leaf Power Problems (2006) (39)
Optimal Edge Deletions for Signed Graph Balancing (2007) (38)
A Multivariate Complexity Analysis of Lobbying in Multiple Referenda (2012) (38)
On the Parameterized Intractability of CLOSEST SUBSTRINGsize and Related Problems (2002) (38)
A fixed-parameter algorithm for minimum quartet inconsistency (2003) (37)
Exact algorithms and applications for Tree-like Weighted Set Cover (2006) (36)
Improved Fixed-Parameter Algorithms for Two Feedback Set Problems (2005) (36)
Ubiquitous Parameterization - Invitation to Fixed-Parameter Algorithms (2004) (36)
Finding Points in General Position (2015) (36)
Iterative Compression for Exactly Solving NP-Hard Minimization Problems (2009) (35)
Efficient Algorithms for Eulerian Extension and Rural Postman (2013) (35)
Fixed‐parameter tractability and data reduction for multicut in trees (2005) (35)
Envy-Free Allocations Respecting Social Networks (2018) (35)
Elections with Few Candidates: Prices, Weights, and Covering Problems (2015) (34)
Approximation and Tidying—A Problem Kernel for s-Plex Cluster Vertex Deletion (2009) (34)
A new view on Rural Postman based on Eulerian Extension and Matching (2011) (34)
Approximation and fixed-parameter algorithms for consecutive ones submatrix problems (2010) (33)
Parameterized Complexity of Arc-Weighted Directed Steiner Problems (2009) (33)
Enumerating maximal cliques in temporal graphs (2016) (33)
On the Manhattan-Distance Between Points on Space-Filling Mesh-Indexings (1996) (33)
A refined complexity analysis of degree anonymization in graphs (2013) (32)
Computing the similarity of two sequences with nested arc annotations (2004) (32)
A generalization of Nemhauser and Trotterʼs local optimization theorem (2009) (32)
Exact Algorithms for Generalizations of Vertex Cover (2005) (32)
Combinatorial voter control in elections (2014) (31)
Error Compensation in Leaf Root Problems (2004) (31)
Efficient computation of optimal temporal walks under waiting-time constraints (2019) (31)
New Worst-Case Upper Bounds for MAX-2-SAT with Application to MAX-CUT (2000) (31)
Stable Marriage with Multi-Modal Preferences (2018) (31)
Algorithms for compact letter displays: Comparison and evaluation (2007) (31)
On Multi-dimensional Hilbert Indexings (1998) (31)
Incremental list coloring of graphs, parameterized by conservation (2010) (30)
Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs (2008) (30)
The Complexity of Degree Anonymization by Vertex Addition (2014) (28)
The Power of Linear-Time Data Reduction for Maximum Matching (2017) (28)
Extending the Tractability Border for Closest Leaf Powers (2005) (28)
Tree decompositions of graphs: Saving memory in dynamic programming (2004) (28)
From Few Components to an Eulerian Graph by Adding Arcs (2011) (28)
On efficient fixed-parameter algorithms for weighted vertex cover (2003) (27)
Faster Exact Solutions for MAX2SAT (2000) (27)
New Upper Bounds for MaxSat (1999) (27)
Complexity of Efficient and Envy-Free Resource Allocation: Few Agents, Resources, or Utility Levels (2016) (27)
Finding Optimal Solutions to Atomix (2001) (27)
A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack (2015) (26)
Some Prospects for Efficient Fixed Parameter Algorithms (1998) (26)
Unambiguous Auxiliary Pushdown Automata and Semi-unbounded Fan-in Circuits (1995) (26)
Closest Strings, Primer Design, and Motif Search (2010) (25)
The Complexity of Arc Routing Problems (2013) (25)
Towards Optimally Solving the LONGEST COMMON SUBSEQUENCE Problem for Sequences with Nested Arc Annotations in Linear Time (2002) (25)
Speeding up Dynamic Programming for Some NP-Hard Graph Recoloring Problems (2008) (25)
Fixed‐parameter tractability results for full‐degree spanning tree and its dual (2006) (25)
Listing All Maximal k-Plexes in Temporal Graphs (2018) (25)
Exact mean computation in dynamic time warping spaces (2017) (25)
Algorithms and Experiments for Clique Relaxations-Finding Maximum s-Plexes (2009) (25)
Complexity and Exact Algorithms for Multicut (2006) (25)
Breakpoint medians and breakpoint phylogenies: A fixed-parameter approach (2002) (24)
Data Reduction for Maximum Matching on Real-World Graphs (2018) (24)
Computing Maximum Matchings in Temporal Graphs (2019) (24)
Measuring Indifference: Unit Interval Vertex Deletion (2010) (23)
Algorithmic Aspects of Temporal Betweenness (2020) (23)
Partitioning Biological Networks into Highly Connected Clusters with Maximum Edge Coverage (2014) (22)
INTRODUCTION TO FIXED-PARAMETER ALGORITHMS (2006) (22)
Partial Kernelization for Rank Aggregation: Theory and Experiments (2010) (21)
A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing (2009) (21)
How similarity helps to efficiently compute Kemeny rankings (2009) (21)
H-index manipulation by merging articles: Models, theory, and experiments (2015) (20)
Isolation concepts for clique enumeration: Comparison and computational experiments (2009) (20)
A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths (2015) (20)
Network-Based Vertex Dissolution (2014) (20)
An Experimental View on Committees Providing Justified Representation (2019) (20)
Mixed Integer Programming with Convex/Concave Constraints: Fixed-Parameter Tractability and Applications to Multicovering and Voting (2017) (20)
Deconstructing intractability - A multivariate complexity analysis of interval constrained coloring (2011) (20)
Parameterized Aspects of Triangle Enumeration (2017) (19)
Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs (2017) (19)
A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems (2009) (19)
Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs (2011) (18)
Exploiting bounded signal flow for graph orientation based on cause-effect pairs (2011) (18)
Win-win kernelization for degree sequence completion problems (2014) (18)
Winner Robustness via Swap- and Shift-Bribery: Parameterized Counting Complexity and Experiments (2021) (18)
The Parameterized Complexity of Local Search for TSP, More Refined (2011) (18)
Minimum Quartet Inconsistency Is Fixed Parameter Tractable (2001) (17)
An Adaptive Version of Brandes' Algorithm for Betweenness Centrality (2018) (17)
Stable roommates with narcissistic, single-peaked, and single-crossing preferences (2019) (17)
Multistage Vertex Cover (2019) (17)
A General Data Reduction Scheme for Domination in Graphs (2006) (17)
Unambiguous Computations and Locally Definable Acceptance Types (1998) (17)
Combining Clickstream Analyses and Graph-Modeled Data Clustering for Identifying Common Response Processes (2021) (16)
TREE DECOMPOSITIONS OF GRAPHS (2006) (16)
The effect of homogeneity on the computational complexity of combinatorial data anonymization (2012) (16)
High-Multiplicity Fair Allocation: Lenstra Empowered by N-fold Integer Programming (2019) (16)
The Parameterized Complexity of the Minimum Shared Edges Problem (2016) (15)
On making directed graphs transitive (2009) (15)
Polynomial-Time Data Reduction for the Subset Interconnection Design Problem (2015) (15)
Parameterized Intractability of Distinguishing Substring Selection (2006) (15)
Faster Sorting and Routing on Grids with Diagonals (1994) (15)
When Can Graph Hyperbolicity be Computed in Linear Time? (2017) (15)
Putting a Compass on the Map of Elections (2021) (15)
Broadening the Research Agenda for Computational Social Choice: Multiple Preference Profiles and Multiple Solutions (2021) (14)
The Computational Complexity of ReLU Network Training Parameterized by Data Dimensionality (2021) (14)
Data-Independences of Parallel Random Access Machines (1993) (14)
Bribery and Control in Stable Marriage (2020) (13)
Partitioning into Colorful Components by Minimum Edge Deletions (2012) (13)
SIMPLE MAX-CUT for unit interval graphs and graphs with few P4s (1999) (13)
Red-blue covering problems and the consecutive ones property (2008) (13)
Parliamentary Voting Procedures: Agenda Control, Manipulation, and Uncertainty (2015) (13)
A more fine‐grained complexity analysis of finding the most vital edges for undirected shortest paths (2018) (13)
Deconstructing Intractability: A Case Study for Interval Constrained Coloring (2009) (13)
Multistage s–t Path: Confronting Similarity with Dissimilarity (2020) (13)
Exploiting hidden structure in selecting dimensions that distinguish vectors (2015) (13)
Approximability and Parameterized Complexity of Consecutive Ones Submatrix Problems (2007) (13)
Evaluation of ILP-Based Approaches for Partitioning into Colorful Components (2013) (13)
Assessing the computational complexity of multilayer subgraph detection (2016) (13)
Partitioning Perfect Graphs into Stars (2014) (12)
Multidimensional Stable Roommates with Master List (2020) (12)
On coalitional manipulation for multiwinner elections: shortlisting (2017) (12)
Efficient Algorithms for Eulerian Extension (2010) (12)
Adapting Stable Matchings to Evolving Preferences (2019) (12)
Simple Max-Cut for Split-Indifference Graphs and Graphs with Few P4's (2004) (12)
Fractals for Kernelization Lower Bounds (2015) (12)
Star Partitions of Perfect Graphs (2014) (11)
Unambiguous Simulations of Auxiliary Pushdown Automata and Circuits (Extended Abstract) (1992) (11)
Diminishable Parameterized Problems and Strict Polynomial Kernelization (2016) (11)
Chapter 2: The Complexity of Arc Routing Problems (2013) (11)
Interference-free walks in time: temporally disjoint paths (2021) (11)
Closest 4-leaf power is fixed-parameter tractable (2008) (11)
Minimum Membership Set Covering and the Consecutive Ones Property (2006) (11)
Isolation Concepts for Enumerating Dense Subgraphs (2007) (11)
Fixed-Parameter Algo Algorithms for Kemeny Scores (2008) (11)
Enumerating Isolated Cliques in Synthetic and Financial Networks (2008) (11)
Optimal Average Case Sorting on Arrays (1995) (10)
Parameterization in Computational Social Choice (2016) (10)
On Making a Distinguished Vertex of Minimum Degree by Vertex Deletion (2014) (10)
Parameterized Dynamic Cluster Editing (2018) (10)
Parameterized Algorithms for Finding a Collective Set of Items (2020) (10)
Pattern-Guided k-Anonymity (2013) (10)
The Search for Consecutive Ones Sub- matrices: Faster and More General (2007) (10)
Feedback Edge Sets in Temporal Graphs (2020) (10)
Efficient algorithms for measuring the funnel-likeness of DAGs (2018) (10)
Fractals for Kernelization Lower Bounds, With an Application to Length-Bounded Cut Problems (2015) (10)
Fixed-parameter tractability and data reduction for multicut in trees (2005) (10)
Fine-Grained Algorithm Design for Matching (2016) (9)
Automated Generation of Search Tree Algorithms for Graph Modification Problems (2003) (9)
Exact Algorithms and Experiments for Hierarchical Tree Clustering (2010) (9)
The Effect of Homogeneity on the Complexity of k-Anonymity (2011) (9)
Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality (2021) (9)
Inductive $$k$$k-independent graphs and c-colorable subgraphs in scheduling: a review (2017) (9)
How to Put Through Your Agenda in Collective Binary Decisions (2013) (9)
Multistage Problems on a Global Budget (2019) (8)
A Parameterized Complexity Analysis of Combinatorial Feature Selection Problems (2013) (8)
Tight Hardness Results for Consensus Problems on Circular Strings and Time Series (2018) (8)
The Power of Data Reduction for Matching (2016) (8)
Developing fixed-parameter algorithms to solve combinatorially explosive biological problems. (2008) (8)
Hardness of Consensus Problems for Circular Strings and Time Series Averaging (2018) (8)
Parameterized Algorithms for Matrix Completion With Radius Constraints (2020) (8)
Using Patterns to Form Homogeneous Teams (2015) (8)
Parameterized Algorithms for Power-Efficient Connected Symmetric Wireless Sensor Networks (2017) (7)
Exploiting a hypergraph model for finding Golomb rulers (2012) (7)
Delay-Robust Routes in Temporal Graphs (2022) (7)
Parameterized Complexity of Stable Roommates with Ties and Incomplete Lists Through the Lens of Graph Parameters (2019) (7)
Twins in Subdivision Drawings of Hypergraphs (2015) (7)
Faster Binary Mean Computation Under Dynamic Time Warping (2020) (6)
Probe Matrix Problems: Totally Balanced Matrices (2007) (6)
Bounded Degree Closest k-Tree Power Is NP-Complete (2005) (6)
Co-Clustering Under the Maximum Norm (2015) (6)
Electing Successive Committees: Complexity and Algorithms (2020) (6)
Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: Theory and experiments (2018) (6)
Extended Islands of Tractability for Parsimony Haplotyping (2010) (6)
Steiner Tree Problems in the Analysis of Biological Networks (2006) (6)
Temporal Connectivity: Coping with Foreseen and Unforeseen Delays (2022) (6)
Enumerating Isolated Cliques in Temporal Networks (2019) (6)
Extended Locally Definable Acceptance Types (Extended Abstract) (1993) (6)
Kernelization through Tidying (2010) (6)
Pattern-Guided Data Anonymization and Clustering (2011) (5)
VERTEX COVER—AN ILLUSTRATIVE EXAMPLE (2006) (5)
Effective and Efficient Data Reduction for the Subset Interconnection Design Problem (2013) (5)
As Time Goes By: Reflections on Treewidth for Temporal Graphs (2020) (5)
PRAM's Towards Realistic Parallelism: BRAM's (1995) (5)
On Explaining Integer Vectors by Few Homogenous Segments (2013) (5)
Polynomial-Time Preprocessing for Weighted Problems Beyond Additive Goal Functions (2019) (5)
Modification-Fair Cluster Editing (2021) (5)
The Computational Complexity of Finding Separators in Temporal Graphs (2017) (5)
Confluence in Data Reduction: Bridging Graph Transformation and Kernelization (2012) (5)
On the Robustness of Winners: Counting Briberies in Elections (2020) (5)
Experiments on Optimally Solving NP-complete Problems on Planar Graphs (2007) (4)
Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics (2015) (4)
A fixed-parameter tractability result for multicommodity demand flow in trees (2006) (4)
Efficient computation of optimal temporal walks under waiting-time constraints (2020) (4)
Towards Improving Brandes' Algorithm for Betweenness Centrality (2018) (4)
Avoiding Forbidden Submatrices by Row Deletions (2004) (4)
Fixed-Parameter Algorithms for Graph-Modeled Data Clustering (2007) (4)
Network-Based Dissolution (2014) (4)
Equilibria in Schelling Games: Computational Complexity and Robustness (2021) (4)
Comparing temporal graphs using dynamic time warping (2018) (4)
The Complexity of Gerrymandering Over Graphs: Paths and Trees (2021) (4)
Theory of and Experiments on Minimally Invasive Stability Preservation in Changing Two-Sided Matching Markets (2021) (4)
On Finding Separators in Temporal Split and Permutation Graphs (2021) (4)
A Refined Complexity Analysis of Fair Districting over Graphs (2021) (3)
On Google Scholar H-Index Manipulation by Merging Articles (2014) (3)
Finding Balance-Fair Short Paths in Graphs (2022) (3)
Equitable scheduling on a single machine (2020) (3)
2 00 2 Parameterized Intractability of Motif Search Problems ∗ (2002) (3)
Understanding Distance Measures Among Elections (2022) (3)
Matrix Robustness, with an Application to Power System Observability (2006) (3)
Partitioning Biological Networks into Highly Connected Clusters with Maximum Edge Coverage (2013) (3)
(Wireless) Scheduling, Graph Classes, and c-Colorable Subgraphs (2017) (3)
On explaining integer vectors by few homogeneous segments (2015) (3)
On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering (2020) (3)
A Parameterized Algorithmics Framework for Degree Sequence Completion Problems in Directed Graphs (2016) (3)
Towards realistic and simple models of parallel computation (1996) (3)
Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments (2017) (3)
Binary Matrix Completion Under Diameter Constraints (2021) (3)
Isolation concepts applied to temporal clique enumeration (2020) (3)
Line-Up Elections: Parallel Voting with Shared Candidate Pool (2020) (3)
Kernelization Through Tidying A Case Study Based on s-Plex Cluster Vertex Deletion (2009) (3)
The Complexity of Finding Effectors (2014) (3)
Polynomial-time data reduction for weighted problems beyond additive goal functions (2019) (3)
On Optimal Orow-Pram Algorithms for Computing Recursively Defined Functions (1995) (3)
Two Influence Maximization Games on Graphs Made Temporal (2021) (3)
On Efficiently Finding Small Separators in Temporal Graphs (2017) (3)
High-Multiplicity Fair Allocation Made More Practical (2021) (3)
Optimal Deterministic Sorting and Routing on Grids and Tori with Diagonals (1999) (3)
Studies in computational aspects of voting: open problems of downey and fellows (2012) (3)
DATA REDUCTION AND PROBLEM KERNELS (2006) (3)
h-Index manipulation by undoing merges* (2016) (3)
Algorithms and Complexity in Phylogenetics (Dagstuhl Seminar 19443) (2019) (2)
On Making a Distinguished Vertex of Minimum Degree by Vertex Deletion (2011) (2)
Teams in Online Scheduling Polls: Game-Theoretic Aspects (2016) (2)
Efficient algorithms for measuring the funnel-likeness of DAGs (2019) (2)
PARAMETERIZED COMPLEXITY THEORY—A PRIMER (2006) (2)
Aspects of a multivariate complexity analysis for Rectangle Tiling (2011) (2)
Recursively Divisible Problems (1996) (2)
Parameterized Algorithmics for Finding Exact Solutions of NP-Hard Biological Problems. (2017) (2)
High-Multiplicity Fair Allocation Using Parametric Integer Linear Programming (2020) (2)
The Computational Complexity of Avoiding Forbidden Submatrices by Row Deletions (2006) (2)
There and Back Again: On Applying Data Reduction Rules by Undoing Others (2022) (2)
Equitable Scheduling for the Total Completion Time Objective (2021) (2)
Well-Formed Separator Sequences, with an Application to Hypergraph Drawing (2015) (2)
Equilibria in Schelling Games: Computational Hardness and Robustness (2021) (2)
Approximating Sparse Quadratic Programs (2020) (2)
Approximation and Tidying—A Problem Kernel for s-Plex Cluster Vertex Deletion (2011) (2)
Two fixed-parameter algorithms for Vertex Covering by Paths on Trees (2008) (2)
Towards Optimal Lo ality in Mesh-Indexings1 (1997) (2)
Complexity of Combinatorial Matrix Completion With Diameter Constraints (2020) (2)
A Parameterized Algorithmics Framework for Digraph Degree Sequence Completion Problems (2016) (2)
Proceedings of the 3rd international conference on Parameterized and exact computation (2008) (1)
Comparing temporal graphs using dynamic time warping (2020) (1)
Data Independence of Read, Write, and Control Structures in PRAM Computations (2000) (1)
Faster algorithms for domination of planar graphs (2000) (1)
Parameterized Dynamic Cluster Editing (2020) (1)
Deepening the (Parameterized) Complexity Analysis of Incremental Stable Matching Problems (2022) (1)
Exploiting a hypergraph model for finding Golomb rulers (2014) (1)
The structural complexity landscape of finding balance-fair shortest paths (2022) (1)
On Improving Resource Allocations by Sharing (2021) (1)
Evaluating an Algorithm for Parameterized Minimum Quartet Inconsistency (2007) (1)
Temporal Unit Interval Independent Sets (2022) (1)
On the Power of Reading and Writing Simultaneously in Parallel Computation (1993) (1)
Optimal Sparsification for Some Binary CSPs Using Low- Degree Polynomials (2016) (1)
The Complexity of Routing with Collision Avoidance (2016) (1)
Complexity Analysis of Degree Anonymization on Graphs (2013) (1)
A Multivariate Complexity Analysis of the Material Consumption Scheduling Problem (2021) (1)
Towards Optimal Locality in Mesh-Indexings1 (1997) (1)
A ug 2 01 7 Diminishable Parameterized Problems and Strict Polynomial Kernelization (2017) (1)
Adapting the Bron–Kerbosch algorithm for enumerating maximal cliques in temporal graphs (2017) (1)
Application-Oriented Computational Social Choice (Dagstuhl Seminar 19381) (2019) (1)
THE ART OF PROBLEM PARAMETERIZATION (2006) (1)
The Parameterized Complexity of the Rainbow Subgraph Problem (2014) (1)
C C ] 1 O ct 2 02 0 Multidimensional Stable Roommates with Master List (2020) (1)
An FPT-Algorithm for Longest Common Subsequence Parameterized by the Maximum Number of Deletions (2022) (0)
Unambiguous Computations and Locally Deenable Acceptance Types: Expanded Version (1998) (0)
Parameterized computational complexity of finding small-diameter subgraphs (2011) (0)
Book Review (2002) (0)
136 19443 – Algorithms and Complexity in Phylogenetics 2 Table of Contents (2020) (0)
Depth-First Search (Ariadne & Co.) (2011) (0)
PRELIMINARIES AND AGREEMENTS (2006) (0)
Íôôö Óùòò× Óö Îöøøü Óúö Ùöøøøö Áñôöóú (2007) (0)
Re ned Sear h Tree Te hniquefor Dominating Set on Planar Graphs ? (2007) (0)
Parameterized Algorithms for Colored Clustering (2023) (0)
Parameterized Algorithms for Power-Efficiently Connecting Sensor Networks: Theory and Experiments (2017) (0)
Exact mean computation in dynamic time warping spaces (2018) (0)
Temporal Graphs: Structure, Algorithms, Applications (Dagstuhl Seminar 21171) (2021) (0)
News Complexity Theory Column 54 (2007) (0)
09171 Executive Summary - Adaptive, Output Sensitive, Online and Parameterized Algorithms (2009) (0)
Diplomarbeit Graph Modification Problems and Automated Search Tree Generation Falk Hüffner (2003) (0)
FURTHER ADVANCED TECHNIQUES (2006) (0)
Proceedings of the 28th Canadian Conference on Computational Geometry, CCCG 2016, August 3-5, 2016, Simon Fraser University, Vancouver, British Columbia, Canada (2016) (0)
Theoretical and empirical evaluation of data reduction for exact Kemeny Rank Aggregation (2013) (0)
The complexity of binary matrix completion under diameter constraints (2020) (0)
Most Classic Problems Remain NP-hard on Relative Neighborhood Graphs and their Relatives (2021) (0)
A Quantitative and Qualitative Analysis of the Robustness of (Real-World) Election Winners (2022) (0)
A LINEAR-TIME FOR MAXIMUM-CARDINALITY MATCHING ON COCOMPARABILITY GRAPHS (2019) (0)
Parameterized and Exact Computation, Third International Workshop, IWPEC 2008, Victoria, Canada, May 14-16, 2008. Proceedings (2008) (0)
35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France (2018) (0)
How to Put Through Change in Collective Binary Decisions (2013) (0)
The Complexity of Finding Effectors (2016) (0)
PARAMETERIZED COMPLEXITY THEORY (2006) (0)
Fair Short Paths in Vertex-Colored Graphs (2022) (0)
2 Poly-Time Preprocessing for Weighted Problems Beyond Additive Goal Functions 1 Introduction (2019) (0)
The effect of homogeneity on the computational complexity of combinatorial data anonymization (2012) (0)
On the Complexity of the Highly Connected Deletion Problem (2013) (0)
Extended Locally Definable Acceptance Types ∗ ( Extend Abstract , Draft Version ) (2008) (0)
Fixed parameter algorithms for planar dominating set (2000) (0)
Data Reduction for Domination in Graphs ( 2004 ; Alber , Fellows , Niedermeier ) (2007) (0)
0 Upper Bounds for Vertex Cover Further Improved ∗ (2007) (0)
On tractable cases of Target Set Selection (2012) (0)
Preface of the Special Issue on Theoretical Aspects of Computer Science (2018) (2020) (0)
Feedback Sets in Temporal Graphs (2019) (0)
DEPTH-BOUNDED SEARCH TREES (2006) (0)
On coalitional manipulation for multiwinner elections: shortlisting (2021) (0)
Optimal Virtual Network Embeddings for Tree Topologies (2021) (0)
36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany (2019) (0)
Exact Algorithms for Finding Well-Connected 2-Clubs in Real-World Graphs: Theory and Experiments (2018) (0)
The Parameterized Complexity of Local Search for TSP, More Refined (2012) (0)
Graph Separators : A Parameterized ViewJo hen (2001) (0)
Temporal Interval Cliques and Independent Sets (2021) (0)
C C ] 2 2 D ec 2 01 7 Fractals for Kernelization Lower Bounds ∗ (2018) (0)
A Parameterized Algorithmics Framework for Degree Sequence Completion Problems in Directed Graphs (2018) (0)
SELECTED CASE STUDIES (2006) (0)
Adaptive , Output Sensitive , Online and Parameterized Algorithms 3 Alternative Measures for Computaqtional Complexity with applications to Machine Learning (2009) (0)
On the Parameterized Intra tabilityof Closest Substring and Related (2002) (0)
Separating an r-outerplanar graph into gluable pieces (2015) (0)
A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack (2016) (0)
CONNECTIONS TO APPROXIMATION ALGORITHMS (2006) (0)
09171 Abstracts Collection - Adaptive, Output Sensitive, Online and Parameterized Algorithms (2009) (0)
Data Reduction for Domination in Graphs (2008) (0)
Efficient Data Reduction forDominating Set: A Linear Problem Kernel for the Planar Case (Extended Abstract) (2002) (0)
Parameterized Lower Bounds for Problems in P via Fine-Grained Cross-Compositions (2023) (0)
Temporal Graphs: Structure, Algorithms, Applications (2021) (0)
The role of twins in computing planar supports of hypergraphs. (2015) (0)
Using Patterns to Form Homogeneous Teams (2013) (0)
Preface of the Special Issue on Theoretical Aspects of Computer Science (2018) (2020) (0)
Front Matter, Foreword, Conference Organization, External Reviewers, Table of Contents (2016) (0)
Parameterized Complexity (Dagstuhl Seminar 01311) (2021) (0)
When Can Graph Hyperbolicity be Computed in Linear Time? (2018) (0)
LIPIcs, Volume 58, MFCS'16, Complete Volume (2016) (0)
Simple Max-Cut for Split-Indi eren e Graphsand Graphs with Few P 4 ' sHans (2007) (0)
Modiﬁcation-Fair Cluster Editing (2022) (0)
Applying a Cut-Based Data Reduction Rule for Weighted Cluster Editing in Polynomial Time (2022) (0)
Interval scheduling and colorful independent sets (2014) (0)
Exact combinatorial algorithms and experiments for finding maximum k-plexes (2011) (0)
Preface of STACS 2019 Special Issue (2021) (0)
Closest Strings , Primer Design , and Motif Search 1 (2002) (0)

This paper list is powered by the following services:

Other Resources About Rolf Niedermeier

What Schools Are Affiliated With Rolf Niedermeier?

Rolf Niedermeier is affiliated with the following schools: