Autorenliste
Matthias Baumgart
- (with Stefan Eckhardt, Jan H. Griebsch, Sven Kosub, Johannes Nowak)
- All-Pairs Common-Ancestor Problems in Weighted Dags
Proceedings of the 1st International Symposium on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies,
ESCAPE'07 (April 7-9, 2007, Hangzhou, China),
LNCS 4614, pp. 282-293, Springer-Verlag, 2007.
[BibTex] - (with Stefan Eckhardt, Jan H. Griebsch, Sven Kosub, Johannes Nowak)
- All-Pairs Common-Ancestor Problems in Weighted Dags
Technical Report TUM-I0606,
Institut für Informatik, TU München, 2006.
[BibTex]
Thomas Bayer
- Intersections of Polynomial Rings and Modules with Applications
Dissertation, Institut für Informatik, Technische Universität München, 2006.
[BibTex] - Optimal Descriptions of Orbit Spaces and Strata of finite Groups
Proceedings of the International Symposium on Symbolic and Algebraic Computation,
ISSAC'04 (July 4-7, 2004, Santander, Spain), pp. 19-26, ACM Press, 2004.
[BibTex] - STRATIFY - A SINGULAR Package for Computing Stratifications of Compact Group Actions
Proceedings of the 7th International Workshop on Computer Algebra in Scientific Computing,
CASC'04 (July 12-19,2004, St. Petersburg, Russia), pp. 23-38, Institut für Informatik, TU München, 2004.
[BibTex] - Computing Optimal Descriptions of Stratifications of Actions of Compact Lie Groups
Technical Report TUM-I0401,
Institut für Informatik, TU München, 2004.
[BibTex] - 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.
[BibTex] - 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.
[BibTex] - Algorithms for the computation of moduli spaces for semiquasihomogeneous singularities
Revista Matemática Complutense 16(1):103-129, 2003.
[BibTex] - 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.
[BibTex] - On the Intersection of Invariant Rings
Beiträge zur Algebra und Geometrie / Contributions to Algebra and Geometry 43(2):551-555, 2002.
[BibTex] - 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.
[BibTex] - 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.
[BibTex]
Anna Bernasconi
- (with Lavinia Egidi)
- Hilbert Function and Complexity Lower Bounds for Symmetric Boolean Functions
Information and Computation 153(1):1-25, 1999.
[BibTex] - (with 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.
[BibTex] - (with 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.
[BibTex] - On the complexity of balanced Boolean functions
Information Processing Letters 70(4):157-163, 1999.
[BibTex] - (with Bruno Codenotti)
- Spectral Analysis of Boolean Functions as a Graph Eigenvalue Problem
IEEE Transactions on Computers 48(3):345-351, 1999.
[BibTex] - (with 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.
[BibTex] - (with 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.
[BibTex] - 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.
[BibTex] - (with Bruno Codenotti)
- Introduzione alla Complessità Computazionale
Springer-Verlag, 1998.
[BibTex] - 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.
[BibTex] - (with 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.
[BibTex]
Stefan Bischof
- (with Ralf Ebner, Thomas Erlebach)
- Parallel Load Balancing for Problems with Good Bisectors
Journal of Parallel and Distributed Computing 60(9):1047-1073, 2000.
[BibTex] - Efficient Algorithms for On-Line Scheduling and Load Distribution in Parallel Systems
Dissertation, Institut für Informatik, Technische Universität München, 1999.
[BibTex] - (with 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.
[BibTex] - (with 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.
[BibTex] - (with 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.
[BibTex] - (with 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.
[BibTex] - (with 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.
[BibTex] - (with Ernst W. Mayr)
- On-Line Scheduling of Parallel Jobs with Runtime Restrictions
Technical Report TUM-I9810,
Institut für Informatik, TU München, 1998.
[BibTex] - (with 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.
[BibTex]
Arno Buchner
- (with Monika Götz, Helgard Nirenberg, Sibylle Krause, Heike Wolters, Siegfried Draeger, Jana Lottmann, Gabriele Berg, Kornelia Smalla)
- Fungal endophytes in potato roots studied by traditional isolation and cultivation-independent DNA-based methods
FEMS Microbiology Ecology 58(3):404-413, 2006.
[BibTex] - (with Hanjo Täubig, Jan H. Griebsch)
- PAST: fast structure-based searching in the PDB
Nucleic Acids Research 34(Web Server):W20-W23, 2006.
[BibTex] - (with Hanjo Täubig, 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.
[BibTex] - (with Wolfgang Ludwig, Oliver Strunk, Ralf Westram, Lothar Richter, Harald Meier, Yadhu Kumar, 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.
[BibTex] - (with 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.
[BibTex] - (with 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.
[BibTex] - (with Newton C. Marcial Gomes, Olajire Fagbola, Rodrigo Costa, Norma Gouvea Rumjanek, 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.
[BibTex]
Dmytro Chibisov
- (with Ernst W. Mayr)
- Computing Minimum-Time Motion for 6R Robots and Application to Industrial Welding
Proceedings of the 4th Int. Workshop on Computer Algebra Systems in Teaching and Research,
CASTR'07 (January 31 – February 3, 2007, Siedlce, Poland), 2007.
[BibTex] - (with Victor G. Ganzha, Ernst W. Mayr, Evgenii V. Vorozhtsov)
- On the Provably Tight Approximation of Optimal Meshing for Non-convex Regions
Proceedings of the 9th Int. Workshop on Computer Algebra in Scientific Computing,
CASC'06 (September 11-15, 2006, Chisinau, Moldova),
LNCS 4194, pp. 109-128, Springer-Verlag, 2006.
[BibTex] - (with Ernst W. Mayr, Sergey Pankratov)
- Spatial Planning and Geometric Optimization: Combining Configuration Space and Energy Methods
Proceedings of the 5th International Workshop on Automated Deduction in Geometry,
ADG'04 (September 16-18, 2004, Gainesville, Florida, USA),
LNCS 3763, pp. 156-168, Springer-Verlag, 2006.
[BibTex] - (with Victor G. Ganzha, Sergey Pankratov, Christoph Zenger)
- Computer Algebra in Nanosciences: Modeling Electronic States in Quantum Dots
Proceedings of the 8th International Workshop on Computer Algebra in Scientific Computing,
CASC'05 (September 12-16, 2005, Kalamata, Greece),
LNCS 3718, pp. 115-124, Springer-Verlag, 2005.
[BibTex] - (with Victor G. Ganzha, Ernst W. Mayr, Evgenii V. Vorozhtsov)
- Generation of Orthogonal Grids on Curvilinear Trimmed Regions in Constant Time
Proceedings of the 8th International Workshop on Computer Algebra in Scientific Computing,
CASC'05 (September 12-16, 2005, Kalamata, Greece),
LNCS 3718, pp. 105-114, Springer-Verlag, 2005.
[BibTex] - (with Victor G. Ganzha, Evgenii V. Vorozhtsov)
- Hierarchical Advancing Front Triangulation Using Symmetry Properties
Proceedings of the 7th International Workshop on Computer Algebra in Scientific Computing,
CASC'04 (July 12-19,2004, St. Petersburg, Russia), pp. 173-184, Institut für Informatik, TU München, 2004.
[BibTex] - (with Victor G. Ganzha, 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.
[BibTex]
Stefan Eckhardt
- (with Andreas M. Mühling, Johannes Nowak)
- Fast Lowest Common Ancestor Computations in Dags
Proceedings of the 15th European Symposium on Algorithms,
ESA'07 (October 8-10, 2007, Eilat, Israel),
LNCS 4698, pp. 705-716, Springer-Verlag, 2007.
[BibTex] - (with Sven Kosub, Johannes Nowak)
- Smoothed Analysis of Trie Height
Technical Report TUM-I0715,
Institut für Informatik, TU München, 2007.
[BibTex] - (with Matthias Baumgart, Jan H. Griebsch, Sven Kosub, Johannes Nowak)
- All-Pairs Common-Ancestor Problems in Weighted Dags
Proceedings of the 1st International Symposium on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies,
ESCAPE'07 (April 7-9, 2007, Hangzhou, China),
LNCS 4614, pp. 282-293, Springer-Verlag, 2007.
[BibTex] - (with Andreas M. Mühling, Johannes Nowak)
- Fast Lowest Common Ancestor Computations in Dags
Technical Report TUM-I0707,
Institut für Informatik, TU München, 2007.
[BibTex] - (with Matthias Baumgart, Jan H. Griebsch, Sven Kosub, Johannes Nowak)
- All-Pairs Common-Ancestor Problems in Weighted Dags
Technical Report TUM-I0606,
Institut für Informatik, TU München, 2006.
[BibTex] - (with Sven Kosub, Moritz G. Maaß, Hanjo Täubig, Sebastian Wernicke)
- Combinatorial Network Abstraction by Trees and Distances
Proceedings of the 16th International Symposium on Algorithms and Computation,
ISAAC'05 (December 19-21, 2005, Hainan, China),
LNCS 3827, pp. 1100-1109, Springer-Verlag, 2005.
[BibTex] - (with Sven Kosub, Moritz G. Maaß, Hanjo Täubig, Sebastian Wernicke)
- Combinatorial Network Abstraction by Trees and Distances
Technical Report TUM-I0502,
Institut für Informatik, TU München, 2005.
[BibTex] - (with Sebastian Wernicke)
- On the Algorithmic Intractability of Computing Distance-Approximating Spanning Trees
Technical Report TUM-I0409,
Institut für Informatik, TU München, 2004.
[BibTex]
Thomas Erlebach
- (with 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.
[BibTex] - (with Stefan Bischof, Ralf Ebner)
- Parallel Load Balancing for Problems with Good Bisectors
Journal of Parallel and Distributed Computing 60(9):1047-1073, 2000.
[BibTex] - (with Ralf Ebner, 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.
[BibTex] - (with Klaus Jansen, Christos Kaklamanis, Milena Mihail, Pino Persiano)
- Optimal wavelength routing on directed fiber trees
Theoretical Computer Science 221:119-137, 1999.
[BibTex] - Scheduling Connections in Fast Networks
Dissertation, Institut für Informatik, Technische Universität München, 1999.
[BibTex] - (with Ralf Ebner, 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.
[BibTex] - (with Stefan Bischof, Ralf Ebner)
- 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.
[BibTex] - (with 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.
[BibTex] - (with Stefan Bischof, Ralf Ebner)
- 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.
[BibTex] - (with Stefan Bischof, Ralf Ebner)
- 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.
[BibTex] - (with Stefan Bischof, Ralf Ebner)
- 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.
[BibTex] - (with 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.
[BibTex] - (with Christos Kaklamanis, Pino Persiano, 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.
[BibTex] - (with 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.
[BibTex] - (with 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.
[BibTex] - (with 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.
[BibTex] - (with 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.
[BibTex] - (with 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.
[BibTex]
Jens Ernst
- A Distributed, Parallel System for Large-Scale Structure Recognition in Gene Expression Data
Proceedings of the 2nd Int. Conference on High Performance Computing and Communications,
HPCC'06 (September 13-15, 2006, Munich, Germany),
LNCS 4208, pp. 21-30, Springer-Verlag, 2006.
[BibTex] - Similarity-Based Clustering Algorithms for Gene Expression Profiles
Dissertation, Institut für Informatik, Technische Universität München, 2003.
[BibTex] - (with Alexander Loy, Angelika Lehner, Natuschka Lee, Justyna Adamczyk, Harald Meier, 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.
[BibTex] - (with 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.
[BibTex]
Tom Friedetzky
- Randomized Load Balancing
Dissertation, Institut für Informatik, Technische Universität München, 2002.
[BibTex] - (with Petra Berenbrink, Artur Czumaj, 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.
[BibTex] - (with Petra Berenbrink, 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.
[BibTex] - (with Petra Berenbrink, 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.
[BibTex]
Stefanie Gerke
- Random Graphs with Constraints
Habilitation, Institut für Informatik, Technische Universität München, 2005.
[BibTex] - (with Colin McDiarmid)
- On the Number of Edges in Random Planar Graphs
Combinatorics, Probability and Computing 13(2):165-183, 2004.
[BibTex] - (with Thomas Schickinger, Angelika Steger)
- K<sub>5</sub>-Free Subgraphs of Random Graphs
Random Structures and Algorithms 24(2):194-232, 2004.
[BibTex] - (with Colin McDiarmid)
- Graph Imperfection with a Co-Site Constraint
SIAM Journal on Discrete Mathematics 17(3):403-425, 2004.
[BibTex] - (with Colin McDiarmid)
- Channel Assignment with Large Demands
Annals of Operations Research 107(1-4):143-159, 2001.
[BibTex]
Jan H. Griebsch
- (with Matthias Baumgart, Stefan Eckhardt, Sven Kosub, Johannes Nowak)
- All-Pairs Common-Ancestor Problems in Weighted Dags
Proceedings of the 1st International Symposium on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies,
ESCAPE'07 (April 7-9, 2007, Hangzhou, China),
LNCS 4614, pp. 282-293, Springer-Verlag, 2007.
[BibTex] - (with Hanjo Täubig, Arno Buchner)
- PAST: fast structure-based searching in the PDB
Nucleic Acids Research 34(Web Server):W20-W23, 2006.
[BibTex] - (with Oliver Arafat, Wolfram Koska)
- xAnVi – An Extensible Visualization and Analysis Framework
Proceedings of the 10th Int. Conference on Information Visualization,
IV'06 (July 5-7, 2006, London, UK), pp. 45-52, IEEE Computer Society Press, 2006.
[BibTex] - (with Matthias Baumgart, Stefan Eckhardt, Sven Kosub, Johannes Nowak)
- All-Pairs Common-Ancestor Problems in Weighted Dags
Technical Report TUM-I0606,
Institut für Informatik, TU München, 2006.
[BibTex] - (with Stella M. Clarke, Timothy W. Simpson)
- Analysis of Support Vector Regression for Approximation of Complex Engineering Analyses
Journal of Mechanical Design 127(6):1077-1087, 2005.
[BibTex] - (with Hanjo Täubig, Arno Buchner)
- 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.
[BibTex] - (with Stella M. Clarke, Michael F. Zäh)
- 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.
[BibTex] - (with Arno Buchner, Hanjo Täubig)
- 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.
[BibTex] - (with Stella M. Clarke, 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.
[BibTex]
Alexander Hall
- (with 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.
[BibTex]
Volker Heun
- Grundlegende Algorithmen
Einführung in den Entwurf und die Analyse effizienter Algorithmen
2. Auflage, Vieweg-Verlag, 2003.
[BibTex] - Approximate protein folding in the HP side chain model on extended cubic lattices
Discrete Applied Mathematics 127(1):163-177, 2003.
[BibTex] - (with Ernst W. Mayr)
- Efficient Dynamic Embeddings of Binary Trees into Hypercubes
Journal of Algorithms 43(1):51-84, 2002.
[BibTex] - (with Ernst W. Mayr)
- Embedding Graphs with Bounded Treewidth into Their Optimal Hypercubes
Journal of Algorithms 43(1):17-50, 2002.
[BibTex] - (with Jens Ernst, 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.
[BibTex] - (with Ernst W. Mayr)
- Optimal Dynamic Embeddings of Complete Binary Trees into Hypercubes
Journal of Parallel and Distributed Computing 61(8):1110-1125, 2001.
[BibTex] - Grundlegende Algorithmen
Einführung in den Entwurf und die Analyse effizienter Algorithmen
1. Auflage, Vieweg-Verlag, 2000.
[BibTex] - 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.
[BibTex] - 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.
[BibTex] - (with Ernst W. Mayr)
- Efficient Dynamic Embeddings of Binary Trees into Hypercubes
Technical Report ICSI-TR-98-023,
International Computer Science Institute (ICSI), Berkeley, 1998.
[BibTex] - (with 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.
[BibTex] - (with 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.
[BibTex] - 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.
[BibTex] - (with 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.
[BibTex] - (with 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.
[BibTex] - (with 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.
[BibTex] - Efficient Embeddings of Treelike Graphs into Hypercubes
Dissertation, Institut für Informatik, Technische Universität München,,
Reihe Informatik, Shaker Verlag 1996.
[BibTex] - (with Ernst W. Mayr)
- Embedding Graphs with Bounded Treewidth into Optimal Hypercubes
Technical Report TUM-I9539,
Institut für Informatik, TU München, 1995.
[BibTex] - (with 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.
[BibTex] - (with 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.
[BibTex]
Klaus Holzapfel
- (with Sven Kosub, Moritz G. Maaß, Hanjo Täubig)
- The Complexity of Detecting Fixed-Density Clusters
Discrete Applied Mathematics 154(11):1547-1562, 2006.
[BibTex] - Density-based clustering in large-scale networks
Dissertation, Institut für Informatik, Technische Universität München, 2006.
[BibTex] - (with 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.
[BibTex] - (with 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.
[BibTex] - (with Sami Khuri)
- 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.
[BibTex]
Klaus Jansen
- (with Thomas Erlebach, Christos Kaklamanis, Milena Mihail, Pino Persiano)
- Optimal wavelength routing on directed fiber trees
Theoretical Computer Science 221:119-137, 1999.
[BibTex] - (with Thomas Erlebach)
- 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.
[BibTex] - (with Christos Kaklamanis, Pino Persiano, Thomas Erlebach)
- 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.
[BibTex] - (with Thomas Erlebach)
- 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.
[BibTex] - (with Thomas Erlebach, 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.
[BibTex] - (with Thomas Erlebach)
- 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.
[BibTex] - (with Thomas Erlebach)
- 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.
[BibTex]
Sami Khuri
- (with 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.
[BibTex] - (with 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.
[BibTex] - (with 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.
[BibTex] - (with 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.
[BibTex]
Ulla Koppenhagen
- (with 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.
[BibTex] - (with 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.
[BibTex] - (with 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.
[BibTex] - (with 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.
[BibTex] - Optimal Algorithms for Binomial Ideals and Commutative Semigroups
Dissertation, Institut für Informatik, Technische Universität München,,
Reihe Informatik, Shaker Verlag 1997.
[BibTex] - (with 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.
[BibTex] - (with 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.
[BibTex] - (with 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.
[BibTex] - (with Ernst W. Mayr)
- Optimal Gröbner Base Algorithms for Binomial Ideals
Technical Report TUM-I9604,
Institut für Informatik, TU München, 1996.
[BibTex] - (with 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.
[BibTex] - (with Ernst W. Mayr)
- The Complexity of the Equivalence Problem for Commutative Semigroups
Technical Report TUM-I9603,
Institut für Informatik, TU München, 1996.
[BibTex] - (with 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.
[BibTex]
Sven Kosub
- (with Christopher M. Homan)
- Dichotomy Results for Fixed Point Counting in Boolean Dynamical Systems
Proceedings of the 10th Italian Conference on Theoretical Computer Science,
ICTCS'07 (Oct 3-5, 2007, Rome, Italy), pp. 163-174, World Scientific Publishing, 2007.
[BibTex] - (with Benjamin Hummel)
- Acyclic Type-of-Relationship Problems on the Internet: An Experimental Analysis
Proceedings of the 7th ACM SIGCOMM Internet Measurement Conference,
IMC'07 (October 24-26, 2007, San Diego, CA, USA), pp. 221-226, ACM Press, 2007.
[BibTex] - (with Lane A. Hemaspaandra, Christopher M. Homan)
- Cluster Computing and the Power of Edge Recognition
Information and Computation 205(8):1274-1293, 2007.
[BibTex] - (with Stefan Eckhardt, Johannes Nowak)
- Smoothed Analysis of Trie Height
Technical Report TUM-I0715,
Institut für Informatik, TU München, 2007.
[BibTex] - (with Matthias Baumgart, Stefan Eckhardt, Jan H. Griebsch, Johannes Nowak)
- All-Pairs Common-Ancestor Problems in Weighted Dags
Proceedings of the 1st International Symposium on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies,
ESCAPE'07 (April 7-9, 2007, Hangzhou, China),
LNCS 4614, pp. 282-293, Springer-Verlag, 2007.
[BibTex] - (with Benjamin Hummel)
- Acyclic Type-of-Relationship Problems on the Internet: An Experimental Analysis
Technical Report TUM-I0709,
Institut für Informatik, TU München, 2007.
[BibTex] - (with Christopher M. Homan)
- Dichotomy Results for Fixed Point Counting in Boolean Dynamical Systems
Technical Report TUM-I0706,
Institut für Informatik, TU München, 2007.
[BibTex] - Dichotomy Results for Fixed-Point Existence Problems for Boolean Dynamical Systems
Technical Report TUM-I0701,
Institut für Informatik, TU München, 2007.
[BibTex] - (with Klaus W. Wagner)
- The Boolean Hierarchy of NP-Partitions
Information and Computation , 2007.
[BibTex] - (with Lane A. Hemaspaandra, Christopher M. Homan, Klaus W. Wagner)
- The Complexity of Computing the Size of an Interval
SIAM Journal on Computing 36(5):1264-1300, 2006.
[BibTex] - (with Klaus Holzapfel, Moritz G. Maaß, Hanjo Täubig)
- The Complexity of Detecting Fixed-Density Clusters
Discrete Applied Mathematics 154(11):1547-1562, 2006.
[BibTex] - (with Moritz G. Maaß, Hanjo Täubig)
- Acyclic Type-of-Relationship Problems on the Internet
Proceedings of the 3rd Workshop on Combinatorial and Algorithmic Aspects of Networking,
CAAN'06 (July 2, 2006, Chester, UK),
LNCS 4235, pp. 98-111, Springer-Verlag, 2006.
[BibTex] - (with Lane A. Hemaspaandra, Christopher M. Homan)
- Cluster Computing and the Power of Edge Recognition
Proceedings of the 3rd Annual Conference on Theory and Applications of Models of Computation,
TAMC'06 (May 15-20, 2006, Beijing, China),
LNCS 3959, pp. 283-294, Springer-Verlag, 2006.
[BibTex] - (with Matthias Baumgart, Stefan Eckhardt, Jan H. Griebsch, Johannes Nowak)
- All-Pairs Common-Ancestor Problems in Weighted Dags
Technical Report TUM-I0606,
Institut für Informatik, TU München, 2006.
[BibTex] - (with Moritz G. Maaß, Hanjo Täubig)
- Acyclic Type-of-Relationship Problems on the Internet
Technical Report TUM-I0605,
Institut für Informatik, TU München, 2006.
[BibTex] - (with Stefan Eckhardt, Moritz G. Maaß, Hanjo Täubig, Sebastian Wernicke)
- Combinatorial Network Abstraction by Trees and Distances
Proceedings of the 16th International Symposium on Algorithms and Computation,
ISAAC'05 (December 19-21, 2005, Hainan, China),
LNCS 3827, pp. 1100-1109, Springer-Verlag, 2005.
[BibTex] - (with Lane A. Hemaspaandra, Christopher M. Homan)
- Cluster Computing and the Power of Edge Recognition
Technical Report URCS-TR-2005-878,
Department of Computer Science, University of Rochester, 2005.
[BibTex] - (with Stefan Eckhardt, Moritz G. Maaß, Hanjo Täubig, Sebastian Wernicke)
- Combinatorial Network Abstraction by Trees and Distances
Technical Report TUM-I0502,
Institut für Informatik, TU München, 2005.
[BibTex] - (with Lane A. Hemaspaandra, Christopher M. Homan, Klaus W. Wagner)
- The Complexity of Computing the Size of an Interval
Technical Report URCS-TR-2005-856,
Department of Computer Science, University of Rochester, 2005.
[BibTex] - Local Density
In: Ulrik Brandes, Thomas Erlebach (Ed.):
Network Analysis
Methodological Foundations
Springer-Verlag, 2005.
[BibTex] - NP-Partitions over Posets with an Application to Reducing the Set of Solutions of NP Problems
Theory of Computing Systems 38(1):83-113, 2005.
[BibTex] - Local Density
Technical Report TUM-I0421,
Institut für Informatik, TU München, 2004.
[BibTex] - 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.
[BibTex] - (with Matthias Galota, Heribert Vollmer)
- Generic separations and leaf languages
Mathematical Logic Quarterly 49(4):353-362, 2003.
[BibTex] - (with Klaus Holzapfel, 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.
[BibTex] - (with Klaus Holzapfel, 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.
[BibTex] - (with Klaus W. Wagner)
- The Boolean Hierarchy of NP-Partitions
Technical Report TUM-I0209,
Institut für Informatik, TU München, 2002.
[BibTex] - (with Matthias Galota, Heribert Vollmer)
- Generic Separations and Leaf Languages
Technical Report TUM-I0104,
Institut für Informatik, TU München, 2001.
[BibTex]
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.
[BibTex] - (with 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.
[BibTex] - (with Ernst W. Mayr)
- Exponential space computation of Gröbner bases
Technical Report TUM-I9606,
Institut für Informatik, TU München, 1996.
[BibTex]
Moritz G. Maaß
- Computing suffix links for suffix trees and arrays
Information Processing Letters 101(6):250-254, 2007.
[BibTex] - Average-Case Analysis of Approximate Trie Search
Algorithmica 46(3-4):469-491, 2006.
[BibTex] - Analysis of Algorithms and Data Structures for Text Indexing
Dissertation, Institut für Informatik, Technische Universität München, 2006.
[BibTex] - (with Klaus Holzapfel, Sven Kosub, Hanjo Täubig)
- The Complexity of Detecting Fixed-Density Clusters
Discrete Applied Mathematics 154(11):1547-1562, 2006.
[BibTex] - (with Sven Kosub, Hanjo Täubig)
- Acyclic Type-of-Relationship Problems on the Internet
Proceedings of the 3rd Workshop on Combinatorial and Algorithmic Aspects of Networking,
CAAN'06 (July 2, 2006, Chester, UK),
LNCS 4235, pp. 98-111, Springer-Verlag, 2006.
[BibTex] - (with Sven Kosub, Hanjo Täubig)
- Acyclic Type-of-Relationship Problems on the Internet
Technical Report TUM-I0605,
Institut für Informatik, TU München, 2006.
[BibTex] - (with Johannes Nowak)
- A new method for approximate indexing and dictionary lookup with one error
Information Processing Letters 96(5):185-191, 2005.
[BibTex] - (with Stefan Eckhardt, Sven Kosub, Hanjo Täubig, Sebastian Wernicke)
- Combinatorial Network Abstraction by Trees and Distances
Proceedings of the 16th International Symposium on Algorithms and Computation,
ISAAC'05 (December 19-21, 2005, Hainan, China),
LNCS 3827, pp. 1100-1109, Springer-Verlag, 2005.
[BibTex] - Computing Suffix Links for Suffix Trees and Arrays
Technical Report TUM-I0514,
Institut für Informatik, TU München, 2005.
[BibTex] - (with Johannes Nowak)
- Text Indexing with Errors
Proceedings of the 16th Annual Symposium on Combinatorial Pattern Matching,
CPM 2005 (June 19-22, 2005, Jeju Island, Korea),
LNCS 3537, pp. 21-32, Springer-Verlag, 2005.
[BibTex] - (with Johannes Nowak)
- Text Indexing with Errors
Technical Report TUM-I0503,
Institut für Informatik, TU München, 2005.
[BibTex] - (with Stefan Eckhardt, Sven Kosub, Hanjo Täubig, Sebastian Wernicke)
- Combinatorial Network Abstraction by Trees and Distances
Technical Report TUM-I0502,
Institut für Informatik, TU München, 2005.
[BibTex] - Average-Case Analysis of Approximate Trie Search
Proceedings of the 15th Annual Symposium on Combinatorial Pattern Matching,
CPM 2004 (July 5-7, 2004, Istanbul, Turkey),
LNCS 3109, pp. 472-483, Springer-Verlag, 2004.
[BibTex] - Average-Case Analysis of Approximate Trie Search
Technical Report TUM-I0405,
Institut für Informatik, TU München, 2004.
[BibTex] - A Fast Algorithm for the Inexact Characteristic String Problem
Technical Report TUM-I0312,
Institut für Informatik, TU München, 2003.
[BibTex] - Linear Bidirectional On-line Construction of Affix Trees
Algorithmica 37(1):43-74, 2003.
[BibTex] - (with Klaus Holzapfel, Sven Kosub, 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.
[BibTex] - (with Klaus Holzapfel, Sven Kosub, Hanjo Täubig)
- The Complexity of Detecting Fixed-Density Clusters
Technical Report TUM-I0212,
Institut für Informatik, TU München, 2002.
[BibTex] - Linear Bidirectional On-line Construction of Affix Trees
Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching,
CPM 2000 (June 21-23, 2000, Montreal, Canada),
LNCS 1848, pp. 320-334, Springer-Verlag, 2000.
[BibTex]
Ernst W. Mayr
- (with Dmytro Chibisov)
- Computing Minimum-Time Motion for 6R Robots and Application to Industrial Welding
Proceedings of the 4th Int. Workshop on Computer Algebra Systems in Teaching and Research,
CASTR'07 (January 31 – February 3, 2007, Siedlce, Poland), 2007.
[BibTex] - (with Dmytro Chibisov, Victor G. Ganzha, Evgenii V. Vorozhtsov)
- On the Provably Tight Approximation of Optimal Meshing for Non-convex Regions
Proceedings of the 9th Int. Workshop on Computer Algebra in Scientific Computing,
CASC'06 (September 11-15, 2006, Chisinau, Moldova),
LNCS 4194, pp. 109-128, Springer-Verlag, 2006.
[BibTex] - (with Dmytro Chibisov, Sergey Pankratov)
- Spatial Planning and Geometric Optimization: Combining Configuration Space and Energy Methods
Proceedings of the 5th International Workshop on Automated Deduction in Geometry,
ADG'04 (September 16-18, 2004, Gainesville, Florida, USA),
LNCS 3763, pp. 156-168, Springer-Verlag, 2006.
[BibTex] - (with Dmytro Chibisov, Victor G. Ganzha, Evgenii V. Vorozhtsov)
- Generation of Orthogonal Grids on Curvilinear Trimmed Regions in Constant Time
Proceedings of the 8th International Workshop on Computer Algebra in Scientific Computing,
CASC'05 (September 12-16, 2005, Kalamata, Greece),
LNCS 3718, pp. 105-114, Springer-Verlag, 2005.
[BibTex] - (with Stefan Pfingstl)
- Fachinformationssystem Informatik (FIS-I) und Semantische
Technologien für Informationsportale (SemIPort)
Erfassung und Bearbeitung bibliographischer Daten
Proceedings of the 35. Jahrestagung der GI (Band 2),
Informatik 2005 (September 19-22, 2005, Bonn, Germany),
LNI P-68, pp. 702-703, Köllen Verlag, 2005.
[BibTex] - (with Agnes Koschmider, Michael Ley, Peter Luksch, Jörg Maas, 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. Jahrestagung der GI (Band 2),
INFORMATIK 2004 (Sep 20-24, 2004, Ulm, Germany),
LNI P-51, pp. 208-212, Köllen Verlag, 2004.
[BibTex] - (with Lutz Horn, Michael Ley, Peter Luksch, Jörg Maas, 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. Jahrestagung der GI (Band 1),
INFORMATIK 2003 (Sep 29 - Oct 2, 2003, Frankfurt / Main, Germany),
LNI P-34, pp. 132-147, Köllen Verlag, 2003.
[BibTex] - (with Volker Heun)
- Efficient Dynamic Embeddings of Binary Trees into Hypercubes
Journal of Algorithms 43(1):51-84, 2002.
[BibTex] - (with Volker Heun)
- Embedding Graphs with Bounded Treewidth into Their Optimal Hypercubes
Journal of Algorithms 43(1):17-50, 2002.
[BibTex] - (with Volker Heun)
- Optimal Dynamic Embeddings of Complete Binary Trees into Hypercubes
Journal of Parallel and Distributed Computing 61(8):1110-1125, 2001.
[BibTex] - (with Ulla Koppenhagen)
- 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.
[BibTex] - (with Ulla Koppenhagen)
- Optimal Algorithms for the Coverability, the Subword, the Containment, and the Equivalence Problems for Commutative Semigroups
Information and Computation 158(2):98-124, 2000.
[BibTex] - (with Ulla Koppenhagen)
- An Optimal Algorithm for Constructing the Reduced Gröbner Basis of Binomial Ideals
Journal of Symbolic Computation 28(3):317-338, 1999.
[BibTex] - (with Stefan Bischof)
- On-Line Scheduling of Parallel Jobs with Runtime Restrictions
Proceedings of the