1 Rolf Luneng er utdannet allmennlege, men har ogsa allsidig bakgrunn i naturmedisin. Mange helseplager kan kureres ved kostomlegging og naturlig behandling.

Source URL: www.haranalys.se

Incremental List Coloring of Graphs, Parameterized by ConservationI Sepp Hartunga , Rolf Niedermeiera a Institut f¨

Source URL: fpt.akt.tu-berlin.de

• Graph coloring
• NP-complete problems
• List coloring
• Parameterized complexity
• Kernelization
• Vertex cover
• Independent set
• Edge coloring
• Complete coloring
• Graph theory
• Theoretical computer science
• Mathematics

Constant Thresholds Can Make Target Set Selection Tractable? Morgan Chopin1?? , Andr´e Nichterlein2 , Rolf Niedermeier2 , and Mathias Weller2? ? ? 1

Source URL: fpt.akt.tu-berlin.de

• Graph operations
• Path decomposition
• Clique
• Kernelization
• Vertex cover
• Parameterized complexity
• Tree decomposition
• Feedback vertex set
• Dominating set
• Graph theory
• Theoretical computer science
• NP-complete problems

DISTRIBUTION OF GRAPH-DISTANCES IN BOLTZMANN ENSEMBLES OF RNA SECONDARY STRUCTURES Rolf Backofen1−2 , Markus Fricke3 , Manja Marz3 , Jing Qin4 , and Peter F. Stadler4−8 1

Source URL: www.rna.uni-jena.de

• Yi script
• Unicode blocks
• Notation
• C0 Controls and Basic Latin

Co-Clustering Under the Maximum Norm Laurent Bulteau? , Vincent Froese?? , Sepp Hartung, and Rolf Niedermeier Institut f¨ ur Softwaretechnik und Theoretische Informatik, TU Berlin, Germany ,

Source URL: fpt.akt.tu-berlin.de

• Biclustering
• 2-satisfiability
• NP
• Matrix
• Permutation
• Consensus clustering
• Complete-linkage clustering
• Statistics
• Cluster analysis
• Mathematics

iJWie bare Kalor/ene so; tellerfor 1 vekta! Rolf Luneng er utdannetallmerinlege, men har ogsa allsidig bakgrunn

Source URL: www.haranalys.se

Evaluation of ILP-based Approaches for Partitioning into Colorful Components Sharon Bruckner1? , Falk H¨ uffner2?? , Christian Komusiewicz2 , and Rolf Niedermeier2 1

Source URL: fpt.akt.tu-berlin.de

• NP-complete problems
• Graph partition
• Clique
• Graph coloring
• Vertex
• Connected component
• Breadth-first search
• Connectivity
• Tree
• Graph theory
• Theoretical computer science
• Mathematics

The Parameterized Complexity of the Rainbow Subgraph Problem Falk Hüffner? , Christian Komusiewicz?? , Rolf Niedermeier, and Martin Rötzschke Institut für Softwaretechnik und Theoretische Informatik, TU Berlin, German

Source URL: fpt.akt.tu-berlin.de

• NP-complete problems
• Graph coloring
• Degeneracy
• Vertex cover
• Edge coloring
• Clique
• Vertex
• Graph
• Dense subgraph
• Graph theory
• Theoretical computer science
• Mathematics

A Parameterized Complexity Analysis of Combinatorial Feature Selection Problems? Vincent Froese, Ren´e van Bevern, Rolf Niedermeier, and Manuel Sorge Institut f¨ ur Softwaretechnik und Theoretische Informatik, TU Berli

Source URL: fpt.akt.tu-berlin.de

• Complexity classes
• Mathematical optimization
• Structural complexity theory
• NP-complete problems
• Parameterized complexity
• NP-complete
• P versus NP problem
• NP
• FO
• Theoretical computer science
• Computational complexity theory
• Applied mathematics

Prices Matter for the Parameterized Complexity of Shift Bribery Robert Bredereck1 , Jiehua Chen1 , Piotr Faliszewski2 , Andr´e Nichterlein1 , and Rolf Niedermeier1 1 TU Berlin, Berlin, Germany {robert.bredereck, jiehua.

Source URL: fpt.akt.tu-berlin.de

• Analysis of algorithms
• Social choice theory
• Single winner electoral systems
• Parameterized complexity
• Borda count
• Voting system
• Time complexity
• FO
• Reduction
• Theoretical computer science
• Computational complexity theory
• Applied mathematics