Lista de obras - Rolf Niedermeier - Dominio Público Uruguay

A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems

article published in 2009

A generalization of Nemhauser and Trotterʼs local optimization theorem

A refined search tree technique for Dominating Set on planar graphs

scholarly article by Jochen Alber et al published November 2005 in Journal of Computer and System Sciences

Algorithms for compact letter displays: Comparison and evaluation

scholarly article by Jens Gramm et al published October 2007 in Computational Statistics & Data Analysis

Breakpoint medians and breakpoint phylogenies: a fixed-parameter approach

artículo científico publicado en 2002

Combinatorial Voter Control in Elections

artículo científico publicado en 2014

Combinatorial voter control in elections

artículo científico publicado en 2015

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

scholarly article by Jiong Guo et al published December 2006 in Journal of Computer and System Sciences

Developing fixed-parameter algorithms to solve combinatorially explosive biological problems

artículo científico publicado en 2008

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

artículo científico publicado en 2015

Evaluation of ILP-Based Approaches for Partitioning into Colorful Components

artículo científico publicado en 2013

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

artículo científico publicado el 25 de agosto de 2011

Fixed-Parameter Algorithms for Kemeny Scores

scholarly article published in Lecture Notes in Computer Science

Fixed-parameter algorithms for Kemeny rankings

scholarly article by Nadja Betzler et al published October 2009 in Theoretical Computer Science

Graph-Based Data Clustering with Overlaps

Graph-based data clustering with overlaps

On Improving Resource Allocations by Sharing

artículo científico publicado en 2022

On Making a Distinguished Vertex of Minimum Degree by Vertex Deletion

On Multidimensional Curves with Hilbert Property

artículo científico publicado en 2000

On The Parameterized Intractability Of Motif Search Problems*

Parameterized Algorithmics for Finding Exact Solutions of NP-Hard Biological Problems

artículo científico publicado en 2017

Parameterized Algorithms and Hardness Results for Some Graph Motif Problems

Parameterized algorithmics for finding connected motifs in biological networks

artículo científico publicado en 2011

Partitioning Biological Networks into Highly Connected Clusters with Maximum Edge Coverage

artículo científico

Polynomial-time data reduction for dominating set

article published in 2004

Robustness Among Multiwinner Voting Rules

artículo científico publicado en 2017

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

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

artículo científico publicado en 2020

The Complexity of Degree Anonymization by Vertex Addition

artículo científico publicado en 2014

The Complexity of Finding Effectors

artículo científico publicado en 2016

The Complexity of Finding Effectors

artículo científico publicado en 2015

The complexity of degree anonymization by vertex addition

artículo científico publicado en 2015

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

artículo científico publicado en 2022

When Can Graph Hyperbolicity Be Computed in Linear Time?

artículo científico publicado en 2017

Lista de obras de Rolf Niedermeier

A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems

A generalization of Nemhauser and Trotterʼs local optimization theorem

A refined search tree technique for Dominating Set on planar graphs

Algorithms for compact letter displays: Comparison and evaluation

Breakpoint medians and breakpoint phylogenies: a fixed-parameter approach

Combinatorial Voter Control in Elections

Combinatorial voter control in elections

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

Developing fixed-parameter algorithms to solve combinatorially explosive biological problems

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

Evaluation of ILP-Based Approaches for Partitioning into Colorful Components

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

Fixed-Parameter Algorithms for Kemeny Scores

Fixed-parameter algorithms for Kemeny rankings

Graph-Based Data Clustering with Overlaps

Graph-based data clustering with overlaps

On Improving Resource Allocations by Sharing

On Making a Distinguished Vertex of Minimum Degree by Vertex Deletion

On Multidimensional Curves with Hilbert Property

On The Parameterized Intractability Of Motif Search Problems*

Parameterized Algorithmics for Finding Exact Solutions of NP-Hard Biological Problems

Parameterized Algorithms and Hardness Results for Some Graph Motif Problems

Parameterized algorithmics for finding connected motifs in biological networks

Partitioning Biological Networks into Highly Connected Clusters with Maximum Edge Coverage

Polynomial-time data reduction for dominating set

Robustness Among Multiwinner Voting Rules

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

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

The Complexity of Degree Anonymization by Vertex Addition

The Complexity of Finding Effectors

The Complexity of Finding Effectors

The complexity of degree anonymization by vertex addition

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

When Can Graph Hyperbolicity Be Computed in Linear Time?

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