Fakultät für Informatik - Technische Universität München Lehrstuhl für Effiziente Algorithmen

Publikationen / Publications

Journal Articles

Wolfgang Ludwig, Oliver Strunk, Ralf Westram, Lothar Richter, Harald Meier, Yadhu Kumar, Arno Buchner, Tina Lai, Susanne Steppi, Gangolf Jobb, Wolfram Förster, Igor Brettske, Stefan Gerber, Anton W. Ginhart, Oliver Gross, Silke Grumann, Stefan Hermann, Ralf Jost, Andreas König, Thomas Liss, Ralph Lüßmann, Michael May, Björn Nonhoff, Boris Reichel, Robert Strehlow, Alexandros Stamatakis, Norbert Stuckmann, Alexander Vilbig, Michael Lenke, Thomas Ludwig, Arndt Bode, Karl-Heinz Schleifer:

ARB: a software environment for sequence data
Nucleic Acids Research 32(4):1363-1371, 2004.

Moritz G. Maaß:

Linear Bidirectional On-line Construction of Affix Trees
Algorithmica 37(1):43-74, 2003.

Matthias Galota, Sven Kosub, Heribert Vollmer:

Generic separations and leaf languages
Mathematical Logic Quarterly 49(4):353-362, 2003.

Volker Heun:

Approximate protein folding in the HP side chain model on extended cubic lattices
Discrete Applied Mathematics 127(1):163-177, 2003.

Thomas Bayer:

An algorithm for computing invariants of linear actions of algebraic groups up to a given degree
Journal of Symbolic Computation 35(4):441-449, 2003.

Newton C. Marcial Gomes, Olajire Fagbola, Rodrigo Costa, Norma Gouvea Rumjanek, Arno Buchner, Leda Mendonça-Hagler, Kornelia Smalla:

Dynamics of Fungal Communities in Bulk and Maize Rhizosphere Soil in the Tropics
Applied and Environmental Microbiology 69(7):3758-3766, 2003.

Thomas Bayer:

Algorithms for the computation of moduli spaces for semiquasihomogeneous singularities
Revista Matemática Complutense 16(1):103-129, 2003.

Hans Jürgen Prömel, Thomas Schickinger, Angelika Steger:

A note on triangle-free and bipartite graphs
Discrete Mathematics 257(2-3):531-540, 2002.

Alexander Loy, Angelika Lehner, Natuschka Lee, Justyna Adamczyk, Harald Meier, Jens Ernst, Karl-Heinz Schleifer, Michael Wagner:

Oligonucleotide Microarray for 16S rRNA Gene-Based Detection of All Recognized Lineages of Sulfate-Reducing Prokaryotes in the Environment
Applied and Environmental Microbiology 68(10):5064-5081, 2002.

Thomas Bayer:

On the Intersection of Invariant Rings
Beiträge zur Algebra und Geometrie / Contributions to Algebra and Geometry 43(2):551-555, 2002.

Volker Heun, Ernst W. Mayr:

Embedding Graphs with Bounded Treewidth into Their Optimal Hypercubes
Journal of Algorithms 43(1):17-50, 2002.

Volker Heun, Ernst W. Mayr:

Efficient Dynamic Embeddings of Binary Trees into Hypercubes
Journal of Algorithms 43(1):51-84, 2002.

Hans Jürgen Prömel, Thomas Schickinger, Angelika Steger:

On the Structure of Clique-free Graphs
Random Structures and Algorithms 19(1):37-53, 2001.

Volker Heun, Ernst W. Mayr:

Optimal Dynamic Embeddings of Complete Binary Trees into Hypercubes
Journal of Parallel and Distributed Computing 61(8):1110-1125, 2001.

Thomas Erlebach, Peter Rossmanith, Hans Stadtherr, Angelika Steger, Thomas Zeugmann:

Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries
Theoretical Computer Science 261(1):119-156, 2001.

Ulla Koppenhagen, Ernst W. Mayr:

An Optimal Algorithm for Constructing the Reduced Gröbner Basis of Binomial Ideals, and Applications to Commutative Semigroups
Journal of Symbolic Computation 31(1-2):259-276, 2001.

Stefan Bischof, Ralf Ebner, Thomas Erlebach:

Parallel Load Balancing for Problems with Good Bisectors
Journal of Parallel and Distributed Computing 60(9):1047-1073, 2000.

Hans Jürgen Prömel, Angelika Steger:

A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5/3
Journal of Algorithms 36(1):89-101, 2000.

Ulla Koppenhagen, Ernst W. Mayr:

Optimal Algorithms for the Coverability, the Subword, the Containment, and the Equivalence Problems for Commutative Semigroups
Information and Computation 158(2):98-124, 2000.

Mark Scharbrodt, Angelika Steger, Horst Weisser:

Approximability of scheduling with fixed jobs
Journal of Scheduling 2(6):267-284, 1999.

Ulla Koppenhagen, Ernst W. Mayr:

An Optimal Algorithm for Constructing the Reduced Gröbner Basis of Binomial Ideals
Journal of Symbolic Computation 28(3):317-338, 1999.

Anna Bernasconi, Lavinia Egidi:

Hilbert Function and Complexity Lower Bounds for Symmetric Boolean Functions
Information and Computation 153(1):1-25, 1999.

Angelika Steger, Nicholas Charles Wormald:

Generating random regular graphs quickly
Combinatorics, Probability and Computing 8(4):377-396, 1999.

Thomas Erlebach, Klaus Jansen, Christos Kaklamanis, Milena Mihail, Pino Persiano:

Optimal wavelength routing on directed fiber trees
Theoretical Computer Science 221:119-137, 1999.

Anna Bernasconi, Bruno Codenotti, Valentino Crespi, Giovanni Resta:

How fast can one compute the permanent of circulant matrices?
Linear Algebra and its Applications 292:15-37, 1999.

Anna Bernasconi:

On the complexity of balanced Boolean functions
Information Processing Letters 70(4):157-163, 1999.

Anna Bernasconi, Bruno Codenotti:

Spectral Analysis of Boolean Functions as a Graph Eigenvalue Problem
IEEE Transactions on Computers 48(3):345-351, 1999.

Yoshiharu Kohayakawa, Bernd Kreuter, Angelika Steger:

An Extremal Problem For Random Graphs And The Number Of Graphs With Large Even-Girth
Combinatorica 18(1):101-120, 1998.

Ernst W. Mayr:

Some Complexity Results for Polynomial Ideals
Journal of Complexity 13(3):303-325, 1997.

Ernst W. Mayr, Ralph Werchner:

Optimal Tree Contraction and Term Matching on the Hypercube and Related Networks
Algorithmica 18(3):445-460, 1997.

Andrei Z. Broder, Ernst W. Mayr:

Counting Minimum Weight Spanning Trees
Journal of Algorithms 24(1):171-176, 1997.

Ernst W. Mayr, Ralph Werchner:

Divide-and-conquer algorithms on the hypercube
Theoretical Computer Science 162(2):283-296, 1996.

Hans Jürgen Prömel, Angelika Steger:

Counting H-free graphs
Discrete Mathematics 154:311-315, 1996.

Colin McDiarmid, Angelika Steger:

Tidier Examples for Lower Bounds on Diagonal Ramsey Numbers
Journal of Combinatorial Theory, Series A 74(1):147-152, 1996.

Graham Brightwell, Hans Jürgen Prömel, Angelika Steger:

The Average Number of Linear Extensions of a Partial Order
Journal of Combinatorial Theory, Series A 73(2):193-206, 1996.

Hans Jürgen Prömel, Angelika Steger:

On the asymptotic structure of sparse triangle-free graphs
Journal of Graph Theory 21(2):137-151, 1996.

Ernst W. Mayr:

Scheduling Interval Orders in Parallel
Parallel Algorithms and Applications 8:21-34, 1996.

Hans Jürgen Prömel, Angelika Steger:

Random l-colorable graphs
Random Structures and Algorithms 6:21-37, 1995.

Stefan Hougardy, Hans Jürgen Prömel, Angelika Steger:

Probabilistically checkable proofs and their consequences for approximation algorithms
Discrete Mathematics 136:175-223, 1994.

Ernst W. Mayr, Charles Gregory Plaxton:

Pipelined parallel prefix computations, and sorting on a pipelined hypercube
Journal of Parallel and Distributed Computing 17(4):374-380, 1993.

Ernst W. Mayr, Charles Gregory Plaxton:

On the Spanning Trees of Weighted Graphs
Combinatorica 12(4):433-447, 1992.

Articles in Conference Proceedings

Hanjo Täubig, Arno Buchner, Jan H. Griebsch:

A Method for Fast Approximate Searching of Polypeptide Structures in the PDB
Proceedings of the German Conference on Bioinformatics,
GCB'04 (October 4-6, 2004, Bielefeld, Germany),
LNI P-53, pp. 65-74, Köllen Verlag, 2004.

Paul Ortyl, Stefan Pfingstl:

Extrahierung bibliographischer Daten aus dem Internet
Proceedings of the 34. GI Jahrestagung (Band 2),
INFORMATIK 2004 (Sep 20-24, 2004, Ulm, Germany),
LNI P-51, pp. 203-207, Köllen Verlag, 2004.

Agnes Koschmider, Michael Ley, Peter Luksch, Jörg Maas, Ernst W. Mayr, Andreas Oberweis, Paul Ortyl, Stefan Pfingstl, Ute Rusnak, Daniel Sommer, Wolffried Stucky, Roland Vollmar:

Entwicklung eines Informationsportals für die Informatik
Proceedings of the 34. GI Jahrestagung (Band 2),
INFORMATIK 2004 (Sep 20-24, 2004, Ulm, Germany),
LNI P-51, pp. 208-212, Köllen Verlag, 2004.

Moritz G. Maaß:

Average-Case Analysis of Approximate Trie Search
Proceedings of the 15th Annual Symposium on Combinatorial Pattern Matching,
CPM'04 (July 5-7, 2004, İstanbul, Turkey),
LNCS 3109, pp. 472-483, Springer-Verlag, 2004.

Stella M. Clarke, Michael F. Zäh, Jan H. Griebsch:

Predicting Haptic Data with Support Vector Regression for Telepresence Applications
Proceedings of the 3rd International Conference on Hybrid Intelligent Systems,
HIS'03 (December 14-17 2003, Melbourne, Australia), pp. 572-581, IOS Press, 2003.

Arno Buchner, Hanjo Täubig, Jan H. Griebsch:

A Fast Method for Motif Detection and Searching in a Protein Structure Database
Proceedings of the German Conference on Bioinformatics,
GCB'03 (October 12-14, 2003, Neuherberg / Garching b. München, Germany), pp. 186-188 2003.

Stella M. Clarke, Jan H. Griebsch, Timothy W. Simpson:

Analysis of Support Vector Regression for Approximation of Complex Engineering Analyses
Proceedings of the 29th Design Automation Conference (ASME Design Engineering Technical Conferences),
DAC/DETC'03 (September 2-6 2003, Chicago, Illinois, USA), 2003.

Thomas Bayer:

Computing the Stratification of Actions of Compact Lie Groups
Proceedings of the 6th International Workshop on Computer Algebra in Scientific Computing,
CASC 2003 (September 20-26, 2003, Passau, Germany), pp. 19-29, Institut für Informatik, TU München, 2003.

Victor G. Ganzha, Dmytro Chibisov, Evgenii V. Vorozhtsov:

Object Oriented Modelling in Numerical Computation: Multigrid Calculations using Maple
Proceedings of the 6th International Workshop on Computer Algebra in Scientific Computing,
CASC 2003 (September 20-26, 2003, Passau, Germany), pp. 121-141, Institut für Informatik, TU München, 2003.

Michal Mnuk:

The Computer Algebra Web
Proceedings of the 6th International Workshop on Computer Algebra in Scientific Computing,
CASC 2003 (September 20-26, 2003, Passau, Germany), pp. 263-273, Institut für Informatik, TU München, 2003.

Peter Ullrich:

An Extension of the Extension Theorem
Proceedings of the 6th International Workshop on Computer Algebra in Scientific Computing,
CASC 2003 (September 20-26, 2003, Passau, Germany), pp. 377-381, Institut für Informatik, TU München, 2003.

Lutz Horn, Michael Ley, Peter Luksch, Jörg Maas, Ernst W. Mayr, Andreas Oberweis, Paul Ortyl, Stefan Pfingstl, Enzo Rossi, Felix Rüssel, Ute Rusnak, Daniel Sommer, Wolffried Stucky, Roland Vollmar, Marco von Mevius:

Konzeption und Betrieb eines Kompetenz- und Dienstleistungsnetzes für die Informatik
Proceedings of the 33. GI Jahrestagung (Band 1),
INFORMATIK 2003 (Sep 29 - Oct 2, 2003, Frankfurt / Main, Germany),
LNI P-34, pp. 132-147, Köllen Verlag, 2003.

Sven Kosub:

Boolean NP-Partitions and Projective Closure
Proceedings of the 4th International Conference on Discrete Mathematics and Theoretical Computer Science,
DMTCS'03 (July 7-12 2003, Dijon, France),
LNCS 2731, pp. 225-236, Springer-Verlag, 2003.

Alexander Hall, Hanjo Täubig:

Comparing Push- and Pull-Based Broadcasting
Or: Would "Microsoft Watches" Profit from a Transmitter?
Proceedings of the 2nd International Workshop on Experimental and Efficient Algorithms,
WEA'03 (May 26-28 2003, Ascona, Switzerland),
LNCS 2647, pp. 148-164, Springer-Verlag, 2003.

Klaus Holzapfel, Sven Kosub, Moritz G. Maaß, Hanjo Täubig:

The Complexity of Detecting Fixed-Density Clusters
Proceedings of the 5th Italian Conference on Algorithms and Complexity,
CIAC'03 (May 28-30 2003, Rome, Italy),
LNCS 2653, pp. 201-212, Springer-Verlag, 2003.

Michal Mnuk:

On an Algebraic Description of Colorability of Planar Graphs
Proceedings of the Logic, Mathematics and Computer Science: Interactions. Symp. in Honor of Buchberger's 60th Birthday,
LMCS 2002 (October 20-22, 2002, RISC Linz, Castle of Hagenberg, Austria), pp. 177-186 2002.

Thomas Bayer:

Moduli Spaces of Low Dimension for Semi Brieskorn-Pham Singularities w.r.t. Right Equivalence
Proceedings of the 5th International Workshop on Computer Algebra in Scientific Computing,
CASC 2002 (September 22-27, 2002, Yalta, Ukraine), pp. 7-16, Institut für Informatik, TU München, 2002.

Michal Mnuk, Gerd Baumann:

On Structured Representation of Physical Objects
Proceedings of the 5th International Workshop on Computer Algebra in Scientific Computing,
CASC 2002 (September 22-27, 2002, Yalta, Ukraine), pp. 227-235, Institut für Informatik, TU München, 2002.

Mark Scharbrodt, Thomas Schickinger, Angelika Steger:

A new average case analysis for completion time scheduling
Proceedings of the 34th Annual ACM Symposium on Theory of Computing,
STOC'02 (May 19-21 2002, Montréal, Québec, Canada), pp. 170-178, ACM Press, 2002.

Jens Ernst, Volker Heun, Ulrich Voll:

Generalized Clustering of Gene Expression Profiles - A Spectral Approach
Proceedings of the International Conference on Bioinformatics,
InCoB 2002 (February 6-8 2002, Bangkok, Thailand), 2002.

Thomas Bayer:

Computing Stratifications of Quotients of Finite Groups and an Application to Shape Memory Alloys
Proceedings of the 4th International Workshop on Computer Algebra in Scientific Computing,
CASC 2001 (September 22-26, 2001, Konstanz, Germany), pp. 13-23, Springer-Verlag, 2001.

Michal Mnuk:

Representing Graph Properties by Polynomial Ideals
Proceedings of the 4th International Workshop on Computer Algebra in Scientific Computing,
CASC 2001 (September 22-26, 2001, Konstanz, Germany), pp. 431-444, Springer-Verlag, 2001.

Sami Khuri, Klaus Holzapfel:

EVEGA: An Educational Visualization Environment for Graph Algorithms
Proceedings of the 6th Annual Conference on Innovation and Technology in Computer Science Education,
ITiCSE 2001 (June 25-27 2001, Canterbury, UK), pp. 101-104, ACM Press, 2001.

Thomas Schickinger, Angelika Steger:

Simplified Witness Tree Arguments
Proceedings of the 27th Annual Conference on Current Trends in Theory and Practice of Informatics,
SOFSEM 2000 (November 25 - December 2 2000, Milovy, Czech Republic),
LNCS 1963, pp. 71-87, Springer-Verlag, 2000.

Petra Berenbrink, Artur Czumaj, Tom Friedetzky, Nikita Vvedenskaya:

Infinite Parallel Job Allocation
Proceedings of the 12th Annual ACM Symposium on Parallel Algorithms and Architectures,
SPAA'00 (July 9-12 2000, Bar Harbor, Maine, USA), pp. 99-108, ACM Press, 2000.

Petra Berenbrink, Artur Czumaj, Angelika Steger, Berthold Vöcking:

Balanced Allocations: The Heavily Loaded Case
Proceedings of the 32nd Annual ACM Symposium on Theory of Computing,
STOC 2000 (May 21-23 2000, Portland, Oregon, USA), pp. 745-754, ACM Press, 2000.

Sami Khuri, Hsiu-Chin Hsu:

Tools for visualizing text compression algorithms
Proceedings of the ACM Symposium on Applied Computing,
SAC 2000 (March 19-21 2000, Como, Italy), pp. 119-123, ACM Press, 2000.

Sami Khuri, Tim Walters, Yanti Sugono:

A grouping genetic algorithm for coloring the edges of graphs
Proceedings of the ACM Symposium on Applied Computing,
SAC 2000 (March 19-21 2000, Como, Italy), pp. 422-427, ACM Press, 2000.

Ralf Ebner, Thomas Erlebach, Claudia Gold, Clemens Harlfinger, Roland Wismüller:

A Framework for Recording and Visualizing Event Traces in Parallel Systems with Load Balancing
Proceedings of the 5th Workshop on Parallel Systems and Algorithms,
PASA'99 (October 7 1999, Jena, Germany), pp. 155-162 1999.

Sami Khuri, Sowmya Rao Miryala:

Genetic Algorithms for Solving Open Shop Scheduling Problems
Proceedings of the 9th Portuguese Conference on Artificial Intelligence,
EPIA'99 (September 21-24 1999, Évora, Portugal),
LNAI 1695, pp. 357-368, Springer-Verlag, 1999.

Anna Bernasconi, Carsten Damm, Igor Shparlinski:

On the Average Sensitivity of Testing Square-Free Numbers
Proceedings of the 5th Annual International Computing and Combinatorics Conference,
COCOON'99 (July 26-28 1999, Tokyo, Japan),
LNCS 1627, pp. 291-299, Springer-Verlag, 1999.

Stefan Bischof, Thomas Schickinger, Angelika Steger:

Load Balancing Using Bisectors ­ A Tight Average-Case Analysis
Proceedings of the 7th Annual European Symposium on Algorithms,
ESA'99 (July 16-18 1999, Prague, Czech Republic),
LNCS 1643, pp. 172-183, Springer-Verlag, 1999.

Volker Heun:

Approximate Protein Folding in the HP Side Chain Model on Extended Cubic Lattices
Proceedings of the 7th Annual European Symposium on Algorithms,
ESA'99 (July 16-18 1999, Prague, Czech Republic),
LNCS 1643, pp. 212-223, Springer-Verlag, 1999.

Petra Berenbrink, Tom Friedetzky, Angelika Steger:

Randomized and Adversarial Load Balancing
Proceedings of the 11th Annual ACM Symposium on Parallel Algorithms and Architectures,
SPAA'99 (June 27-30 1999, Saint-Malo, France), pp. 175-184, ACM Press, 1999.

Stefan Bischof, Ralf Ebner, Thomas Erlebach:

Parallel Load Balancing for Problems with Good Bisectors
Proceedings of the International Parallel Processing Symposium and Symposium on Parallel and Distributed Processing,
IPPS/SPDP'99 (April 12-16 1999, San Juan, Puerto Rico), pp. 531-538, IEEE Computer Society Press, 1999.

Anna Bernasconi, Igor Shparlinski:

Circuit Complexity of Testing Square-Free Numbers
Proceedings of the 16th Symposium on Theoretical Aspects in Computer Science,
STACS'99 (March 4-6 1999, Trier, Germany),
LNCS 1563, pp. 47-56, Springer-Verlag, 1999.

Mark Scharbrodt, Angelika Steger, Horst Weisser:

Approximability of scheduling with fixed jobs
Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms,
SODA'99 (January 17-19 1999, Baltimore, Maryland), pp. 961-962, ACM Press, 1999.

Thomas Erlebach, Klaus Jansen:

Maximizing the Number of Connections in Optical Tree Networks
Proceedings of the 9th Annual International Symposium on Algorithms and Computation,
ISAAC'98 (December 14-16 1998, Taejon, Korea),
LNCS 1533, pp. 179-188, Springer-Verlag, 1998.

Stefan Bischof, Ernst W. Mayr:

On-Line Scheduling of Parallel Jobs with Runtime Restrictions
Proceedings of the 9th Annual International Symposium on Algorithms and Computation,
ISAAC'98 (December 14-16 1998, Taejon, Korea),
LNCS 1533, pp. 119-128, Springer-Verlag, 1998.

Anna Bernasconi:

On the polynomial representation of Boolean functions over GF(2)
Proceedings of the 6th Italian Conference on Theoretical Computer Science,
ICTCS'98 (November 9-11 1998, Prato, Italy), pp. 265-276, World Scientific Publishing, 1998.

Martin Raab, Angelika Steger:

Balls into Bins - A Simple and Tight Analysis
Proceedings of the 2nd International Workshop on Randomization and Approximation Techniques in Computer Science,
RANDOM'98 (October 8-10 1998, Barcelona, Spain),
LNCS 1518, pp. 159-170, Springer-Verlag, 1998.

Stefan Bischof, Ralf Ebner, Thomas Erlebach:

Load Balancing for Problems with Good Bisectors, and Applications in Finite Element Simulations
Proceedings of the 4th International Euro-Par Conference on Parallel Processing,
Euro-Par'98 (September 1-4 1998, Southampton, UK),
LNCS 1470, pp. 383-389, Springer-Verlag, 1998.

Oliver Krone, Martin Raab, Béat Hirsbrunner:

Load Balancing for Network Based Multi-threaded Applications
Proceedings of the 5th European PVM-MPI Users Group Meeting,
EuroPVM/MPI (September 7-9 1998, Liverpool, UK),
LNCS 1497, pp. 206-214, Springer-Verlag, 1998.

Anna Bernasconi:

Combinatorial properties of classes of functions hard to compute in constant depth
Proceedings of the 4th Annual International Computing and Combinatorics Conference,
COCOON'98 (August 12-14 1998, Taipei, Taiwan),
LNCS 1449, pp. 339-348, Springer-Verlag, 1998.

Petra Berenbrink, Tom Friedetzky, Ernst W. Mayr:

Parallel Continuous Randomized Load Balancing
Proceedings of the 10th Annual ACM Symposium on Parallel Algorithms and Architectures,
SPAA'98 (June 28 - July 2 1998, Puerto Vallarta, Mexico), pp. 192-201, ACM Press, 1998.

Stefan Bischof, Ralf Ebner, Thomas Erlebach:

Load Balancing for Problems with Good Bisectors, and Applications in Finite Element Simulations
Proceedings of the Workshop Anwendungsbezogene Lastverteilung,
ALV'98 (March 25-26 1998, München), pp. 1-12 1998.

Thomas Erlebach, Peter Rossmanith, Hans Stadtherr, Angelika Steger, Thomas Zeugmann:

Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries
Proceedings of the 8th International Workshop Algorithmic Learning Theory,
ALT'97 (October 6-8 1997, Sendai, Japan),
LNAI 1316, pp. 260-276, Springer-Verlag, 1997.

Ulla Koppenhagen, Ernst W. Mayr:

The Complexity of the Coverability, the Containment, and the Equivalence Problems for Commutative Semigroups
Proceedings of the 11th International Symposium on Fundamentals of Computation Theory,
FCT'97 (September 1-3 1997, Krakow, Poland),
LNCS 1279, pp. 257-268, Springer-Verlag, 1997.

Christos Kaklamanis, Pino Persiano, Thomas Erlebach, Klaus Jansen:

Constrained Bipartite Edge Coloring with Applications to Wavelength Routing
Proceedings of the 24th International Colloquium on Automata, Languages and Programming,
ICALP'97 (July 7-11 1997, Bologna, Italy),
LNCS 1256, pp. 493-504, Springer-Verlag, 1997.

Thomas Erlebach, Klaus Jansen:

Off-line and On-line Call-Scheduling in Stars and Trees
Proceedings of the 23rd International Workshop on Graph-Theoretic Concepts in Computer Science,
WG'97 (June 18-20 1997, Berlin, Germany),
LNCS 1335, pp. 199-213, Springer-Verlag, 1997.

Thomas Erlebach, Klaus Jansen, Christos Kaklamanis, Pino Persiano:

An Optimal Greedy Algorithm for Wavelength Allocation in Directed Tree Networks
Proceedings of the DIMACS Workshop on Network Design: Connectivity and Facilities Location,
(April 28-30 1997, Princeton, NJ),
DIMACS 40, pp. 117-129, American Mathematical Society, 1997.

Hans Jürgen Prömel, Angelika Steger:

RNC-Approximation Algorithms for the Steiner Problem
Proceedings of the 14th Symposium on Theoretical Aspects of Computer Science,
STACS'97 (February 27 - March 1, 1997, Lübeck, Germany),
LNCS 1200, pp. 559-570, Springer-Verlag, 1997.

Thomas Erlebach, Klaus Jansen:

Call Scheduling in Trees, Rings and Meshes
Proceedings of the 30th Hawaii International Conference on System Sciences,
HICSS-30, pp. 221-222, IEEE Computer Society Press, 1997.

Volker Heun, Ernst W. Mayr:

A General Method for Efficient Embeddings of Graphs into Optimal Hypercubes
Proceedings of the 2nd International Euro-Par Conference on Parallel Processing,
Euro-Par'96 (Aug. 26-29 1996, Lyon, France),
LNCS 1123, pp. 222-233, Springer-Verlag, 1996.

Ernst W. Mayr, Hans Stadtherr:

Efficient parallel algorithms for scheduling with tree precedence constraints
Proceedings of the 2nd International Euro-Par Conference on Parallel Processing,
Euro-Par'96 (Aug. 26-29 1996, Lyon, France),
LNCS 1124, pp. 543-554, Springer-Verlag, 1996.

Volker Heun:

Efficient Dynamic Embeddings of Arbitrary Binary Trees into Hypercubes
Proceedings of the 3rd International Workshop on Parallel Algorithms for Irregularly Structured Problems,
IRREGULAR'96 (August 19-21 1996, Santa Barbara, CA, USA),
LNCS 1117, pp. 287-298, Springer-Verlag, 1996.

Ulla Koppenhagen, Ernst W. Mayr:

Optimal Gröbner Base Algorithms for Binomial Ideals
Proceedings of the 23rd International Colloquium on Automata, Languages, and Programming,
ICALP'96 (July 8-12 1996, Paderborn, Germany),
LNCS 1099, pp. 244-255, Springer-Verlag, 1996.

Ulla Koppenhagen, Ernst W. Mayr:

An Optimal Algorithm for Constructing the Reduced Gröbner Basis of Binomial Ideals
Proceedings of the International Symposium on Symbolic and Algebraic Computation,
ISSAC'96 (July 24-26 1996, Zürich, Switzerland), pp. 55-62, ACM Press, 1996.

Klaus Kühnle, Ernst W. Mayr:

Exponential space computation of Gröbner bases
Proceedings of the International Symposium on Symbolic and Algebraic Computation,
ISSAC'96 (July 24-26 1996, Zürich, Switzerland), pp. 63-71, ACM Press, 1996.

Ulla Koppenhagen, Ernst W. Mayr:

An Optimal Algorithm for Constructing the Reduced Gröbner Basis of Binomial Ideals and Applications to Commutative Semigroups
Proceedings of the 2nd Magma Conference on Computational Algebra,
(May 12-16 1996, Milwaukee, Wisconsin, USA), 1996.

Volker Heun, Ernst W. Mayr:

Embedding Graphs with Bounded Treewidth into Optimal Hypercubes
Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science,
STACS'96 (Feb. 22-24, Grenoble, France),
LNCS 1046, pp. 157-168, Springer-Verlag, 1996.

Thomas Erlebach, Klaus Jansen:

Scheduling of Virtual Connections in Fast Networks
Proceedings of the 4th Workshop on Parallel Systems and Algorithms,
PASA'96, pp. 13-32, World Scientific Publishing, 1996.

Volker Heun, Ernst W. Mayr:

Optimal Dynamic Edge-Disjoint Embeddings of Complete Binary Trees into Hypercubes
Proceedings of the 4th Workshop on Parallel Systems and Algorithms,
PASA'96, pp. 195-209, World Scientific Publishing, 1996.

Ernst W. Mayr:

Scheduling Interval Orders in Parallel
Proceedings of the 28th Annual Hawaii International Conference on System Sciences,
HICSS-28 (January 3-6 1995, Kihei, Maui, Hawaii), pp. 20-28, IEEE Computer Society Press, 1995.

Volker Heun, Ernst W. Mayr:

A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube
Proceedings of the 3rd Workshop on Parallel Systems and Algorithms,
PASA'93 (April 1-2 1993, Bonn, Germany), Mitteilungen - Gesellschaft für Informatik e.V., Parallel-Algorithmen und Rechnerstrukturen (11):7-11 1993.

Ernst W. Mayr, Ralph Werchner:

Divide-and-Conquer Algorithms on the Hypercube
Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science,
STACS'93 (Feb. 25-27 1993, Würzburg, Germany),
LNCS 665, pp. 153-162, Springer-Verlag, 1993.

PhD & Habil. Theses

Jens Ernst:

Similarity-Based Clustering Algorithms for Gene Expression Profiles
Dissertation, Institut für Informatik, Technische Universität München, 2003.

Thomas Schickinger:

Complete Subgraphs of Random Graphs
Dissertation, Institut für Informatik, Technische Universität München, 2002.

Tom Friedetzky:

Randomized Load Balancing
Dissertation, Institut für Informatik, Technische Universität München, 2002.

Ulrich Voll:

Threshold Phenomena in Branching Trees and Sparse Random Graphs
Dissertation, Institut für Informatik, Technische Universität München, 2002.

Mark Scharbrodt:

Produktionsplanung in der Prozessindustrie: Modelle, effiziente Algorithmen und Umsetzung
Dissertation, Institut für Informatik, Technische Universität München, 2000.

Stefan Bischof:

Efficient Algorithms for On-Line Scheduling and Load Distribution in Parallel Systems
Dissertation, Institut für Informatik, Technische Universität München, 1999.

Thomas Erlebach:

Scheduling Connections in Fast Networks
Dissertation, Institut für Informatik, Technische Universität München, 1999.

Klaus Kühnle:

Space Optimal Computation of Normal Forms of Polynomials
Dissertation, Institut für Informatik, Technische Universität München,
Reihe Informatik, Shaker Verlag, 1998.

Hans Stadtherr:

Work Efficient Parallel Scheduling Algorithms
Dissertation, Institut für Informatik, Technische Universität München, Utz Verlag, 1998.

Ulla Koppenhagen:

Optimal Algorithms for Binomial Ideals and Commutative Semigroups
Dissertation, Institut für Informatik, Technische Universität München,
Reihe Informatik, Shaker Verlag, 1997.

Volker Heun:

Efficient Embeddings of Treelike Graphs into Hypercubes
Dissertation, Institut für Informatik, Technische Universität München,
Reihe Informatik, Shaker Verlag, 1996.

Technical Reports

Stefan Eckhardt, Sebastian Wernicke:

On the Algorithmic Intractability of Computing Distance-Approximating Spanning Trees
Technical Report TUM-I0409,
Institut für Informatik, TU München, 2004.

Moritz G. Maaß:

Average-Case Analysis of Approximate Trie Search
Technical Report TUM-I0405,
Institut für Informatik, TU München, 2004.

Thomas Bayer:

Computing Optimal Descriptions of Stratifications of Actions of Compact Lie Groups
Technical Report TUM-I0401,
Institut für Informatik, TU München, 2004.

Arno Buchner, Hanjo Täubig:

A Fast Method for Motif Detection and Searching in a Protein Structure Database
Technical Report TUM-I0314,
Institut für Informatik, TU München, 2003.

Moritz G. Maaß:

A Fast Algorithm for the Inexact Characteristic String Problem
Technical Report TUM-I0312,
Institut für Informatik, TU München, 2003.

Gerd Baumann, Michal Mnuk:

Elements - An object oriented approach to industrial software development
Technical Report TUM-I0308,
Institut für Informatik, TU München, 2003.

Michal Mnuk:

How Helpful Are Systems for Algorithm Visualization?
Technical Report TUM-I0303,
Institut für Informatik, TU München, 2003.

Klaus Holzapfel, Sven Kosub, Moritz G. Maaß, Hanjo Täubig:

The Complexity of Detecting Fixed-Density Clusters
Technical Report TUM-I0212,
Institut für Informatik, TU München, 2002.

Sven Kosub, Klaus W. Wagner:

The Boolean Hierarchy of NP-Partitions
Technical Report TUM-I0209,
Institut für Informatik, TU München, 2002.

Thomas Bayer:

An Algorithm for Computing Invariants of Linear Actions of Algebraic Groups up to a Given Degree
Technical Report TUM-I0201,
Institut für Informatik, TU München, 2002.

Matthias Galota, Sven Kosub, Heribert Vollmer:

Generic Separations and Leaf Languages
Technical Report TUM-I0104,
Institut für Informatik, TU München, 2001.

Ralf Ebner, Thomas Erlebach, Andreas Ganz, Claudia Gold, Clemens Harlfinger, Roland Wismüller:

A Framework for Recording and Visualizing Event Traces in Parallel Systems with Load Balancing
Technical Report TUM-I9909,
Institut für Informatik, TU München, 1999.

Mark Scharbrodt, Angelika Steger, Horst Weisser:

Approximability of Scheduling with Fixed Jobs
Technical Report TUM-I9907,
Institut für Informatik, TU München, 1999.

Anna Bernasconi, Carsten Damm, Igor Shparlinski:

On the Average Sensitivity of Testing Square-Free Numbers
Technical Report TUM-I9908,
Institut für Informatik, TU München, 1999.

Volker Heun:

Approximate Protein Folding in the HP Side Chain Model on Extended Cubic Lattices
Technical Report ICSI-TR-98-029,
International Computer Science Institute (ICSI), Berkeley, 1998.

Volker Heun, Ernst W. Mayr:

Optimal Dynamic Embeddings of Complete Binary Trees into Hypercubes
Technical Report ICSI-TR-98-022,
International Computer Science Institute (ICSI), Berkeley, 1998.

Volker Heun, Ernst W. Mayr:

Efficient Dynamic Embeddings of Binary Trees into Hypercubes
Technical Report ICSI-TR-98-023,
International Computer Science Institute (ICSI), Berkeley, 1998.

Stefan Bischof, Ralf Ebner, Thomas Erlebach:

Load Balancing for Problems with Good Bisectors, and Applications in Finite Element Simulations
Technical Report TUM-I9811,
Institut für Informatik, TU München, 1998.

Stefan Bischof, Ernst W. Mayr:

On-Line Scheduling of Parallel Jobs with Runtime Restrictions
Technical Report TUM-I9810,
Institut für Informatik, TU München, 1998.

Anna Bernasconi, Carsten Damm, Igor Shparlinski:

Circuit and Decision Tree Complexity of Some Number Theoretic Problems
Technical Report 98-21,
Forschungsbericht Mathematik/Informatik, Universität Trier, 1998.

Ernst W. Mayr:

Some Complexity Results for Polynomial Ideals
Technical Report TUM-I9704,
Institut für Informatik, TU München, 1997.

Thomas Erlebach, Peter Rossmanith, Hans Stadtherr, Angelika Steger, Thomas Zeugmann:

Efficient Learning of One-Variable Pattern Languages from Positive Data
Technical Report DOI-TR-128,
Department of Informatics, Kyushu University, Fukuoka, Japan, 1996.

Hans Jürgen Prömel, Angelika Steger:

RNC-Approximation Algorithms for the Steiner Problem
Technical Report TUM-I9633,
Institut für Informatik, TU München, 1996.

Ulla Koppenhagen, Ernst W. Mayr:

The Complexity of the Equivalence Problem for Commutative Semigroups
Technical Report TUM-I9603,
Institut für Informatik, TU München, 1996.

Ulla Koppenhagen, Ernst W. Mayr:

Optimal Gröbner Base Algorithms for Binomial Ideals
Technical Report TUM-I9604,
Institut für Informatik, TU München, 1996.

Ulla Koppenhagen, Ernst W. Mayr:

An Optimal Algorithm for Constructing the Reduced Gröbner Basis of Binomial Ideals
Technical Report TUM-I9605,
Institut für Informatik, TU München, 1996.

Klaus Kühnle, Ernst W. Mayr:

Exponential space computation of Gröbner bases
Technical Report TUM-I9606,
Institut für Informatik, TU München, 1996.

Volker Heun, Ernst W. Mayr:

Optimal Dynamic Edge-Disjoint Embeddings of Complete Binary Trees into Hypercubes
Technical Report TUM-I9607,
Institut für Informatik, TU München, 1996.

Volker Heun, Ernst W. Mayr:

Embedding Graphs with Bounded Treewidth into Optimal Hypercubes
Technical Report TUM-I9539,
Institut für Informatik, TU München, 1995.

Ernst W. Mayr, Hans Stadtherr:

Optimal Parallel Algorithms for Two Processor Scheduling with Tree Precedence Constraints
Technical Report TUM-I9531,
Institut für Informatik, TU München, 1995.

Ernst W. Mayr, Ralph Werchner:

Optimal Tree Contraction and Term Matching on the Hypercube and Related Networks
Technical Report TUM-I9532,
Institut für Informatik, TU München, 1995.

Ulla Koppenhagen, Ernst W. Mayr:

The Complexity of the Boundedness, Coverability, and Selfcoverability Problems for Commutative Semigroups
Technical Report TUM-I9518,
Institut für Informatik, TU München, 1995.

Ernst W. Mayr:

On Polynominal Ideals, Their Complexity, and Applications
Technical Report TUM-I9520,
Institut für Informatik, TU München, 1995.

Ernst W. Mayr:

Scheduling Interval Orders in Parallel
Technical Report TUM-I9426,
Institut für Informatik, TU München, 1994.

Volker Heun, Ernst W. Mayr:

A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube
Technical Report TUM-I9321,
Institut für Informatik, TU München, 1993.

Ernst W. Mayr, Ralph Werchner:

Divide-and-Conquer Algorithms on the Hypercube
Technical Report TUM-I9322,
Institut für Informatik, TU München, 1993.

Books

Volker Heun:

Grundlegende Algorithmen
Einführung in den Entwurf und die Analyse effizienter Algorithmen
2. Auflage, Vieweg-Verlag, 2003.

Hans Jürgen Prömel, Angelika Steger:

The Steiner Tree Problem
A Tour Through Graphs, Algorithms and Complexity
Vieweg-Verlag, 2002.

Thomas Schickinger, Angelika Steger:

Diskrete Strukturen (Band 2)
Wahrscheinlichkeitstheorie und Statistik
Springer-Verlag, 2001.

Angelika Steger:

Diskrete Strukturen (Band 1)
Kombinatorik - Graphentheorie - Algebra
Springer-Verlag, 2001.

Volker Heun:

Grundlegende Algorithmen
Einführung in den Entwurf und die Analyse effizienter Algorithmen
1. Auflage, Vieweg-Verlag, 2000.

Anna Bernasconi, Bruno Codenotti:

Introduzione alla Complessità Computazionale
Springer-Verlag, 1998.