Rolf Niedermeier | TU Berlin (original) (raw)

Uploads

Papers by Rolf Niedermeier

Research paper thumbnail of The effect of homogeneity on the complexity of k-anonymity

Research paper thumbnail of Probe matrix problems: totally balanced matrices

Research paper thumbnail of The effect of homogeneity on the computational complexity of combinatorial data anonymization

Research paper thumbnail of Parameterized algorithmics for computational social choice: nine research challenges

Research paper thumbnail of On Making a Distinguished Vertex of Minimum Degree by Vertex Deletion

Research paper thumbnail of Exact Algorithms and Experiments for Hierarchical Tree Clustering

National Conference on Artificial Intelligence, 2010

Research paper thumbnail of On Making a Distinguished Vertex Minimum Degree by Vertex Deletion

Lecture Notes in Computer Science, 2011

Research paper thumbnail of Some Prospects forEfficient Fixed Parameter Algorithms

Lecture Notes in Computer Science, 1998

... However, only elementary combinatorial considerations have been used for this result and mayb... more ... However, only elementary combinatorial considerations have been used for this result and maybe with the help of machine support one could still ... to Jin Wiedermann for inviting me to a talk on the presented topic, which together with the lecture notes served ... The MIT Press, 1990 ...

Research paper thumbnail of Extended Islands of Tractability for Parsimony Haplotyping

Lecture Notes in Computer Science, 2010

Research paper thumbnail of Parametrized complexity of vertex cover variants

Important variants of the Vertex Cover problem (among others, Connected Vertex Cover, Capacitated... more Important variants of the Vertex Cover problem (among others, Connected Vertex Cover, Capacitated Vertex Cover, and Maximum Partial Vertex Cover) have been intensively studied in terms of polynomial-time approximability. By way of contrast, their parameterized complexity,has so far been completely,open. We close this gap here by showing that, with the size of the desired vertex cover as parameter, Connected

Research paper thumbnail of Invitation to Fixed-Parameter Algorithms

Research paper thumbnail of Deconstructing Intractability: A Case Study for Interval Constrained Coloring

Lecture Notes in Computer Science, 2009

Research paper thumbnail of Efficient Algorithms for Eulerian Extension

Lecture Notes in Computer Science, 2010

Research paper thumbnail of Upper Bounds for Vertex Cover Further Improved

Lecture Notes in Computer Science, 1999

The problem instance of Vertex Cover consists of anundirected graph G = (V; E) and a positive int... more The problem instance of Vertex Cover consists of anundirected graph G = (V; E) and a positive integer k,the question is whether there exists a subset C ` V ofvertices such that each edge in E has at least one ofits endpoints in C with jCj k. We improve two recentworst case upper bounds for Vertex Cover. First,Balasubramanian et al.

Research paper thumbnail of Exact Solutions for Closest String and Related Problems

Lecture Notes in Computer Science, 2001

Closest String is one of the core problems in the field of consensus word analysis with particula... more Closest String is one of the core problems in the field of consensus word analysis with particular importance for computational biology. Given k strings of same length and a positive integer d, find a "closest string" s such that none of the given strings has Hamming distance greater than d from s. Closest String is NP-complete. We show how to

Research paper thumbnail of New Upper Bounds for MaxSat

Lecture Notes in Computer Science, 1999

Given a boolean formula F in conjunctive normal form and an integer k, is there a truth assignmen... more Given a boolean formula F in conjunctive normal form and an integer k, is there a truth assignment satisfying at least k clauses? This is the decision version of the Maximum Satisfiability (MaxSax) problem we study in this paper. We improve upper bounds on the worst case running time for MAXSAT. First, Cai and Chen showed that MAXSAT can be

Research paper thumbnail of Faster sorting and routing on grids with diagonals

Lecture Notes in Computer Science, 1994

... on naa a D a D an a a D nnaa aa DD a D aaanaan aa DD ana aa D ao DD a D aoo aa a DD aa D o aa... more ... on naa a D a D an a a D nnaa aa DD a D aaanaan aa DD ana aa D ao DD a D aoo aa a DD aa D o aa oa aaa nn DO an D aan D a D a aa DO a D a ao DD aoa oa oa D aa n D DO a D a a ODD aa D DDD a DD a ana ODD ODD aap aaa aoa ana DOD DDD DDD DDD D DO nap ...

Research paper thumbnail of Fixed Parameter Algorithms for Planar Dominating Set and Related Problems

Lecture Notes in Computer Science, 2000

Research paper thumbnail of A General Data Reduction Scheme for Domination in Graphs

Lecture Notes in Computer Science, 2006

Research paper thumbnail of Improved Tree Decomposition Based Algorithms for Domination-like Problems

Lecture Notes in Computer Science, 2002

We present an improved dynamic programming strategy for dominating set and related problems on gr... more We present an improved dynamic programming strategy for dominating set and related problems on graphs that are given together with a tree decomposition of width k. We obtain an O(4k n) algorithm for dominating set, where n is the number of nodes of the tree decomposition. This result improves the previously best known algorithm of Telle and Proskurowski running in

Research paper thumbnail of The effect of homogeneity on the complexity of k-anonymity

Research paper thumbnail of Probe matrix problems: totally balanced matrices

Research paper thumbnail of The effect of homogeneity on the computational complexity of combinatorial data anonymization

Research paper thumbnail of Parameterized algorithmics for computational social choice: nine research challenges

Research paper thumbnail of On Making a Distinguished Vertex of Minimum Degree by Vertex Deletion

Research paper thumbnail of Exact Algorithms and Experiments for Hierarchical Tree Clustering

National Conference on Artificial Intelligence, 2010

Research paper thumbnail of On Making a Distinguished Vertex Minimum Degree by Vertex Deletion

Lecture Notes in Computer Science, 2011

Research paper thumbnail of Some Prospects forEfficient Fixed Parameter Algorithms

Lecture Notes in Computer Science, 1998

... However, only elementary combinatorial considerations have been used for this result and mayb... more ... However, only elementary combinatorial considerations have been used for this result and maybe with the help of machine support one could still ... to Jin Wiedermann for inviting me to a talk on the presented topic, which together with the lecture notes served ... The MIT Press, 1990 ...

Research paper thumbnail of Extended Islands of Tractability for Parsimony Haplotyping

Lecture Notes in Computer Science, 2010

Research paper thumbnail of Parametrized complexity of vertex cover variants

Important variants of the Vertex Cover problem (among others, Connected Vertex Cover, Capacitated... more Important variants of the Vertex Cover problem (among others, Connected Vertex Cover, Capacitated Vertex Cover, and Maximum Partial Vertex Cover) have been intensively studied in terms of polynomial-time approximability. By way of contrast, their parameterized complexity,has so far been completely,open. We close this gap here by showing that, with the size of the desired vertex cover as parameter, Connected

Research paper thumbnail of Invitation to Fixed-Parameter Algorithms

Research paper thumbnail of Deconstructing Intractability: A Case Study for Interval Constrained Coloring

Lecture Notes in Computer Science, 2009

Research paper thumbnail of Efficient Algorithms for Eulerian Extension

Lecture Notes in Computer Science, 2010

Research paper thumbnail of Upper Bounds for Vertex Cover Further Improved

Lecture Notes in Computer Science, 1999

The problem instance of Vertex Cover consists of anundirected graph G = (V; E) and a positive int... more The problem instance of Vertex Cover consists of anundirected graph G = (V; E) and a positive integer k,the question is whether there exists a subset C ` V ofvertices such that each edge in E has at least one ofits endpoints in C with jCj k. We improve two recentworst case upper bounds for Vertex Cover. First,Balasubramanian et al.

Research paper thumbnail of Exact Solutions for Closest String and Related Problems

Lecture Notes in Computer Science, 2001

Closest String is one of the core problems in the field of consensus word analysis with particula... more Closest String is one of the core problems in the field of consensus word analysis with particular importance for computational biology. Given k strings of same length and a positive integer d, find a "closest string" s such that none of the given strings has Hamming distance greater than d from s. Closest String is NP-complete. We show how to

Research paper thumbnail of New Upper Bounds for MaxSat

Lecture Notes in Computer Science, 1999

Given a boolean formula F in conjunctive normal form and an integer k, is there a truth assignmen... more Given a boolean formula F in conjunctive normal form and an integer k, is there a truth assignment satisfying at least k clauses? This is the decision version of the Maximum Satisfiability (MaxSax) problem we study in this paper. We improve upper bounds on the worst case running time for MAXSAT. First, Cai and Chen showed that MAXSAT can be

Research paper thumbnail of Faster sorting and routing on grids with diagonals

Lecture Notes in Computer Science, 1994

... on naa a D a D an a a D nnaa aa DD a D aaanaan aa DD ana aa D ao DD a D aoo aa a DD aa D o aa... more ... on naa a D a D an a a D nnaa aa DD a D aaanaan aa DD ana aa D ao DD a D aoo aa a DD aa D o aa oa aaa nn DO an D aan D a D a aa DO a D a ao DD aoa oa oa D aa n D DO a D a a ODD aa D DDD a DD a ana ODD ODD aap aaa aoa ana DOD DDD DDD DDD D DO nap ...

Research paper thumbnail of Fixed Parameter Algorithms for Planar Dominating Set and Related Problems

Lecture Notes in Computer Science, 2000

Research paper thumbnail of A General Data Reduction Scheme for Domination in Graphs

Lecture Notes in Computer Science, 2006

Research paper thumbnail of Improved Tree Decomposition Based Algorithms for Domination-like Problems

Lecture Notes in Computer Science, 2002

We present an improved dynamic programming strategy for dominating set and related problems on gr... more We present an improved dynamic programming strategy for dominating set and related problems on graphs that are given together with a tree decomposition of width k. We obtain an O(4k n) algorithm for dominating set, where n is the number of nodes of the tree decomposition. This result improves the previously best known algorithm of Telle and Proskurowski running in