direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

PhD Theses

Jochen Alber.
Exact Algorithms for NP-hard Problems on Networks: Design, Analysis, and Implementation.
Universität Tübingen, January, 2003.
Bibtex entry Link to PDF
Nadja Betzler.
A Multivariate Complexity Analysis of Voting Problems.
Friedrich-Schiller-Universität Jena, November, 2010. Published by Verlag Dr. Hut.
Bibtex entry Link to PDF
René van Bevern.
Fixed-Parameter Linear-Time Algorithms for NP-hard Graph and Hypergraph Problems Arising in Industrial Applications.
TU Berlin, June, 2014. Published by Universitätsverlag der TU Berlin.
Bibtex entry Link to PDF
Robert Bredereck.
Multivariate complexity analysis of team management problems.
TU Berlin, October, 2014. Published by Universitätsverlag der TU Berlin.
Bibtex entry Link to PDF
Jiehua Chen.
Exploiting Structure in Computationally~Hard Voting~Problems.
TU Berlin, December, 2015. Published by Universitätsverlag der TU Berlin.
Bibtex entry Link to PDF
Michael Dom.
Recognition, Generation, and Application of Binary Matrices with the Consecutive-Ones Property.
Friedrich-Schiller-Universität Jena, December, 2008. Published by Cuvillier, 2009.
Bibtex entry Link to PDF
Jens Gramm.
Fixed-Parameter Algorithms for the Consensus Analysis of Genomic Data.
Universität Tübingen, July, 2003.
Bibtex entry Link to PDF
Jiong Guo.
Algorithm Design Techniques for Parameterized Graph Modification Problems.
Friedrich-Schiller-Universität Jena, February, 2006.
Bibtex entry Link to PDF
Sepp Hartung.
Exploring Parameter Spaces in Coping with Computational Intractability.
TU Berlin, Januar, 2014.
Bibtex entry Link to PDF
Falk Hüffner.
Algorithms and Experiments for Parameterized Approaches to Hard Graph Problems.
Friedrich-Schiller-Universität Jena, December, 2007.
Bibtex entry Link to PDF
Christian Komusiewicz.
Parameterized Algorithmics for Network Analysis: Clustering \& Querying.
Technische Universität Berlin, September, 2011.
Bibtex entry Link to PDF
Hannes Moser.
Finding Optimal Solutions for Covering and Matching Problems.
Friedrich-Schiller-Universität Jena, November, 2009. Published by Cuvillier, 2010.
Bibtex entry Link to PDF
André Nichterlein.
Degree-Constrained Editing of Small-Degree Graphs.
TU Berlin, December, 2014. Published by Universitätsverlag der TU Berlin.
Bibtex entry Link to PDF
Rolf Niedermeier.
Towards realistic and simple models of parallel computation.
Universität Tübingen, July, 1996.
Bibtex entry Link to PDF
Johannes Uhlmann.
Multivariate Algorithmics in Biological Data Analysis.
Technische Universität Berlin, June, 2011.
Bibtex entry Link to PDF
Mathias Weller.
Aspects of Preprocessing Applied to Combinatorial Graph Problems.
TU Berlin, August, 2013. Published by Universitätsverlag der TU Berlin.
Bibtex entry Link to PDF
Sebastian Wernicke.
Combinatorial algorithms to cope with the complexity of biological networks.
Friedrich-Schiller-Universität Jena, December, 2006.
Bibtex entry Link to PDF

Master Theses

Matthias Bentert.
Parametrised Algorithms for Finding Triangles in Graphs.
TU Berlin, December, 2016. Master thesis
Bibtex entry Link to PDF
Till Fluschnik.
The Parameterized Complexity of Finding Paths with Shared Edges.
TU Berlin, March, 2015. Master thesis
Bibtex entry Link to PDF
Vincent Froese.
Combinatorial Feature Selection Parameterized Algorithms and Complexity.
TU Berlin, September, 2012. Master thesis
Bibtex entry Link to PDF
Anne-Sophie Himmel.
Algorithmic Investigations into Temporal Paths.
TU Berlin, April, 2018. Master thesis
Bibtex entry Link to PDF
Clemens Hoffmann.
Algorithms and Complexity for Centrality Improvement in Networks.
TU Berlin, April, 2017. Master thesis
Bibtex entry Link to PDF
Leon Kellerhals.
Parameterized Algorithms for Network Flows.
TU Berlin, June, 2018. Master thesis
Bibtex entry Link to PDF
Viatcheslav Korenwein.
The Practical Power of Data Reduction for Maximum-Cardinality Matching.
TU Berlin, Januar, 2018. Master thesis
Bibtex entry Link to PDF
Marcelo Garlet Millani.
Funnels - Algorithmic Complexity of Problems on Special Directed Acyclic Graphs.
TU Berlin, August, 2017. Master thesis
Bibtex entry Link to PDF
Marten Picker.
Algorithms and Experiments for Finding Robust 2-Clubs.
TU Berlin, August, 2015. Master thesis
Bibtex entry Link to PDF
Tomasz Przedmojski.
Algorithms and Experiments for (Nearly) Restricted Domains in Elections.
TU Berlin, February, 2016. Master thesis
Bibtex entry Link to PDF
Philipp Zschoche.
On Finding Separators in Temporal Graphs.
TU Berlin, August, 2017. Master thesis
Bibtex entry Link to PDF

Bachelor Theses

Amin Abid.
g-Indexmanipulation: Algorithmen zum Auflösen von Artikelvereinigungen.
TU Berlin, Mai, 2017. Bachelor thesis
Bibtex entry Link to PDF
Felix Bohlmann.
Graphclustern durch Zerstören langer induzierter Pfade.
TU Berlin, 2015. Bachelor thesis
Bibtex entry Link to PDF
Alexander Dittmann.
Algorithms and Experiments for Betweeness Centrality in Tree-Like Networks.
TU Berlin, November, 2017. Bachelor thesis
Bibtex entry Link to PDF
Frank Dymek.
Verbesserung einer Greedy-Heuristik für Dominating Set: Dynamische Probleme und Turbo-Charging.
TU Berlin, Februar, 2017. Bachelor thesis
Bibtex entry Link to PDF
Ugo Paavo Finnendahl.
Das Stable Roommate-Problem unter Einschränkungen der Präferenzstruktur.
TU Berlin, April, 2016. Bachelor thesis
Bibtex entry Link to PDF
Jan Eric Frömmrich.
A Systematic Comparison of Graph Parameters.
TU Berlin, April, 2018. Bachelor thesis
Bibtex entry Link to PDF
Christopher Hannusch.
Algorithms for Finding Highly Connected Subgraphs.
TU Berlin, Mai, 2017. Bachelor thesis
Bibtex entry Link to PDF
Anne-Sophie Himmel.
Enumerating Maximal Cliques in Temporal Graphs.
TU Berlin, January, 2016. Bachelor thesis
Bibtex entry Link to PDF
Clemens Hoffmann.
Graph Degree Anonymization: Lower Bounds and Heuristics.
TU Berlin, March, 2014. Bachelor thesis
Bibtex entry Link to PDF
Manuela Hopp.
On Nash Equilibria for a Competitive Diffusion Game on Hypercubes and Grids.
TU Berlin, Dezember, 2015. Bachelor thesis
Bibtex entry Link to PDF
Marcel Koseler.
Kernelization for Degree-Constraint Editing on Directed Graphs.
TU Berlin, November, 2015. Bachelor thesis
Bibtex entry Link to PDF
Max-Jonathan Luckow.
Paths under Neighborhood Constraints---Algorithms and Complexity.
TU Berlin, May, 2017. Bachelor thesis
Bibtex entry Link to PDF
Marcelo Garlet Millani.
Algorithms and Complexity for Degree Anonymization in Directed Graphs.
TU Berlin, March, 2015. Bachelor thesis
Bibtex entry Link to PDF
Marco Morik.
The Complexity of Routing with Collision Avoidance.
TU Berlin, June, 2016. Bachelor thesis
Bibtex entry Link to PDF
Frank Ng.
Community Detection-Algorithmen für Arzt-Patienten-Netzwerke.
TU Berlin, März, 2018. Bachelor thesis
Bibtex entry Link to PDF
Benjamin Oesterle.
On the Influence of Different Stand-Off Rules in Network Diffusion Games.
TU Berlin, März, 2018. Bachelor thesis
Bibtex entry Link to PDF
Tomasz Przedmojski.
Algorithm Engineering for Hierarchical Tree Clustering.
TU Berlin, Januar, 2013. Bachelor thesis
Bibtex entry Link to PDF
Fabian Spieß.
Programm zur Visualisierung und automatisierten Ableitung von Beziehungen zwischen Graphparametern.
TU Berlin, February, 2014. Bachelor thesis
Bibtex entry Link to PDF
Kolja Stahl.
Algorithm Engineering für das Auffinden dichter Teilgraphen in dünnen Graphen.
TU Berlin, June, 2013. Bachelor thesis
Bibtex entry Link to PDF
Maximilian Stahlberg.
Finding the Most Vital Edges for Shortest Paths - Algorithms and Complexity for Special Graph Classes.
TU Berlin, February, 2016. Bachelor thesis
Bibtex entry Link to PDF
Thomas Wais.
The Interval Ordering Problem on Cliques.
TU Berlin, März, 2018. Bachelor thesis
Bibtex entry Link to PDF

Zusatzinformationen / Extras