max planck institut
informatik

• Homepage

MPI-INF D1 Publications

MPI-INF D1 Publications

Entries sorted by: 1. Author,Editor - 1. by Individual - 1. by Names

Login to this database

 Find

Viewing:	1. Author,Editor - 1. by Individual - 1. by Names
Previous Page	Next Page	Expand All	Collapse All	Search (Full Text)
Show entries starting with: A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

# Year Author(s) [non member] Title Type 2 Mortensen, Christian Worm 2006 Bast, Holger [Mortensen, Christian Worm] Weber, Ingmar Output-Sensitive Autocompletion Search In: String Processing and Information Retrieval : 13th International Conference, SPIRE 2006, 150-162 Proceedings Article 2005 [Mortensen, Christian Worm] Pettie, Seth The complexity of implicit and space-efficient priority queues In: Algorithms and data structures : 9th International Workshop, WADS 2005, 49-60 Proceedings Article 4 Morvan, Michel (ed.) 1998 Rüb, Christine On Batcher's Merge Sorts as Parallel Sorting Algorithms In: Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science (STACS-98), 410-420 Proceedings Article 1998 Hagerup, Torben Sorting and Searching on the Word RAM In: Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science (STACS-98), 366-398 Proceedings Article 1998 Jansen, Klaus The Mutual Exclusion Scheduling Problem for Permutation and Comparability Graphs In: Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science (STACS-98), 287-297 Proceedings Article 1997 Brodal, Gerth Stølting Predecessor Queries in Dynamic Integer Sets In: Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science (STACS-97), 21-32 Proceedings Article 1 Moser, Hannes 2010 Berberich, Eric [Hagen, Matthias] [Hiller, Benjamin] [Moser, Hannes] Experiments In: Algorithm Engineering : Bridging the Gap between Algorithm Theory and Practice, 325-388 Part of a Book 1 Moshe, Lewenstein (ed.) 2006 [Brodal, Gerth Stølting] Kaligosi, Kanela [Katriel, Irit] Kutz, Martin Faster Algorithms for Computing Longest Common Increasing Subsequences In: Combinatorial Pattern Matching, 17th Annual Symposium, CPM 2006, 330-341 Proceedings Article 1 Motskin, Arik 2010 [Guibas, Leonidas] Milosavljevic, Nikola [Motskin, Arik] Connected Dominating Sets on Dynamic Geometric Graphs In: Proceedings of the 22nd Canadian Conference on Computational Geometry (CCCG2010), 27-30 Proceedings Article 1 Motwani, Rajeev (ed.) 2003 Hagedoorn, Michiel Nearest Neighbors Can Be Found Efficiently If the Dimension Is Small Relative to the Input Size In: Database Theory - ICDT 2003 : 9th International Conference, 440-454 Proceedings Article 10 Mount, David M. 2007 [Arya, Sunil] Malamatos, Theocharis [Mount, David M.] A simple entropy-based algorithm for planar point location In: ACM Transactions on Algorithms [3], 17 Journal Article 2007 [Arya, Sunil] Malamatos, Theocharis [Mount, David M.] [Wong, Ka Chun] Optimal expected-case planar point location In: SIAM Journal on Computing [37], 584-610 Journal Article 2006 [Arya, Sunil] Malamatos, Theocharis [Mount, David M.] On the Importance of Idempotence In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, STOC'06, 564-573 Proceedings Article 2006 [Arya, Sunil] Malamatos, Theocharis [Mount, David M.] The Effect of Corners on the Complexity of Approximate Range Searching In: Proceedings of the 22nd Annual Symposium on Computational Geometry, SCG'06, 11-20 Proceedings Article 2005 [Arya, Sunil] Malamatos, Theocharis Mount, David M. Space-Time Tradeoffs for Approximate Spherical Range Counting In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 535-544 Proceedings Article 2000 Arya, Sunil [Mount, David M.] Approximate range searching In: Computational Geometry [17], 135-152 Journal Article 1996 Arya, Sunil Mount, David M. [Narayan, Oruttom] Accounting for boundary effects in nearest neighbor searching In: Discrete & Computational Geometry [16], 155-176 Journal Article 1995 Arya, Sunil [Mount, David M.] [Narayan, Oruttom] Accounting for boundary effects in nearest neighbor searching In: 11th Annual ACM Symposium on Computational Geometry (SCG95), 336-344 Proceedings Article 1995 Arya, Sunil [Mount, David M.] Approximate range searching In: 11th Annual ACM Symposium on Computational Geometry (SCG95), 172-181 Proceedings Article 1995 Arya, Sunil [Das, Gautam] [Mount, David M.] [Salowe, Jeffrey S.] Smid, Michiel Euclidean spanners: short, thin, and lanky In: 27th Annual ACM Symposium on Theory of Computing (STOC95), 489-498 Proceedings Article 1 Moura, Arnaldo V. (ed.) 1998 Jansen, Klaus A New Characterization for Parity Graphs and a Coloring Problem with Costs In: Proceedings of the 3rd Latin American Symposium on Theoretical Informatics (Latin-98), 249-260 Proceedings Article 4 Mourrain, Bernard 2009 Hemmer, Michael [Tsigaridas, Elias P.] [Zafeirakopoulos, Zafeirakis] [Emiris, Ioannis Z.] [Karavelas, Menelaos I.] [Mourrain, Bernard] Experimental evaluation and cross-benchmarking of univariate real solvers In: Symbolic Numeric Computation 2009 (SNC 2009), 45-54 Proceedings Article 2008 [Emiris,Ioannis] Hemmer, Michael [Karavelas, Menelaos] [Limbach, Sebastian] [Mourrain, Bernard] [Tsigaridas, Elias] [Zafeirakopoulos,Zafeirakis] Cross-benchmarks of univariate algebraic kernels Report 2008 [Emiris, Ioannis Z.] Hemmer, Michael [Karavelas, Menelaos] [Mourrain, Bernard] [Tsigaridas, Elias P.] [Zafeirakopoulos, Zafeirakis] Experimental evaluation and cross-benchmarking of univariate real solvers Report 2007 [Mourrain, Bernard] [Pion, Sylvain] Schmitt, Susanne [Técourt, Jean-Pierre] [Tsigaridas, Elias] Wolpert, Nicola Algebraic Issues in Computational Geometry In: Effective Computational Geometry for Curves and Surfaces, 117-155 Part of a Book 1 Mozes, Shay 2014 Gawrychowski, Pawel [Mozes, Shay] [Weimann, Oren] Improved Submatrix Maximum Queries in Monge Matrices In: Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I, 525-537 Proceedings Article 1 Mucherino, Antonio (ed.) 2009 [Correa, Jose R.] Megow, Nicole Raman, Rajiv [Suchan, Karol] Cardinality Constrained Graph Partitioning into Cliques with Submodular Costs In: 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2009), 347-350 Proceedings Article 1 Mueck, Thomas 1998 Mueck, Thomas Implementation of Hammock Decomposition with Application to Shortest Path Problems Universität des Saarlandes Thesis - Masters thesis 4 Müller-Hannemann, Matthias (ed.) 2011 Berberich, Eric Emeliyanenko, Pavel Sagraloff, Michael An Elimination Method for Solving Bivariate Polynomial Systems: Eliminating the Usual Drawbacks In: 2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX), 35-47 Proceedings Article 2011 Doerr, Benjamin [Künnemann, Marvin] Wahlström, Magnus Dependent Randomized Rounding: The Bipartite Case In: 2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX), 96-106 Proceedings Article 2010 Berberich, Eric [Hagen, Matthias] [Hiller, Benjamin] [Moser, Hannes] Experiments In: Algorithm Engineering : Bridging the Gap between Algorithm Theory and Practice, 325-388 Part of a Book 2010 [Mörig, Marc] [Scholz, Sven] [Tscheuschner, Tobias] Berberich, Eric Implementation aspects In: Algorithm Engineering : Bridging the Gap between Algorithm Theory and Practice, 237-289 Part of a Book 1 Müller, Haiko 1998 [Bodlaender, Hans L.] [Deogun, Jitender S.] Jansen, Klaus [Kloks, Ton] [Kratsch, Dieter] [Müller, Haiko] [Tuza, Zsolt] Ranking of Graphs In: SIAM Journal on Discrete Mathematics [11], 168-181 Journal Article 2 Müller, Joachim 2012 Baumbach, Jan Friedrich, Tobias Kötzing, Timo [Krohmer, Anton] Müller, Joachim Pauling, Josch Efficient algorithms for extracting biological key pathways with global constraints In: GECCO'12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation, 169-176 Proceedings Article 2012 Alcaraz, Nicolas Friedrich, Tobias Kötzing, Timo [Krohmer, Anton] Müller, Joachim Pauling, Josch Baumbach, Jan Efficient key pathway mining: combining networks and OMICS data In: Integrative Biology [4], 756-764 Journal Article 2 Müller, Matthias 1998 Müller, Matthias Ein Simulator für Prozessornetzwerke Universität des Saarlandes Thesis - Masters thesis 1998 Sanders, Peter [Reussner, Ralf] [Prechelt, Lutz] [Müller, Matthias] SKaMPI: A Detailed, Accurate MPI Benchmark In: Proceedings of the 5th European PVM/MPI Users' Group Meeting, 52-59 Proceedings Article 3 Müller, Michael 1998 Mehlhorn, Kurt Müller, Michael Näher, Stefan Schirra, Stefan Seel, Michael Uhrig, Christian Ziegler, Joachim A computational basis for higher-dimensional computational geometry and applications In: Computational Geometry: Theory and Applications [10], 289-304 Journal Article 1997 Mehlhorn, Kurt Müller, Michael Näher, Stefan Schirra, Stefan Seel, Michael Uhrig, Christian Ziegler, Joachim A Computational Basis for Higher-dimensional Computational Geometry and Applications In: Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), 254-263 Proceedings Article 1996 Müller, Michael Rüb, Christine [Rülling, Wolfgang] A Circuit for Exact Summation of Floating-Point Numbers In: Information Processing Letters [57], 159-163 Journal Article 8 Müller, Peter 2002 Althaus, Ernst [Kohlbacher, Oliver] [Lenhof, Hans-Peter] Müller, Peter A combinatorial approach to protein docking with flexible side chains In: Journal of Computational Biology [9], 597-612 Journal Article 2000 Althaus, Ernst Kohlbacher, Oliver Lenhof, Hans-Peter Müller, Peter A Combinatorial Approach to Protein Docking with Flexible Side-Chains In: Proceedings of the 4th Annual International Conference on Computational Molecular Biology (RECOMB-00), 15-24 Proceedings Article 2000 [Jung, Bernd] Lenhof, Hans-Peter Müller, Peter Rüb, Christine Simulating synthetic polymer chains in parallel In: Future Generation Computer Systems [16], 513-522 Journal Article 1999 Müller, Peter Parallel molecular dynamics simulations for synthetic polymers Universität des Saarlandes Thesis - PhD thesis 1999 [Jung, Bernd] Lenhof, Hans-Peter Müller, Peter Rüb, Christine Simulating synthetic polymer chains in parallel In: Proceedings of the 7th International Conference on High-Performance Computing and Networking Europe (HPCN Europe-99), 13-22 Proceedings Article 1997 [Jung, Bernd] Lenhof, Hans-Peter Müller, Peter Rüb, Christine Langevin dynamics simulations of macromolecules on parallel computers In: Macromolecular Theory and Simulation [6], 507-521 Journal Article 1997 [Jung, Bernd] Lenhof, Hans-Peter Müller, Peter Rüb, Christine Parallel MD-simulations of synthetic polymers In: Parallel processing for scientific computing (PPSC-97) : 8th SIAM conference, CD-ROM Proceedings Article 1995 Müller, Peter Ein effizienter paralleler Molekulardynamik-Simulationsalgorithmus für synthetische Polymere Universität des Saarlandes Thesis - Masters thesis 2 Müller, Tobias 2011 [Müller, Tobias] Perez-Gimenez, Xavier [Wormald, Nicholas] Disjoint Hamilton cycles in the random geometric graph In: Journal of Graph Theory [68], 299-322 Journal Article 2004 [Henz, Martin] [Müller, Tobias] Thiel, Sven Global constraints for round robin tournament scheduling In: European Journal of Operational Research [153], 92-101 Journal Article 4 Mütze, Torsten 2012 [Belfrage, Michael] [Mütze, Torsten] Spöhel, Reto Probabilistic one-player Ramsey games via deterministic two-player games In: SIAM Journal on Discrete Mathematics [26], 1031-1049 Journal Article 2011 [Mütze, Torsten] [Rast, Thomas] Spöhel, Reto Coloring random graphs online without creating monochromatic subgraphs In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), 145-158 Proceedings Article 2011 [Mütze, Torsten] Spöhel, Reto On the path-avoidance vertex-coloring game In: The Electronic Journal of Combinatorics [18], 1-33 Electronic Journal Article 2011 [Mütze, Torsten] Spöhel, Reto On the path-avoidance vertex-coloring game In: The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, 657-662 Electronic Proceedings Article 1 Munro, I. 1993 Hagerup, Torben Mehlhorn, Kurt Munro, I. Maintaining Discrete Probability Distributions Optimally In: Automata, languages and programming (ICALP-93) : 20th international colloquium, 253-264 Proceedings Article 1 Munro, J. 1984 Alt, Helmut Mehlhorn, Kurt Munro, J. On the complexity of partial match retrieval In: Information Processing Letters [19], 61-65 Journal Article 4 Munro, J. Ian 2011 Farzan, Arash [Munro, J. Ian] Succinct representation of dynamic trees In: Theoretical Computer Science [412], 2668-2678 Journal Article 2005 Kaligosi, Kanela Mehlhorn, Kurt [Munro, J. Ian] [Sanders, Peter] Towards Optimal Multiple Selection In: Automata, languages and programming : 32nd International Colloquim, ICALP 2005, 103-114 Proceedings Article 1984 Alt, Helmut Mehlhorn, Kurt Munro, J. Ian Partial match retrieval in implicit data structures In: Information Processing Letters [19], 61-65 Journal Article 1981 Alt, Helmut Mehlhorn, Kurt Munro, J. Ian Partial Match Retrieval in Implicit Data Structures In: Mathematical foundations of computer science (MFCS-81) : 10th symposium, ,, 156-161 Proceedings Article 1 Mun, Youngsong (ed.) 2006 Kettner, Lutz Mehlhorn, Kurt [Pion, Sylvain] [Schirra, Stefan] [Yap, Chee] Reply to "Backward Error Analysis ..." In: Computational Science and Its Applications - ICCSA 2006, I, 60-60 Proceedings Article 2 Murlak, Filip (ed.) 2011 [Berenbrink, Petra] [Friedetzky, Tom] [Elsaesser, Robert] [Nagel, Lars] Sauerwald, Thomas Faster Coupon Collecting via Replication with Applications in Gossiping In: 36th International Symposium on Mathematical Foundations of Computer Science (MFCS-11), 72-83 Proceedings Article 2011 [Bredereck, Robert] [Nichterlein, Andr{\'e}] [Niedermeier, Rolf] Philip, Geevarghese Pattern-Guided Data Anonymization and Clustering In: Mathematical Foundations of Computer Science 2011 - 36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011. Proceedings, 182-193 Proceedings Article 1 Musial, Peter M. 2005 Kowalski, Dariusz [Musial, Peter M.] [Shvartsman, Alexander] Explicit combinatorial structures for cooperative distributed algorithms In: 25th IEEE International Conference on Distributed Computing Systems (ICDCS'05), 49-58 Proceedings Article 1 Musser, David R. (ed.) 2000 [Brönnimann, Hervé] [Kettner, Lutz] Schirra, Stefan [Veltkamp, Remco] Applications of the Generic Programming Paradigm in the Design of CGAL In: Generic programming - International Seminar on Generic Programming Dagstuhl Castle, Germany, April 27 - May 1, 1998, selected papers, 206-216 Part of a Book 1 Musser, David (ed.) 2006 Kettner, Lutz Reference Counting in Library Design---Optionally and with Union-Find Optimization In: Proceedings of the First International Workshop on Library-Centric Software Design, LCSD'05, 34-43 Proceedings Article 7 Mustafa, Nabil H. 2010 [Basit, Abdul] [Mustafa, Nabil H.] Ray, Saurabh [Raza, Sarfraz] Centerpoints and Tverberg's technique In: Computational Geometry [43], 593-600 Journal Article 2010 Mustafa, Nabil H. Ray, Saurabh Improved Results on Geometric Hitting Set Problems In: Discrete & Computational Geometry [44], 883-895 Journal Article 2007 Mustafa, Nabil H. [Ray, Saurabh] An Optimal Generalization of the Centerpoint Theorem, and its Extensions In: Proceedings of the Twenty-Third Annual Symposium on Computational Geometry (SCG'07), 138-141 Proceedings Article 2007 [Ray, Saurabh] Mustafa, Nabil H. Weak $\epsilon$-nets have a basis of size $O(1/\epsilon\log 1/\epsilon)$ in any dimension In: Proceedings of the Twenty-Third Annual Symposium on Computational Geometry (SCG'07), 239-244 Proceedings Article 2006 Elbassioni, Khaled M. Mustafa, Nabil H. Conflict-Free Colorings of Rectangle Ranges In: STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, 254-263 Proceedings Article 2005 Elbassioni, Khaled M. Fishkin, Aleksei V. Mustafa, Nabil H. Sitters, Rene Approximation algorithms for Euclidean Group TSP In: Automata, languages and programming : 32nd International Colloquim, ICALP 2005, 1115-1126 Proceedings Article 2005 Elbassioni, Khaled M. Mustafa, Nabil H. Conflict-Free Colorings of Rectangle Ranges for Wireless Networks Unpublished/Draft 3 Muthukrishnan, S. 1998 [Crochemore, Maxime] Gasieniec, Leszek [Hariharan, Ramesh] [Muthukrishnan, S.] [Rytter, Wojciech] A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern Matching In: SIAM Journal on Computing [27], 668-681 Journal Article 1997 Czumaj, Artur Ferragina, Paolo Gasieniec, Leszek [Muthukrishnan, S.] Träff, Jesper Larsson The Architecture of a Software Library for String Processing In: Proceedings of the Workshop on Algorithm Engineering (WAE-97), 166-176 Proceedings Article 1995 Hariharan, Ramesh [Muthukrishnan, S.] String Matching over a General Matching Relation In: Information and Computation [122], 140-148 Journal Article 44 Mutzel, Petra 2003 Klau, Gunnar W. Mutzel, Petra Automatic Layout and Labelling of State Diagrams In: Mathematics: Key Technology for the Future : Joint Projects Between Universities and Industry, 584-608 Part of a Book 2001 Mutzel, Petra An alternative method to crossing minimization on hierarchical graphs In: SIAM Journal on Optimization [11], 1065-1080 Journal Article 2001 [Klau, Gunnar W.] Klein, Karsten [Mutzel, Petra] An Experimental Comparison of Orthogonal Compaction Algorithms In: Proceedings of the 8th International Symposium on Graph Drawing (GD-00), 37-51 Proceedings Article 2000 [Kececioglu, John] Lenhof, Hans-Peter Mehlhorn, Kurt Mutzel, Petra Reinert, Knut [Vingron, Martin] A polyhedral approach to sequence alignment problems In: Discrete Applied Mathematics [104], 143-186 Journal Article 2000 Klau, Gunnar W. Mutzel, Petra Optimal Labelling of Point Features in the Slider Model In: Computing and Combinatorics, Proceedings of the 6th Annual International Conference (COCOON-00), 340-350 Proceedings Article 2000 Mutzel, Petra Ziegler, Thomas The Constrained Crossing Minimization Problem In: Graph Drawing, Proceedings of the 7th International Symposium (GD-99), 175-185 Proceedings Article 1999 Klau, Gunnar W. Mutzel, Petra Combining Graph Labeling and Compaction In: Proceedings of the 7th International Symposium on Graph Drawing (GD-99), 27-37 Proceedings Article 1999 Mutzel, Petra [Eades, Peter] Graph Drawing Algorithms In: Algorithms & Theory of Computation Handbook, 9-1-9-26 Part of a Book 1999 [Brandenburg, Franz J.] [Schreiber, Falk] [Jünger, Michael] [Marks, Joe] Mutzel, Petra Graph Drawing Contest Report In: Proceedings of the 7th International Symposium on Graph Drawing (GD-99), 400-409 Proceedings Article 1999 Klau, Gunnar W. Mutzel, Petra Optimal Compaction of Orthogonal Grid Drawings In: Proceedings of the 7th International Conference on Integer Programming and Combinatorial Optimization (IPCO-99), 304-319 Proceedings Article 1999 Mutzel, Petra Weiskircher, René Optimizing Over All Combinatorial Embeddings of a Planar Graph In: Proceedings of the 7th International Conference on Integer Programming and Combinatorial Optimization (IPCO-99), 361-376 Proceedings Article 1999 Mutzel, Petra Ziegler, Thomas The constrained crossing minimization problem: a first approach In: Operations Research Proceedings 1998, 125-134 Proceedings Article 1999 Mutzel, Petra Zeichnen von Diagrammen - Theorie und Praxis Universität des Saarlandes Thesis - Habilitation thesis 1998 Fialko, Sergej Mutzel, Petra A new approximation algorithm for the planar augmentation problem In: Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-98), 260-269 Proceedings Article 1998 Jünger, Michael [Leipert, Sebastian] Mutzel, Petra A Note on Computing a Maximal Planar Subgraph using PQ-Trees In: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems [17], 609-612 Journal Article 1998 Mutzel, Petra Gutwenger, Carsten Brockenauer, Ralf Fialko, Sergej Klau, Gunnar W. Krüger, Michael Ziegler, Thomas [Näher, Stefan] [Alberts, David] [Ambras, Dirk] [Koch, Gunter] [Jünger, Michael] [Buchheim, Christoph] [Leipert, Sebastian] AGD: A Library of Algorithms for Graph Drawing In: Proceedings of the 6th International Symposium on Graph Drawing (GD-98), 456-457 Proceedings Article 1998 [Biedl, Therese] [Kaufmann, Michael] Mutzel, Petra Drawing Planar Partitions II: HH-Drawings In: Proceedings of the 24th Workshop on Graph-Theoretic Concepts in Computer Science (WG-98), 124-136 Proceedings Article 1998 [Eades, Peter] Mutzel, Petra Graph Drawing Algorithms In: Algorithms and Theory of Computation Handbook, 9-26 Part of a Book 1998 [Eades, Peter] [Marks, Joe] Mutzel, Petra [North, Stephen] Graph Drawing Contest Report In: Proceedings of the 6th International Symposium on Graph Drawing (GD-98), 423-435 Proceedings Article 1998 [Jünger, Michael] [Leipert, Sebastian] Mutzel, Petra Level Planarity Testing in Linear Time In: Proceedings of the 6th International Symposium on Graph Drawing (GD-98), 224-237 Proceedings Article 1998 Gutwenger, Carsten Mutzel, Petra Planar Polyline Drawings with Good Angular Resolution In: Proceedings of the 6th International Symposium on Graph Drawing (GD-98), 167-182 Proceedings Article 1998 [Jünger, Michael] Mutzel, Petra [Odenthal, Thomas] [Scharbrodt, M.] The thickness of a minor-excluded class of graphs In: Discrete Mathematics [182], 169-176 Journal Article 1998 Mutzel, Petra Odenthal, Thomas Scharbrodt, M. The thickness of graphs: A survey In: Graphs and Combinatorics [14], 59-73 Journal Article 1998 Mutzel, Petra Weiskircher, René Two-Layer Planarization in Graph Drawing In: Proceedings of the 9th International Symposium on Algorithms and Computation (ISAAC-98), 69-78 Proceedings Article 1997 [Jünger, Michael] Mutzel, Petra 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms In: Journal of Graph Algorithms and Applications [1], 1-25 Journal Article 1997 Reinert, Knut Lenhof, Hans-Peter Mehlhorn, Kurt Mutzel, Petra Kececioglu, John A Branch-And-Cut algorithm for multiple sequence alignment In: Proceedings of the 1st Annual International Conference on Computational Molecular Biology (RECOMB-97), 241-250 Proceedings Article 1997 [Christof, Thomas] [Jünger, Michael] [Kececioglu, John] Mutzel, Petra [Reinelt, Gerhard] A Branch-And-Cut Approach to Physical Mapping of Chromosomes by Unique End-Probes In: Journal of Computational Biology [4], 433-447 Journal Article 1997 Christof, Thomas [Jünger, Michael] Kececioglu, John Mutzel, Petra [Reinelt, Gerhard] A branch-and-cut approach to physical mapping with end-probes In: Proceedings of the 1st Annual International Conference on Computational Molecular Biology (RECOMB-97), 84-92 Proceedings Article 1997 [Jünger, Michael] Lee, E. K. Mutzel, Petra [Odenthal, Thomas] A Polyhedral Approach to the Multi-Layer Crossing Minimization Problem In: Proceedings of the 5th Symposium on Graph Drawing (GD-97), 13-24 Proceedings Article 1997 [Alberts, David] Gutwenger, Carsten Mutzel, Petra [Näher, Stefan] AGD-Library: A Library of Algorithms for Graph Drawing In: Proceedings of the Workshop on Algorithm Engineering (WAE-97), 112-123 Proceedings Article 1997 [Brandenburg, Franz J.] [Jünger, Michael] Mutzel, Petra Algorithmen zum automatischen Zeichnen von Graphen In: Informatik Spektrum [20], 199-207 Journal Article 1997 Hundack, Christoph Mutzel, Petra [Pouchkarev, Igor] [Thome, Stefan] ArchE: A Graph Drawing System for Archaeology In: Proceedings of the 5th Symposium on Graph Drawing (GD-97), 297-302 Proceedings Article 1997 [Vingron, Martin] Lenhof, Hans-Peter Mutzel, Petra Computational Molecular Biology In: Annotated Bibliographies in Combinatorial Optimization, 445-471 Part of a Book 1997 [Jünger, Michael] [Leipert, Sebastian] Mutzel, Petra Pitfalls of using PQ-Trees in Automatic graph Drawing In: Proceedings of the 5th Symposium on Graph Drawing (GD-97), 193-204 Proceedings Article 1997 [Brandenburg, Franz J.] [Jünger, Michael] Mutzel, Petra [Lengauer, Thomas] SPP 731 : Algorithmen zum automatischen Zeichnen von Graphen im Rahmen des DFG-Schwerpunkts "Effiziente Algorithmen für diskrete Probleme und ihre Anwendungen" In: Informatik '97 : Informatik als Innovationsmotor : 27. Jahrestagung der Gesellschaft für Informatik, 58-67 Proceedings Article 1996 Mutzel, Petra An alternative method to crossing minimization on hierarchical graphs In: Proceedings of the 4th Symposium on Graph Drawing (GD-96), 318-333 Proceedings Article 1996 [Jünger, Michael] Mutzel, Petra Exact and heuristic algorithms for 2-layer straightline crossing minimization In: Graph Drawing (GD95), - Proceedings Article 1996 [De Simone, Caterina] [Diehl, Martin] [Jünger, Michael] Mutzel, Petra [Reinelt, Gerhard] [Rinaldi, Giovanni] Exact Ground States of Two-Dimensional +-J Ising Spin Glasses In: Journal of Statistical Physics [84], 1363-1371 Journal Article 1996 [Jünger, Michael] Mutzel, Petra Maximum planar subgraphs and nice embeddings: Practical layout tools In: Algorithmica [16], 33-59 Journal Article 1996 Mehlhorn, Kurt Mutzel, Petra On the Embedding Phase of the Hopcroft and Tarjan Planarity Testing Algorithm In: Algorithmica [16], 233-242 Journal Article 1995 Mutzel, Petra A Polyhedral Approach to Planar Augmentation and Related Problems In: Algorithms - ESA'95: 3rd Annual European Symposium, 494-507 Proceedings Article 1995 [DeSimone, Caterina] [Diehl, Martin] [Jünger, Michael] Mutzel, Petra [Reinelt, Gerhard] [Rinaldi, Giovanni] Exact Ground States of Ising Spin Glasses: New Experimental Results With a Branch and Cut Algorithm In: Journal of Statistical Physics [80], 487-496 Journal Article 1995 [Jünger, Michael] Mutzel, Petra The Polyhedral Approach to the Maximum Planar Subgraph Problem: New Chances for Related Problems In: Graph Drawing: DIMACS International Workshop (GD94), 119-130 Proceedings Article 1995 [Juurlink, Ben] Mutzel, Petra ? In: Conference on High-Performance Computing, 125-130 Proceedings Article 3 Myers, Gene (ed.) 1996 [Brodal, Gerth Stølting] Gasieniec, Leszek Approximate Dictionary Queries In: Combinatorial Pattern Matching: 7th Annual Symposium (CPM'96), 65-74 Proceedings Article 1996 Arikati, Srinivasa Rao [Dessmark, Anders] [Lingas, Andrzej] [Marathe, Madhav V.] Approximation algorithms for maximum two-dimensional pattern matching In: Combinatorial Pattern Matching: 7th Annual Symposium, CPM96, 348-360 Proceedings Article 1996 Gasieniec, Leszek [Karpinski, Marek] [Plandowski, Wojciech] [Rytter, Wojciech] Randomized Efficient Algorithms for Compressed Strings: the Finger-Print Approach In: Combinatorial Pattern Matching: 7th Annual Symposium (CPM'96), 39-49 Proceedings Article 1 M. Halldórsson, Magnús (ed.) 2011 Manjunath, Madhusudan Mehlhorn, Kurt Panagiotou, Konstantinos Sun, He Approximate Counting of Cycles in Streams In: 19th Annual European Symposium on Algorithms (ESA-11), 677-688 Proceedings Article 1 Näher, S 1989 Mehlhorn, Kurt Näher, S A library of efficient data types and algorithms In: Mathematical foundations of computer science (MFCS-89) : 14th international symposium, 88-106 Proceedings Article 45 Näher, Stefan 2011 Mehlhorn, Kurt Näher, Stefan Schweitzer, Pascal Certifying algorithms In: Computer Science Review [5], 119-161 Journal Article 2010 McConnella, Ross M. Mehlhorn, Kurt [Näher, Stefan] [Schweitzer, Pascal] Certifying algorithms In: Computer Science Review [Article in Press], 1-43 Electronic Journal Article 2005 Funke, Stefan Mehlhorn, Kurt Näher, Stefan Structural filtering: a paradigm for efficient and exact geometric programs In: Computational Geometry [31], 179-194 Journal Article 2004 Kettner, Lutz [Näher, Stefan] Two Computational Geometry Libraries: LEDA and CGAL In: Handbook of Discrete and Computational Geometry, 1435-1463 Part of a Book 2000 Althaus, Ernst Mehlhorn, Kurt Näher, Stefan Schirra, Stefan Experiments on curve reconstruction In: Proceedings of 2nd Workshop on Algorithm Engineering and Experiments (ALENEX-00), 103-114 Electronic Proceedings Article 1999 Mehlhorn, Kurt [Näher, Stefan] Seel, Michael [Seidel, Raimund] Schilz, Thomas Schirra, Stefan Uhrig, Christian Checking geometric programs or verification of geometric structures In: Computational Geometry: Theory and Applications [12], 85-104 Journal Article 1999 Mehlhorn, Kurt [Näher, Stefan] LEDA: a platform for combinatorial and geometric computing Book 1999 Funke, Stefan Mehlhorn, Kurt [Näher, Stefan] Structural Filtering: a Paradigm for Efficient and Exact Geometric Programs In: Abstracts for the 11th Canadian Conference on Computational Geometry (CCCG-99), 39-42 Proceedings Article 1998 Mehlhorn, Kurt Müller, Michael Näher, Stefan Schirra, Stefan Seel, Michael Uhrig, Christian Ziegler, Joachim A computational basis for higher-dimensional computational geometry and applications In: Computational Geometry: Theory and Applications [10], 289-304 Journal Article 1998 Mutzel, Petra Gutwenger, Carsten Brockenauer, Ralf Fialko, Sergej Klau, Gunnar W. Krüger, Michael Ziegler, Thomas [Näher, Stefan] [Alberts, David] [Ambras, Dirk] [Koch, Gunter] [Jünger, Michael] [Buchheim, Christoph] [Leipert, Sebastian] AGD: A Library of Algorithms for Graph Drawing In: Proceedings of the 6th International Symposium on Graph Drawing (GD-98), 456-457 Proceedings Article 1998 Mehlhorn, Kurt Näher, Stefan From Algorithms to Working Programs on the Use of Program Checking in LEDA In: Fundamentals - foundations of computer science : XV. IFIP world computer congress, 81-88 Proceedings Article 1998 Mehlhorn, Kurt Näher, Stefan From Algorithms to Working Programs: On the Use of Program Checking in LEDA In: Mathematical foundations of computer science (MFCS-98) : 23rd international symposium, 84-93 Proceedings Article 1997 Mehlhorn, Kurt Müller, Michael Näher, Stefan Schirra, Stefan Seel, Michael Uhrig, Christian Ziegler, Joachim A Computational Basis for Higher-dimensional Computational Geometry and Applications In: Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), 254-263 Proceedings Article 1997 [Alberts, David] Gutwenger, Carsten Mutzel, Petra [Näher, Stefan] AGD-Library: A Library of Algorithms for Graph Drawing In: Proceedings of the Workshop on Algorithm Engineering (WAE-97), 112-123 Proceedings Article 1997 Mehlhorn, Kurt Näher, Stefan Uhrig, Christian The LEDA platform for combinatorial and geometric computing In: Proceedings of the 24th International Colloquium on Automata, Languages, and Programming (ICALP-97), 7-16 Proceedings Article 1996 Mehlhorn, Kurt [Näher, Stefan] Schilz, Thomas Schirra, Stefan Seel, Michael [Seidel, Raimund] Uhrig, Christian Checking Geometric Programs or Verification of Geometric Structures In: 12th Annual ACM Symposium on Computational Geometry (SCG 96), 159-165 Proceedings Article 1996 Mehlhorn, Kurt Näher, Stefan Uhrig, Christian The LEDA Platform for Combinatorial and Geometric Computing In: Beherrschung von Informationssystemen : Tagungsband der Informatik '96 ; GI - 26. Jahrestagung, 43-50 Proceedings Article 1995 Burnikel, Christoph Könemann, Jochen Mehlhorn, Kurt [Näher, Stefan] Schirra, Stefan Uhrig, Christian Exact Geometric Computation in LEDA In: 11th ACM Symposium on Computational Geometry (SCG95), C18-C19 Proceedings Article 1995 Mehlhorn, Kurt Näher, Stefan LEDA : A Platform for Combinatorial and Geometric Computing Report 1995 Mehlhorn, Kurt [Näher, Stefan] LEDA: A Platform for Combinatorial and Geometric Computing In: Communications of the ACM [38], 96-102 Journal Article 1994 Mehlhorn, Kurt Näher, Stefan Nievergelt, Jurg Introduction In: Journal of Symbolic Computation [17], 295-295 Journal Article 1994 Mehlhorn, Kurt Näher, Stefan The Implementation of Geometric Algorithms In: Technology and foundations : Information Processing '94 ; proceedings of the IFIP 13th World Computer Congress, 223-231 Proceedings Article 1992 Mehlhorn, Kurt Näher, Stefan Algorithm Design and Software Libraries: Recent Developments in the LEDA Project In: Proceedings of the IFIP 12th World Computer Congress. Volume 1: Algorithms, Software, Architecture, 493-508 Proceedings Article 1992 Alt, Helmut Fleischer, Rudolf Kaufmann, Michael Mehlhorn, Kurt Näher, Stefan Schirra, Stefan Uhrig, Christian Approximate motion planning and the complexity of the boundary of the union of simple geometric figures In: Algorithmica [8], 391-408 Journal Article 1992 Fleischer, Rudolf Fries, Otfried Mehlhorn, Kurt Meiser, Stefan Näher, Stefan Rohnert, Hans Schirra, Stefan Simon, Klaus Tsakalidis, Athanasios Uhrig, Christian Selected Topics from Computational Geometry, Data Structures and Motion Planning In: Data Structures and Efficient Algorithms, Final Report on the DFG Special Joint Initiative, 25-43 Part of a Book 1990 Mehlhorn, Kurt Näher, Stefan A faster compaction algorithm with automatic jog insertion In: IEEE Transactions on CAD of Integrated Circuits and Systems [9], 158-166 Journal Article 1990 Alt, Helmut Fleischer, Rudolf Kaufmann, Michael Mehlhorn, Kurt Näher, Stefan Schirra, Stefan Uhrig, Christian Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures In: Computational geometry (SCG-90) : 6th annual symposium, 281-289 Proceedings Article 1990 Mehlhorn, Kurt Näher, Stefan Bounded ordered dictionaries in $O(\log \log n)$ time and $O(n)$ space In: Information Processing Letters [35], 183-189 Journal Article 1990 Mehlhorn, Kurt Näher, Stefan Dynamic Fractional Cascading In: Algorithmica [5], 215-241 Journal Article 1990 Mehlhorn, Kurt Näher, Stefan Uhrig, Christian Hidden line elimination for isooriented rectangles Report 1990 Mehlhorn, Kurt Näher, Stefan Uhrig, Christian Hidden line elimination for isooriented rectangles In: Information Processing Letters [35], 137-143 Journal Article 1990 Näher, Stefan Mehlhorn, Kurt LEDA - A Library of Efficient Data Types and Algorithms In: GI - 20. Jahrestagung I, Informatik auf dem Weg zum Anwender, 35-39 Proceedings Article 1990 Näher, Stefan Mehlhorn, Kurt LEDA: A Library of Efficient Data Types and Algorithms In: Automata, languages and programming (ICALP-90) : 17th international colloquium, 1-5 Proceedings Article 1990 Mehlhorn, Kurt Näher, Stefan Rauch, Monika On the Complexity of a Game Related to the Dictionary Problem In: SIAM Journal on Computing [19], 902-906 Journal Article 1989 Mehlhorn, Kurt Näher, Stefan LEDA: A library of efficient data types and algorithms In: Mathematical foundations of computer science (MFCS-89) : 14th international symposium, 88-106 Proceedings Article 1989 Mehlhorn, Kurt Näher, Stefan Rauch, Monika On the Complexity of a Game Related to the Dictionary Problem In: 30th Annual Symposium on Foundations of Computer Science (FOCS 1989), 546-548 Proceedings Article 1988 Mehlhorn, Kurt Näher, Stefan Alt, Helmut A Lower Bound on the Complexity of the Union-Split-Find Problem In: SIAM Journal on Computing [17], 1093-1102 Journal Article 1987 Mehlhorn, Kurt Näher, Stefan A faster compaction algorithm with automatic jog insertion Report 1987 Mehlhorn, Kurt Näher, Stefan Alt, Helmut A Lower Bound for the Complexity of the Union-Split-Find Problem In: Automata, Languages and Programming (ICALP-87) : 14th International Colloquium, 479-488 Proceedings Article 1987 Fries, O. Mehlhorn, Kurt Näher, Stefan Tsakalidis, A. A $\log \log n$ data structure for three-sided range queries In: Information Processing Letters [25], 269-273 Journal Article 1986 Mehlhorn, Kurt Näher, Stefan Alt, Helmut A Lower Bound for the Complexity of the Union-Split-Find Problem Report 1986 Mehlhorn, Kurt Näher, Stefan Dynamic fractional cascading Report 1985 Fries, O. Mehlhorn, Kurt Näher, Stefan Dynamization of geometric data structures Report 1985 Fries, O. Mehlhorn, Kurt Näher, Stefan Dynamization of geometric data structures In: Computational geometry (SCG-85) : 1st symposium, 168-176 Proceedings Article 1982 Becker, Michael Degenhardt, W. Doenhardt, J. Hertel, S. Kaninke, G. Kerber, W. Mehlhorn, Kurt Näher, Stefan Rohnert, H. Winter, T. A Probabilistic Algorithm for Vertex Connectivity of Graphs In: Information Processing Letters [15], 135-136 Journal Article 4 Näher, Stefan (ed.) 2009 Bast, Hannah Car or Public Transport -- Two Worlds In: Efficient Algorithms : Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday, 355-367 Part of a Book 2009 Doerr, Benjamin Introducing Quasirandomness to Computer Science In: Efficient Algorithms : Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday, 99-111 In: Lecture Notes in Computer Science [5760], 99-111 Part of a Book 2000 Mehlhorn, Kurt Schäfer, Guido Implementation of $O(nm \log n)$ weighted matchings: The power of data structures In: 4th International Workshop on Algorithm Engineering, 23-38 Proceedings Article 1994 Special issue on “algorithms: implementation, libraries and use” Book 2 Nagamochi, Hiroshi (ed.) 2008 Bringmann, Karl Friedrich, Tobias Approximating the volume of unions and intersections of high-dimensional geometric objects. In: Proceedings of the 19th International Symposium on Algorithms and Computation (ISAAC 2008), 436-447 Proceedings Article 2008 Friedrich, Tobias Hebbinghaus, Nils Average Update Times for Fully-Dynamic All-Pairs Shortest Paths. In: Proceedings of the 19th International Symposium on Algorithms and Computation (ISAAC 2008), 693-704 Proceedings Article 1 Nagarajan, Viswanath 2010 Bansal, Nikhil [Gupta, Anupam] [Li, Jian] Mestre, Julián [Nagarajan, Viswanath] [Rudra, Atri] When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings (Extended Abstract) In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. II, 218-229 Proceedings Article 1 Nagel, Lars 2011 [Berenbrink, Petra] [Friedetzky, Tom] [Elsaesser, Robert] [Nagel, Lars] Sauerwald, Thomas Faster Coupon Collecting via Replication with Applications in Gossiping In: 36th International Symposium on Mathematical Foundations of Computer Science (MFCS-11), 72-83 Proceedings Article 1 Nakano, Shin-Ichi (ed.) 2011 Friedrich, Tobias Sauerwald, Thomas [Stauffer, Alexandre] Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary Dimensions In: 22nd International Symposium on Algorithms and Computation (ISAAC-11), 190-199 Proceedings Article 1 Nakano, S. (ed.) 1999 Krysta, Piotr Solis-Oba, Roberto Approximation algorithms for bounded facility location In: Proceedings of the 5th Annual International Conference on Computing and Combinatorics (COCOON-99), 241-250 Proceedings Article 1 Nanavati, Akash 2009 Christodoulou, George [Koutsoupias, Elias] [Nanavati, Akash] Coordination Mechanisms In: Theoretical Computer Science [410], 3327-3336 Journal Article 1 Nannicini, Giacomo (ed.) 2009 [Correa, Jose R.] Megow, Nicole Raman, Rajiv [Suchan, Karol] Cardinality Constrained Graph Partitioning into Cliques with Submodular Costs In: 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2009), 347-350 Proceedings Article 2 Nanni, Umberto 1998 [Alberts, David] [Cattaneo, G] [Italiano, Giuseppe] [Nanni, Umberto] Zaroliagis, Christos A Software Library of Dynamic Graph Algorithms In: Proceedings of Workshop on Algorithms and Experiments (ALEX-98), 129-136 Proceedings Article 1998 [Frigioni, Daniele] Miller, Tobias [Nanni, Umberto] [Pasqualone, Giulio] Schäfer, Guido Zaroliagis, Christos An experimental study of dynamic algorithms for directed graphs In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), 368-380 Proceedings Article 1 Nanongkai, Danupon 2013 Elbassioni, Khaled [Chalermsook, Parinya] [Nanongkai, Danupon] Sun, He Multi-Attribute Profit-Maximizing Pricing Unpublished/Draft 1 Naor, Joseph (ed.) 2009 Harren, Rolf van Stee, Rob Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 12th International Workshop, APPROX 2009 and 13th International Workshop, RANDOM 2009, 177-189 Proceedings Article 1 Narayanaswamy, N.S. 2006 [Lotker, Zvi] Majumdar, Debapriyo [Narayanaswamy, N.S.] Weber, Ingmar Sequences Characterizing k-Trees In: Computing and Combinatorics, 12th Annual International Conference, COCOON 2006, 216-225 Proceedings Article 2 Narayan, Oruttom 1996 Arya, Sunil Mount, David M. [Narayan, Oruttom] Accounting for boundary effects in nearest neighbor searching In: Discrete & Computational Geometry [16], 155-176 Journal Article 1995 Arya, Sunil [Mount, David M.] [Narayan, Oruttom] Accounting for boundary effects in nearest neighbor searching In: 11th Annual ACM Symposium on Computational Geometry (SCG95), 336-344 Proceedings Article 1 Nardelli, Enrico (ed.) 2000 Beier, Rene Sibeyn, Jop F. A powerful heuristic for telephone gossiping In: Proceedings of the 7th International Colloquium on Structural Information and Communication Complexity (SIROCCO-00), 17-36 Proceedings Article 1 Narodytska, Nina 2011 [Fellows, Michael R.] Friedrich, Tobias Hermelin, Danny [Narodytska, Nina] [Rosamond, Frances A.] Constraint Satisfaction Problems: Convexity Makes All Different Constraints Tractable In: Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (IJCAI 2011), 522-527 Proceedings Article 1 Narula, Vishal 2012 Elbassioni, Khaled [Garg, Naveen] [Gupta, Divya] [Kumar, Amit] [Narula, Vishal] [Pal, Arindam] Approximation Algorithms for the Unsplittable Flow Problem on Paths and Trees In: 32nd International Conference on Foundations of Software Technology and Theoretical Computer Science : FSTTCS 2012, 267-275 Electronic Proceedings Article 3 Nasre, Meghana 2011 [Kavitha, Telikepalli] Mestre, Julian [Nasre, Meghana] Popular mixed matchings In: Theoretical Computer Science [412], 2679-2690 Journal Article 2008 [Huang, Chien-Chung] Kavitha, Telikepalli [Michail, Dimitrios] [Nasre, Meghana] Bounded Unpopularity Matchings In: 11th Scandinavian Workshop on Algorithm Theory (SWAT), 127-137 Proceedings Article 2008 Kavitha, Telikepalli [Nasre, Meghana] Optimal Popular Matchings Miscellaneous 1 Nasre, M. 2009 [Kavitha, T.] Mestre, Julián [Nasre, M.] Popular Mixed Matchings In: Automata, Languages and Programming : 36th International Colloquium, ICALP 2009, 574-584 Proceedings Article 1 Nasr, Meghana 2011 Huang, Chien-Chung [Kavitha, Telikepalli] [Michael, Dimitrios] [Nasr, Meghana] Bounded Unpopularity Matchings In: Algorithmica [61], 738-757 Journal Article 10 Naujoks, Rouven 2011 [Althaus, Ernst] Kupilas, Joschka Naujoks, Rouven On the Low-Dimensional Steiner Minimum Tree Problem in Hamming Metric In: Theory and Applications of Models of Computation : 8th Annual Conference, TAMC 2011, 308-319 Proceedings Article 2011 [Funke, Stefan] [Laue, Soeren] [Lotker, Zvi] Naujoks, Rouven Power assignment problems in wireless communication: Covering points by disks, reaching few receivers quickly, and energy-efficient travelling salesman tours In: Ad Hoc Networks [9], 1028-1035 Journal Article 2010 [Althaus, Ernst] [Altmeyer, Sebastian] Naujoks, Rouven A New Combinatorial Approach to Parametric Path Analysis Report 2008 Naujoks, Rouven NP-hard Networking Problems - Exact and Approximate Algorithms Universität des Saarlandes Thesis - PhD thesis 2008 Funke, Stefan Laue, Sören Naujoks, Rouven [Lotker, Zvi] Power Assignment Problems in Wireless Communication: Covering Points by Disks, Reaching few Receivers Quickly, and Energy-Efficient Travelling Salesman Tours In: Distributed Computing in Sensor Systems, 4th IEEE International Conference, DCOSS 2008, 282-295 Proceedings Article 2008 Althaus, Ernst Naujoks, Rouven Reconstructing Phylogenetic Networks with One Recombination In: Experimental Algorithms, 7th International Workshop, WEA 2008, 275-288 Proceedings Article 2007 Funke, Stefan Laue, Sören Naujoks, Rouven Minimum Energy Broadcast with Few Senders In: Distributed Computing in Sensor Systems : Third IEEE International Conference, DCOSS 2007, 404-416 Proceedings Article 2006 Althaus, Ernst Naujoks, Rouven Computing Steiner Minimal Trees in Hamming Metric In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'06, 172-181 Proceedings Article 2006 Funke, Stefan Laue, Sören Naujoks, Rouven [Lotker, Zvi] Power Assignment Problems in Wireless Communication In: ??? [?], 1-14 Miscellaneous 2004 Naujoks, Rouven A heuristic for solving interior point Methods exactly Universität des Saarlandes Thesis - Masters thesis 1 Navarro, Gonzalo 2010 Farzan, Arash [Gagie, Travis] [Navarro, Gonzalo] Entropy-Bounded Representation of Point Grids In: Algorithms and Computation : 21st International Symposium, ISAAC 2010. - Pt. II, 327-338 Proceedings Article 1 Nechushtan, Oren 2001 [Bäsken, Matthias] [Brönnimann, Hervé] [Frank, Da] [Devillers, Olivier] [Ester, Ezra] [Fabri, Andreas] [Flato, Eyal] [Gärtner, Bernd] [Giezeman, Geert-Jan] [Halperin, Dan] [Hanniel, Iddo] [Har-Peled, Sariel] [Herrmann, Thomas] Hert, Susan [Hirsch, Shai] [Hoffmann, Michael] Kettner, Lutz [Nechushtan, Oren] [Neyer, Gabriele] [Pasechnik, Dmitrii] [Pion, Sylvain] Schirra, Stefan [Schönherr, Sven] Seel, Michael [Teillaud, Monique] [Veltkamp, Remco] [Wein, Ron] [Wesselink, Wieger] [Yvinec, Mariette] CGAL Reference and User Manuals Unknown Form: eBookForm 1 Nederlof, Jesper 2012 [Cygan, Marek] [Dell, Holger] [Lokshtanov, Daniel] [Marx, Daniel] [Nederlof, Jesper] [Okamoto, Yoshio] [Paturi, Ramamohan] [Saurabh, Saket] Wahlström, Magnus On Problems as Hard as CNF-SAT In: 2012 IEEE 27th Conference on Computational Complexity (CCC 2012), 74-84 Proceedings Article 1 Nedjah, Nadia (ed.) 2009 [Helwig, Sabine] Neumann, Frank [Wanka, Rolf] Particle Swarm Optimization with Velocity Adaptation In: 2009 International Conference on Adaptive and Intelligent Systems ICAIS 2009 : proceedings, 146-151 Proceedings Article 3 Nekrich, Yakov 2014 [Gagie, Travis] Gawrychowski, Pawel [Kärkkäinen, Juha] [Nekrich, Yakov] [Puglisi, Simon J.] LZ77-Based Self-indexing with Faster Pattern Matching In: LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31 - April 4, 2014. Proceedings, 731-742 Proceedings Article 2013 [Gagie, Travis] Gawrychowski, Pawel [Nekrich, Yakov] Heaviest Induced Ancestors and Longest Common Substrings In: 25th Canadian Conference on Computational Geometry (CCCG 13), 145-150 Proceedings Article 2013 Gawrychowski, Pawel [Kucherov, Gregory] [Nekrich, Yakov] [Starikovskaya, Tatiana] Minimal Discriminating Words Problem Revisited In: String Processing and Information Retrieval - 20th International Symposium (SPIRE 2013), Proceedings Article 1 Nemhauser, George (ed.) 2004 [Boros, Endre] Elbassioni, Khaled M. [Gurvich, Vladimir] [Khachiyan, Leonid] Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems In: Integer programming and combinatorial optimization : 10th International IPCO Conference, 152-162 Proceedings Article 2 Nesetril, Jaroslav (ed.) 1999 Krysta, Piotr [Lorys, Krzysztof] Efficient approximation algorithms for the achromatic number In: Proceedings of the 7th Annual European Symposium on Algorithms (ESA-99), 402-413 Proceedings Article 1999 Crauser, Andreas [Ferragina, Paolo] On Constructing Suffix Arrays in External Memory In: Proceedings of the 7th Annual European Symposium on Algorithms (ESA-99), 224-235 Proceedings Article 4 Nešetřil, Jarik (ed.) 2011 Panagiotou, Konstantinos Spöhel, Reto [Steger, Angelika] [Thomas, Henning] Explosive percolation in Erdős-Rényi-like random graph processes In: The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, 699-704 Electronic Proceedings Article 2011 [Gugelmann, Luca] Spöhel, Reto On balanced coloring games in random graphs In: The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, 425-430 Electronic Proceedings Article 2011 [Mütze, Torsten] Spöhel, Reto On the path-avoidance vertex-coloring game In: The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, 657-662 Electronic Proceedings Article 2011 Doerr, Benjamin [Fouz, Mahmoud] Friedrich, Tobias Social Networks Spread Rumors in Sublogarithmic Time In: The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, 303-308 In: Electronic Notes in Discrete Mathematics [38], 303-308 Electronic Proceedings Article 1 Nest, Martin 1998 Nest, Martin Vergleich von praxisnahen seriellen und parallelisierten Verfahren zur Bestimmung der Schnittpunkte von Liniensegmenten in der Ebene Universität des Saarlandes Thesis - Masters thesis 2 Neuhold, Erich J. (ed.) 1976 Güttler, Reiner Mehlhorn, Kurt Schneider, Wolfgang Wernet, Norbert Binary Search Trees: Average and Worst Case Behavior In: GI - 6. Jahrestagung, 301-313 Proceedings Article 1976 Heydthausen, Manfred Mehlhorn, Kurt Top Down Parsing of Macro Grammars In: GI - 6. Jahrestagung, 95-108 Proceedings Article 1 Neukirch, Markus 1994 Neukirch, Markus Grundlegende geometrische Datenstrukturen und Algorithmen für LEDA Universität des Saarlandes Thesis - Masters thesis 4 Neumann, Adrian 2013 Bringmann, Karl Doerr, Benjamin Neumann, Adrian [Sliacan, Jakub] Online Checkpointing with Improved Worst-Case Guarantees In: Automata, Languages, and Programming - 40th International Colloquium (ICALP 2013), 255-266 Proceedings Article 2012 Mehlhorn, Kurt Neumann, Adrian Schmidt, Jens M. Certifying 3-Edge-Connectivity Unpublished/Draft 2012 Bringmann, Karl Mehlhorn, Kurt Neumann, Adrian Remarks on Category-Based Routing in Social Networks Unpublished/Draft 2011 Neumann, Adrian Implementation of Schmidt's algorithm for certifying triconnectivity testing Universität des Saarlandes Thesis - Masters thesis 1 Neumann, A. 2013 Mehlhorn, Kurt Neumann, A. Schmidt, Jens M. Certifying 3-Edge-Connectivity In: 39th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'13), 358-369 Proceedings Article 2 Neumann, Dirk 2000 [Neumann, Dirk] Kohlbacher, Oliver [Haltner, Eleonore] Lenhof, Hans-Peter [Lehr, Claus-Michael] Modeling the Sugar Lectin Interaction by Computational Chemistry Relevant to Drug Design In: Proceedings of the 3rd World Meeting on Pharmaceutics, Biopharmaceutics and Pharmaceutical Technology, 233 Proceedings Article 1998 [Neumann, Dirk] [Haltner, Elleonore] [Lehr, Claus-Michael] Kohlbacher, Oliver Lenhof, Hans-Peter Investigating the Sugar-Lectin Interaction by Computational Chemistry: Tunneling the Epithelial Barrier In: Proceedings of the 18th Interlec Meeting, 549 Proceedings Article 67 Neumann, Frank 2013 Doerr, Benjamin [Johannsen, Daniel] Kötzing, Timo [Neumann, Frank] [Theile, Madeleine] More effective crossover operators for the all-pairs shortest path problem In: Theoretical Computer Science [471], 12-26 Journal Article 2012 Kötzing, Timo [Sutton, Andrew M.] [Neumann, Frank] [O'Reilly, Una-May] The max problem revisited: the importance of mutation in genetic programming In: GECCO’12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation, 1333-1340 Proceedings Article 2012 Kötzing, Timo [Neumann, Frank] [Röglin, Heiko] [Witt, Carsten] Theoretical analysis of two ACO approaches for the traveling salesman problem In: Swarm Intelligence [6], 1-21 Journal Article 2012 Friedrich, Tobias [Kroeger, Trent] [Neumann, Frank] Weighted preferences in evolutionary multi-objective optimization In: International Journal of Machine Learning and Cybernetics [Online First], 1-10 Electronic Journal Article 2011 Bringmann, Karl Friedrich, Tobias [Neumann, Frank] [Wagner, Markus] Approximation-guided evolutionary multi-objective optimization In: Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (IJCAI 2011), 1198-1203 Proceedings Article 2011 [Durrett, Greg] [Neumann, Frank] [O'Reilly, Una-May] Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics In: FOGA'11 : Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, 69-80 Proceedings Article 2011 Neumann, Frank [Reichel, Joachim] [Skutella, Martin] Computing Minimum Cuts by Randomized Search Heuristics In: Algorithmica [59], 323-342 Journal Article 2011 Doerr, Benjamin [Eremeev, Anton] Neumann, Frank [Theile, Madeleine] [Thyssen, Christian] Evolutionary algorithms and dynamic programming In: Theoretical Computer Science [412], 6020-6035 Journal Article 2011 Friedrich, Tobias [Horoba, Christian] Neumann, Frank Illustration of fairness in evolutionary multi-objective optimization In: Theoretical Computer Science [412], 1546-1556 Journal Article 2011 [Mainberger, Markus] [Hoffmann, Sebastian] [Weickert, Joachim] Tang, Ching Hoo [Johannsen, Daniel] [Neumann, Frank] Doerr, Benjamin Optimising Spatial and Tonal Data for Homogeneous Diffusion Inpainting In: Scale Space and Variational Methods in Computer Vision : Third International Conference, SSVM 2011, 26-37 Proceedings Article 2011 Wagner, Markus [Veeramachaneni, Kalyan] [Neumann, Frank] [O'Reilly, Una-May] Optimizing the Layout of 1000 Wind Turbines In: European Wind Energy Association Annual Event, 1-10 Proceedings Article 2011 Kötzing, Timo [Neumann, Frank] Spöhel, Reto PAC learning and genetic programming In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 2091-2096 Proceedings Article 2011 Doerr, Benjamin [Neumann, Frank] [Sudholt, Dirk] [Witt, Carsten] Runtime analysis of the 1-ANT ant colony optimizer In: Theoretical Computer Science [412], 1629-1644 Journal Article 2011 Kötzing, Timo [Neumann, Frank] [Sudholt, Dirk] [Wagner, Markus] Simple max-min ant systems and the optimization of linear pseudo-Boolean functions In: FOGA'11 : Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, 209-218 Proceedings Article 2010 Kötzing, Timo [Lehre, Per Kristian] Neumann, Frank [Oliveto, Pietro S.] Ant Colony Optimization and the Minimum Cut Problem In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 1393-1400 Proceedings Article 2010 Neumann, Frank [Witt, Carsten] Ant Colony Optimization and the minimum spanning tree problem In: Theoretical Computer Science [411], 2406-2413 Journal Article 2010 Friedrich, Tobias [He, Jun] Hebbinghaus, Nils Neumann, Frank [Witt, Carsten] Approximating Covering Problems by Randomized Search Heuristics using Multi-Objective Models In: Evolutionary Computation [18], 617 - 633 Journal Article 2010 Neumann, Frank [Witt, Carsten] Bioinspired Computation in Combinatorial Optimization : Algorithms and Their Computational Complexity Book 2010 Doerr, Benjamin Neumann, Frank [Wegener, Ingo] Editorial In: Algorithmica [57], 119-120 Journal Article 2010 [Jansen, Thomas] Neumann, Frank Editorial for the Special Issue on Theoretical Aspects of Evolutionary Multi-Objective Optimization In: Evolutionary Computation [18], 333-334 Journal Article 2010 Kratsch, Stefan [Lehre, Per Kristian] [Neumann, Frank] [Oliveto, Pietro Simone] Fixed Parameter Evolutionary Algorithms and Maximum Leaf Spanning Trees: A Matter of Mutation In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 204-213 Proceedings Article 2010 Doerr, Benjamin Neumann, Frank In Memoriam: Ingo Wegener In: Algorithmica [58], 541-542 Journal Article 2010 Doerr, Benjamin Johannsen, Daniel Kötzing, Timo Neumann, Frank [Theile, Madeleine] More Effective Crossover Operators for the All-Pairs Shortest Path Problem In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 184-193 Proceedings Article 2010 [Böttcher, Süntje] Doerr, Benjamin Neumann, Frank Optimal fixed and adaptive mutation rates for the LeadingOnes problem In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 1-10 Proceedings Article 2010 Friedrich, Tobias Hebbinhaus, Nils Neumann, Frank Plateaus Can Be Harder in Multi-Objective Optimization In: Theoretical Computer Science [411], 854-864 Journal Article 2010 [Berghammer, Rudolf] Friedrich, Tobias Neumann, Frank Set-based Multi-Objective Optimization, Indicators, and Deteriorative Cycles In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 495-502 Proceedings Article 2010 Kötzing, Timo Neumann, Frank [Röglin, Heiko] [Witt, Carsten] Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem In: Swarm Intelligence : 7th International Conference, ANTS 2010, 324-335 Proceedings Article 2010 Friedrich, Tobias Neumann, Frank When to Use Bit-Wise Neutrality In: Natural Computing [9], 283 - 294 Journal Article 2009 [Horoba, Chrisitian] Neumann, Frank Additive Approximations of Pareto-Optimal Sets by Evolutionary Multi-Objective Algorithms In: FOGA'09 : Revised Selected Papers from ACM SIGEVO Foundations of Genetic Algorithms X, 79-86 Proceedings Article 2009 Friedrich, Tobias [He, Jun] Hebbinghaus, Nils Neumann, Frank [Witt, Carsten] Analyses of Simple Hybrid Algorithms for the Vertex Cover Problem In: Evolutionary Computation, [17], 3-19 Journal Article 2009 Neumann, Frank [Sudholt, Dirk] [Witt, Carsten] Analysis of Different MMAS ACO Algorithms on Unimodal Functions and Plateaus In: Swarm Intelligence [3], 35-68 Journal Article 2009 Friedrich, Tobias Hebbinghaus, Nils Neumann, Frank Comparison of Simple Diversity Mechanisms on Plateau Functions In: Theoretical Computer Science [410], 2455-2462 Journal Article 2009 Neumann, Frank [Sudholt, Dirk] [Witt, Carsten] Computational Complexity of Ant Colony Optimization and Its Hybridization with Local Search In: Innovations in Swarm Intelligence, 91-120 Part of a Book 2009 [Baswana, Surender] [Biswas, Somenath] Doerr, Benjamin [Friedrich, Tobias] [Kurur, Piyush P.] Neumann, Frank Computing Single Source Shortest Paths using Single-Objective Fitness Functions In: FOGA'09 : revised selected papers from ACM SIGEVO Foundations of Genetic Algorithms X, 59-66 Proceedings Article 2009 Doerr, Benjamin [Eremeev, Anton] [Horoba, Christian] Neumann, Frank [Theile, Madeleine] Evolutionary Algorithms and Dynamic Programming In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 771-777 Proceedings Article 2009 Kratsch, Stefan Neumann, Frank Fixed-Parameter Evolutionary Algorithms and the Vertex Cover Problem In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 293-300 Proceedings Article 2009 Friedrich, Tobias [Horoba, Christian] Neumann, Frank Multiplicative Approximations and the Hypervolume Indicator In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 571-578 Proceedings Article 2009 [Brockhoff, Dimo] [Friedrich, Tobias] Hebbinghaus, Nils Klein, Christian Neumann, Frank [Zitzler, Eckart] On the Effects of Adding Objectives to Plateau Functions In: IEEE Transactions on Evolutionary Computation [13], 591-603 Journal Article 2009 [Helwig, Sabine] Neumann, Frank [Wanka, Rolf] Particle Swarm Optimization with Velocity Adaptation In: 2009 International Conference on Adaptive and Intelligent Systems ICAIS 2009 : proceedings, 146-151 Proceedings Article 2009 Neumann, Frank [Witt, Carsten] Runtime Analysis of a Simple Ant Colony Optimization Algorithm In: Algorithmica [54], 243-255 Journal Article 2009 Neumann, Frank [Oliveto, Pietro Simone] [Witt, Carsten] Theoretical Analysis of Fitness-Proportional Selection: Landscapes and Efficiency In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 835-842 Proceedings Article 2009 [Oliveto, Pietro Simone] [Lehre, Per Kristian] Neumann, Frank Theoretical Analysis of Rank-Based Mutation - Combining Exploration and Exploitation In: 2009 IEEE Congress on Evolutionary Computation : CEC, 1455-1462 Proceedings Article 2008 [Brockhoff, Dimo] Friedrich, Tobias Neumann, Frank Analyzing Hypervolume Indicator Based Algorithms In: Parallel Problem Solving from Nature (PPSN X), 651-660 Proceedings Article 2008 Neumann, Frank [Witt, Carsten] Ant Colony Optimization and the Minimum Spanning Tree Problem In: International Conference on Learning and Intelligent Optimization 2007, 153-166 Proceedings Article 2008 Neumann, Frank [Reichel, Joachim] Approximating Minimum Multicuts by Evolutionary Multi-Objective Algorithms In: Parallel Problem Solving from Nature (PPSN X), 72-81 Proceedings Article 2008 [Horoba, Christian] Neumann, Frank Benefits and Drawbacks for the Use of epsilon-Dominance in Evolutionary Multi-Objective Optimization In: Genetic and Evolutionary Computation Conference 2008, 641-680 Proceedings Article 2008 Neumann, Frank [Reichel, Joachim] [Skutella, Martin] Computing Minimum Cuts by Randomized Search Heuristics In: Genetic and Evolutionary Computation Conference 2008, 779-786 Proceedings Article 2008 Neumann, Frank Expected Runtimes of Evolutionary Algorithms for the Eulerian Cycle Problem In: Computers and Operations Research [35], 2750-2759 Journal Article 2008 [Kroeske, Jense] [Ghandar, Adam] [Michalewicz, Zbigniew] Neumann, Frank Learning Fuzzy Rules with Evolutionary Algorithms - An Analytic Approach In: Parallel Problem Solving from Nature (PPSN X), 1051-1060 Proceedings Article 2008 [Diedrich, Florian] [Kehden, Britta] Neumann, Frank Multi-objective Problems in Terms of Relational Algebra In: Relations and Kleene Algebra in Computer Science 2008, 84-98 Proceedings Article 2008 Neumann, Frank [Sudholt, Dirk] [Witt, Carsten] Rigorous Analyses for the Combination of Ant Colony Optimization and Local Search In: International Conference on Ant Colony Optimization and Swarm Intelligence 2008, 132-143 Proceedings Article 2008 Happ, Edda Johannsen, Daniel Klein, Christian Neumann, Frank Rigorous Analyses of Fitness-Proportional Selection for Optimizing Linear Functions In: Genetic and Evolutionary Computation Conference 2008, 953-960 Proceedings Article 2008 Friedrich, Tobias [Horoba, Christian] Neumann, Frank Runtime Analyses for Using Fairness in Evolutionary Multi-Objective Optimization In: Parallel Problem Solving from Nature (PPSN X), 671-680 Proceedings Article 2008 [Diedrich, Florian] Neumann, Frank Using Fast Matrix Multiplication in Bio-Inspired Computation for Complex Optimization Problems In: IEEE Congress on Evolutionary Computation 2008, 3828-3833 Proceedings Article 2008 Friedrich, Tobias Neumann, Frank When to Use Bit-wise Neutrality In: IEEE Congress on Evolutionary Computation 2008, 997-1003 Proceedings Article 2007 Doerr, Benjamin [Gnewuch, Michael] Hebbinghaus, Nils Neumann, Frank A Rigorous View On Neutrality In: IEEE Congress on Evolutionary Computation 2007, 2591-2597 Proceedings Article 2007 Friedrich, Tobias [He, Jun] Hebbinghaus, Nils Neumann, Frank [Witt, Carsten] Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models In: Genetic and Evolutionary Computation Conference 2007, 797-804 Proceedings Article 2007 Neumann, Frank [Sudholt, Dirk] [Witt, Carsten] Comparing Variants of MMAS ACO Algorithms on Pseudo-Boolean Functions In: Engineering Stochastic Local Search Algorithms 2007, 61-75 Proceedings Article 2007 [Brockhoff, Dimo] Friedrich, Tobias Hebbinghaus, Nils Klein, Christian Neumann, Frank [Zitzler, Eckart] Do Additional Objectives Make a Problem Harder? In: Genetic and Evolutionary Computation Conference 2007, 765-772 Proceedings Article 2007 Friedrich, Tobias [He, Jun] Hebbinghaus, Nils Neumann, Frank [Witt, Carsten] On Improving Approximate Solutions by Evolutionary Algorithms In: IEEE Congress on Evolutionary Computation 2007, 2614-2621 Proceedings Article 2007 Doerr, Benjamin Neumann, Frank [Sudholt, Dirk] [Witt, Carsten] On the Runtime Analysis of the 1-ANT ACO algorithm In: Genetic and Evolutionary Computation Conference 2007, 33-40 Proceedings Article 2007 Friedrich, Tobias Hebbinghaus, Nils Neumann, Frank Plateaus Can Be Harder in Multi-Objective Optimization In: IEEE Congress on Evolutionary Computation 2007, 2622-2629 Proceedings Article 2007 Neumann, Frank [Wegener, Ingo] Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem In: Theoretical Computer Science [378], 32-40 Journal Article 2007 Friedrich, Tobias Hebbinghaus, Nils Neumann, Frank Rigorous Analyses of Simple Diversity Mechanisms In: Genetic and Evolutionary Computation Conference 2007, 1219-1225 Proceedings Article 2007 Doerr, Benjamin Hebbinghaus, Nils Neumann, Frank Speeding up Evolutionary Algorithms Through Asymmetric Mutation Operators In: Evolutionary Computation [15], 401-410 Journal Article 2006 Neumann, Frank [Witt, Carsten] Ant Colony Optimization and the Minimum Spanning Tree Problem Report 2006 Doerr, Benjamin Hebbinghaus, Nils Neumann, Frank Speeding Up Evolutionary Algorithms Through Restricted Mutation Operators In: Parallel Problem Solving from Nature - PPSN IX, 9th International Conference, 978-987 Proceedings Article 2 Neumann, Frank (ed.) 2008 GECCO 2008: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation Proceedings 2007 GECCO 2007: Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation Proceedings 1 Newman, Ilan 2011 [Ben-Zwi, Oren] Hermelin, Danny [Lokshtanov, Daniel] [Newman, Ilan] Treewidth governs the complexity of target set selection In: Discrete Optimization [8], 87-96 Journal Article 1 Newman, I. 1995 [Berthomé, P.] [Duboux, T.] Hagerup, Torben [Newman, I.] [Schuster, Assaf] Self-Simulation for the Passive Optical Star Model In: Algorithms-ESA'95: 3rd Annual European Symposium, 268-380 Proceedings Article 1 Newo Kenmogne, Regis 2005 Newo Kenmogne, Regis Understanding LSI Via The Truncated Term-Term Matrix Universität des Saarlandes Thesis - Masters thesis 1 Neyer, Gabriele 2001 [Bäsken, Matthias] [Brönnimann, Hervé] [Frank, Da] [Devillers, Olivier] [Ester, Ezra] [Fabri, Andreas] [Flato, Eyal] [Gärtner, Bernd] [Giezeman, Geert-Jan] [Halperin, Dan] [Hanniel, Iddo] [Har-Peled, Sariel] [Herrmann, Thomas] Hert, Susan [Hirsch, Shai] [Hoffmann, Michael] Kettner, Lutz [Nechushtan, Oren] [Neyer, Gabriele] [Pasechnik, Dmitrii] [Pion, Sylvain] Schirra, Stefan [Schönherr, Sven] Seel, Michael [Teillaud, Monique] [Veltkamp, Remco] [Wein, Ron] [Wesselink, Wieger] [Yvinec, Mariette] CGAL Reference and User Manuals Unknown Form: eBookForm 1 Ngo, Hung Q. (ed.) 2009 Elbassioni, Khaled [Makino, Kazuhisa] Rauf, Imran On the Readability of Monotone Boolean Formulae In: Computing and Combinatorics :15th Annual International Conference, COCOON 2009, 496-505 Proceedings Article 1 Nguyen, An 2006 Funke, Stefan [Guibas, Leonidas] [Nguyen, An] [Wang, Yusu] Distance-Sensitive Information Brokerage in Sensor Networks In: Distributed Computing in Sensor Systems, Second IEEE International Conference, DCOSS 2006, 234-251 Proceedings Article 2 Nichterlein, Andr{ 2 'e} 2011 [Bredereck, Robert] [Nichterlein, Andr{\'e}] [Niedermeier, Rolf] Philip, Geevarghese Pattern-Guided Data Anonymization and Clustering In: Mathematical Foundations of Computer Science 2011 - 36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011. Proceedings, 182-193 Proceedings Article 2011 [Bredereck, Robert] [Nichterlein, Andr{\'e}] [Niedermeier, Rolf] Philip, Geevarghese The Effect of Homogeneity on the Complexity of $k$-Anonymity In: Fundamentals of Computation Theory - 18th International Symposium, FCT 2011, Oslo, Norway, August 22-25, 2011. Proceedings, 53-64 Proceedings Article 1 Nicola Beume (ed.) 2008 Doerr, Benjamin Johannsen, Daniel [Tang, Ching Hoo] How Single Ant ACO Systems Optimize Pseudo-Boolean Functions In: Parallel Problem Solving from Nature – PPSN X, 378-388 Proceedings Article 1 Nicosia, Gaia (ed.) 2011 van Zuylen, Anke [Schalekamp, Frans] [Williamson, David P.] Popular Ranking In: 10th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2011, 267-270 Electronic Proceedings Article 1 Nicosia, Giuseppe (ed.) 2012 Kötzing, Timo [Molter, Hendrik] ACO beats EA on a dynamic pseudo-Boolean function In: Parallel Problem Solving from Nature - PPSN XII : 12th International Conference, 113-122 Proceedings Article 3 Niedermeier, Rolf 2011 [Bredereck, Robert] [Nichterlein, Andr{\'e}] [Niedermeier, Rolf] Philip, Geevarghese Pattern-Guided Data Anonymization and Clustering In: Mathematical Foundations of Computer Science 2011 - 36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011. Proceedings, 182-193 Proceedings Article 2011 [Bredereck, Robert] [Nichterlein, Andr{\'e}] [Niedermeier, Rolf] Philip, Geevarghese The Effect of Homogeneity on the Complexity of $k$-Anonymity In: Fundamentals of Computation Theory - 18th International Symposium, FCT 2011, Oslo, Norway, August 22-25, 2011. Proceedings, 53-64 Proceedings Article 2002 [Niedermeier, Rolf] [Reinhard, Klaus] Sanders, Peter Towards Optimal Locality in Mesh-Indexings In: Discrete Applied Mathematics [117], 211-237 Journal Article 1 Niedermeier, Rolf (ed.) 2008 Wahlström, Magnus A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances In: 3rd International Workshop on Parameterized and Exact Computation (IWPEC 2008), 202-213 Proceedings Article 1 Niederreiter, Harald (ed.) 2008 Doerr, Benjamin [Gnewuch, Michael] Construction of Low-Discrepancy Point Sets of Small Size by Bracketing Covers and Dependent Randomized Rounding In: Monte Carlo and Quasi-Monte Carlo Methods 2006, 299-312 Proceedings Article 3 Niehren, Joachim 2003 Althaus, Ernst [Duchier, Denys] [Koller, Alexander] Mehlhorn, Kurt [Niehren, Joachim] Thiel, Sven An Efficient Algorithm for the Configuration Problem of Dominance Graphs In: Journal of Algorithms [48], 194-219 Journal Article 2001 Althaus, Ernst [Duchier, Denys] [Koller, Alexander] Mehlhorn, Kurt [Niehren, Joachim] Thiel, Sven An Efficient Algorithm for the Configuration Problem of Dominance Graphs In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-01), 815-824 Proceedings Article 2000 Koller, Alexander Mehlhorn, Kurt Niehren, Joachim A Polynomial-Time Fragment of Dominance Constraints In: Proceedings of the 38th Annual Meeting of the Association of Computational Linguistics (ACL-00), 368-375 Proceedings Article 1 Nielsen, Mogens (ed.) 1999 Sanders, Peter Accessing Multiple Sequences Through Set Associative Caches In: Proceedings of the 26th International Colloquium on Automata, Languages and Programming (ICALP-99), 655-664 Proceedings Article 3 Nievergelt, Jurg 1994 Mehlhorn, Kurt Näher, Stefan Nievergelt, Jurg Introduction In: Journal of Symbolic Computation [17], 295-295 Journal Article 1984 Hertel, Stefan Mäntylä, Martti Mehlhorn, Kurt Nievergelt, Jurg Space Sweep Solves Intersection of Convex Polyhedra In: Acta Informatica [21], 501-519 Journal Article 1984 [Hertel, Stefan] [Mehlhorn, Kurt] [Mäntylä, Martti] [Nievergelt, Jurg] Space sweep solves intersection of two convex polyhedra elegantly Report 2 Nievergelt, Jurg (ed.) 1997 Schirra, Stefan Precision and Robustness in Geometric Computations In: Algorithmic Foundations of Geographic Information Systems, 255-287 Part of a Book 1994 Special issue on “algorithms: implementation, libraries and use” Book 1 Nikolaidis, Ioanis (ed.) 2004 Funke, Stefan Kesselman, Alexander Lotker, Zvi [Segal, Michael] Improved Approximation Algorithms for Connected Sensor Cover In: Ad-hoc, mobil and wireless networks : Third International Conference, ADHOC-NOW 2004, 56-69 Proceedings Article 2 Nikoletseas, Sotiris 2002 [Andreou, Maria] Fotakis, Dimitris [Nikoletseas, Sotiris] [Papadopoulou, Vicky] [Spirakis, Paul G.] On Radiocoloring Hierarchically Specified Planar Graphs: PSPACE-Completeness and Approximations In: Mathematical Foundations of Computer Science 2002 : 27th International Symposium, MFCS 2002, 81-92 Proceedings Article 2002 Fotakis, Dimitris [Nikoletseas, Sotiris] [Papadopoulou, Vicky] [Spirakis, Paul G.] Radiocolorings in Periodic Planar Graphs: PSPACE-Completeness and Efficient Approximations for the Optimal Range of Frequencies In: Graph-Theoretic Concepts in Computer Science : 28th International Workshop, WG 2002, 223-234 Proceedings Article 5 Nikoletseas, Sotiris (ed.) 2009 [Kavitha, T.] Mestre, Julián [Nasre, M.] Popular Mixed Matchings In: Automata, Languages and Programming : 36th International Colloquium, ICALP 2009, 574-584 Proceedings Article 2009 Doerr, Benjamin Friedrich, Tobias [Sauerwald, Thomas] Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness In: Automata, Languages and Programming : 36th International Colloquium, ICALP 2009, 366-377 Proceedings Article 2009 Friedrich, Tobias [Sauerwald, Thomas] [Vilenchik, Dan] Smoothed Analysis of Balancing Networks In: Automata, Languages and Programming : 36th International Colloquium, ICALP 2009, 472-483 Proceedings Article 2005 Bast, Holger Weber, Ingmar Don't Compare Averages In: 4th International Workshop on Efficient and Experimental Algorithms (WEA'05), 67-76 Proceedings Article 2005 Mehlhorn, Kurt Michail, Dimitrios Implementing Minimum Cycle Basis Algorithms In: Experimental and Efficient Algorithms, 4th InternationalWorkshop, WEA 2005, 32-43 Proceedings Article 1 Nikolo, Nikola S. (ed.) 2005 Mehlhorn, Kurt Minimum Cycle Bases and Surface Reconstruction In: Graph Drawing: 13th International Symposium, GD 2005, ,, 532-532 Proceedings Article 1 Nilsson, Stefan 1995 [Andersson, Arne] Hagerup, Torben [Nilsson, Stefan] [Raman, Rajeev] Sorting in Linear Time? In: 27th Annual ACM Symposium on Theory of Computing (STOC95), 427-436 Proceedings Article 1 Nishimura, Naomi 1995 Hagerup, Torben [Katajainen, Jyrki] [Nishimura, Naomi] [Ragde, Prabhakar] Characterizations of k-Terminal Flow Networks and Computing Network Flows in Partial k-Trees In: 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA95), 641-649 Proceedings Article 1 Nishizeki, Takao (ed.) 1990 Klein, R. Mehlhorn, Kurt Meiser, Stefan On the Construction of Abstract Voronoi Diagrams, II In: Algorithms (ISA-90) : 1st international symposium (SIGAL-90), 138-154 Proceedings Article 1 Nissen, Marco 1998 Nissen, Marco Graph Iterators: Decoupling Graph Structures from Algorithms Universität des Saarlandes Thesis - Masters thesis 1 Noguiera, Loana Tito (ed.) 2008 [Epstein, Leah] van Stee, Rob Maximizing the minimum load for selfish agents In: LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, 264-275 Proceedings Article 2 Noltemeier, Hartmut (ed.) 1988 Gao, Shaodi Kaufmann, Michael Mehlhorn, Kurt Rülling, Wolfgang Storb, Christoph Jerrum, Mark On Continuous Homotopic One Layer Routing (Extended Abstract) In: Computational geometry and its applications (CG-88) : international workshop, 55-70 Proceedings Article 1980 Mehlhorn, Kurt A New Data Structure for Representing Sorted Lists In: Graph-theoretic concepts in computer science (WG-80) : 6th international workshop, 90-112 Proceedings Article 1 North, Stephen 1998 [Eades, Peter] [Marks, Joe] Mutzel, Petra [North, Stephen] Graph Drawing Contest Report In: Proceedings of the 6th International Symposium on Graph Drawing (GD-98), 423-435 Proceedings Article 1 North, Stephen (ed.) 1996 Mutzel, Petra An alternative method to crossing minimization on hierarchical graphs In: Proceedings of the 4th Symposium on Graph Drawing (GD-96), 318-333 Proceedings Article 2 Nor, Igor 2012 [Nor, Igor] Hermlin, Danny [Charlat, Sylvain] [Engelstadter, Jan] [Reuter, Max] [Duron, Olivier] [Sagot, Marie-France] Mod/Resc Parsimony Inference: Theory and application In: Information and Computation [213], 23-32 Journal Article 2010 [Nor, Igor] Hermelin, Danny [Charlat, Sylvain] [Engelstadter, Jan] [Reuter, Max] [Duron, Olivier Sagot, Marie-France] Mod/Resc Parsimony Inference In: Combinatorial Pattern Matching : 21st Annual Symposium, CPM 2010, 202-213 Proceedings Article 1 Novotni, Dominik 2006 [Brown, Christopher] El Kahoui, M'hammed [Novotni, Dominik] [Weber, Andreas] Algorithmic methods for investigating equilibria in epidemic modeling In: Journal of Symbolic Computation [41], 1157-1173 Journal Article 3 Nowotka, Dirk 2014 Gawrychowski, Pawel [Manea, Florin] [Nowotka, Dirk] Testing Generalised Freeness of Words In: 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 337-349 Proceedings Article 2013 Gawrychowski, Pawel [Manea, Florin] [Nowotka, Dirk] Discovering Hidden Repetitions in Words In: 9th Conference on Computability in Europe (CiE 2013), 210-219 Proceedings Article 2013 Gawrychowski, Pawel [Manea, Florin] [Mercas, Robert] [Nowotka, Dirk] [Tiseanu, Catalin] Finding Pseudo-repetitions In: 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), 257-268 Proceedings Article 1 Nurmi, O. (ed.) 1992 Lenhof, Hans-Peter Smid, Michiel Maintaining the visibility map of speres while moving the viewpoint on a circle at infinity In: Algorithms Theory - SWAT'92: Third Scandinavian Workshop on Algorithm Theory, 388-398 Proceedings Article 3 Nutov, Zeev 2000 Nutov, Zeev [Penn, Michael] On Integrality, Stability and Composition of Dicycle Packings and Covers In: Journal of Combinatorial Optimization [4], 235 - 252 Journal Article 1999 [Auletta, Vincenzo] [Dinitz, Yefim] Nutov, Zeev [Parente, Domenico] A 2-approximation algorithm for finding an optimum 3-vertex-connected spanning subgraph In: Journal of Algorithms [32], 21-30 Journal Article 1999 [Dinitz, Yefim] Nutov, Zeev A 3-approximation algorithm for finding optimum 4,5-vertex-connected spanning subgraphs In: Journal of Algorithms [32], 21-30 Journal Article 1 Nystrom, I (ed.) 2000 Hagedoorn, Michiel Overmars, Mark H. Veltkamp, Remco A New Visibility Partition for Affine Pattern Matching In: Discrete Geometry for Computer Imagery, Proceedings of the 9th International Conference (DGCI-00), 358-370 Proceedings Article 3 O'Dúnlaing, Colm 1991 Mehlhorn, Kurt Meiser, Stefan O'Dúnlaing, Colm On the construction of abstract Voronoi diagrams In: Discrete & Computational Geometry [6], 211-224 Journal Article 1990 Mehlhorn, Kurt Meiser, Stefan Ó'Dúnlaing, Colm On the Construction of Abstract Voronoi Diagrams In: Theoretical aspects of computer science (STACS-90) : 7th annual symposium, 227-239 Proceedings Article 1989 Mehlhorn, Kurt Meiser, Stefan O'Dunlaing, Colm On the construction of abstract Voronoi diagrams Report 1 O'Leary, Dianne 2008 Zotenko, Elena Mestre, Julián O'Leary, Dianne Przytyzka, Teresa Essential Complex Biological Modules Explain the Centrality-Lethality Rule In: PLoS Computational Biology [x], x-x Journal Article 1 O'Neill, Michael (ed.) 2009 GECCO 2009: Proceedings of the 11th Annual conference on Genetic and evolutionary computation. Proceedings 3 O'Reilly, Una-May 2012 Kötzing, Timo [Sutton, Andrew M.] [Neumann, Frank] [O'Reilly, Una-May] The max problem revisited: the importance of mutation in genetic programming In: GECCO’12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation, 1333-1340 Proceedings Article 2011 [Durrett, Greg] [Neumann, Frank] [O'Reilly, Una-May] Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics In: FOGA'11 : Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, 69-80 Proceedings Article 2011 Wagner, Markus [Veeramachaneni, Kalyan] [Neumann, Frank] [O'Reilly, Una-May] Optimizing the Layout of 1000 Wind Turbines In: European Wind Energy Association Annual Event, 1-10 Proceedings Article 1 O'Rourke, Joseph (ed.) 2004 Kettner, Lutz [Näher, Stefan] Two Computational Geometry Libraries: LEDA and CGAL In: Handbook of Discrete and Computational Geometry, 1435-1463 Part of a Book 1 Oberhauser, Fred 1997 Oberhauser, Fred Arithmetik der Transduktoren Universität des Saarlandes Thesis - Masters thesis 3 Odenthal, Thomas 1998 [Jünger, Michael] Mutzel, Petra [Odenthal, Thomas] [Scharbrodt, M.] The thickness of a minor-excluded class of graphs In: Discrete Mathematics [182], 169-176 Journal Article 1998 Mutzel, Petra Odenthal, Thomas Scharbrodt, M. The thickness of graphs: A survey In: Graphs and Combinatorics [14], 59-73 Journal Article 1997 [Jünger, Michael] Lee, E. K. Mutzel, Petra [Odenthal, Thomas] A Polyhedral Approach to the Multi-Layer Crossing Minimization Problem In: Proceedings of the 5th Symposium on Graph Drawing (GD-97), 13-24 Proceedings Article 1 Östlin, Anna 1997 Gasieniec, Leszek [Jansson, Jesper] [Lingas, Andrzej] [Östlin, Anna] On the complexity of computing evolutionary trees In: Proceedings of the 3rd International Conference on Computing and Combinatorics (COCOON-97), 134-145 Proceedings Article 1 Ogihara, Mitsunori (ed.) 2011 [Althaus, Ernst] Kupilas, Joschka Naujoks, Rouven On the Low-Dimensional Steiner Minimum Tree Problem in Hamming Metric In: Theory and Applications of Models of Computation : 8th Annual Conference, TAMC 2011, 308-319 Proceedings Article 1 Okamoto, Yoshio 2012 [Cygan, Marek] [Dell, Holger] [Lokshtanov, Daniel] [Marx, Daniel] [Nederlof, Jesper] [Okamoto, Yoshio] [Paturi, Ramamohan] [Saurabh, Saket] Wahlström, Magnus On Problems as Hard as CNF-SAT In: 2012 IEEE 27th Conference on Computational Complexity (CCC 2012), 74-84 Proceedings Article 1 Okamoto, Yoshio (ed.) 2011 Friedrich, Tobias Sauerwald, Thomas [Stauffer, Alexandre] Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary Dimensions In: 22nd International Symposium on Algorithms and Computation (ISAAC-11), 190-199 Proceedings Article 2 Okhotin, Alexander 2014 Jez, Artur [Okhotin, Alexander] Computational completeness of equations over sets of natural numbers In: Information and Computation [237], 56-94 Journal Article 2013 Jez, Artur [Okhotin, Alexander] Unambiguous Conjunctive Grammars over a One-Letter Alphabet In: 17th International Conference on Developments in Language Theory (DLT 2013), 277-288 Proceedings Article 1 Olderog, Ernst-Rüdiger (ed.) 2010 [Althaus, Ernst] [Altmeyer, Sebastian] Naujoks, Rouven A New Combinatorial Approach to Parametric Path Analysis Report 2 Oliveto, Pietro 2009 [Friedrich, Tobias] [Oliveto, Pietro] [Sudholt, Dirk] [Witt, Carsten] Analysis of Diversity-Preserving Mechanisms for Global Exploration In: Evolutionary Computation [17], 455-476 Journal Article 2008 Friedrich, Tobias [Oliveto, Pietro] [Sudholt, Dirk] [Witt, Carsten] Theoretical Analysis of Diversity Mechanisms for Global Exploration In: Proceedings of the 10th annual conference on Genetic and evolutionary computation (GECCO 2008), 945-952 Proceedings Article 3 Oliveto, Pietro Simone 2010 Kratsch, Stefan [Lehre, Per Kristian] [Neumann, Frank] [Oliveto, Pietro Simone] Fixed Parameter Evolutionary Algorithms and Maximum Leaf Spanning Trees: A Matter of Mutation In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 204-213 Proceedings Article 2009 Neumann, Frank [Oliveto, Pietro Simone] [Witt, Carsten] Theoretical Analysis of Fitness-Proportional Selection: Landscapes and Efficiency In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 835-842 Proceedings Article 2009 [Oliveto, Pietro Simone] [Lehre, Per Kristian] Neumann, Frank Theoretical Analysis of Rank-Based Mutation - Combining Exploration and Exploitation In: 2009 IEEE Congress on Evolutionary Computation : CEC, 1455-1462 Proceedings Article 1 Oliveto, Pietro S. 2010 Kötzing, Timo [Lehre, Per Kristian] Neumann, Frank [Oliveto, Pietro S.] Ant Colony Optimization and the Minimum Cut Problem In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 1393-1400 Proceedings Article 1 Opatrny, Jaroslav (ed.) 2007 Funke, Stefan Rauf, Imran Information Brokerage Via Location-Free Double Rulings In: Ad-Hoc, Mobile, and Wireless Networks : 6th International Conference, ADHOC-NOW 2007, Morelia, Mexico, September 24-26, 2007, Proceedings, 87-100 Proceedings Article 1 Orejas, Fernando (ed.) 2001 [Park, Sang-Min] Lee, Jae-Ha [Chwa, Kyung-Yong] Visibility-Based Pursuit-Evasion in a Polygonal Region by a Searcher In: Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP-01), 456-468 Proceedings Article 3 Orlando, S. (ed.) 1997 Miller, Tobias Zaroliagis, Christos A First Experimental Study of a Dynamic Transitive Closure Algorithm In: Proceedings of the Workshop on Algorithm Engineering (WAE-97), 64-73 Proceedings Article 1997 [Alberts, David] Gutwenger, Carsten Mutzel, Petra [Näher, Stefan] AGD-Library: A Library of Algorithms for Graph Drawing In: Proceedings of the Workshop on Algorithm Engineering (WAE-97), 112-123 Proceedings Article 1997 Czumaj, Artur Ferragina, Paolo Gasieniec, Leszek [Muthukrishnan, S.] Träff, Jesper Larsson The Architecture of a Software Library for String Processing In: Proceedings of the Workshop on Algorithm Engineering (WAE-97), 166-176 Proceedings Article 3 Orlin, James B. 1990 Ahuja, Ravindra K. Mehlhorn, Kurt Orlin, James B. Tarjan, Robert E. Faster algorithms for the shortest path problem In: Journal of the ACM [37], 213-223 Journal Article 1988 Ahuja, Ravindra K. Mehlhorn, Kurt Orlin, James B. Tarjan, Robert E. Faster Algorithms for the Shortest Path Problem Report 1988 Ahuja, Ravindra K. Mehlhorn, Kurt Orlin, James B. Tarjan, Robert E. Faster Algorithms for the Shortest Path Problem Report 1 Orlis, Christos 2014 [Fekete, Sándor P.] [Fiethe, Björn] [Friedrichs, Stephan] [Michalik, Harald] [Orlis, Christos] Efficient reconfiguration of processing modules on FPGAs for space instruments In: Adaptive Hardware and Systems (AHS), 2014 NASA/ESA Conference on, 15-22 Proceedings Article 6 Osbild, Ralf 2011 Mehlhorn, Kurt Osbild, Ralf Sagraloff, Michael A General Approach to the Analysis of Controlled Perturbation Algorithms In: Computational Geometry [44], 507-528 Journal Article 2008 Mehlhorn, Kurt Osbild, Ralf Sagraloff, Michael A General Approach to the Analysis of Controlled Perturbation Algorithms Report 2007 Doerr, Benjamin Friedrich, Tobias Klein, Christian Osbild, Ralf Unbiased Matrix Rounding In: Electronic Notes in Discrete Mathematics [28], 41-46 Journal Article 2006 Mehlhorn, Kurt Osbild, Ralf Sagraloff, Michael Reliable and Efficient Computational Geometry Via Controlled Perturbation In: Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Part I, 299-310 Proceedings Article 2006 Doerr, Benjamin Friedrich, Tobias Klein, Christian Osbild, Ralf Unbiased Matrix Rounding In: Algorithm theory - SWAT 2006 : 10th Scandinavian Workshop on Algorithm Theory, 102-112 Proceedings Article 2005 Doerr, Benjamin Friedrich, Tobias Klein, Christian Osbild, Ralf Rounding of Sequences and Matrices, with Applications In: Third Workshop on Approximation and Online Algorithms (WAOA 2005), 96-109 Proceedings Article 2 Osipov, Vitaly 2009 Ajwani, Deepak [Meyer, Ulrich] [Osipov, Vitaly] Breadth first search on massive graphs In: The shortest path problem : ninth DIMACS implemenation challenge, 291-307 Part of a Book 2007 Ajwani, Deepak Meyer, Ulrich Osipov, Vitaly Improved external memory BFS implementations In: 9th Workshop on Algorithm Engineering and Experiments (ALENEX), 3-12 Proceedings Article 1 Ossamy, Rodrigue 2002 Ossamy, Rodrigue TSP Cuts Outside the Template Paradigm Universität des Saarlandes Thesis - Masters thesis 4 Osthus, Deryk 2009 [Cooley, Oliver] [Fountoulakis, Nikolaos] [Kühn, Daniela] [Osthus, Deryk] Embeddings and Ramsey numbers of sparse k-uniform hypergraphs In: Combinatorica [29], 263-297 Journal Article 2009 Fountoulakis, Nikolaos [Kühn, Daniela] [Osthus, Deryk] Minors in random regular graphs In: Random Structures and Algorithms [35], 444-463 Journal Article 2008 [Cooley, Oliver] Fountoulakis, Nikolaos [Kühn, Daniela] [Osthus, Deryk] 3-Uniform hypergraphs of bounded degree have linear Ramsey numbers In: Journal of Combinatorial Theory B [98], 484-505 Journal Article 2008 Fountoulakis, Nikolaos [Kühn, Daniela] [Osthus, Deryk] The order of the largest complete minor in a random graph In: Random Structures and Algorithms [33], 127-141 Journal Article 2 Ost, Kirstin 2001 [Cole, Richard] [Ost, Kirstin] Schirra, Stefan Edge-Coloring Bipartite Multigraphs in O(E log D) Time In: Combinatorica [21], 5-12 Journal Article 1995 Ost, Kirstin Algorithmen für das Kantenfärbungsproblem Universität des Saarlandes Thesis - Masters thesis 3 Ottmann, Thomas (ed.) 1998 Mehlhorn, Kurt Amortisierte Analyse In: Prinzipien des Algorithmenentwurfs, 91-102 Part of a Book 1992 Fleischer, Rudolf Fries, Otfried Mehlhorn, Kurt Meiser, Stefan Näher, Stefan Rohnert, Hans Schirra, Stefan Simon, Klaus Tsakalidis, Athanasios Uhrig, Christian Selected Topics from Computational Geometry, Data Structures and Motion Planning In: Data Structures and Efficient Algorithms, Final Report on the DFG Special Joint Initiative, 25-43 Part of a Book 1987 Mehlhorn, Kurt Näher, Stefan Alt, Helmut A Lower Bound for the Complexity of the Union-Split-Find Problem In: Automata, Languages and Programming (ICALP-87) : 14th International Colloquium, 479-488 Proceedings Article 2 Ott, Sebastian 2013 [Antoniadis, Antonios] [Huang, Chien-Chung] Ott, Sebastian [Verschae, José] How to Pack Your Items When You Have to Buy Your Knapsack In: Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, 62-73 Proceedings Article 2012 Ott, Sebastian Thou shalt not lie : on truthfully maximizing the minimum load on selfish related machines Universität des Saarlandes Thesis - Masters thesis 1 Oudalov, Vladimir 2008 [Boros, Endre] Elbassioni, Khaled Gurvich, Vladimir [Makino, Kazuhisa] [Oudalov, Vladimir] A Complete Characterization of Nash-Solvability of Bimatrix Games in Terms of the Exclusion of Certain 2x2 subgames In: Computer Science - Theory and Applications, Third International Computer Science Symposium in Russia, CSR 2008, 99-109 Proceedings Article 3 Overmars, Mark H. 2000 Hagedoorn, Michiel Overmars, Mark H. Veltkamp, Remco A New Visibility Partition for Affine Pattern Matching In: Discrete Geometry for Computer Imagery, Proceedings of the 9th International Conference (DGCI-00), 358-370 Proceedings Article 1981 Mehlhorn, Kurt Overmars, Mark H. Optimal dynamization of decomposable searching problems In: Information Processing Letters [12], 93-98 Journal Article 1980 Mehlhorn, Kurt Overmars, Mark H. Optimal dynamization of decomposable searching problems Report 1 Owen, A. B. (ed.) 2009 Doerr, Benjamin [Gnewuch, Michael] Wahlström, Magnus Implementation of a component-by-component algorithm to generate small low-discrepancy samples In: Monte Carlo and Quasi-Monte Carlo Methods 2008, 323-338 Proceedings Article 1 Owe, Olaf (ed.) 2011 [Bredereck, Robert] [Nichterlein, Andr{\'e}] [Niedermeier, Rolf] Philip, Geevarghese The Effect of Homogeneity on the Complexity of $k$-Anonymity In: Fundamentals of Computation Theory - 18th International Symposium, FCT 2011, Oslo, Norway, August 22-25, 2011. Proceedings, 53-64 Proceedings Article 1 Pacholski, Leszek 1999 Krysta, Piotr [Pacholski, Leszek] The STO problem is NP-complete In: Journal of Symbolic Computation [27], 207-219 Journal Article 1 Pacifici, Andrea (ed.) 2011 van Zuylen, Anke [Schalekamp, Frans] [Williamson, David P.] Popular Ranking In: 10th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2011, 267-270 Electronic Proceedings Article 2 Pagh, Rasmus 2005 [Fotakis, Dimitris] [Pagh, Rasmus] Sanders, Peter Spirakis, Paul G. Space Efficient Hash Tables With Worst Case Constant Access Time In: Theory of Computing Systems [38], 229-248 Journal Article 2003 Fotakis, Dimitris [Pagh, Rasmus] Sanders, Peter [Spirakis, Paul G.] Space Efficient Hash Tables with Worst Case Constant Access Time In: Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2003), 271-282 Proceedings Article 1 Pagli, Linda (ed.) 1999 Fleischer, Rudolf FUN with implementing algorithms In: Proceedings of the International Conference on FUN with Algorithms (FUN-98), 88-98 Proceedings Article 1 Pajarola, Renato (ed.) 2009 Emeliyanenko, Pavel Berberich, Eric Sagraloff, Michael Visualizing Arcs of Implicit Algebraic Curves, Exactly and Fast In: Advances in Visual Computing : 5th International Symposium, ISVC 2009, 608-619 Proceedings Article 3 Palamidessi, Catuscia (ed.) 2005 Elbassioni, Khaled M. Fishkin, Aleksei V. Mustafa, Nabil H. Sitters, Rene Approximation algorithms for Euclidean Group TSP In: Automata, languages and programming : 32nd International Colloquim, ICALP 2005, 1115-1126 Proceedings Article 2005 Kovács, Annamária Polynomial Time Preemptive Sum-Multicoloring on Paths In: Automata, languages and programming : 32nd International Colloquim, ICALP 2005, 840-852 Proceedings Article 2005 Kaligosi, Kanela Mehlhorn, Kurt [Munro, J. Ian] [Sanders, Peter] Towards Optimal Multiple Selection In: Automata, languages and programming : 32nd International Colloquim, ICALP 2005, 103-114 Proceedings Article 6 Paluch, Katarzyna 2012 Elbassioni, Khaled [Paluch, Katarzyna] van Zuylen, Anke Simpler Approximation of the Maximum Asymmetric Traveling Salesman Problem In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, 501-506 Electronic Proceedings Article 2006 Paluch, Katarzyna A New Approximation Algorithm for Multidimensional Rectangle Tiling In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 712-721 Proceedings Article 2006 [Irving, Robert W.] [Telikepalli, Kavitha] Mehlhorn, Kurt Michail, Dimitrios [Paluch, Katarzyna] Rank-Maximal Matchings In: ACM Transactions on Algorithms [2], 602-610 Journal Article 2004 Kavitha, Telikepalli Mehlhorn, Kurt Michail, Dimitrios [Paluch, Katarzyna] A Faster Algorithm for Minimum Cycle Basis of Graphs In: Automata, languages and programming : 31st International Colloquium, ICALP 2004, 846-857 Proceedings Article 2004 Mehlhorn, Kurt Michail, Dimitrios Telikepalli, Kavitha [Irving, Robert W.] [Paluch, Katarzyna] Rank-Maximal Matchings In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 68-75 Proceedings Article 2004 Kavitha, Telikepalli Mehlhorn, Kurt Michail, Dimitrios [Paluch, Katarzyna] Strongly Stable Matchings in Time O(nm) and Extension to the Hospitals-Residents Problem In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), 222-233 Proceedings Article 1 Paluch, Katarzyna E. 2007 [Kavitha, Telikepalli] Mehlhorn, Kurt Michail, Dimitrios [Paluch, Katarzyna E.] Strongly stable matchings in time O(nm) and extension to the hospitals-residents problem In: ACM Transactions on Algorithms [3], 15.1-15.18 Journal Article 1 Pal, Arindam 2012 Elbassioni, Khaled [Garg, Naveen] [Gupta, Divya] [Kumar, Amit] [Narula, Vishal] [Pal, Arindam] Approximation Algorithms for the Unsplittable Flow Problem on Paths and Trees In: 32nd International Conference on Foundations of Software Technology and Theoretical Computer Science : FSTTCS 2012, 267-275 Electronic Proceedings Article 27 Panagiotou, Konstantinos 2013 Panagiotou, Konstantinos Spöhel, Reto [Steger, Angelika] [Thomas, Henning] Explosive percolation in Erdös-Rényi-like random graph processes In: Combinatorics, Probability and Computing [22], 133-145 Journal Article 2013 Panagiotou, Konstantinos Pourmiri, Ali Sauerwald, Thomas Faster Rumor Spreading with Multiple Calls In: 24th International Symposium on Algorithms and Computation (ISAAC-13), 446-456 Proceedings Article 2013 Fountoulakis, Nikolaos Panagiotou, Konstantinos On the Insertion Time of Cuckoo Hashing In: SIAM Journal on Computing [?], ?-? Journal Article 2012 Panagiotou, Konstantinos [Coja-Oghlan, Amin] Catching the k-NAESAT Threshold In: STOC’12 : Proceedings of the 2012 ACM Symposium on Theory of Computing, 899-907 Proceedings Article 2012 Bringmann, Karl [Panagiotou, Konstantinos] Efficient Sampling Methods for Discrete Distributions In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 133-144 Proceedings Article 2012 [Brightwell, Graham] Panagiotou, Konstantinos [Steger, Angelika] Extremal subgraphs of random graphs In: Random Structures & Algorithms [41], 147-178 Journal Article 2012 Fountoulakis, Nikolaos Panagiotou, Konstantinos Tight Load Thresholds for Cuckoo Hashing In: Random Structures and Algorithms [41], 306-333 Journal Article 2012 Fountoulakis, Nikolaos [Panagiotou, Konstantinos] [Sauerwald, Thomas] Ultra-fast rumor spreading in social networks In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 1642-1660 Proceedings Article 2012 Panagiotou, Konstantinos [Sinha, Makrand] Vertices of degree k in random unlabeled trees In: Journal of Graph Theory [69], 114-130 Journal Article 2011 Fountoulakis, Nikolaos [Panagiotou, Konstantinos] 3-Connected Cores In Random Planar Graphs In: Combinatorics, Probability & Computing [20], 381-412 Journal Article 2011 Manjunath, Madhusudan Mehlhorn, Kurt Panagiotou, Konstantinos Sun, He Approximate Counting of Cycles in Streams In: 19th Annual European Symposium on Algorithms (ESA-11), 677-688 Proceedings Article 2011 Panagiotou, Konstantinos Spöhel, Reto [Steger, Angelika] [Thomas, Henning] Explosive percolation in Erdős-Rényi-like random graph processes In: The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, 699-704 Electronic Proceedings Article 2011 Panagiotou, Konstantinos [Steger, Angelika] On the Degree Sequence of Random Planar Graphs In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), 1198-1210 Proceedings Article 2011 Fountoulakis, Nikolaos Khosla, Megha Panagiotou, Konstantinos The Multiple-orientability Thresholds for Random Hypergraphs In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), 1222-1236 Proceedings Article 2010 Panagiotou, Konstantinos [Steger, Angelika] Maximal Biconnected Subgraphs of Random Planar Graphs In: ACM Transactions on Algorithms [6], 31,1-31,21 Journal Article 2010 Fountoulakis, Nikolaos Panagiotou, Konstantinos Orientability of random hypergraphs and the power of multiple choices In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010. - Pt. 1, 348-359 Proceedings Article 2010 Fountoulakis, Nikolaos Huber, Anna Panagiotou, Konstantinos Reliable broadcasting in random networks and the effect of density In: 2010 Proceedings IEEE INFOCOM, 2552-2560 Proceedings Article 2010 Fountoulakis, Nikolaos Panagiotou, Konstantinos Rumor spreading on random regular graphs and expanders In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 13th Internationa lWorkshop, APPROX 2010 and 14th International Workshop, RANDOM 2010, 560-573 Proceedings Article 2010 [Kuhn, Fabian] Panagiotou, Konstantinos [Spencer, Joel] [Steger, Angelika] Synchrony and Asynchrony in Neural Networks In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 949-964 Proceedings Article 2010 Johannsen, Daniel Panagiotou, Konstantinos Vertices of Degree k in Random Maps In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1436-1447 Proceedings Article 2009 Panagiotou, Konstantinos Blocks In Constrained Random Graphs with Fixed Average Degree In: 21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009), 733-744 Electronic Proceedings Article 2009 Fountoulakis, Nikolaos Huber, Anna Panagiotou, Konstantinos Brief Announcement: The Speed of Broadcasting in Random Networks - Density Does Not Matter In: Distributed Computing : 23rd International Symposium, DISC 2009, 529-530 Proceedings Article 2009 Panagiotou, Konstantinos [Steger, Angelika] Maximal Biconnected Subgraphs of Random Planar Graphs In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 432-440 Proceedings Article 2009 Panagiotou, Konstantinos The Degree Sequence of Random Graphs from Subcritical Classes In: Combinatorics, Probability and Computing [18], 647-681 Journal Article 2009 Fountoulakis, Nikolaos Huber, Anna Panagiotou, Konstantinos The Speed of Broadcasting in Random Networks: Density Does Not Matter In: 23rd International Symposium on Distributed Computing (DISC '09), 529-530 Proceedings Article 2009 Angelopoulos, Spyros Doerr, Benjamin Huber, Anna Panagiotou, Konstantinos Tight bounds for quasirandom rumor spreading In: The Electronic Journal of Combinatorics [16], R102,1-R102,19 Electronic Journal Article 2009 Panagiotou, Konstantinos Vertices of Degree k in Random Unlabeled Trees In: European Conference on Combinatorics, Graph Theory and Applications (EuroComb '09), 41-45 Proceedings Article 2 Panconesi, Alessandro 2013 [Clementi, Andrea] [Crescenzi, Pierluigi] Doerr, Carola [Fraigniaud, Pierre] [Isopi, Marc] [Panconesi, Alessandro] [Pasquale, Francesco] [Silvestri, Riccardo] Rumor Spreading in Random Evolving Graphs In: Proc. of the 21st European Symposium on Algorithms (ESA 2013), 325-336 Proceedings Article 1998 [Panconesi, Alessandro] Papatriantafilou, Marina Tsigas, Philippas [Vitanyi, Paul] Randomized Naming Using Wait-Free Shared Variables In: Distributed Computing [11], 113-124 Journal Article 1 Panconesi, Alessandro (ed.) 2012 [Akbari, Hoda] [Berenbrink, Petra] Sauerwald, Thomas A simple approach for adapting continuous load balancing processes to discrete settings In: PODC'12 : Proceedings of the 2012 ACM Symposium on Principles of Distributed Computing, 271-280 Proceedings Article 1 Pandya, Paritosh (ed.) 2003 Telikepalli, Kavitha Efficient Algorithms for Abelian group isomorphism and related problems In: FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science : 23rd Conference, 277-288 Proceedings Article 8 Pantziou, Grammati E. 2000 Kontogiannis, Spyros [Pantziou, Grammati E.] [Spirakis, Paul G.] [Yung, Moti] Robust Parallel Computations through Randomization In: Theory of Computing Systems [33], 427-464 Journal Article 1999 Kagaris, Dimitrios [Pantziou, Grammati E.] [Tragoudas, Spyros] Zaroliagis, Christos Transmissions in a network with capacities and delays In: Networks [33 ], 167-174 Journal Article 1996 [Kavvadias, Dimitris J.] [Pantziou, Grammati E.] [Spirakis, Paul G.] Zaroliagis, Christos Hammock-on-ears decomposition : a technique for the efficient parallel solution of shortest paths and other problems In: Theoretical Computer Science [168], 121-154 Journal Article 1995 [Djidjev, Hristo N.] [Pantziou, Grammati E.] Zaroliagis, Christos Fast Algorithms for Maintaining Shortest Paths In: Fundamentals of Computation Theory: 10th International Conference (FCT95), 191-200 Proceedings Article 1995 [Djidjev, Hristo N.] [Pantziou, Grammati E.] Zaroliagis, Christos On-line and Dynamic Algorithms for Shortest Path Problems In: STACS95: 12th Annual Symposium on Theoretical Aspects of Computer Science, 193-204 Proceedings Article 1995 [Kagaris, Dimitrios] [Pantziou, Grammati E.] [Tragoudas, Spyros] Zaroliagis, Christos On the Computation of Fast Data Transmissions in Networks In: Algorithms and Data Structures: 4th International Workshop (WADS95), 291-302 Proceedings Article 1995 [Kagaris, Dimitrios] [Pantziou, Grammati E.] [Tragoudas, Spyros] Zaroliagis, Christos Quickest Paths: Parallelization and Dynamization In: 28th Annual Hawaii International Conference on System Sciences (HICSS-28), 39-44 Proceedings Article 1995 [Dubhashi, Devdatt] [Pantziou, Grammati E.] [Spirakis, Paul G.] Zaroliagis, Christos The Fourth Moment in Luby's Distribution In: Theoretical Computer Science [148], 133-140 Journal Article 1 Pantziou, G. E. 2000 [Djidjev, Hristo N.] Pantziou, G. E. Zaroliagis, Christos Improved algorithms for dynamic shortest paths In: Algorithmica [28], 367-389 Journal Article 2 Papadopoulou, Vicky 2002 [Andreou, Maria] Fotakis, Dimitris [Nikoletseas, Sotiris] [Papadopoulou, Vicky] [Spirakis, Paul G.] On Radiocoloring Hierarchically Specified Planar Graphs: PSPACE-Completeness and Approximations In: Mathematical Foundations of Computer Science 2002 : 27th International Symposium, MFCS 2002, 81-92 Proceedings Article 2002 Fotakis, Dimitris [Nikoletseas, Sotiris] [Papadopoulou, Vicky] [Spirakis, Paul G.] Radiocolorings in Periodic Planar Graphs: PSPACE-Completeness and Efficient Approximations for the Optimal Range of Frequencies In: Graph-Theoretic Concepts in Computer Science : 28th International Workshop, WG 2002, 223-234 Proceedings Article 2 Papadopoulou, Vicky G. (ed.) 2009 Elbassioni, Khaled Raman, Rajiv Ray, Saurabh [Sitters, Rene] On Profit-Maximizing Pricing for the Highway and Tollbooth Problems In: Algorithmic Game Theory : Second International Symposium, SAGT 2009, 275-286 In: ArXiv.org [5814], 275-286 Proceedings Article 2009 Pyrga, Evangelia [Chung, Christine] Stochastic Stability in Internet Router Congestion Games In: Algorithmic Game Theory : Second International Symposium, SAGT 2009, 183-195 Proceedings Article 2 Papaioannou, Evi 2007 [Caragiannis, Ioannis] Fishkin, Aleksei V. [Kaklamanis, Christos] [Papaioannou, Evi] A tight bound for online colouring of disk graphs In: Theoretical Computer Science [384], 152-160 Journal Article 2007 [Caragiannis, Ioannis] Fishkin, Aleksei V. [Kaklamanis, Christos] [Papaioannou, Evi] Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs In: 29th Symposium on Mathematical Foundations of Computer Science MFCS 2004, 119-136 Proceedings Article 4 Papatheodorou, Theodore S. (ed.) 1986 Fürer, Martin Mehlhorn, Kurt AT$^2$-Optimal Galois Field Multiplier for VLSI In: VLSI Algorithms and Architectures, Aegean Workshop on Computing, 217-225 Proceedings Article 1986 VLSI algorithms and architectures : Aegean workshop on computing Proceedings 1986 [Fürer, Martin] [Mehlhorn, Kurt] VLSI Algorithms and Architectures, Aegean Workshop on Computing - >> Dublette In: VLSI Algorithms and Architectures, Aegean Workshop on Computing, 328 Proceedings 1986 [Fürer, Martin] [Mehlhorn, Kurt] VLSI Algorithms and Architectures, Aegean Workshop on Computing - >> Dublette In: VLSI Algorithms and Architectures, Aegean Workshop on Computing, 328 Proceedings 11 Papatriantafilou, Marina 2010 Gidenstam, Anders [Papatriantafilou, Marina] [Tsigas, Philippas] NBmalloc: Allocating Memory in a Lock-Free Manner In: Algorithmica [58], 304-338 Journal Article 2009 Gidenstam, Anders [Papatriantafilou, Marina] [Sundell, Håkan] [Tsigas, Philippas] Efficient and Reliable Lock-Free Memory Reclamation Based on Reference Counting In: IEEE Transactions on Parallel and Distributed Systems [20], 1173-1187 Journal Article 2009 [Larsson, Andreas] Gidenstam, Anders [Ha, Phuong H.] [Papatriantafilou, Marina] [Tsigas, Philippas] Multiword Atomic Read/Write Registers on Multiprocessor Systems In: Journal of experimental algorithmics [13], 7:1-7:30 Electronic Journal Article 2009 Gidenstam, Anders [Papatriantafilou, Marina] [Tsigas, Phillipas] NBmalloc : Allocating Memory in a Lock-Free Manner In: Algorithmica [Online First], 1-35 Electronic Journal Article 2007 Gidenstam, Anders [Papatriantafilou, Marina] LFthreads: A Lock-Free Thread Library In: 11th International Conference On Principles Of Distributed Systems (OPODIS), 217-231 Proceedings Article 1998 [Panconesi, Alessandro] Papatriantafilou, Marina Tsigas, Philippas [Vitanyi, Paul] Randomized Naming Using Wait-Free Shared Variables In: Distributed Computing [11], 113-124 Journal Article 1997 Papatriantafilou, Marina Tsigas, Philippas Self-Stabilizing Wait-Free Clock Synchronization In: Parallel Processing Letters [7], 321-328 Journal Article 1997 [Mavronicolas, Marios] Papatriantafilou, Marina Tsigas, Philippas The impact of timing on linearizability in counting networks In: Proceedings of the 11th International Parallel Processing Symposium (IPPS-97), 684-688 Proceedings Article 1996 Garg, Naveen Papatriantafilou, Marina Tsigas, Philippas Distributed List Coloring: How to Dynamically Allocate Frequencies to Mobile Base Stations In: 8th Annual IEEE Symposium on Parallel and Distributed Processing (SPDP '96), 18-25 Proceedings Article 1995 [Hoepman, Jaap-Henk] Papatriantafilou, Marina Tsigas, Philippas Self-Stabilization in Wait-Free Shared Memory Objects In: Distributed Algorithms: 9th International Workshop (WDAG95), 273-287 Proceedings Article 1995 Papatriantafilou, Marina Tsigas, Philippas Wait-Free Consensus in ``In-Phase'' Multiprocessor Systems In: Seventh IEEE Symposium on Parallel and Distributed Processing, 312-319 Proceedings Article 1 Pardalos, Panos M. (ed.) 2000 [Jansen, Klaus] Solis-Oba, Roberto [Sviridenko, Maxim] Linear time approximation schemes for shop scheduling problems In: Approximation and complexity in numerical optimization, 338-346 Part of a Book 1 Paredaens, Jan (ed.) 1984 Mehlhorn, Kurt Preparata, Franco P. Area-Time Optimal VLSI Integer Multiplier with Minimum Computation Time In: Automata, languages and programming (ICALP-84) : 11th colloquium, 347-357 Proceedings Article 1 Parente, Domenico 1999 [Auletta, Vincenzo] [Dinitz, Yefim] Nutov, Zeev [Parente, Domenico] A 2-approximation algorithm for finding an optimum 3-vertex-connected spanning subgraph In: Journal of Algorithms [32], 21-30 Journal Article 2 Parida, Laxmi (ed.) 2010 [Nor, Igor] Hermelin, Danny [Charlat, Sylvain] [Engelstadter, Jan] [Reuter, Max] [Duron, Olivier Sagot, Marie-France] Mod/Resc Parsimony Inference In: Combinatorial Pattern Matching : 21st Annual Symposium, CPM 2010, 202-213 Proceedings Article 2010 [Blelloch, Guy E.] Farzan, Arash Succinct Representations of Separable Graphs In: Combinatorial Pattern Matching : 21st Annual Symposium, CPM 2010, 138-150 Proceedings Article 1 Park, Jong Hyuk (ed.) 2010 Emeliyanenko, Pavel Modular Resultant Algorithm for Graphics Processors In: Algorithms and Architectures for Parallel Processing : 10th International Conference, ICA3PP 2010. - Pt. 1, 427-440 Proceedings Article 1 Park, Kunsoo 1997 [Crochemore, Maxime] [Galil, Zvi] Gasieniec, Leszek [Park, Kunsoo] [Rytter, Wojciech] Constant-time Randomized Parallel String Matching In: SIAM Journal on Computing [26], 950-960 Journal Article 2 Park, Kunsoo (ed.) 2010 Farzan, Arash [Gagie, Travis] [Navarro, Gonzalo] Entropy-Bounded Representation of Point Grids In: Algorithms and Computation : 21st International Symposium, ISAAC 2010. - Pt. II, 327-338 Proceedings Article 2010 [Canzar, Stefan] Elbassioni, Khaled [Elmasry, Amr] [Raman, Rajiv] On the Approximability of the Maximum Interval Constrained Coloring Problem In: Algorithms and Computation : 21st International Symposium, ISAAC 2010. - Pt. II, 168-179 Proceedings Article 3 Park, Sang-Min 2001 [Park, Sang-Min] Lee, Jae-Ha [Chwa, Kyung-Yong] Visibility-Based Pursuit-Evasion in a Polygonal Region by a Searcher In: Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP-01), 456-468 Proceedings Article 2000 [Park, Sang-Min] Lee, Jae-Ha [Chwa, Kyung-Yong] Characterization of Rooms Searchable by Two Guards In: Proceedings of the 11th Conference on Algorithms and Computation, 515-526 Proceedings Article 2000 Lee, Jae-Ha [Park, Sang-Min] [Chwa, Kyung-Yong] Searching a polygonal room with one door by a 1-searcher In: International Journal of Computational Geometry and Applications [10], 201-220 Journal Article 2 Parreira, Josiane 2003 Parreira, Josiane Information Retrieval by Dimension Reduction - A Comparative Study Universität des Saarlandes Thesis - Masters thesis 2003 Parreira, Josiane On the Role of the Singular Values in Latent Semantic Indexing Universität des Saarlandes Thesis - Masters thesis 3 Parrow, Joachim (ed.) 2003 [Hall, Alex] [Hippler, Steffen] Skutella, Martin Multicommodity Flows Over Time: Efficient Algorithms and Complexity In: Automata, languages and programming : 30th International Colloquium, ICALP 2003, 397-409 Proceedings Article 2003 Fotakis, Dimitris On the Competitive Ratio for Online Facility Location In: Automata, languages and programming : 30th International Colloquium, ICALP 2003, 637-652 Proceedings Article 2003 Kärkkäinen, Juha Sanders, Peter Simple Linear Work Suffix Array Construction In: Automata, languages and programming : 30th International Colloquium, ICALP 2003, 943-955 Proceedings Article 1 Parso, Alberto (ed.) 2014 [Gagie, Travis] Gawrychowski, Pawel [Kärkkäinen, Juha] [Nekrich, Yakov] [Puglisi, Simon J.] LZ77-Based Self-indexing with Faster Pattern Matching In: LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31 - April 4, 2014. Proceedings, 731-742 Proceedings Article 1 Parvin, Bahram (ed.) 2009 Emeliyanenko, Pavel Berberich, Eric Sagraloff, Michael Visualizing Arcs of Implicit Algebraic Curves, Exactly and Fast In: Advances in Visual Computing : 5th International Symposium, ISVC 2009, 608-619 Proceedings Article 1 Pascual, Fanny 2007 Christodoulou, George [Gourves, Laurent] [Pascual, Fanny] Scheduling Selfish Tasks: About the Performance of Truthful Algorithms In: Computing and Combinatorics : 13th Annual International Conference, COCOON 2007, 187-197 Proceedings Article 1 Pasechnik, Dmitrii 2001 [Bäsken, Matthias] [Brönnimann, Hervé] [Frank, Da] [Devillers, Olivier] [Ester, Ezra] [Fabri, Andreas] [Flato, Eyal] [Gärtner, Bernd] [Giezeman, Geert-Jan] [Halperin, Dan] [Hanniel, Iddo] [Har-Peled, Sariel] [Herrmann, Thomas] Hert, Susan [Hirsch, Shai] [Hoffmann, Michael] Kettner, Lutz [Nechushtan, Oren] [Neyer, Gabriele] [Pasechnik, Dmitrii] [Pion, Sylvain] Schirra, Stefan [Schönherr, Sven] Seel, Michael [Teillaud, Monique] [Veltkamp, Remco] [Wein, Ron] [Wesselink, Wieger] [Yvinec, Mariette] CGAL Reference and User Manuals Unknown Form: eBookForm 1 Pasedach, Klaus (ed.) 1997 [Brandenburg, Franz J.] [Jünger, Michael] Mutzel, Petra [Lengauer, Thomas] SPP 731 : Algorithmen zum automatischen Zeichnen von Graphen im Rahmen des DFG-Schwerpunkts "Effiziente Algorithmen für diskrete Probleme und ihre Anwendungen" In: Informatik '97 : Informatik als Innovationsmotor : 27. Jahrestagung der Gesellschaft für Informatik, 58-67 Proceedings Article 2 Pasquale, Francesco 2013 [Clementi, Andrea] [Crescenzi, Pierluigi] Doerr, Carola [Fraigniaud, Pierre] [Pasquale, Francesco] [Silvestri, Riccardo] Diffusion probabiliste dans les reseaux dynamiques In: Proc. of the 15èmes Rencontres Francophones pour les Aspects Algorithmiques des Télécommunications (AlgoTel 2013), Proceedings Article 2013 [Clementi, Andrea] [Crescenzi, Pierluigi] Doerr, Carola [Fraigniaud, Pierre] [Isopi, Marc] [Panconesi, Alessandro] [Pasquale, Francesco] [Silvestri, Riccardo] Rumor Spreading in Random Evolving Graphs In: Proc. of the 21st European Symposium on Algorithms (ESA 2013), 325-336 Proceedings Article 1 Pasqualone, Giulio 1998 [Frigioni, Daniele] Miller, Tobias [Nanni, Umberto] [Pasqualone, Giulio] Schäfer, Guido Zaroliagis, Christos An experimental study of dynamic algorithms for directed graphs In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), 368-380 Proceedings Article 2 Paterson, Michael S. (ed.) 1990 Cheriyan, Joseph Hagerup, Torben Mehlhorn, Kurt Can A Maximum Flow be Computed in o(nm) Time? In: Automata, languages and programming (ICALP-90) : 17th international colloquium, 235-248 Proceedings Article 1990 Näher, Stefan Mehlhorn, Kurt LEDA: A Library of Efficient Data Types and Algorithms In: Automata, languages and programming (ICALP-90) : 17th international colloquium, 1-5 Proceedings Article 2 Paterson, Mike 2000 [Goldberg, Leslie Ann] [MacKenzie, Philip D.] [Paterson, Mike] Srinivasan, Aravind Contention resolution with constant expected delay In: Journal of the ACM [42], 1048-1096 Journal Article 1995 [Cole, Richard] Hariharan, Ramesh [Paterson, Mike] [Zwick, Uri] Tighter Lower Bounds on the Exact Complexity of String Matching In: SIAM Journal on Computing [24], 30-45 Journal Article 4 Paterson, Mike (ed.) 2000 Lee, Jae-Ha [Cheong, Otfried] [Kwon, Woo-Cheol] [Shin, Sung-Yong] [Chwa, Kyung-Yong] Approximation of Curvature-constrained Shortest Paths through a Sequence of Points In: Algorithms - ESA 2000, Proceedings of the 8th Annual European Symposium (ESA-00), 314-325 Proceedings Article 2000 Sanders, Peter [Solis-Oba, Roberto] How Helpers Hasten h-Relations In: Algorithms - ESA 2000, Proceedings of the 8th Annual European Symposium (ESA-00), 392-402 Proceedings Article 2000 Fleischer, Rudolf Wahl, Michaela Online scheduling revisited In: Algorithms - ESA 2000, Proceedings of the 8th Annual European Symposium (ESA-00), 202-210 Proceedings Article 2000 Mehlhorn, Kurt Ziegelmann, Mark Resource Constrained Shortest Paths In: Algorithms - ESA 2000, Proceedings of the 8th Annual European Symposium (ESA-00), 326-337 Proceedings Article 1 Patrikalakis, Nicholas M. (ed.) 2002 Schömer, Elmar Reichel, Joachim Warken, Thomas Lennerz, Christian Efficient Collision Detection for Curved Solid Objects In: Proceedings of the Seventh ACM Symposium on Solid Modeling and Applications, 321-328 Proceedings Article 1 Patt-Shamir, Boaz 2004 Kesselman, Alexander [Lotker, Zvi] [Mansour, Yishay] [Patt-Shamir, Boaz] [Schieber, Baruch] [Sviridenko, Maxim] Buffer Overflow Management in QoS Switches In: SIAM Journal on Computing [33], 563-583 Journal Article 1 Paturi, Ramamohan 2012 [Cygan, Marek] [Dell, Holger] [Lokshtanov, Daniel] [Marx, Daniel] [Nederlof, Jesper] [Okamoto, Yoshio] [Paturi, Ramamohan] [Saurabh, Saket] Wahlström, Magnus On Problems as Hard as CNF-SAT In: 2012 IEEE 27th Conference on Computational Complexity (CCC 2012), 74-84 Proceedings Article 2 Pauling, Josch 2012 Baumbach, Jan Friedrich, Tobias Kötzing, Timo [Krohmer, Anton] Müller, Joachim Pauling, Josch Efficient algorithms for extracting biological key pathways with global constraints In: GECCO'12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation, 169-176 Proceedings Article 2012 Alcaraz, Nicolas Friedrich, Tobias Kötzing, Timo [Krohmer, Anton] Müller, Joachim Pauling, Josch Baumbach, Jan Efficient key pathway mining: combining networks and OMICS data In: Integrative Biology [4], 756-764 Journal Article 1 Pauly, Mark 2007 [Miklos, Balint] Giesen, Joachim [Pauly, Mark] Medial Axis Approximation from Inner Voronoi Balls: A Demo of the Mesecina Tool In: Proceedings of the Twenty-Third Annual Symposium on Computational Geometry (SCG'07), 123-124 Proceedings Article 1 Paul, Christophe 2012 [Kim, Eun Jung] [Paul, Christophe] Philip, Geevarghese A Single-exponential FPT Algorithm for the K4-Minor Cover Problem In: Algorithm Theory - SWAT 2012 : 13th Scandinavian Symposium and Workshops, 119-130 Proceedings Article 1 Paul, Markus 1991 Alt, Helmut Blum, Norbert Mehlhorn, Kurt Paul, Markus Computing a maximum cardinality matching in a bipartite graph in time $O(n^1.5 \sqrtm/\log n)$ In: Information Processing Letters [37], 237-240 Journal Article 1 Paul, Wiegand R. (ed.) 2009 [Bringmann, Karl] [Friedrich, Tobias] Don't be greedy when calculating hypervolume contributions In: FOGA'09 : revised selected papers from ACM SIGEVO Foundations of Genetic Algorithms X, 103-112 Proceedings Article 2 Paul, Wolfgang J. 1992 Mehlhorn, Kurt [Paul, Wolfgang J.] Uhrig, C $k$ versus $k+1$ Index Registers and Modifiable versus Non-modifiable Programs In: Information and Computation [101], 123-129 Journal Article 1989 Mehlhorn, Kurt [Paul, Wolfgang J.] Two Versus One Index Register and Modifiable Versus Non-modifiable Programs In: Automata, languages and programming (ICALP-89) : 16th international colloquium, 603-609 Proceedings Article 1 Paul, Wolfgang J. (ed.) 1992 Klein, Rolf Mehlhorn, Kurt Meiser, Stefan Randomized incremental construction of abstract Voronoi diagrams In: Informatik---Festschrift zum 60.~Geburtstag von Günter Hotz, 283-308 Part of a Book 1 Pavone, Mario (ed.) 2012 Kötzing, Timo [Molter, Hendrik] ACO beats EA on a dynamic pseudo-Boolean function In: Parallel Problem Solving from Nature - PPSN XII : 12th International Conference, 113-122 Proceedings Article 1 Pedrycz, Witold (ed.) 2009 [Helwig, Sabine] Neumann, Frank [Wanka, Rolf] Particle Swarm Optimization with Velocity Adaptation In: 2009 International Conference on Adaptive and Intelligent Systems ICAIS 2009 : proceedings, 146-151 Proceedings Article 1 Pehrson, Bjoern (ed.) 1994 Mehlhorn, Kurt Näher, Stefan The Implementation of Geometric Algorithms In: Technology and foundations : Information Processing '94 ; proceedings of the IFIP 13th World Computer Congress, 223-231 Proceedings Article 13 Pelc, Andrzej 2006 [Czyzowicz, Jurek] Kowalski, Dariusz [Markou, Euripides] [Pelc, Andrzej] Complexity of searching for a black hole Unpublished/Draft 2006 [Dessmark, Anders] [Fraigniaud, Pierre] Kowalski, Dariusz [Pelc, Andrzej] Deterministic rendezvous in graphs Unpublished/Draft 2006 [Dessmark, Anders] [Fraigniaud, Pierre] Kowalski, Dariusz [Pelc, Andrzej] Deterministic Rendezvous in Graphs In: Algorithmica [46], 69-96 Journal Article 2005 [Czyzowicz, Jurek] Kowalski, Dariusz [Markou, Euripides] [Pelc, Andrzej] Searching for a black hole in tree networks In: Principles of distributed systems : 8th International Conference, OPODIS 2004, 67-80 Proceedings Article 2005 Kowalski, Dariusz [Pelc, Andrzej] Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism In: Theoretical Computer Science [333], 355-371 Journal Article 2004 Kowalski, Dariusz [Pelc, Andrzej] Centralized deterministic broadcasting in undirected multi-hop radio networks In: Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques. 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004, and 8th International Workshop on Randomization and Computation, RANDOM 2004, 171-182 Proceedings Article 2004 [Fraigniaud, Pierre] [Gasieniec, Leszek] Kowalski, Dariusz [Pelc, Andrzej] Collective Tree Exploration In: LATIN 2004: Theoretical informatics, 6th Latin American Symposium, 141-151 Proceedings Article 2004 Kowalski, Dariusz [Pelc, Andrzej] Polynomial deterministic rendezvous in arbitrary graphs In: Algorithms and Computation: 15th International Symposium, ISAAC 2004, 644-656 Proceedings Article 2004 Kowalski, Dariusz [Pelc, Andrzej] Time of deterministic broadcasting in radio networks with local knowledge In: SIAM Journal on Computing [33], 870-891 Journal Article 2003 Kowalski, Dariusz [Pelc, Andrzej] Time of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism In: Proceedings of the 10th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2003), 195-210 Proceedings Article 1997 Gasieniec, Leszek [Pelc, Andrzej] Broadcasting with a bounded fraction of faulty nodes In: Journal of Parallel and Distributed Computing [42], 11-20 Journal Article 1996 Gasieniec, Leszek [Pelc, Andrzej] Adaptive Broadcasting with Faulty Nodes In: Parallel Computing [22], 903-912 Journal Article 1996 Gasieniec, Leszek [Kranakis, Evangelos] [Krizanc, Danny] [Pelc, Andrzej] Minimizing Congestion of Layouts for ATM Networks with Faulty Links In: Mathematical Foundations of Computer Science 1996: 21st International Symposium (MFCS'96), 392-403 Proceedings Article 1 Peleg, David 2009 Amini, Omid [Peleg, David] [Pérennes, Stéphane] [Sau, Ignasi] [Saurabh, Saket] Degree-Constrained Subgraph Problems: Hardness and Approximation Results In: Approximation and Online Algorithms : 6th International Workshop, WAOA 2008, 29-42 Proceedings Article 5 Peleg, David (ed.) 2013 Bringmann, Karl [Friedrich, Tobias] Exact and Efficient Generation of Geometric Random Variates and Random Graphs In: Automata, Languages, and Programming - 40th International Colloquium (ICALP-13), 267-278 Proceedings Article 2013 Hoefer, Martin [Wagner, Lisa] Locally Stable Marriage with Strict Preferences In: 40th International Colloquium on Automata, Languages and Programming (ICALP-13), 620-631 Proceedings Article 2013 Anand, S Bringmann, Karl [Friedrich, Tobias] [Garg, Naveen] [Kumar, Amit] Minimizing maximum (weighted) flow-time on related and unrelated machines In: Automata, Languages, and Programming - 40th International Colloquium (ICALP-13), 13-24 Proceedings Article 2013 Jez, Artur One-Variable Word Equations in Linear Time In: 40th International Colloquium on Automata, Languages, and Programming (ICALP 2013), 324-335 Proceedings Article 2013 Bringmann, Karl Doerr, Benjamin Neumann, Adrian [Sliacan, Jakub] Online Checkpointing with Improved Worst-Case Guarantees In: Automata, Languages, and Programming - 40th International Colloquium (ICALP 2013), 255-266 Proceedings Article 8 Pelikan, Martin (ed.) 2010 Kötzing, Timo [Lehre, Per Kristian] Neumann, Frank [Oliveto, Pietro S.] Ant Colony Optimization and the Minimum Cut Problem In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 1393-1400 Proceedings Article 2010 Johannsen, Daniel Lengler, Johannes Can Quantum Search Accelerate Evolutionary Algorithms? In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 1433-1440 Proceedings Article 2010 Doerr, Benjamin [Johannsen, Daniel] Edge-based representation beats vertex-based representation in shortest path problems In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 759-766 Proceedings Article 2010 Doerr, Benjamin Johannsen, Daniel Winzen, Carola Multiplicative Drift Analysis In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 1449-1456 Proceedings Article 2010 Doerr, Benjamin Fouz, Mahmoud [Witt, Carsten] Quasirandom Evolutionary Algorithms In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 1457-1464 Proceedings Article 2010 [Berghammer, Rudolf] Friedrich, Tobias Neumann, Frank Set-based Multi-Objective Optimization, Indicators, and Deteriorative Cycles In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 495-502 Proceedings Article 2008 GECCO 2008: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation Proceedings 2007 GECCO 2007: Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation Proceedings 1 Pemmaraju, Sriram V. 2011 [Pemmaraju, Sriram V.] Raman, Rajiv [Varadarajan, Kasturi] Max-coloring and online coloring with bandwidths on interval graphs In: ACM Transactions on Algorithms [7], 35:1-35:21 Journal Article 3 Penczek, Wojciech (ed.) 1996 Gasieniec, Leszek [Kranakis, Evangelos] [Krizanc, Danny] [Pelc, Andrzej] Minimizing Congestion of Layouts for ATM Networks with Faulty Links In: Mathematical Foundations of Computer Science 1996: 21st International Symposium (MFCS'96), 392-403 Proceedings Article 1996 [Chlebus, Bogdan S.] [Czumaj, Artur] Gasieniec, Leszek [Kowaluk, Miroslaw] [Plandowski, Wojciech] Parallel Alternating-Direction Access Machine In: Mathematical Foundations of Computer Science 1996: 21st International Symposium (MFCS'96), 255-266 Proceedings Article 1996 Sibeyn, Jop F. Routing on Triangles, Tori and Honeycombs In: Mathematical Foundations of Computer Science 1996: 21st International Symposium (MFCS'96), 529-541 Proceedings Article 1 Penfield, Paul (ed.) 1984 Lengauer, Thomas Mehlhorn, Kurt The HILL system: A design environment for the hierarchical spezification, compaction, and simulation of integrated circuit layouts In: Proceedings, Conference on Advanced Research in VLSI, 139-149 Proceedings Article 1 Penninkx, Eelko 2006 [Bodlaender, Hans L.] [Feremans, Corinne] [Grigoriev, Alexander] [Penninkx, Eelko] Sitters, Rene [Wolle, Thomas] On the minimum corridor connection and other generalized geometric problems In: 4th Workshop on Approximation and Online Algorithms, WAOA, 69-82 Proceedings Article 1 Penn, Michael 2000 Nutov, Zeev [Penn, Michael] On Integrality, Stability and Composition of Dicycle Packings and Covers In: Journal of Combinatorial Optimization [4], 235 - 252 Journal Article 1 Penttonen, Martti 1997 [Dietzfelbinger, Martin] Hagerup, Torben Katajainen, Jyrki [Penttonen, Martti] A reliable randomized algorithm for the closest-pair problem In: Journal of Algorithms [25], 19-51 Journal Article 2 Penttonen, Martti (ed.) 2002 Kärkkäinen, Juha Computing the threshold for q-gram filters In: Algorithm theory, SWAT 2002 : 8th Scandinavian Workshop on Algorithm Theory, 348-357 Proceedings Article 2002 Sanders, Peter Vöcking, Berthold Random Arc Allocation and Applications to Disks, Drums and DRAMs In: Algorithm theory, SWAT 2002 : 8th Scandinavian Workshop on Algorithm Theory, 121-130 Proceedings Article 2 Pérennes, Stéphane 2009 Amini, Omid [Peleg, David] [Pérennes, Stéphane] [Sau, Ignasi] [Saurabh, Saket] Degree-Constrained Subgraph Problems: Hardness and Approximation Results In: Approximation and Online Algorithms : 6th International Workshop, WAOA 2008, 29-42 Proceedings Article 2009 Amini, Omid [Pérennes, Stéphane] [Sau, Ignasi] Hardness and approximation of traffic grooming In: Theoretical Computer Science [410], 3751-3760 Journal Article 1 Perez-Gimenez, Xavier 2011 [Müller, Tobias] Perez-Gimenez, Xavier [Wormald, Nicholas] Disjoint Hamilton cycles in the random geometric graph In: Journal of Graph Theory [68], 299-322 Journal Article 1 Persiano, Giuseppe (ed.) 2012 Harren, Rolf [Kern, Walter] Improved Lower Bound for Online Strip Packing In: Approximation and Online Algorithms : 9th International Workshop ,WAOA 2011, 211-218 Proceedings Article 3 Persiano, Pino (ed.) 2012 van Zuylen, Anke Simpler 3/4-approximation algorithms for MAX SAT In: Approximation and Online Algorithms : 9th International Workshop, WAOA 2011, 188-197 Proceedings Article 2005 [Ahuja, Nitin] [Baltz, Andreas] Doerr, Benjamin [Privetivy, Ales] [Srivastav, Anand] On the Minimum Load Coloring Problem In: Third Workshop on Approximation and Online Algorithms (WAOA 2005), 15-26 Proceedings Article 2005 Doerr, Benjamin Friedrich, Tobias Klein, Christian Osbild, Ralf Rounding of Sequences and Matrices, with Applications In: Third Workshop on Approximation and Online Algorithms (WAOA 2005), 96-109 Proceedings Article 1 Petcu, Adrian (ed.) 2005 [Beldiceanu, Nicolas] Katriel, Irit Thiel, Sven GCC-like Restrictions on the Same constraint In: Constraint Satisfaction and Constraint Logic Programming : ERCIM/CoLogNet International Workshop, CSCLP 2004, 1-11 In: Recent Advances in Constraints [3419], 1-11 Proceedings Article 1 Petersson, Ola 2000 [Andersson, Arne] Hagerup, Torben [Hastad, Johan] [Petersson, Ola] Tight bounds for searching a sorted array of strings In: SIAM Journal on Computing [30], 1552-1578 Journal Article 3 Petitjean, Sylvain 2011 Hemmer, Michael [Dupon, Laurent] [Petitjean, Sylvain] [Schomer, Elmar] A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics In: Journal of Symbolic Computation [46], 467-494 Journal Article 2008 Hemmer, Michael [Dupont, Laurent] [Petitjean, Sylvain] [Schömer, Elmar] Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangment of Quadrics Report 2007 [Dupont, Laurent] Hemmer, Michael [Petitjean, Sylvain] [Schömer, Elmar] Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics In: 15th Annual European Symposium on Algorithms, 633-644 Proceedings Article 3 Petitjean, Sylvain (ed.) 2008 Berberich, Eric Kerber, Michael Arrangements on Surfaces of Genus One: Tori and Dupin Cyclides In: 24th European Workshop on Computational Geometry - Collection of Abstracts, 209-212 Proceedings Article 2008 Berberich, Eric Kerber, Michael Sagraloff, Michael Geometric Analysis of Algebraic Surfaces Based on Planar Arrangements In: 24th European Workshop on Computational Geometry - Collection of Abstracts, 29-32 Proceedings Article 2008 Dumitriu, Daniel [Funke, Stefan] Kutz, Martin [Milosavljevic, Nikola] On the Locality of Extracting a 2-Manifold in $R^3$ In: Collection of abstracts of the 24th European Workshop on Computational Geometry, 205-208 Proceedings Article 1 Petri, Tobias H. 2009 [Shervashidze, Nino] Vishwanathan, S .V. N. [Petri, Tobias H.] Mehlhorn, Kurt [Borgwardt, Karsten M.] Efficient Graphlet Kernels for Large Graph Comparison In: Proceedings of the Twelfth International Conference on Artificial Intelligence and Statistics (AISTATS), 488-495 Electronic Proceedings Article 8 Pettie, Seth 2011 [Baswana, Surender] [Kavitha, Telikepalli] Mehlhorn, Kurt [Pettie, Seth] Additive Spanners and (α, β)-Spanners In: ACM Transactions on Algorithms [7], 5:1-5:26 Journal Article 2005 Pettie, Seth Sanders, Peter Computing Approximate Matchings in External Memory, Streaming, Parallel, and Distributed Network Models Unpublished/Draft 2005 Baswana, Surender Telikepalli, Kavitha Mehlhorn, Kurt Pettie, Seth New Constructions of (alpha, beta)-Spanners and Purely Additive Spanners In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 672-681 Proceedings Article 2005 Pettie, Seth Sensitivity Analysis of Minimum Spanning Trees in Sub-Inverse-Ackermann Time In: Algorithms and computation : 16th International Symposium, ISAAC 2005, 964-973 Proceedings Article 2005 [Mortensen, Christian Worm] Pettie, Seth The complexity of implicit and space-efficient priority queues In: Algorithms and data structures : 9th International Workshop, WADS 2005, 49-60 Proceedings Article 2005 Pettie, Seth Towards a final analysis of pairing heaps In: 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 174-183 Proceedings Article 2004 Pettie, Seth Sanders, Peter A simpler linear time 2/3 - eps approximation for maximum weight matching In: Information Processing Letters [91], 271-276 Journal Article 2004 Sanders, Peter Pettie, Seth A Simpler Linear Time 2/3 - epsilon Approximation for Maximum Weight Matching Report 2 Pevzner, Pavel A. (ed.) 2014 [Babenko, Maxim A.] [Gawrychowski, Pawel] [Kociumaka, Tomasz] [Starikovskaya, Tatiana A.] Computing Minimal and Maximal Suffixes of a Substring Revisited In: Combinatorial Pattern Matching - 25th Annual Symposium, CPM 2014, Moscow, Russia, June 16-18, 2014. Proceedings, 30-39 Proceedings Article 2014 Gawrychowski, Pawel [Uznanski, Przemyslaw] Order-Preserving Pattern Matching with k Mismatches In: Combinatorial Pattern Matching - 25th Annual Symposium, CPM 2014, Moscow, Russia, June 16-18, 2014. Proceedings, 130-139 Proceedings Article 4 Pevzner, Pavel (ed.) 2014 Jez, Artur A really Simple Approximation of Smallest Grammar In: 25th Annual Symposium on Combinatorial Pattern Matching (CPM 2014), 182-191 Proceedings Article 2000 Althaus, Ernst Kohlbacher, Oliver Lenhof, Hans-Peter Müller, Peter A Combinatorial Approach to Protein Docking with Flexible Side-Chains In: Proceedings of the 4th Annual International Conference on Computational Molecular Biology (RECOMB-00), 15-24 Proceedings Article 1999 Burkhardt, Stefan Crauser, Andreas [Ferragina, Paolo] Lenhof, Hans-Peter [Rivals, Eric] [Vingron, Martin] q-gram Based Database Searching Using a Suffix Array (QUASAR) In: Proceedings of the 3rd Annual International Conference on Computational Molecular Biology (RECOMB-99), 77-83 Proceedings Article 1998 Lenhof, Hans-Peter Reinert, Knut [Vingron, Martin] A polyhedral approach to RNA sequence structure alignment In: Proceedings of the 2nd Annual International Conference on Computational Molecular Biology (RECOMB-98), 153-162 Proceedings Article 21 Philip, Geevarghese 2012 [Kim, Eun Jung] [Paul, Christophe] Philip, Geevarghese A Single-exponential FPT Algorithm for the K4-Minor Cover Problem In: Algorithm Theory - SWAT 2012 : 13th Scandinavian Symposium and Workshops, 119-130 Proceedings Article 2012 Mnich, Matthias Philip, Geevarghese [Saurabh, Saket] [Suchy, Ondrej] Beyond Max-Cut: lambda-Extendible Properties Parameterized Above the Poljak-Turzík Bound In: 32nd International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012), 412-423 Electronic Proceedings Article 2012 [Misra, Neeldhara] Philip, Geevarghese [Raman, Venkatesh] [Saurabh, Saket] [Sikdar, Somnath] FPT Algorithms for Connected Feedback Vertex Set In: Journal of Combinatorial Optimization [24], 131-146 Journal Article 2012 [Misra, Neeldhara] Philip, Geevarghese [Raman, Venkatesh] [Saurabh, Saket] On Parameterized Independent Feedback Vertex Set In: Theoretical Computer Science [461], 65-75 Journal Article 2012 Philip, Geevarghese [Raman, Venkatesh] [Sikdar, Somnath] Polynomial kernels for dominating set in graphs of bounded degeneracy and beyond In: ACM Transactions on Algorithms [9], 23 Journal Article 2011 [Arumugam, S.] [Chandrasekar, K. Raja] [Misra, Neeldhara] Philip, Geevarghese [Saurabh, Saket] Algorithmic Aspects of Dominator Colorings in Graphs In: Combinatorial Algorithms - 22nd International Workshop, IWOCA 2011, Victoria, BC, Canada, July 20-22, 2011, Revised Selected Papers, 19-30 Proceedings Article 2011 [Cygan, Marek] Philip, Geevarghese [Pilipczuk, Marcin] [Pilipczuk, Micha\l{}] [Wojtaszczyk, Jakub Onufry] Dominating set is fixed parameter tractable in claw-free graphs In: Theoretical Computer Science [412], 6982-7000 Journal Article 2011 [Fomin, Fedor V.] [Lokshtanov, Daniel] [Misra, Neeldhara] Philip, Geevarghese [Saurabh, Saket] Hitting forbidden minors: Approximation and Kernelization In: 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany, 189-200 Proceedings Article 2011 [Fomin, Fedor V.] Philip, Geevarghese [Villanger, Yngve] Minimum Fill-in of Sparse Graphs: Kernelization and Approximation In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India, 164-175 Proceedings Article 2011 [Misra, Neeldhara] Philip, Geevarghese [Raman, Venkatesh] [Saurabh, Saket] On Parameterized Independent Feedback Vertex Set In: Computing and Combinatorics - 17th Annual International Conference, COCOON 2011, Dallas, TX, USA, August 14-16, 2011. Proceedings, 98-109 Proceedings Article 2011 [Bredereck, Robert] [Nichterlein, Andr{\'e}] [Niedermeier, Rolf] Philip, Geevarghese Pattern-Guided Data Anonymization and Clustering In: Mathematical Foundations of Computer Science 2011 - 36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011. Proceedings, 182-193 Proceedings Article 2011 [Fernau, Henning] [Fomin, Fedor V.] [Lokshtanov, Daniel] [Mnich, Matthias] Philip, Geevarghese [Saurabh, Saket] Ranking and Drawing in Subexponential Time In: Combinatorial Algorithms - 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers, Proceedings Article 2011 [Bredereck, Robert] [Nichterlein, Andr{\'e}] [Niedermeier, Rolf] Philip, Geevarghese The Effect of Homogeneity on the Complexity of $k$-Anonymity In: Fundamentals of Computation Theory - 18th International Symposium, FCT 2011, Oslo, Norway, August 22-25, 2011. Proceedings, 53-64 Proceedings Article 2011 Philip, Geevarghese The Kernelization Complexity of some Domination and Covering Problems Homi Bhabha National Institute Thesis - PhD thesis 2010 Philip, Geevarghese [Raman, Venkatesh] [Villanger, Yngve] A Quartic Kernel for Pathwidth-One Vertex Deletion In: Graph Theoretic Concepts in Computer Science - 36th International Workshop, WG 2010, Zar\'os, Crete, Greece, June 28-30, 2010 Revised Papers, 196-207 Proceedings Article 2010 [Misra, Neeldhara] Philip, Geevarghese [Raman, Venkatesh] [Saurabh, Saket] [Sikdar, Somnath] FPT Algorithms for Connected Feedback Vertex Set In: WALCOM: Algorithms and Computation, 4th International Workshop, WALCOM 2010, Dhaka, Bangladesh, February 10-12, 2010. Proceedings, 269-280 Proceedings Article 2010 [Ambalath, Abhimanyu M.] [Balasundaram, Radheshyam] [H., Chintan Rao] [Koppula, Venkata] [Misra, Neeldhara] Philip, Geevarghese [Ramanujan, M. S.] On the Kernelization Complexity of Colorful Motifs In: Parameterized and Exact Computation - 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings, 14-25 Proceedings Article 2010 [Fernau, Henning] [Fomin, Fedor V.] Philip, Geevarghese [Saurabh, Saket] The Curse of Connectivity: $t$-Total Vertex (Edge) Cover In: Computing and Combinatorics, 16th Annual International Conference, COCOON 2010, Nha Trang, Vietnam, July 19-21, 2010. Proceedings, 34-43 Proceedings Article 2010 [Misra, Neeldhara] Philip, Geevarghese [Raman, Venkatesh] [Saurabh, Saket] The effect of girth on the kernelization complexity of Connected Dominating Set In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India, 96-107 Proceedings Article 2009 Philip, Geevarghese [Raman, Venkatesh] [Sikdar, Somnath] Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels In: Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings, 694-705 Proceedings Article 2008 Philip, Geevarghese Fixed-Parameter Algorithms for Graph Problems Using Graph Minor Theory Homi Bhabha National Institute Thesis - Masters thesis 1 Piccialli, Veronica (ed.) 2011 van Zuylen, Anke [Schalekamp, Frans] [Williamson, David P.] Popular Ranking In: 10th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2011, 267-270 Electronic Proceedings Article 5 Pietracaprina, Andrea (ed.) 1998 Solis-Oba, Roberto 2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), 441-452 Proceedings Article 1998 [Frigioni, Daniele] Miller, Tobias [Nanni, Umberto] [Pasqualone, Giulio] Schäfer, Guido Zaroliagis, Christos An experimental study of dynamic algorithms for directed graphs In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), 368-380 Proceedings Article 1998 Chong, Ka Wong Ramos, Edgar A. Improved deterministic parallel padded sorting In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), 405-416 Proceedings Article 1998 Bradford, Phillip Gnassi [Golin, Mordecai J.] [Larmore, Lawrence L.] [Rytter, Wojciech] Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), 43-54 Proceedings Article 1998 Meyer, Ulrich Sanders, Peter $\Delta$-Stepping: A Parallel Single Source Shortest Path Algorithm In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), 393-404 Proceedings Article 3 Pilipczuk, Marcin 2012 [Cygan, Marek] [Kratsch, Stefan] [Pilipczuk, Marcin] [Pilipczuk, Michał] Wahlström, Magnus Clique Cover and Graph Separation: New Incompressibility Results In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 254-265 Proceedings Article 2012 [Kratsch, Stefan] [Pilipczuk, Marcin] [Pilipczuk, Michał] Wahlström, Magnus Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs In: Automata, Languages, and Programming ; 39th International Colloquium, ICALP 2012, 581-593 Proceedings Article 2011 [Cygan, Marek] Philip, Geevarghese [Pilipczuk, Marcin] [Pilipczuk, Micha\l{}] [Wojtaszczyk, Jakub Onufry] Dominating set is fixed parameter tractable in claw-free graphs In: Theoretical Computer Science [412], 6982-7000 Journal Article 1 Pilipczuk, Micha 1 l{} 2011 [Cygan, Marek] Philip, Geevarghese [Pilipczuk, Marcin] [Pilipczuk, Micha\l{}] [Wojtaszczyk, Jakub Onufry] Dominating set is fixed parameter tractable in claw-free graphs In: Theoretical Computer Science [412], 6982-7000 Journal Article 2 Pilipczuk, Michał 2012 [Cygan, Marek] [Kratsch, Stefan] [Pilipczuk, Marcin] [Pilipczuk, Michał] Wahlström, Magnus Clique Cover and Graph Separation: New Incompressibility Results In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 254-265 Proceedings Article 2012 [Kratsch, Stefan] [Pilipczuk, Marcin] [Pilipczuk, Michał] Wahlström, Magnus Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs In: Automata, Languages, and Programming ; 39th International Colloquium, ICALP 2012, 581-593 Proceedings Article 1 Pillichshammer, Friedrich 2008 Doerr, Benjamin [Gnewuch, Michael] [Kritzer, Peter] [Pillichshammer, Friedrich] Component-by-component construction of low-discrepancy point sets of small size In: Monte Carlo Methods and Applications [14], 129-149 Journal Article 1 Pillichshammer, Peter 2008 Doerr, Benjamin [Gnewuch, Michael] [Kritzer, Peter] [Pillichshammer, Peter] Component-by-component construction of low-discrepancy point sets of small size In: Monte Carlo Methods Applications [14], 129-150 Journal Article 1 Pinotti, M. Cristina 1998 Brodal, Gerth Stølting [Pinotti, M. Cristina] Comparator Networks for Binary Heap Construction In: Proceedings of the 6th Scandinavian Workshop on Algorithm Theory (SWAT-98), 158-168 Proceedings Article 1 Pin, Jean-Eric (ed.) 2014 [Diekert, Volker] Jez, Artur [Plandowski, Wojciech] Finding All Solutions of Equations in Free Groups and Monoids with Involution In: 9th International Computer Science Symposium in Russia (CSR 2014), 1-15 Proceedings Article 14 Pion, Sylvain 2008 Kettner, Lutz Mehlhorn, Kurt [Pion, Sylvain] [Schirra, Stefan] [Yap, Chee] Classroom Examples of Robustness Problems in Geometric Computations In: Computational Geometry: Theory and Applications [40], 61-78 Journal Article 2008 Berberich, Eric Hemmer, Michael [Karavelas, Menelaos] [Pion, Sylvain] [Teillaud, Monique] [Tsigaridas, Elias] Prototype implementation of the algebraic kernel Report 2007 [Mourrain, Bernard] [Pion, Sylvain] Schmitt, Susanne [Técourt, Jean-Pierre] [Tsigaridas, Elias] Wolpert, Nicola Algebraic Issues in Computational Geometry In: Effective Computational Geometry for Curves and Surfaces, 117-155 Part of a Book 2007 [Hert, Susan] [Hoffmann, Michael] Kettner, Lutz [Pion, Sylvain] [Seel, Michael] An adaptable and extensible geometry kernel In: Computational Geometry: Theory and Applications [38], 16-36 Journal Article 2007 Hemmer, Michael [Hert, Susan] [Kettner, Lutz] [Pion, Sylvain] [Schirra, Stefan] Number Types, CGAL - Computational Geometry Algorithms Library, release 3.3 Manual 2006 Berberich, Eric Hemmer, Michael [Karavelas, Menelaos] [Pion, Sylvain] [Teillaud, Monique] [Tsigaridas, Elias] Interface specification of algebraic kernel Report 2006 Kettner, Lutz Mehlhorn, Kurt [Pion, Sylvain] [Schirra, Stefan] [Yap, Chee] Reply to "Backward Error Analysis ..." In: Computational Science and Its Applications - ICCSA 2006, I, 60-60 Proceedings Article 2004 Berberich, Eric Eigenwillig, Arno [Emiris, Ioannis] [Fogel, Efraim] [Hemmer, Michael] [Halperin, Dan] [Kakargias, Athanasios] Kettner, Lutz Mehlhorn, Kurt [Pion, Sylvain] [Schömer, Elmar] [Teillaud, Monique] [Wein, Ron] Wolpert, Nicola An Empirical Comparison of Software for Constructing Arrangements of Curved Arcs Report 2004 Kettner, Lutz Mehlhorn, Kurt Pion, Sylvain [Schirra, Stefan] [Yap, Chee] Classroom Examples of Robustness Problems in Geometric Computations Report 2004 Kettner, Lutz Mehlhorn, Kurt [Pion, Sylvain] [Schirra, Stefan] [Yap, Chee] Classroom Examples of Robustness Problems in Geometric Computations In: ESA 2004: 12th Annual European Symposium on Algorithms, 702-713 Proceedings Article 2001 Hert, Susan [Hoffmann, Michael] [Kettner, Lutz] [Pion, Sylvain] Seel, Michael An Adaptable and Extensible Geometry Kernel In: Proceedings of the 5th International Workshop on Algorithm Engineering (WAE-01), 79-90 Proceedings Article 2001 [Bäsken, Matthias] [Brönnimann, Hervé] [Frank, Da] [Devillers, Olivier] [Ester, Ezra] [Fabri, Andreas] [Flato, Eyal] [Gärtner, Bernd] [Giezeman, Geert-Jan] [Halperin, Dan] [Hanniel, Iddo] [Har-Peled, Sariel] [Herrmann, Thomas] Hert, Susan [Hirsch, Shai] [Hoffmann, Michael] Kettner, Lutz [Nechushtan, Oren] [Neyer, Gabriele] [Pasechnik, Dmitrii] [Pion, Sylvain] Schirra, Stefan [Schönherr, Sven] Seel, Michael [Teillaud, Monique] [Veltkamp, Remco] [Wein, Ron] [Wesselink, Wieger] [Yvinec, Mariette] CGAL Reference and User Manuals Unknown Form: eBookForm 2001 [Brönnimann, Hervé] Burnikel, Christoph [Pion, Sylvain] Interval arithmetic yields efficient dynamic filters for computational geometry In: Discrete Applied Mathematics [109], 25-47 Journal Article 1998 [Brönnimann, Hervé] Burnikel, Christoph [Pion, Sylvain] Interval analysis yields efficient dynamic filters for computational geometry In: Proceedings of the 14th International Annual ACM Symposium on Computational Geometry (SCG-98), 165-174 Proceedings Article 1 Pirillo, G. (ed.) 1998 Solis-Oba, Roberto Frederickson, Greg N. Rooted Spanning Trees with Small Weight and Average Length In: Theoretical Computer Science, 114-125 Proceedings Article 1 Piskorski, Jakub 1994 Piskorski, Jakub Parallele Graphenalgorithmen für den Hypercube Universität des Saarlandes Thesis - Masters thesis 6 Pitts, Andrew M. (ed.) 2012 Elbassioni, Khaled A QPTAS for ε-Envy-Free Profit-Maximizing Pricing on Line Graphs In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 513-524 Proceedings Article 2012 [Cygan, Marek] [Kratsch, Stefan] [Pilipczuk, Marcin] [Pilipczuk, Michał] Wahlström, Magnus Clique Cover and Graph Separation: New Incompressibility Results In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 254-265 Proceedings Article 2012 [Kane, Daniel] Mehlhorn, Kurt Sauerwald, Thomas Sun, He Counting Arbitrary Subgraphs in Data Streams In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 598-609 Proceedings Article 2012 Bringmann, Karl [Panagiotou, Konstantinos] Efficient Sampling Methods for Discrete Distributions In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 133-144 Proceedings Article 2012 [Kratsch, Stefan] [Pilipczuk, Marcin] [Pilipczuk, Michał] Wahlström, Magnus Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs In: Automata, Languages, and Programming ; 39th International Colloquium, ICALP 2012, 581-593 Proceedings Article 2012 Megow, Nicole [Skutella, Martin] [Verschae, Jose] Wiese, Andreas The Power of Recourse for Online MST and TSP In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 689-700 Proceedings Article 1 Pitts, Andrew (ed.) 2012 Schmidt, Jens M. Certifying 3-Connectivity in Linear Time In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 786-797 Proceedings Article 1 Piwowarski, Benjamin 2006 Bast, Holger [Dupret, Georges] Majumdar, Debapriyo [Piwowarski, Benjamin] Discovering a Term Taxonomy from Term Similarities Using Principal Component Analysis In: Semantics, web and mining : Joint International Workshops, EWMF 2005 and KDO 2005, 103-120 Proceedings Article 4 Plandowski, Wojciech 2014 [Diekert, Volker] Jez, Artur [Plandowski, Wojciech] Finding All Solutions of Equations in Free Groups and Monoids with Involution In: 9th International Computer Science Symposium in Russia (CSR 2014), 1-15 Proceedings Article 1996 Gasieniec, Leszek [Karpinski, Marek] [Plandowski, Wojciech] [Rytter, Wojciech] Efficient Algorithms for Lempel-Ziv Encoding In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, 392-403 Proceedings Article 1996 [Chlebus, Bogdan S.] [Czumaj, Artur] Gasieniec, Leszek [Kowaluk, Miroslaw] [Plandowski, Wojciech] Parallel Alternating-Direction Access Machine In: Mathematical Foundations of Computer Science 1996: 21st International Symposium (MFCS'96), 255-266 Proceedings Article 1996 Gasieniec, Leszek [Karpinski, Marek] [Plandowski, Wojciech] [Rytter, Wojciech] Randomized Efficient Algorithms for Compressed Strings: the Finger-Print Approach In: Combinatorial Pattern Matching: 7th Annual Symposium (CPM'96), 39-49 Proceedings Article 1 Plehn, Gottfried (ed.) 1999 Sanders, Peter Berechnungen mit großen Datenmengen In: Jahrbuch der Max-Planck-Gesellschaft 1999, 534-540 Part of a Book 1 Plesser, Theo (ed.) 1997 Lenhof, Hans-Peter Parallel Protein Puzzle: A New Suite of Protein Docking Tools In: Forschung und wissenschaftliches Rechnen: Beiträge zum Heinz-Billing-Preis 1996, 31-48 Part of a Book 2 Poblete, Patricio V. (ed.) 1995 Bradford, Phillip Gnassi [Choppela, Venkatesh] [Rawlins, Gregory J.E.] Lower Bounds for the Matrix Chain Ordering Problem In: LATIN'95: Theoretical Informatics, 2nd Latin American Symposium, 112-130 Proceedings Article 1995 Chaudhuri, Shiva [Dubhashi, Devdatt] Probabilistic Recurrence Relations Revisited In: LATIN'95: Theoretical Informatics, Second Latin American Symposium, 207-219 Proceedings Article 2 Pocchiola, Michel 2006 [Brönnimann, Hervé] Kettner, Lutz [Pocchiola, Michel] [Snoeyink, Jack] Counting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm In: SIAM Journal on Computing [36], 721-739 Journal Article 2005 [Brönnimann, Hervé] Kettner, Lutz [Pocchiola, Michel] [Snoeyink, Jack] Counting and enumerating pointed pseudo-triangulations with the greedy flip algorithm In: Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics (ALENEX/ANALCO 2005), 98-110 Proceedings Article 1 Podelski, Andreas (ed.) 2010 [Althaus, Ernst] [Altmeyer, Sebastian] Naujoks, Rouven A New Combinatorial Approach to Parametric Path Analysis Report 4 Pogalnikova, Roza 2012 Berberich, Eric [Halperin, Dan] [Kerber, Michael] [Pogalnikova, Roza] Deconstructing Approximate Offsets In: Discrete & Computational Geometry [48], 964-989 Journal Article 2011 Berberich, Eric [Halperin, Dan] [Kerber, Michael] [Pogalnikova, Roza] Deconstructing Approximate Offsets In: arXiv [abs/1109.2158], Electronic Journal Article 2011 Berberich, Eric [Halperin, Dan] [Kerber, Michael] [Pogalnikova, Roza] Deconstructing Approximate Offsets In: Proceedings of the 27th Annual Symposium on Computational Geometry (SCG'11), 187-196 Proceedings Article 2010 Berberich, Eric [Halperin, Dan] [Kerber, Michael] [Pogalnikova, Roza] Polygonal Reconstruction from Approximate Offsets In: 26th European Workshop on Computational Geometry : Workshop Proceedings, 65-68 Electronic Proceedings Article 1 Pohl, Klaus (ed.) 1997 [Brandenburg, Franz J.] [Jünger, Michael] Mutzel, Petra [Lengauer, Thomas] SPP 731 : Algorithmen zum automatischen Zeichnen von Graphen im Rahmen des DFG-Schwerpunkts "Effiziente Algorithmen für diskrete Probleme und ihre Anwendungen" In: Informatik '97 : Informatik als Innovationsmotor : 27. Jahrestagung der Gesellschaft für Informatik, 58-67 Proceedings Article 2 Pohl, Sebastian 2012 Doerr, Benjamin Pohl, Sebastian Run-time analysis of the (1+1) evolutionary algorithm optimizing linear functions over a finite alphabet In: GECCO'12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation, 1317-1324 Proceedings Article 2006 Pohl, Sebastian Exact Integer Linear Programming with Bounded Variables in a Branch- and Cut Algorithm Universität des Saarlandes Thesis - Masters thesis 1 Pokorný, Jaroslav (ed.) 2004 Sanders, Peter Algorithms for Scalable Storage Servers In: SOFSEM 2004 : theory and practice of computer science ; 30th Conference on Current Trends in Theory and Practice of Computer Science, 82-101 Proceedings Article 1 Poli, Ricardo (ed.) 2007 GECCO 2007: Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation Proceedings 1 Poli, Riccardo (ed.) 2009 GECCO 2009: Proceedings of the 11th Annual conference on Genetic and evolutionary computation. Proceedings 1 Pollack, Jordan (ed.) 2008 GECCO 2008: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation Proceedings 4 Poloni, Carlo (ed.) 2008 [Brockhoff, Dimo] Friedrich, Tobias Neumann, Frank Analyzing Hypervolume Indicator Based Algorithms In: Parallel Problem Solving from Nature (PPSN X), 651-660 Proceedings Article 2008 Neumann, Frank [Reichel, Joachim] Approximating Minimum Multicuts by Evolutionary Multi-Objective Algorithms In: Parallel Problem Solving from Nature (PPSN X), 72-81 Proceedings Article 2008 [Kroeske, Jense] [Ghandar, Adam] [Michalewicz, Zbigniew] Neumann, Frank Learning Fuzzy Rules with Evolutionary Algorithms - An Analytic Approach In: Parallel Problem Solving from Nature (PPSN X), 1051-1060 Proceedings Article 2008 Friedrich, Tobias [Horoba, Christian] Neumann, Frank Runtime Analyses for Using Fairness in Evolutionary Multi-Objective Optimization In: Parallel Problem Solving from Nature (PPSN X), 671-680 Proceedings Article 7 Polzin, Tobias 2003 Polzin, Tobias Algorithms for the Steiner Problem in Networks Universität des Saarlandes Thesis - PhD thesis 2003 Althaus, Ernst Polzin, Tobias [Vahdati Daneshmand, Siavash] Improving Linear Programming Approaches for the Steiner Tree Problem In: Experimental and efficient algorithms : Second International Workshop, WEA 2003, 1-14 Proceedings Article 2003 Polzin, Tobias [Vahdati Daneshmand, Siavash] On Steiner trees and minimum spanning trees in hypergraphs In: Operations Research Letters [31], 12-20 Journal Article 2002 Polzin, Tobias [Vahdati Daneshmand, Siavash] Extending Reduction Techniques for the Steiner Tree Problem In: Algorithms - ESA 2002 : 10th Annual European Symposium, 795-807 Proceedings Article 2001 Polzin, Tobias [Vahdati Daneshmand, Siavash] A Comparison of Steiner Tree Relaxations In: Discrete Applied Mathematics [112], 241-261 Journal Article 2001 Polzin, Tobias [Vahdati Daneshmand, Siavash] Improved Algorithms for the Steiner Problem in Networks In: Discrete Applied Mathematics [112], 263-300 Journal Article 2000 Polzin, Tobias [Vahdati Daneshmand, Siavash] Primal-Dual Approaches to the Steiner Problem In: Approximation Algorithms for Combinatorial Optimization, 214-225 Proceedings Article 1 Pool, Rene 2012 [Canzar, Stefan] [El-Kebir, Mohammed] [Pool, Rene] Elbassioni, Khaled [Malde, Alpeshkumar K.] [Mark, Alan E.] [Geerke, Daan P.] [Stougie, Leen] [Klau, Gunnar W.] Charge Group Partitioning in Biomolecular Simulation In: Research in Computational Molecular Biology : 16th Annual International Conference, RECOMB 2012, 29-43 Proceedings Article 1 Poon, Sheung-Hung 2003 [Cheng, Siu-Wing] Funke, Stefan [Golin, Mordecai J.] [Kumar, Piyush] [Poon, Sheung-Hung] [Ramos, Edgar A.] Curve Reconstruction from Noisy Samples In: Proceedings of the 19th Annual Symposium on Computational Geometry (SCG-03), 420-429 Proceedings Article 1 Porat, Ely (ed.) 2013 Gawrychowski, Pawel [Kucherov, Gregory] [Nekrich, Yakov] [Starikovskaya, Tatiana] Minimal Discriminating Words Problem Revisited In: String Processing and Information Retrieval - 20th International Symposium (SPIRE 2013), Proceedings Article 3 Porkolab, Lorant 2002 [Jansen, Klaus] Porkolab, Lorant Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks In: Algorithmica [32], 507-520 Journal Article 2000 Khachiyan, Leonid Porkolab, Lorant Integer optimization on convex semialgebraic sets In: Discrete & Computational Geometry [23], 207-224 Journal Article 1997 Porkolab, Lorant Khachiyan, Leonid Computing Integral Points in Convex Semi-algebraic Sets In: Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS-97), 162-171 Proceedings Article 5 Portier, Natacha (ed.) 2014 Jez, Artur [Lohrey, Markus] Approximation of smallest linear tree grammar In: 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 445-457 Proceedings Article 2014 Gawrychowski, Pawel [Manea, Florin] [Nowotka, Dirk] Testing Generalised Freeness of Words In: 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 337-349 Proceedings Article 2013 Wahlström, Magnus Abusing the Tutte Matrix: An Algebraic Instance Compression for the K-set-cycle Problem In: 29th International Symposium on Theoretical Aspects of Computer Science (STACS-13), Electronic Proceedings Article 2013 Gawrychowski, Pawel [Manea, Florin] [Mercas, Robert] [Nowotka, Dirk] [Tiseanu, Catalin] Finding Pseudo-repetitions In: 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), 257-268 Proceedings Article 2013 Jez, Artur Recompression: a simple and powerful technique for word equations In: 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), 233-244 Proceedings Article 1 Portz, Sascha 1994 Portz, Sascha Darstellung und Implementierung polynomieller und streng polynomieller Algorithmen für das Minimum-Cost-Flow-Problem Universität des Saarlandes Thesis - Masters thesis 1 Pór, Attila 2005 Kutz, Martin [Pór, Attila] Angel, Devil, and King In: Computing and Combinatorics : 11th Annual International Conference, COCOON 2005, 925-934 Proceedings Article 1 Potikoglou, Ioannis 1999 Potikoglou, Ioannis Parallele Algorithmen zur Lösung des Single-Source Shortest Path Problems Universität des Saarlandes Thesis - Masters thesis 2 Pouchkarev, Igor 2000 Pouchkarev, Igor ArchEd: Ein interaktives Zeichensystem für die Archäologie Universität des Saarlandes Thesis - Masters thesis 1997 Hundack, Christoph Mutzel, Petra [Pouchkarev, Igor] [Thome, Stefan] ArchE: A Graph Drawing System for Archaeology In: Proceedings of the 5th Symposium on Graph Drawing (GD-97), 297-302 Proceedings Article 1 Pountourakis, Emmanouil 2010 [Pountourakis, Emmanouil] Vidali, Angelina A complete characterization of group-strategyproof mechanisms of cost-sharing. In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. I, 146-157 Proceedings Article 1 Pourmiri, Ali 2013 Panagiotou, Konstantinos Pourmiri, Ali Sauerwald, Thomas Faster Rumor Spreading with Multiple Calls In: 24th International Symposium on Algorithms and Computation (ISAAC-13), 446-456 Proceedings Article 1 Prädel, Lars 2011 Harren, Rolf [Jansen, Klaus] [Prädel, Lars] van Stee, Rob A (5/3 + ε)-Approximation for Strip Packing In: Algorithms and Data Structures : 12th International Symposium, WADS 2011, 475-487 Proceedings Article 3 Prasad, Sushil 2006 Althaus, Ernst [Calinescu, Gruia] [Mandoiu, Ion] [Prasad, Sushil] [Tchervenski, Nickolay] [Zelikovsly, Alexander] Power efficient range assignment for symmetric connectivity in static ad-hoc wireless networks In: Wireless Networks [12], 287-299 Journal Article 2003 Althaus, Ernst [Calinescu, Gruia] [Mandoiu, Ion] [Prasad, Sushil] [Tchervenski, Nickolay] [Zelikovsly, Alexander] Power Efficient Range Assignment in Ad-hoc Wireless In: Proceedings of the IEEE Wireless Communications and Networking Conference (WCNC-03), 1889-1894 Proceedings Article 2 Prasanna, Viktor K. (ed.) 2005 Funke, Stefan [Milosavljevic, Nikola] Infrastructure-Establishment from Scratch in Wireless Sensor Networks In: Distributed computing in sensor systems : First IEEE International Conference, DCOSS 2005, 354-367 Proceedings Article 1999 Sibeyn, Jop F. Ultimate Parallel List Ranking? In: Proceedings of the 6th International Conference on High Performance Computing (HiPC-99), 197-201 Proceedings Article 1 Prechelt, Lutz 1998 Sanders, Peter [Reussner, Ralf] [Prechelt, Lutz] [Müller, Matthias] SKaMPI: A Detailed, Accurate MPI Benchmark In: Proceedings of the 5th European PVM/MPI Users' Group Meeting, 52-59 Proceedings Article 1 Precup, Doina 2002 [McGeoch, Catherine] Sanders, Peter [Fleischer, Rudolf] [Cohen, Paul R.] [Precup, Doina] Using Finite Experiments to Study Asymptotic Performance In: Experimental Algorithmics, 93-126 Part of a Book 1 Preetham, A. J. 1996 Preetham, A. J. [Krithivasan, Kamala] [Rangan, C. Pandu] Sibeyn, Jop F. Parallel algorithm for maximum empty L-shaped polygon In: 3rd Conference on High-Performance Computing, - Proceedings Article 1 Preis, B. 1993 Kucera, Ludek Mehlhorn, Kurt Preis, B. Schwarzenecker, E. Exact Algorithms for a Geometric Packing Problem (Extended Abstract) In: Theoretical aspects of computer science (STACS-93) : 10th annual symposium, 317-322 Proceedings Article 1 Prellberg, Thomas 2008 [Cameron, Peter] Johannsen, Daniel [Prellberg, Thomas] Schweitzer, Pascal Counting Defective Parking Functions In: Electronic Journal of Combinatorics [15], R92 Electronic Journal Article 2 Preneel, Bart (ed.) 2006 [Hariharan, Ramesh] [Telikepalli, Kavitha] Mehlhorn, Kurt A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs In: Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Part I, 250-261 Proceedings Article

Previous Page

Next Page

Expand All

Collapse All

Search (Full Text)