| # |  | Year | Author(s) [non member] | | Title | Type | |
|---|
| 2 |
 | Esparza, Javier (ed.) |
| |
| | 2014 | Jez, Artur | | Context Unification is in PSPACE
In: 41st International Colloquium on Automata, Languages, and Programming (ICALP 2014), 244-255 | Proceedings Article | |
| | 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 |
| |
| | 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 |
| Estivill-Castro, V. (ed.) |
| |
| | 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 | |
| 1 |
| |
| | 1995 | [Evans, Brian]
Schwarz, Christian
[Teich, Jürgen]
[Vainshtein, Alek]
[Welzl, Emo] | | Minimal enclosing parallelogram with application
In: 11th Annual ACM Symposium on Computational Geometry (SCG95), C34-C35 | Proceedings Article | |
| 1 |
| |
| | 1995 | [Evans, B.L.]
Schwarz, Christian
[Teich, Jürgen] | | Automated design of two-dimensional rational decimation systems
In: Proceedings of IEEE Asilomar Conference on Signals, Systems, and Computers, 498-502 | Proceedings Article | |
| 1 |
| |
| | 2012 | Doerr, Benjamin
[Fouz, Mahmoud]
[Friedrich, Tobias] | | Experimental analysis of rumor spreading in social networks
In: Design and Analysis of Algorithms First Mediterranean Conference on Algorithms, MedAlg 2012, 159-173 | Proceedings Article | |
| 1 |
| |
| | 1981 | Hong, Jia-Wei
Mehlhorn, Kurt
Rosenberg, Arnold L. | | Cost Tradeoffs in Graph Embeddings, with Applications (Preliminary Version)
In: Automata, languages and programming (ICALP-81) : 8th international colloquium, 41-55 | Proceedings Article | |
| 3 |
| |
| | 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 | |
| | 2000 | [Fabri, Andreas]
[Giezeman, Geert-Jan]
[Kettner, Lutz]
Schirra, Stefan
[Schönherr, Sven] | | On the Design of CGAL, a computational geometry algorithms library
In: Software - Practice and Experience [30], 1167-1202 | Journal Article | |
| | 1996 | [Fabri, Andreas]
[Giezeman, Geert-Jan]
[Kettner, Lutz]
Schirra, Stefan
[Schönherr, Sven] | | The CGAL Kernel: A Basis for Geometric Computation
In: Applied Computational Geometry: Towards Geometric Engineering Proceedings (WACG'96), 191-202 | Proceedings Article | |
| 1 |
| |
| | 2004 | [Brodal, Gerth Stølting]
[Fagerberg, Rolf]
Meyer, Ulrich
[Zeh, Norbert] | | Cache-oblivious data structures and algorithms for undirected breadth-first search and shortest paths
In: Algorithm theory, SWAT 2004 : 9th Scandinavian Workshop on Algorithm Theory ; Humlebæk, Denmark, July 8-10, 2004 ; proceedings, 480-492 | Proceedings Article | |
| 1 |
| |
| | 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 |
| |
| | 2005 | [Chlebus, Bogdan S.]
Kowalski, Dariusz | | Cooperative asynchronous update of shared memory
In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC 2005), 733-739 | Proceedings Article | |
| 1 |
| |
| | 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 |
| |
| | 2013 | [Fanghänel, Alexander]
[Geulen, Sascha]
Hoefer, Martin
[Vöcking, Berthold] | | Online Capacity Maximization in Wireless Networks
In: Journal of Scheduling [16], 81-91 | Journal Article | |
| 1 |
| |
| | 2000 | [Cole, Richard]
[Farach-Colton, Martin]
Hariharan, Ramesh
[Przytycka, Teresa]
[Thorup, Mikkel] | | An O(n log n) algorithm for the maximum agreement subtree problem for binary trees
In: SIAM Journal on Computing [30], 1385-1404 | Journal Article | |
| 2 |
| Farach-Colton, Martin (ed.) |
| |
| | 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 | [Boros, Endre]
Elbassioni, Khaled M.
[Gurvich, Vladimir]
[Khachiyan, Leonid] |  | Generating Maximal Independent Sets for Hypergraphs with Bounded Edge-Intersections
In: LATIN 2004: Theoretical Informatics, 6th Latin American Symposium, 488-498 | Proceedings Article | |
| 1 |
| Faria, Luerbio (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 | |
| 3 |
| Farzan, Arash |
| |
| | 2011 | Farzan, Arash
[Munro, J. Ian] | | Succinct representation of dynamic trees
In: Theoretical Computer Science [412], 2668-2678 | Journal Article | |
| | 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 | [Blelloch, Guy E.]
Farzan, Arash | | Succinct Representations of Separable Graphs
In: Combinatorial Pattern Matching : 21st Annual Symposium, CPM 2010, 138-150 | Proceedings Article | |
| 1 |
| Fatourou, Panagiota |
| |
| | 2000 | Fatourou, Panagiota
[Spirakis, Paul G.] | | Efficient Scheduling of Strict Multithreaded Computations
In: Theory of Computing Systems [33], 173-232 | Journal Article | |
| 3 |
| Feitelson, Dror G. (ed.) |
| |
| | 1997 | Brodal, Gerth Stølting
Träff, Jesper Larsson
Zaroliagis, Christos | | A parallel priority data structure with applications
In: 11th Internatinal Parallel Processing Symposium (IPPS-97), 689-693 | Proceedings Article | |
| | 1997 | [Kaufmann, Michael]
Meyer, Ulrich
Sibeyn, Jop F. | | Matrix Transpose on Meshes: Theory and Practice
In: Proceedings of the 11th International Parallel Processing Symposium (IPPS-97), 315-319 | Proceedings 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 | |
| 4 |
| Fekete, Sándor P. |
| |
| | 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 | |
| | 2013 | [Fekete, Sándor P.]
[Friedrichs, Stephan]
[Kröller, Alexander]
[Schmidt, Christiane] | | Facets for Art Gallery Problems
In: Computing and Combinatorics, 208-220 | Proceedings Article | |
| | 2003 | [Fekete, Sandor P.]
Skutella, Martin
[Woeginger, Gerhard J.] | | The complexity of economic equilibria for house allocation markets
In: Information Processing Letters [88], 219-223 | Journal Article | |
| | 2001 | [Eiglsperger, Markus]
Fekete, Sandor P.
Klau, Gunnar W. | | Orthogonal Graph Drawing
In: Drawing Graphs: Methods and Models, 121-171 | Part of a Book | |
| 1 |
| |
| | 2003 | [Agarwal, Amit]
[Agarwal, Tarun]
[Chopra, Sumit]
[Feldmann, Anja]
[Kammenhuber, Nils]
Krysta, Piotr
[Vöcking, Berthold] | | An experimental study of k-splittable scheduling for DNS-based traffic allocation
In: Euro-Par 2003 parallel processing : 9th International Euro-Par Conference ; proceedings, 230-235 | Proceedings Article | |
| 1 |
| |
| | 2012 | Feldmann, Matthias | | Stochastic optimization with fitness proportional ant systems
Universität des Saarlandes | Thesis - Bachelor thesis | |
| 1 |
| |
| | 2002 | Sanders, Peter
[Träff, Jesper Larsson] | | The factor algorithm for regular all-to-all communication on clusters of SMP nodes
In: Proceedings of the 8th International Euro-Par Conference, 799-803 | Proceedings Article | |
| 1 |
| |
| | 1998 | Feld, Thomas | | Analyse und Implementierung von Algorithmen zum Minimum Cost Circulation Problem
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| |
| | 2003 | Denny, Markus | | Solving geometric optimization problems using graphics hardware
In: EUROGRAPHICS 2003 : the European Association for Computer Graphics 24th Annual Conference, 441-451 | Proceedings Article | |
| 4 |
| |
| | 2012 | [Fellows, Michael R.]
Hermelin, Danny
[Rosamond, Fraces A.] | | Well Quasi Orders in Subclasses of Bounded Treewidth Graphs and Their Algorithmic Applications
In: Algorithmica [64], 3-18 | Journal Article | |
| | 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 | |
| | 2011 | [Fellows, Michael R.]
[Hartman, Tzvika]
Hermelin, Danny
[Landau, Gad M.]
[Rosamond, Frances A.]
[Rozenberg, Liat] | | Haplotype Inference Constrained by Plausible Haplotype Data
In: IEEE/ACM Transactions on Computational Biology and Bioinformatics [8], 1692-1699 | Journal Article | |
| | 2011 | [Fellows, Michael R.]
[Fertin, Guillaume]
Hermelin, Danny
[Vialette, Stephane] | | Upper and lower bounds for finding connected motifs in vertex-colored graphs
In: Journal of Computer and System Sciences [77], 799-811 | Journal Article | |
| 3 |
| Felsner, Stefan (ed.) |
| |
| | 2005 | [Cooper, Joshua]
Doerr, Benjamin
[Spencer, Joel]
[Tardos, Gabor] | | Deterministic Random Walks on the Integers
In: 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 73-76
In: Discrete Mathematics & Theoretical Computer Science [AE], 73-76 | Proceedings Article | |
| | 2005 | Doerr, Benjamin
Hebbinghaus, Nils | | Discrepancy of Products of Hypergraphs
In: 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 323-328 | Proceedings Article | |
| | 2005 | Kutz, Martin | | Weak Positional Games on Hypergraphs of Rank Three
In: 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 31-36 | Proceedings Article | |
| 2 |
| Feremans, Corinne |
| |
| | 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 | |
| | 2006 | [Feremans, Corinne]
[Grigoriev, Alexander]
Sitters, Rene | | The geometric generalized minimum spanning tree problem with grid clustering
In: 4OR: A Quarterly Journal of Operations Research [4], 319-329 | Journal Article | |
| 2 |
| |
| | 1998 | [Calinescu, Gruia]
Fernandes, Cristina G.
Finkler, Ulrich
Karloff, Howard | | A Better Approximation Algorithm for Finding Planar Subgraphs
In: Journal of Algorithms [27], 269-302 | Journal Article | |
| | 1996 | [Calinescu, Gruia]
[Fernandes, Cristina G.]
Finkler, Ulrich
[Karloff, Howard] | | A better approximation algorithm for finding planar subgraphs
In: 7th ACM-SIAM Symposium on Discrete Algorithms (SODA96), 16-25 | Proceedings Article | |
| 1 |
| Fernández-Baca, David (ed.) |
| |
| | 2012 | [Qian, Jiawei]
[Schalekamp, Frans]
[Williamson, David P.]
van Zuylen, Anke | | On the Integrality Gap of the Subtour LP for the 1,2-TSP
In: LATIN 2012: Theoretical Informatics ; 10th Latin American Symposium, 606-617 | Proceedings Article | |
| 2 |
| Fernau, Henning |
| |
| | 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 | |
| | 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 | |
| 1 |
| |
| | 2010 | [Kasprzik, Anna]
Kötzing, Timo | | String Extension Learning Using Lattices
In: Language and Automata Theory and Applications : 4th International Conference, LATA 2010, 380-391 | Proceedings Article | |
| 9 |
| |
| | 2002 | Crauser, Andreas
Ferragina, Paolo | | A theoretical and experimental study on the construction of suffix arrays in external memory
In: Algorithmica [32], 1-35 | Journal Article | |
| | 2001 | Crauser, Andreas
[Ferragina, Paolo]
Mehlhorn, Kurt
Meyer, Ulrich
Ramos, Edgar A. | | Randomized External-Memory Algorithms for Line Segment Intersection and Other Geometric Problems
In: International Journal of Computational Geometry & Applications [11], 305-337 | Journal Article | |
| | 1999 | Brengel, Klaus
Crauser, Andreas
Meyer, Ulrich
[Ferragina, Paolo] | | An Experimental Study of Priority Queues in External Memory
In: Algorithm engineering (WAE-99) : 3rd International Workshop, WAE'99, 345-359 | Proceedings Article | |
| | 1999 | Crauser, Andreas
[Ferragina, Paolo]
Mehlhorn, Kurt
Meyer, Ulrich
Ramos, Edgar A. | | I/O-optimal computation of segment intersections
In: Proceedings of the DIMACS Workshop on External Algorithms and Visualization, 131-138 | 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 | |
| | 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 | Ferragina, Paolo
[Gross, Roberto] | | Optimal On-Line Search and Sublinear Time Update in String Matching
In: SIAM Journal on Computing [27], 713-736 | Journal Article | |
| | 1998 | Crauser, Andreas
Ferragina, Paolo
Mehlhorn, Kurt
Meyer, Ulrich
Ramos, Edgar A. | | Randomized External-Memory Algorithms for some Geometric Problems
In: Proceedings of the 14th International Annual ACM Symposium on Computational Geometry (SCG-98), 259-268 | 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 |
| |
| | 2012 | Hermelin, Danny
[Mnich, Matthias]
[van Leeuwen, Erik Jan] | | Parameterized complexity of induced H-matching on claw-free graphs
In: Algorithms - ESA 2012 : 20th Annual European Symposium, 624-635 | Proceedings Article | |
| | 2012 | Abed, Fidaa
[Huang, Chien-Chung] | | Preemptive Coordination Mechanisms for Unrelated Machines
In: Algorithms - ESA 2012 : 20th Annual European Symposium, 12-23 | Proceedings Article | |
| | 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 | |
| 6 |
| |
| | 2002 | Elbassioni, Khaled M. | | On Dualization in Products of Forests.
In: STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, 142-153 | Proceedings Article | |
| | 2002 | Bast, Hannah | | Scheduling at Twilight the Easy Way
In: STACS 2002 : 19th Annual Symposium on Theoretical Aspects of Computer Science, 166-178 | Proceedings Article | |
| | 2001 | Krysta, Piotr
Kumar, V. S. Anil | | Approximation Algorithms for Minimum Size 2-connectivity Problems
In: Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science (STACS-01), 431-442 | Proceedings Article | |
| | 1997 | Sibeyn, Jop F.
[Guillaume, Frank]
[Seidel, Tillmann] | | Practical Parallel List Ranking
In: Proceedings of the 4th Symposium on Solving Irregularly Structured Problems in Parallel (IRREGULAR-97), 25-36 | Proceedings Article | |
| | 1996 | Träff, Jesper Larsson
Zaroliagis, Christos | | A Simple Parallel Algorithm for the Single-Source Shortest Path Problem on Planar Digraphs
In: Parallel Algorithms for Irregularly Structured Problems: 3rd International Workshop (IRREGULAR'96), 183-194 | Proceedings Article | |
| | 1996 | Hagerup, Torben | | Allocating Independent Tasks to Parallel Processors: An Experimental Study
In: Parallel Algorithms for Irregularly Structured Problems: 3rd International Workshop (IRREGULAR'96), 1-33 | Proceedings Article | |
| 1 |
| Fertin, Guillaume |
| |
| | 2011 | [Fellows, Michael R.]
[Fertin, Guillaume]
Hermelin, Danny
[Vialette, Stephane] | | Upper and lower bounds for finding connected motifs in vertex-colored graphs
In: Journal of Computer and System Sciences [77], 799-811 | Journal Article | |
| 1 |
| Festa, Paola (ed.) |
| |
| | 2010 | Doerr, Benjamin
[Künnemann, Marvin]
Wahlström, Magnus | | Randomized Rounding for Routing and Covering Problems: Experiments and Improvements
In: Experimental Algorithms : 9th International Symposium, SEA 2010, 190-201 | Proceedings Article | |
| 1 |
| Fetzer, Christof (ed.) |
| |
| | 2004 | Bast, Holger | | Dimension Reduction: A Powerful Principle for Automatically Finding Concepts in Unstructured Data
In: International Workshop on Self-* Properties in Complex Information Systems (SELF-STAR 2004), 113-116 | Proceedings Article | |
| 1 |
| Fiala , Jiří (ed.) |
| |
| | 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 | |
| 1 |
| Fiala, Frank (ed.) |
| |
| | 1996 | [Krithivasan, Kamala]
[Rema, Anna]
Schirra, Stefan
[Vijaykumar, P.I.] | | Velocity planning for a robot moving along the shortest straight line path among moving obstacles
In: Canadian Conference on Computational Geometry (CCCG '96), 149-154 | Proceedings Article | |
| 3 |
| Fiala, Jiri (ed.) |
| |
| | 2010 | [Kao, Ming-Yang]
[Leung, Henry C. M.]
Sun, He
[Zhang, Yong] | | Deterministic Polynomial-Time Algorithms for Designing Short DNA Words
In: Theory and Applications of Models of Computation : 7th Annual Conference, TAMC 2010, 308-319 | Proceedings Article | |
| | 2004 | Baumann, Nadine
[Köhler, Ekkehard] | | Approximating Earliest Arrival Flows with Flow-Dependent Transit Times
In: Mathematical foundations of computer science 2004 : 29th International Symposium, MFCS 2004, 599-610 | Proceedings Article | |
| | 2004 | [Boros, Endre]
Elbassioni, Khaled M.
[Gurvich, Vladimir]
[Khachiyan, Leonid]
[Makino, Kazuhisa] | | Generating Paths and Cuts in Multi-pole (Di)graphs
In: Mathematical foundations of computer science 2004 : 29th International Symposium, MFCS 2004, 298-309 | Proceedings Article | |
| 3 |
| Fialko, Sergej |
| |
| | 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 | 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 | |
| | 1997 | Fialko, Sergej | | Das planare Augmentierungsproblem
Universität des Saarlandes | Thesis - Masters thesis | |
| 5 |
| Fiat, Amos (ed.) |
| |
| | 2009 | [Amaldi, Edoardo]
[Iuliano, Claudio]
Jurkiewicz, Tomasz
Mehlhorn, Kurt
[Rizzi, Romeo] | | Breaking the $O(m^2n)$ Barrier for Minimum Cycle Bases
In: Algorithms - ESA 2009 : 17th Annual European Symposium, 301-312 | Proceedings Article | |
| | 2009 | [Amaldi, Edoardo]
[Iuliano, Claudio]
Jurkiewicz, Tomasz
Mehlhorn, Kurt
[Rizzi, Romeo] | | Breaking the $O(m^2n)$ Barrier for Minimum Cycle Bases
In: Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings, 301-312 | Proceedings Article | |
| | 2009 | Elbassioni, Khaled
[Makino, Kazuhisa]
Rauf, Imran | | Output-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs
In: Algorithms - ESA 2009 : 17th Annual European Symposium, 143-154 | 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 | |
| | 1998 | Albers, Susanne
[Westbrook, Jeffery] | | Self-organizing data structures
In: Online Algorithms: The State of the Art, 13-51 | Part of a Book | |
| 1 |
| Fich, Faith (ed.) |
| |
| | 2003 | [Georgiou, Chryssis]
Kowalski, Dariusz
[Shvartsman, Alexander] | | Efficient Gossip and Robust Distributed Computation
In: Distributed Computing, 17th International Conference (DISC 2003), 224-238 | Proceedings Article | |
| 1 |
| Fiethe, Björn |
| |
| | 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 | |
| 1 |
| Finkel, Alain (ed.) |
| |
| | 1992 | Clarkson, Kenneth L.
Mehlhorn, Kurt
Seidel, Raimund | | Four Results on Randomized Incremental Constructions
In: Theoretical aspects of computer science (STACS-92) : 9th annual symposium, 463-474 | Proceedings Article | |
| 5 |
| Finkler, Ulrich |
| |
| | 1999 | Finkler, Ulrich
Mehlhorn, Kurt | | Checking Priority Queues
In: Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-99), 901-902 | Proceedings Article | |
| | 1998 | [Calinescu, Gruia]
Fernandes, Cristina G.
Finkler, Ulrich
Karloff, Howard | | A Better Approximation Algorithm for Finding Planar Subgraphs
In: Journal of Algorithms [27], 269-302 | Journal Article | |
| | 1997 | Finkler, Ulrich | | Design of Efficient and Correct Algorithms: Theoretical Results and Runtime Prediction of Implementations in Practice
Universität des Saarlandes | Thesis - PhD thesis | |
| | 1997 | Finkler, Ulrich
Mehlhorn, Kurt | | Runtime Prediction of Real Programs on Real Machines
In: Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-97), 380-389 | Proceedings Article | |
| | 1996 | [Calinescu, Gruia]
[Fernandes, Cristina G.]
Finkler, Ulrich
[Karloff, Howard] | | A better approximation algorithm for finding planar subgraphs
In: 7th ACM-SIAM Symposium on Discrete Algorithms (SODA96), 16-25 | Proceedings Article | |
| 2 |
| Fink, Christian |
| |
| | 2002 | Althaus, Ernst
Fink, Christian | | A Polyhedral Approach to Surface Reconstruction from Planar Contours.
In: Proceedings of the 9th International Conference on Integer Programming and Combinatorial Optimization, 258-272 | Proceedings Article | |
| | 2001 | Fink, Christian | | Oberflächenrekonstruktion von planaren Konturen
Universität des Saarlandes | Thesis - Masters thesis | |
| 4 |
| |
| | 2009 | Doerr, Benjamin
[Friedrich, Tobias]
[Künnemann, Marvin]
[Sauerwald, Thomas] | | Quasirandom Rumor Spreading: An Experimental Analysis
In: 2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX), 145-153 | Proceedings Article | |
| | 2009 | Doerr, Benjamin
Wahlström, Magnus | | Randomized Rounding in the Presence of a Cardinality Constraint
In: 2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX), 162-174 | Proceedings Article | |
| | 2006 | Mehlhorn, Kurt | | Reliable and Efficient Geometric Computing
In: Algorithms and Complexity : 6th Italian Conference, CIAC 2006, 1-2 | Proceedings Article | |
| | 2006 | Kovács, Annamária | | Tighter Approximation Bounds for LPT Scheduling in Two Special Cases
In: Algorithms and Complexity : 6th Italian Conference, CIAC 2006, 187-198 | Proceedings Article | |
| 2 |
| Fischer, Johannes (ed.) |
| |
| | 2013 | Jez, Artur | | Approximation of Grammar-Based Compression via Recompression
In: 24th Annual Symposium on Combinatorial Pattern Matching (CPM 2013), 165-176 | Proceedings Article | |
| | 2013 | [Bannai, Hideo]
Gawrychowski, Pawel
[Inenaga, Shunsuke]
[Takeda, Masayuki] | | Converting SLP to LZ78 in almost Linear Time
In: Combinatorial Pattern Matching, 24th Annual Symposium (CPM 2013), 38-49 | Proceedings Article | |
| 1 |
| |
| | 2007 | Beier, René
[Röglin, Heiko]
[Vöcking, Berthold] | | The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization
In: Integer Programming and Combinatorial Optimization : 12th International IPCO Conference, 53-67 | Proceedings Article | |
| 5 |
| |
| | 2009 | Elbassioni, Khaled
[Fishkin, Aleksei V.]
[Sitters, René] | | Approximation algorithms for the Euclidean traveling salesman problem with discrete and continuous neighborhoods
In: International Journal of Computational Geometry & Applications [19], 173-193 | Journal Article | |
| | 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 | |
| | 2006 | Elbassioni, Khaled M.
[Fishkin, Aleksei V.]
Sitters, Rene | | On Approximating the TSP with Intersecting Neighborhoods
In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 213-222 | 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 | |
| 2 |
| |
| | 2002 | Banderier, Cyril
[Flajolet, Philippe] | | Basic analytic combinatorics of directed lattice paths
In: Theoretical Computer Science [281], 37-80 | Journal Article | |
| | 2002 | Banderier, Cyril
[Bousquet-Mélou, Mireille]
[Denise, Alain]
[Flajolet, Philippe]
[Gardy, Danièle]
[Gouyou-Beauchamps, Dominique] | | Generating Functions for Generating Trees
In: Discrete Mathematics [246], 29-55 | Journal Article | |
| 1 |
| Flamini, Marta (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 |
| Flammini, Michele (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 |
| Flato, Eyal |
| |
| | 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 | |
| 2 |
| Fleischer, Lisa |
| |
| | 2009 | [Bhaskar, Umang]
[Fleischer, Lisa]
[Hoy, Darrell]
Huang, Chien-Chung | | Equilibria of Atomic Flow Games are not Unique
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 748-757 | Proceedings Article | |
| | 2003 | [Fleischer, Lisa]
Skutella, Martin | | Minimum Cost Flows Over Time without Intermediate Storage
In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), 66-75 | Proceedings Article | |
| 23 |
| |
| | 2004 | Funke, Stefan
Mehlhorn, Kurt
Schmitt, Susanne
[Burnikel, Christoph]
[Fleischer, Rudolf]
[Schirra, Stefan] | | The LEDA class real number -- extended version | Report | |
| | 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 | |
| | 2000 | Burnikel, Christoph
Fleischer, Rudolf
Mehlhorn, Kurt
Schirra, Stefan | | A strong and easily computable separation bound for arithmetic expressions involving radicals
In: Algorithmica [27], 87-99 | Journal Article | |
| | 2000 | [Bein, Wolfgang W.]
Fleischer, Rudolf
[Larmore, Lawrence L.] | | Limited bookmark randomized online algorithms for the paging problem
In: Information Processing Letters [76], 155-162 | Journal 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 | |
| | 1999 | Fleischer, Rudolf | | Decision trees: old and new results
In: Information and computation [152], 44-61 | Journal Article | |
| | 1999 | Burnikel, Christoph
Fleischer, Rudolf
Mehlhorn, Kurt
Schirra, Stefan | | Efficient exact geometric computation made easy
In: Proceedings of the 15th Annual Symposium on Computational Geometry (SCG-99), 341-350 | Proceedings Article | |
| | 1999 | Fleischer, Rudolf | | Effiziente und Online-Algorithmen
Universität des Saarlandes | Thesis - Habilitation thesis | |
| | 1999 | Fleischer, Rudolf | | FUN with implementing algorithms
In: Proceedings of the International Conference on FUN with Algorithms (FUN-98), 88-98 | Proceedings Article | |
| | 1998 | Fleischer, Rudolf | | On the Bahncard problem
In: Proceedings of the 4th International Conference on Computing and Combinatorics (COCOON-98), 65-74 | Proceedings Article | |
| | 1997 | Mehlhorn, Kurt
Burnikel, Christoph
Fleischer, Rudolf
Schirra, Stefan | | A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Square Roots
In: Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-97), 702-709 | Proceedings Article | |
| | 1997 | [Das, Gautam]
Fleischer, Rudolf
Gasieniec, Leszek
Gunopulos, Dimitrios
Kärkkäinen, Juha | | Episode matching
In: Combinatorial pattern matching : 8th annual symposium (CPM-97), 12-27 | Proceedings Article | |
| | 1997 | Bradford, Phillip Gnassi
Fleischer, Rudolf
Smid, Michiel | | More efficient parallel totally monotone matrix searching
In: Journal of Algorithms [23], 386-400 | Journal Article | |
| | 1996 | Fleischer, Rudolf | | A simple balanced search tree with $O(1)$ worst-case update time
In: International Journal of Foundations of Computer Science [7], 137-149 | Journal Article | |
| | 1996 | [Alon, Noga]
Bradford, Phillip Gnassi
Fleischer, Rudolf | | Matching nuts and bolts faster
In: Information Processing Letters [59], 123-127 | Journal Article | |
| | 1995 | Fleischer, Rudolf
[Jung, Hermann]
Mehlhorn, Kurt | | A communication-randomness tradeoff for two-processor systems
In: Information and Computation [116], 155-161 | Journal Article | |
| | 1995 | Bradford, Phillip Gnassi
Fleischer, Rudolf | | Matching nuts and bolts faster
In: Algorithms and Computation: 6th International Symposium (ISAAC'95), 402-408 | 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 | |
| | 1992 | Fleischer, Rudolf
Mehlhorn, Kurt
Rote, Günter
Welzl, Emo
Yap, Chee-Keng | | Simultaneous Inner and Outer Approximation of Shapes
In: Algorithmica [8], 365-389 | Journal Article | |
| | 1991 | Fleischer, Rudolf
Jung, Hermann
Mehlhorn, Kurt | | A Time-Randomness Tradeoff for Communication Complexity
In: Distributed Algorithms, 4th International Workshop, 390-401 | Proceedings 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 | Fleischer, Rudolf
Mehlhorn, Kurt
Rote, Günter
Welzl, Emo
Yap, Chee-Keng | | On Simultaneous Inner and Outer Approximation of Shapes
In: Computational geometry (SCG-90) : 6th annual symposium, 216-224 | Proceedings Article | |
| 6 |
| |
| | 2004 | Abraham, David
[Cechlárová, Katarina]
[Manlove, David F.]
Mehlhorn, Kurt | | Pareto-optimality in house allocation problems
In: Algorithms and Computation: 15th International Symposium, ISAAC 2004, 3-15 | Proceedings Article | |
| | 2004 | [Aranov, Boris]
[Asano, Tetsuo]
[Katoh, Naoki]
Mehlhorn, Kurt
[Tokuyama, Takeshi] | | Polyline Fitting of Planar Points Under Min-sum Criteria
In: Algorithms and Computation: 15th International Symposium, ISAAC 2004, 77-88 | 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 | |
| | 2002 | [Bader, David]
[Moret, Bernard]
Sanders, Peter | | Algorithm Engineering for Parallel Computation
In: Experimental Algorithmics, 1-23 | Part of a Book | |
| | 2002 | Sanders, Peter | | Presenting Data from Experiments in Algorithmics
In: Experimental Algorithmics, 181-196 | Part of a Book | |
| | 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 |
| Floreano, Dario (ed.) |
| |
| | 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 | |
| 1 |
| Flysher, Guy |
| |
| | 2007 | [Bar-Yehuda, Reuven]
[Flysher, Guy]
Mestre, Julián
[Rawitz, Dror] | | Approximation of Partial Capacitated Vertex Cover
In: 15th Annual European Symposium on Algorithms, 335-346 | Proceedings Article | |
| 9 |
| Fogel, Efi |
| |
| | 2010 | Berberich, Eric
[Fogel, Efi]
[Halperin, Dan]
[Kerber, Michael]
[Setter, Ophir] | | Arrangements on Parametric Surfaces II: Concretizations and Applications
In: Mathematics in Computer Science [4], 67-91 | Journal Article | |
| | 2010 | Berberich, Eric
[Fogel, Efi]
[Halperin, Dan]
Mehlhorn, Kurt
[Wein, Ron] | | Arrangements on Parametric Surfaces I: General Framework and Infrastructure
In: Mathematics in Computer Science [4], 45-66 | Journal Article | |
| | 2007 | [Fogel, Efi]
[Halperin, Dan]
Kettner, Lutz
[Teillaud, Monique]
[Wein, Ron]
Wolpert, Nicola | | Arrangements
In: Effective Computational Geometry for Curves and Surfaces, 1-66 | Part of a Book | |
| | 2007 | Berberich, Eric
[Fogel, Efi]
[Halperin, Dan]
Mehlhorn, Kurt
[Wein, Ron] | | Sweeping and Maintaining Two-Dimensional Arrangements on Quadrics | Report | |
| | 2007 | Berberich, Eric
[Fogel, Efi]
[Halperin, Dan]
[Wein, Ron] | | Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces
In: Proceedings of 23rd European Workshop on Computational Geometry, 223-226 | Proceedings Article | |
| | 2007 | Berberich, Eric
[Fogel, Efi]
[Halperin, Dan]
Mehlhorn, Kurt
[Wein, Ron] | | Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step
In: Algorithms - ESA 2007, 15th Annual European Symposium, 645-656 | Proceedings Article | |
| | 2007 | Berberich, Eric
[Fogel, Efi]
Meyer, Andreas | | Updated Website to include Benchmark Instances for Arrangements of Quadrics and Planar Algebraic Curves | Report | |
| | 2006 | Berberich, Eric
Ebert, Franziska
[Fogel, Efi]
Kettner, Lutz | | Web-site with benchmark instances for planar curve arrangements | Report | |
| | 2003 | Berberich, Eric
Eigenwillig, Arno
[Fogel, Efi]
[Halperin, Dan]
Hert, Susan
Kettner, Lutz
[Teillaud, Monique]
[Wein, Ron] | | Specification of the traits classes for CGAL arrangements of curves | Report | |
| 1 |
| Fogel, Efraim |
| |
| | 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 | |
| 2 |
| Follert, Frank |
| |
| | 1997 | [Follert, Frank]
[Schömer, Elmar]
[Sellen, Jürgen]
Smid, Michiel
[Thiel, Christian] | | Computing the largest empty anchored cylinder, and related problems
In: International Journal of Computational Geometry and Applications [7], 563-580 | Journal Article | |
| | 1995 | [Follert, Frank]
[Schömer, Elmar]
[Sellen, Jürgen]
Smid, Michiel
Thiel, Christian | | Computing a largest empty anchored cylinder, and related problems
In: Foundations of Software Technology and Theoretical Computer Science: 15th Conference, 428-442 | Proceedings Article | |
| 4 |
| |
| | 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 | [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 | |
| | 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 | |
| 11 |
| Fomin, Fedor V. (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 | 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 | |
| | 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 | Doerr, Benjamin
[Fouz, Mahmoud]
[Friedrich, Tobias] | | Asynchronous rumor spreading in preferential attachment graphs
In: Algorithm Theory - SWAT 2012 : 13th Scandinavian Symposium and Workshops, 307-315 | Proceedings Article | |
| | 2012 | Huang, Chien-Chung | | Non-preemptive Speed Scaling
In: Algorithm Theory - SWAT 2012 : 13th Scandinavian Symposium and Workshops, 249-260 | Proceedings Article | |
| | 2009 | [Böcker, Sebastian]
[Hüffner, Falk]
[Truss, Anke]
Wahlström, Magnus | | A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams
In: Parameterized and Exact Computation : 4th International Workshop, IWPEC 2009, 38-49 | Proceedings Article | |
| | 2009 | Kratsch, Stefan
Wahlström, Magnus | | Two Edge Modification Problems without Polynomial Kernels
In: Parameterized and Exact Computation : 4th International Workshop, IWPEC 2009, 264-275 | Proceedings Article | |
| | 2006 | [Grigoriev, Alexander]
[van Loon, Joyce]
Sitters, Rene
[Uetz, Marc] | | How to Sell a Graph: Guidelines for Graph Retailers
In: Graph-Theoretic Concepts in Computer Science : 32nd International Workshop, WG 2006, 125-136 | Proceedings Article | |
| | 2006 | Kowalik, Lukasz | | Improved Edge Coloring with Three Colors
In: Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, WG 2006, 90-101 | Proceedings Article | |
| 1 |
| Fomin, Fedor (ed.) |
| |
| | 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 | |
| 1 |
| Fonseca, Carlos M. (ed.) |
| |
| | 2009 | [Bringmann, Karl]
[Friedrich, Tobias] | | Approximating the least hypervolume contributor: NP-hard in general, but fast in practice
In: Evolutionary Multi-Criterion Optimization : 5th International Conference, EMO 2009, 6-20 | Proceedings Article | |
| 1 |
| Fontaine, Marc |
| |
| | 2003 | Fontaine, Marc | | Computing the Filtration Efficiency of Shape-Index-Filters for Approximate String Matching
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| Fontet, M. (ed.) |
| |
| | 1984 | | | Theoretical aspects of computer science (STACS-84) : [1st] symposium | Proceedings | |
| 1 |
| Forrest, Stephanie (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 | |
| 8 |
| Fotakis, Dimitris |
| |
| | 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 | |
| | 2004 | Fotakis, Dimitris | | Incremental Algorithms for Facility Location and k-Median
In: Algorithms – ESA 2004: 12th Annual European Symposium, 347-358 | 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 | 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 | |
| | 2002 | Fotakis, Dimitris
[Spirakis, Paul G.] | | Minimum Congestion Redundant Assignments to Tolerate Random Faults
In: Algorithmica [32], 396-422 | Journal Article | |
| | 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 | |
| | 2002 | Fotakis, Dimitris
Kontogiannis, Spyros
[Koutsoupias, Elias]
[Mavronicolas, Marios]
[Spirakis, Paul G.] | | The Structure and Complexity of Nash Equilibria for a Selfish Routing Game
In: Automata, Languages and Programming : 29th International Colloquium, ICALP 2002, 123-134 | Proceedings Article | |
| 1 |
| |
| | 2012 | Elbassioni, Khaled
[Fouad, Mohamed]
[Bertino, Elisa] | | Modeling the Risk & Utility of Information Sharing in Social Networks
In: 2012 ASE/IEEE International Conference on Privacy, Security, Risk and Trust and
2012 ASE/IEEE International Conference on Social Computing : SocialCom/PASSAT 2012, 441-450 | Proceedings Article | |
| 1 |
| |
| | 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 | |
| 20 |
| |
| | 2013 | Fountoulakis, Nikolaos
Panagiotou, Konstantinos | | On the Insertion Time of Cuckoo Hashing
In: SIAM Journal on Computing [?], ?-? | 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 | |
| | 2011 | Fountoulakis, Nikolaos
[Panagiotou, Konstantinos] | | 3-Connected Cores In Random Planar Graphs
In: Combinatorics, Probability & Computing [20], 381-412 | Journal Article | |
| | 2011 | Fountoulakis, Nikolaos
Friedrich, Tobias
Hermelin, Danny | | Average Case Parameterized Complexity | Unpublished/Draft | |
| | 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 | 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 | Fountoulakis, Nikolaos
[Kang, Ross]
[McDiarmid, Colin] | | The t-stability number of a random graph
In: The Electronic Journal of Combinatorics [17], R59,1-R59,29 | Electronic Journal 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 | [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 | |
| | 2009 | Fountoulakis, Nikolaos
Huber, Anna | | Quasirandom rumor spreading on the complete graph is as fast as randomized rumor spreading
In: SIAM Journal on Discrete Mathematics [23], 1964-1991 | 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 | |
| | 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
[Reed, Bruce] | | The evolution of the mixing rate of a simple random walk on the giant component of a random graph
In: Random Structures and Algorithms [33], 68-86 | 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 | |
| | 2007 | Fountoulakis, Nikolaos
[Reed, Bruce] | | Faster Mixing and Small Bottlenecks
In: Probability Theory and Related Fields [137], 475-486 | Journal Article | |
| | 2007 | [Fountoulakis, Nikolaos] | | Percolation on sparse random graphs with given degree sequence
In: Internet Mathematics [4], 329-356 | Journal Article | |
| 1 |
| Fourey, Sébastien (ed.) |
| |
| | 2002 | Ray, Rahul
[Smid, MIchiel]
[Lange, Katharina]
[Wendt, Ulrich] | | Computing Large Planar Regions in Terrains
In: IWCIA 2001, 8th International Workshop on Combinatorial Image Analysis (IWCIA-01), 139-152 | Proceedings Article | |
| 1 |
| Fousse, Laurent |
| |
| | 2004 | Schmitt, Susanne
Fousse, Laurent | | A comparison of polynomial evaluation schemes | Report | |
| 19 |
| Fouz, Mahmoud |
| |
| | 2012 | Doerr, Benjamin
[Fouz, Mahmoud]
[Friedrich, Tobias] | | Asynchronous rumor spreading in preferential attachment graphs
In: Algorithm Theory - SWAT 2012 : 13th Scandinavian Symposium and Workshops, 307-315 | Proceedings Article | |
| | 2012 | Doerr, Benjamin
[Fouz, Mahmoud]
[Friedrich, Tobias] | | Experimental analysis of rumor spreading in social networks
In: Design and Analysis of Algorithms First Mediterranean Conference on Algorithms, MedAlg 2012, 159-173 | Proceedings Article | |
| | 2012 | Fouz, Mahmoud | | Randomized Rumor Spreading in Social Networks & Complete Graphs
Universität des Saarlandes | Thesis - PhD thesis | |
| | 2012 | Doerr, Benjamin
[Fouz, Mahmoud]
Friedrich, Tobias | | Why Rumors Spread Fast in Social Networks
In: Communications of the ACM [55], 70-75 | Journal Article | |
| | 2011 | Doerr, Benjamin
[Fouz, Mahmoud] | | Asymptotically Optimal Randomized Rumor Spreading
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 502-513 | Proceedings Article | |
| | 2011 | Doerr, Benjamin
[Fouz, Mahmoud] | | Asymptotically optimal randomized rumor spreading
In: Electronic Notes in Discrete Mathematics [38], 297-302 | Electronic Journal Article | |
| | 2011 | Doerr, Benjamin
[Fouz, Mahmoud] | | Quasi-random rumor spreading: Reducing randomness can be costly
In: Information Processing Letters [111], 227-230 | Journal Article | |
| | 2011 | Doerr, Benjamin
[Fouz, Mahmoud]
[Witt, Carsten] | | Sharp bounds by probability-generating functions and variable drift
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 2083-2090 | Proceedings Article | |
| | 2011 | Doerr, Benjamin
[Fouz, Mahmoud]
Friedrich, Tobias | | Social Networks Spread Rumors in Sublogarithmic Time
In: STOC'11 : Proceedings of the 43rd ACM Symposium on Theory of Computing, 21-30 | 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 | |
| | 2011 | [Boros, Endre]
Elbassioni, Khaled
[Fouz, Mahmoud]
[Gurvich, Vladimir]
[Makino, Kazuhisa]
[Manthey, Bodo] | | Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 147-158 | Proceedings Article | |
| | 2010 | Elbassioni, Khaled
[Fouz, Mahmoud]
[Swamy, Chaitanya] | | Approximation Algorithms for Non-single-minded Profit-Maximization Problems with Limited Supply
In: Internet and Network Economics : 6th International Workshop, WINE 2010, 462-472 | Proceedings Article | |
| | 2010 | Doerr, Benjamin
[Fouz, Mahmoud] | | Hereditary Discrepancies in Different Numbers of Colors II
In: SIAM Journal on Discrete Mathematics [24], 1205-1213 | Journal 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 | [Christodoulou, George]
Elbassioni, Khaled
[Fouz, Mahmoud] | | Truthful Mechanisms for Exhibitions
In: Internet and Network Economics : 6th International Workshop, WINE 2010, 170-181 | Proceedings Article | |
| | 2009 | Doerr, Benjamin
[Fouz, Mahmoud] | | A Time-Randomness Tradeoff for Quasi-Random Rumour Spreading
In: Electronic Notes in Discrete Mathematics [34], 335 - 339 | Journal Article | |
| | 2009 | Doerr, Benjamin
Fouz, Mahmoud
[Schmidt, Martin]
Wahlström, Magnus | | BBOB: Nelder-Mead with resize and halfruns
In: Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference (GECCO 2009), 2239-2246 | Proceedings Article | |
| | 2006 | Doerr, Benjamin
Fouz, Mahmoud | | Hereditary Discrepancies in Different Numbers of Colors II
In: ??? [?], 1-19 | Miscellaneous | |
| | 2006 | Fouz, Mahmoud | | Hereditary Discrepancy in Different Numbers of Colors
Universität des Saarlandes | Thesis - Bachelor thesis | |
| 5 |
| Fraigniaud, Pierre |
| |
| | 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 | |
| | 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 | |
| | 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 | |
| 4 |
| Fraigniaud, Pierre (ed.) |
| |
| | 2014 | Jez, Artur | | Context Unification is in PSPACE
In: 41st International Colloquium on Automata, Languages, and Programming (ICALP 2014), 244-255 | Proceedings Article | |
| | 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 | |
| | 1996 | Sibeyn, Jop F. | | List Ranking on Interconnection Networks
In: 2nd Euro-Par Conference, 529-541 | Proceedings Article | |
| | 1996 | [Juurlink, Ben]
Sibeyn, Jop F.
[Rao, P. Srinivasa] | | Worm-Hole Gossiping on Meshes and Tori
In: 2nd Euro-Par Conference, 361-369 | Proceedings Article | |
| 1 |
| |
| | 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 |
| |
| | 2010 | [Althaus, Ernst]
[Altmeyer, Sebastian]
Naujoks, Rouven | | A New Combinatorial Approach to Parametric Path Analysis | Report | |
| 2 |
| |
| | 1992 | Baumgarten, Hanna
Jung, Hermann
Mehlhorn, Kurt | | Dynamic Point Location in General Subdivisions
In: Discrete algorithms (SODA-92) : 3rd annual ACM-SIAM symposium, 250-258 | Proceedings Article | |
| | 1992 | Mehlhorn, Kurt
Sharir, Micha
Welzl, Emo | | Tail Estimates for the Space Complexity of Randomised Incremental Algorithms
In: Discrete algorithms (SODA-92) : 3rd annual ACM-SIAM symposium, 89-93 | Proceedings Article | |
| 2 |
| Frederickson, Greg N. |
| |
| | 1998 | [Frederickson, Greg N.]
Solis-Oba, Roberto | | Algorithms for Measuring Perturbability in Matroid Optimization
In: Combinatorica [18], 503-518 | Journal Article | |
| | 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 |
| |
| | 1996 | [Fredman, Michael]
[Khachiyan, Leonid] | | On the Complexity of Dualization of Monotone Disjunctive Normal Forms
In: J. Algorithms [21], 618-628 | Journal Article | |
| 1 |
| |
| | 2001 | Meyer, Ulrich | | Heaps are better than Buckets: Parallel Shortest Paths on Unbalanced Graphs
In: Proceedings of the 7th International Euro-Par Conference on Parallel Processing (Euro-Par-01) :, 343-351 | Proceedings Article | |
| 4 |
| |
| | 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 | Jez, Artur | | One-Variable Word Equations in Linear Time
In: 40th International Colloquium on Automata, Languages, and Programming (ICALP 2013), 324-335 | Proceedings Article | |
| | 2006 | Ajwani, Deepak
Friedrich, Tobias
Meyer, Ulrich | | An $O(n^2.75)$ algorithm for online topological ordering
In: Algorithm theory - SWAT 2006 : 10th Scandinavian Workshop on Algorithm Theory, 53-64 | 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 | |
| 3 |
| Freivalds, Rūsiņš (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 | 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 | 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 | |
| 1 |
| Frid, Anna (ed.) |
| |
| | 2009 | Wahlström, Magnus | | New Plain-Exponential Time Classes for Graph Homomorphism
In: Computer Science – Theory and Applications : 4th International Computer Science Symposium in Russia, CSR 2009, 346-355 | Proceedings Article | |
| 2 |
| Friedetzky, Tom |
| |
| | 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 | [Berenbrink, Petra]
[Cooper, Colin]
[Friedetzky, Tom]
Friedrich, Tobias
Sauerwald, Thomas | | Randomized Diffusion for Indivisible Loads
In: 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA-11), 429-439 | Proceedings Article | |
| 3 |
| |
| | 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 | |
| | 2014 | [Friedrichs, Stephan]
[Kulau, Ulf]
[Wolf, Lars] | | Energy-efficient voltage scheduling of peripheral components on wireless sensor nodes
In: Communications Workshops (ICC), 2014 IEEE International Conference on, 860-865 | Proceedings Article | |
| | 2013 | [Fekete, Sándor P.]
[Friedrichs, Stephan]
[Kröller, Alexander]
[Schmidt, Christiane] | | Facets for Art Gallery Problems
In: Computing and Combinatorics, 208-220 | Proceedings Article | |
| 80 |
| |
| | 2013 | Bringmann, Karl
[Friedrich, Tobias] | | Approximation Quality of the Hypervolume Indicator
In: Artificial Intelligence [195], 265–290 | Journal Article | |
| | 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 | 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 | Bringmann, Karl
[Friedrich, Tobias] | | Parameterized Average-Case Complexity of the Hypervolume Indicator
In: 15th Annual Conference on Genetic and Evolutionary Computation (GECCO-13), 575-582 | Proceedings Article | |
| | 2013 | Bringmann, Karl
[Friedrich, Tobias]
[Igel, Christian]
[Voß, Thomas] | | Speeding Up Many-Objective Optimization by Monte Carlo Approximations
In: Artificial Intelligence [204], 22–29 | Journal Article | |
| | 2012 | Bringmann, Karl
Friedrich, Tobias | | Approximating the least hypervolume contributor: NP-hard in general, but fast in practice
In: Theoretical Computer Science [425], 104-116 | Journal Article | |
| | 2012 | Doerr, Benjamin
[Fouz, Mahmoud]
[Friedrich, Tobias] | | Asynchronous rumor spreading in preferential attachment graphs
In: Algorithm Theory - SWAT 2012 : 13th Scandinavian Symposium and Workshops, 307-315 | Proceedings Article | |
| | 2012 | Bringmann, Karl
Friedrich, Tobias | | Convergence of Hypervolume-Based Archiving Algorithms II: Competitiveness
In: GECCO'12 : Proceedings of the Fourteenth International Conference on
Genetic and Evolutionary Computation, 457-464 | Proceedings Article | |
| | 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 | |
| | 2012 | Doerr, Benjamin
[Fouz, Mahmoud]
[Friedrich, Tobias] | | Experimental analysis of rumor spreading in social networks
In: Design and Analysis of Algorithms First Mediterranean Conference on Algorithms, MedAlg 2012, 159-173 | Proceedings Article | |
| | 2012 | Friedrich, Tobias
[Gairing, Martin]
Sauerwald, Thomas | | Quasirandom Load Balancing
In: SIAM Journal on Computing [41], 747-771 | 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 | |
| | 2012 | Doerr, Benjamin
[Fouz, Mahmoud]
Friedrich, Tobias | | Why Rumors Spread Fast in Social Networks
In: Communications of the ACM [55], 70-75 | 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 | Fountoulakis, Nikolaos
Friedrich, Tobias
Hermelin, Danny | | Average Case Parameterized Complexity | Unpublished/Draft | |
| | 2011 | Friedrich, Tobias
Hebbinghaus, Nils | | Average update times for fully-dynamic all-pairs shortest paths
In: Discrete Applied Mathematics [159], 1751-1758 | Journal Article | |
| | 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 | |
| | 2011 | Bringmann, Karl
Friedrich, Tobias | | Convergence of Hypervolume-Based Archiving Algorithms I: Effectiveness
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 745-752 | Proceedings Article | |
| | 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 | |
| | 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 | Doerr, Benjamin
Friedrich, Tobias
[Künnemann, Marvin]
Sauerwald, Thomas | | Quasirandom Rumor Spreading: An Experimental Analysis
In: ACM Journal of Experimental Algorithmics [16], Article No. 3.3 | Journal Article | |
| | 2011 | [Berenbrink, Petra]
[Cooper, Colin]
[Friedetzky, Tom]
Friedrich, Tobias
Sauerwald, Thomas | | Randomized Diffusion for Indivisible Loads
In: 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA-11), 429-439 | Proceedings Article | |
| | 2011 | Friedrich, Tobias
[Sauerwald, Thomas]
[Vilenchik, Dan] | | Smoothed analysis of balancing networks
In: Random Structures & Algorithms [39], 115-138 | Journal Article | |
| | 2011 | Doerr, Benjamin
[Fouz, Mahmoud]
Friedrich, Tobias | | Social Networks Spread Rumors in Sublogarithmic Time
In: STOC'11 : Proceedings of the 43rd ACM Symposium on Theory of Computing, 21-30 | 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 | |
| | 2011 | Friedrich, Tobias
[Bringmann, Karl]
[Voss, Thomas]
[Igel, Christian] | | The Logarithmic Hypervolume Indicator
In: FOGA'11 : Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, 81-92 | Proceedings Article | |
| | 2010 | [Bringmann, Karl]
Friedrich, Tobias | | An Efficient Algorithm for Computing Hypervolume Contributions
In: Evolutionary Computation [18], 383-402 | 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 | Bringmann, Karl
Friedrich, Tobias | | Approximating the volume of unions and intersections of high-dimensional geometric objects
In: Computational Geometry [43], 601-610 | Journal Article | |
| | 2010 | Ajwani, Deepak
Friedrich, Tobias | | Average-case Analysis of Incremental Topological Ordering
In: Discrete Applied Mathematics [158], 240-250 | Journal Article | |
| | 2010 | [Cooper, Joshua]
Doerr, Benjamin
Friedrich, Tobias
[Spencer, Joel] | | Deterministic Random Walks on Regular Trees
In: Random Structures and Algorithms [37], 353-366 | Journal Article | |
| | 2010 | [Bradonjić, Milan]
[Elsässer, Robert]
Friedrich, Tobias
[Sauerwald, Thomas]
[Stauffer, Alexandre] | | Efficient Broadcast on Random Geometric Graphs
In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1412-1421 | 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 | Friedrich, Tobias
[Gairing, Martin]
[Sauerwald, Thomas] | | Quasirandom Load Balancing
In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1620-1629 | 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 | |
| | 2010 | Friedrich, Tobias
[Sauerwald, Thomas]
[Vilenchik, Dan] | | Smoothed Analysis of Balancing Networks
In: Random Structures and Algorithms [Early View], 1-24 | Electronic Journal Article | |
| | 2010 | Friedrich, Tobias
[Sauerwald, Thomas] | | The Cover Time of Deterministic Random Walks
In: Computing and Combinatorics : 16th Annual International Conference, COCOON 2010, 130-139 | Proceedings Article | |
| | 2010 | Friedrich, Tobias
Sauerwald, Thomas | | The Cover Time of Deterministic Random Walks
In: The Electronic Journal of Combinatorics [17], R167,1-R167,30 | Electronic Journal Article | |
| | 2010 | [Bringmann, Karl]
Friedrich, Tobias | | The Maximum Hypervolume Set Yields Near-optimal Approximation
In: 12th annual conference on Genetic and evolutionary computation (GECCO 2010), 511-518 | Proceedings Article | |
| | 2010 | [Bringmann, Karl]
Friedrich, Tobias | | Tight Bounds for the Approximation Ratio of the Hypervolume Indicator
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 607-616 | Proceedings Article | |
| | 2010 | Friedrich, Tobias
Neumann, Frank | | When to Use Bit-Wise Neutrality
In: Natural Computing [9], 283 - 294 | Journal 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 | [Friedrich, Tobias]
[Oliveto, Pietro]
[Sudholt, Dirk]
[Witt, Carsten] | | Analysis of Diversity-Preserving Mechanisms for Global Exploration
In: Evolutionary Computation [17], 455-476 | Journal Article | |
| | 2009 | [Bringmann, Karl]
[Friedrich, Tobias] | | Approximating the least hypervolume contributor: NP-hard in general, but fast in practice
In: Evolutionary Multi-Criterion Optimization : 5th International Conference, EMO 2009, 6-20 | Proceedings 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 | [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
Friedrich, Tobias | | Deterministic Random Walks on the Two-Dimensional Grid
In: Combinatorics, Probability and Computing [18], 123-144 | Journal Article | |
| | 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 | |
| | 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 | [Friedrich, Tobias]
[Sauerwald, Thomas] | | Near-Perfect Load Balancing by Randomized Rounding
In: STOC09 : Proceedings of the 2009 ACM International Symposium on Theory of Computing, 121-130 | 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 | Doerr, Benjamin
Friedrich, Tobias
[Sauerwald, Thomas] | | Quasirandom Rumor Spreading on Expanders
In: Electronic Notes in Discrete Mathematics [34], 243 - 247 | Journal Article | |
| | 2009 | Doerr, Benjamin
[Friedrich, Tobias]
[Künnemann, Marvin]
[Sauerwald, Thomas] | | Quasirandom Rumor Spreading: An Experimental Analysis
In: 2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX), 145-153 | 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 | |
| | 2008 | Ajwani, Deepak
Friedrich, Tobias
Meyer, Ulrich | | An $O(n^2.75)$ algorithm for incremental topological ordering
In: ACM Transactions on Algorithms [4], 1-14 | Journal 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 | 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 | |
| | 2008 | [Cooper, Joshua]
Doerr, Benjamin
Friedrich, Tobias
[Spencer, Joel] | | Deterministic Random Walks on Regular Trees
In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, 766-772 | Proceedings Article | |
| | 2008 | Doerr, Benjamin
Friedrich, Tobias
[Sauerwald, Thomas] | | Quasirandom Rumor Spreading
In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, 773-781 | 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 | 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 | |
| | 2008 | Friedrich, Tobias
Neumann, Frank | | When to Use Bit-wise Neutrality
In: IEEE Congress on Evolutionary Computation 2008, 997-1003 | 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 | Ajwani, Deepak
Friedrich, Tobias | | Average-Case Analysis of Online Topological Ordering
In: Algorithms and Computation : 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007. Proceedings, 464-475 | Proceedings Article | |
| | 2007 | [Cooper, Joshua]
Doerr, Benjamin
Friedrich, Tobias
[Spencer, Joel] | | Deterministic Random Walks on Regular Trees
In: Electronic Notes in Discrete Mathematics [29], 509-513 | Journal 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 | 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 | 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
Friedrich, Tobias
Klein, Christian
Osbild, Ralf | | Unbiased Matrix Rounding
In: Electronic Notes in Discrete Mathematics [28], 41-46 | Journal Article | |
| | 2007 | Friedrich, Tobias | | Use and Avoidance of Randomness
Universität des Saarlandes | Thesis - PhD thesis | |
| | 2006 | Ajwani, Deepak
Friedrich, Tobias
Meyer, Ulrich | | An $O(n^2.75)$ algorithm for online topological ordering
In: Algorithm theory - SWAT 2006 : 10th Scandinavian Workshop on Algorithm Theory, 53-64 | Proceedings Article | |
| | 2006 | Doerr, Benjamin
Friedrich, Tobias | | Deterministic Random Walks on the Two-Dimensional Grid
In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 474-483 | Proceedings Article | |
| | 2006 | Doerr, Benjamin
Friedrich, Tobias | | Quasirandomness in Graphs
In: Electronic Notes in Discrete Mathematics [25], 61-64 | Journal 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 | Friedrich, Tobias | | Deterministic Random Walks on Infinite Grids
Friedrich-Schiller-Universität Jena | Thesis - Masters thesis | |
| | 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 |
| Fries, Markus |
| |
| | 2001 | Fries, Markus | | Implementation of a Dynamic Convex Hall Algorithm in Arbitrary Dimension
Universität des Saarlandes | Thesis - Masters thesis | |
| | 2000 | Fries, Markus | | Implementation of a Dynamic Convex Hull Algorithm in Arbitrary Dimension
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| |
| | 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 | |
| 3 |
| |
| | 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 | |
| | 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 | |
| 2 |
| |
| | 2000 | [Cooper, Colin]
Frieze, Alan M.
Mehlhorn, Kurt
Priebe, Volker | | Average-Case Complexity of Shortest-Paths Problems in the Vertex-Potential Model
In: Random Structures & Algorithms [16], 33-46 | Journal Article | |
| | 1997 | [Cooper, Colin]
Frieze, Alan M.
Mehlhorn, Kurt
Priebe, Volker | | Average-case complexity of shortest-paths problems in the vertex-potential model
In: International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM-97), 15-26 | Proceedings Article | |
| 1 |
| Frigioni, Daniele |
| |
| | 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 |
| Frigioni, Daniele (ed.) |
| |
| | 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 | |
| 1 |
| Froyland, Gary |
| |
| | 2008 | [Froyland, Gary]
[Koch, Thorsten]
Megow, Nicole
[Duane, Emily]
[Wren, Howard] | | Optimizing the Landside Operation of a Container Terminal
In: OR Spectrum [30], 53-75 | Journal Article | |
| 1 |
| Fuhrmann, Artur |
| |
| | 2001 | [Fuhrmann, Artur]
Schömer, Elmar | | A General Method for Computing the Reachable Space of Mechanisms
In: Proceedings of the 2001 ASME Design Engineering Technical Conferences and Computers and Information in Engineering Conference. - Vol. 2, 27th Design Automation Conference (DETC'01), DAC-21057 | Proceedings Article | |
| 1 |
| Fuhr, Norbert (ed.) |
| |
| | 2007 | Bast, Holger
Chitea, Alexandru
Suchanek, Fabian
Weber, Ingmar | | ESTER: Efficient Search in Text, Entities, and Relations
In: 30th International Conference on Research and Development in Information Retrieval (SIGIR'07), 671-678 | Proceedings Article | |
| 1 |
| Fujita, Satoshi (ed.) |
| |
| | 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 | |
| 1 |
| Fukuda, Komei (ed.) |
| |
| | 2010 | Mehlhorn, Kurt | | Reliable and Efficient Geometric Computing
In: Mathematical Software, ICMS 2010 : Third International Congress
on Mathematical Software, 10-11 | Proceedings Article | |
| 2 |
| Fukunaga, Takuro (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 | |
| 2 |
| |
| | 1995 | [Bodlaender, Hans L.]
Hagerup, Torben | | Parallel Algorithms with Optimal Speedup for Bounded Treewidth
In: Automata, Languages, and Programming: 22nd International Colloquium (ICALP95), 268-279 | Proceedings Article | |
| | 1995 | Chaudhuri, Shiva
Zaroliagis, Christos | | Shortest Path Queries in Digraphs of Small Treewidth
In: Automata, Languages, and Programming: 22nd International Colloquium (ICALP95), 244-255 | Proceedings Article | |
| 57 |
| Funke, Stefan |
| |
| | 2011 | Beier, Rene
Funke, Stefan
Matijevic, Domagoj
[Sanders, Peter] | | Energy-Efficient Paths in Radio Networks
In: Algorithmica [61], 298-319 | Journal 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 | |
| | 2009 | [Burnikel, Christoph]
[Funke, Stefan]
Mehlhorn, Kurt
[Schirra, Stefan]
Schmitt, Susanne | | A Separation Bound for Real Algebraic Expressions
In: Algorithmica [55], 14-28 | Journal Article | |
| | 2009 | [Dumitriu, Daniel]
[Funke, Stefan]
[Kutz, Martin]
[Milosavljevic, Nikola] | | How Much Geometry It Takes to Reconstruct a 2-Manifold in R 3
In: ACM Journal of Experimental Algorithms [14], 2.2:1-2.2:17 | Electronic Journal Article | |
| | 2009 | Bast, Holger
Funke, Stefan
Matijevic, Domagoj | | Ultrafast shortest-path queries via transit nodes
In: The shortest path problem : ninth DIMACS implemenation challenge, 175-192 | Part of a Book | |
| | 2008 | Eisenbrand, Friedrich
Funke, Stefan
Karrenbauer, Andreas
Matijevic, Domagoj | | Energy-Aware Stage Illumination
In: International Journal of Computational Geometry and Applications [18], 107-129 | Journal Article | |
| | 2008 | Dumitriu, Daniel
[Funke, Stefan]
[Kutz, Martin]
[Milosavljevic, Nikola] | | How much Geometry it takes to Reconstruct a 2-Manifold in $R^3$
In: 10th Workshop on Algorithm Engineering and Experiments (ALENEX-2008), 65-74 | Proceedings Article | |
| | 2008 | Dumitriu, Daniel
[Funke, Stefan]
[Kutz, Martin]
[Milosavljevic, Nikola] | | On the Locality of Extracting a 2-Manifold in $R^3$
In: 11th Scandinavian Workshop on Algorithm Theory (SWAT-2008), 270-281 | 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 | |
| | 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 | |
| | 2007 | Funke, Stefan
Laue, Sören | | Bounded-Hop Energy-Efficient Broadcast in Low-Dimensional Metrics Via Coresets
In: STACS 2007 : 24th Annual Symposium on Theoretical Aspects of Computer Science, 272-283 | Proceedings Article | |
| | 2007 | Bast, Holger
Funke, Stefan
[Sanders, Peter]
[Schultes, Dominik] | | Fast Routing in Road Networks using Transit Nodes
In: Science [316], 566 | Journal Article | |
| | 2007 | Funke, Stefan
[Milosavljevic, Nikola] | | Guaranteed-delivery Geographic Routing under Uncertain Node Locations
In: IEEE INFOCOM 2007 : 26th IEEE International Conference on Computer Communications, 1244-1252 | Proceedings Article | |
| | 2007 | Funke, Stefan
Kesselman, Alexander
[Kuhn, Fabian]
[Lotker, Zvi]
[Segal, Michael] | | Improved approximation algorithms for connected sensor cover
In: Wireless Networks [13], 153-164 | Journal Article | |
| | 2007 | Bast, Holger
Funke, Stefan
Matijevic, Domagoj
[Sanders, Peter]
[Schultes, Dominik] | | In Transit to Constant Time Shortest-Path Queries in Road Networks
In: 9th Workshop on Algorithm Enginneering and Experiments (ALENEX'07), 46-59 | Proceedings Article | |
| | 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 | |
| | 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 | |
| | 2007 | Funke, Stefan
[Milosavljevic, Nikola] | | Network Sketching or: "How much Geometry hides in Connectivity? - Part II"
In: Proceedings of the eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-07), 958-967 | Proceedings Article | |
| | 2007 | [Aronov, Boris]
[Asano, Tetsuo]
Funke, Stefan | | Optimal Triangulation with Steiner Points
In: Algorithms and Computation : 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007. Proceedings, 681-691 | Proceedings Article | |
| | 2007 | Eisenbrand, Friedrich
[Funke, Stefan]
Karrenbauer, Andreas
Reichel, Joachim
[Schömer, Elmar] | | Packing a truck - Now with a twist!
In: International Journal of Computational Geometry & Applications [17], 505-527 | Journal Article | |
| | 2006 | [Funke, Stefan]
Kesselman, Alexander
Meyer, Ulrich
[Segal, Michael] | | A Simple Improved Distributed Algorithm for Minimum CDS in Unit Disk Graphs
In: ACM Transactions on Sensor Networks [2], 444-453 | Journal Article | |
| | 2006 | Funke, Stefan
Klein, Christian
Mehlhorn, Kurt
Schmitt, Susanne | | Controlled Perturbation for Delaunay Triangulations | Report | |
| | 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 | |
| | 2006 | Funke, Stefan
Klein, Christian | | Hole Detection or: "How Much Geometry Hides in Connectivity?"
In: Proceedings of the 22nd Annual Symposium on Computational Geometry, SCG'06, 377-385 | Proceedings Article | |
| | 2006 | Funke, Stefan
Laue, Sören
Naujoks, Rouven
[Lotker, Zvi] | | Power Assignment Problems in Wireless Communication
In: ??? [?], 1-14 | Miscellaneous | |
| | 2006 | Bast, Holger
Funke, Stefan
Matijevic, Domagoj | | TRANSIT: Ultrafast Shortest-Path Queries with Linear-Time Preprocessing
In: 9th DIMACS Implementation Challenge --- Shortest Path, | Electronic Proceedings Article | |
| | 2006 | Funke, Stefan
[Malamatos, Theocharis]
[Matijevic, Domagoj]
Wolpert, Nicola | | (Approximate) Conic Nearest Neighbors and the induced Voronoi Diagram
In: 18th Canadian Conference on Computational Geometry, 23-26 | Proceedings Article | |
| | 2005 | Funke, Stefan
Kesselman, Alexander
Meyer, Ulrich
[Segal, Michael] | | A Simple Improved Distributed Algorithm for Minimum CDS in Unit Disk Graphs
In: 1st IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob 2005), 220-223 | Proceedings Article | |
| | 2005 | Althaus, Ernst
Funke, Stefan
[Har-Peled, Sariel]
[Könemann, Jochen]
[Ramos, Edgar A.]
Skutella, Martin | | Approximating k-Hop Minimum-Spanning Trees
In: Operations Research Letters [33], 115-120 | Journal Article | |
| | 2005 | Funke, Stefan
Klein, Christian
Mehlhorn, Kurt
Schmitt, Susanne | | Controlled Perturbation for Delaunay Triangulations
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 1047-1056 | Proceedings Article | |
| | 2005 | Eisenbrand, Friedrich
Funke, Stefan
Karrenbauer, Andreas
Matijevic, Domagoj | | Energy-Aware Stage Illumination
In: Proceedings of the 21st Annual Symposium on Computational Geometry : (SCG05), 336-346 | Proceedings Article | |
| | 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 | |
| | 2005 | Eisenbrand, Friedrich
[Funke, Stefan]
Karrenbauer, Andreas
Reichel, Joachim
[Schömer, Elmar] | | Packing a Trunk - now with a Twist!
In: Proceedings SPM 2005 ACM Symposium on Solid and Physical Modeling, 197-206 | Proceedings 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 | |
| | 2005 | Funke, Stefan | | Topological Hole Detection in Wireless Sensor Networks and its Applications
In: 3rd ACM/SIGMOBILE International Workshop on foundations of Mobile Computing (DIAL-M-POMC), 44-53 | Proceedings Article | |
| | 2004 | Funke, Stefan
Matijevic, Domagoj
Sanders, Peter | | Constant Time Queries for Energy Efficient Paths in Multi-Hop Wireless Networks
In: First International Workshop on Algorithms for Wireless and Mobile Networks, 97-111 | Proceedings Article | |
| | 2004 | Funke, Stefan
Malamatos, Theocharis
Ray, Rahul | | Finding Planar Regions in a Terrain
In: 20th European Workshop on Computational Geometry (EWCG), 1-4 | Proceedings Article | |
| | 2004 | Funke, Stefan
Malamatos, Theocharis
Ray, Rahul | | Finding Planar Regions in a Terrain: In Practice and with a Guarantee
In: Proceedings of the Twentieth Annual Symposium on Computational Geometry : (SCG'04), 96-105 | Proceedings Article | |
| | 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 | |
| | 2004 | Althaus, Ernst
Eisenbrand, Friedrich
Funke, Stefan
Mehlhorn, Kurt | | Point Containment in the Integer Hull of a Polyhedron
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 929-933 | Proceedings Article | |
| | 2004 | Funke, Stefan
Mehlhorn, Kurt
Schmitt, Susanne
[Burnikel, Christoph]
[Fleischer, Rudolf]
[Schirra, Stefan] | | The LEDA class real number -- extended version | Report | |
| | 2003 | Eisenbrand, Friedrich
Funke, Stefan
[Garg, Naveen]
[Könemann, Jochen] | | A Combinatorial Algorithm for Computing a Maximum Independent Set in a t-perfect Graph
In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), 517-522 | Proceedings Article | |
| | 2003 | Funke, Stefan
Matijevic, Domagoj
Sanders, Peter | | Approximating Energy Efficient Paths in Wireless Multi-hop Networks
In: Algorithms - ESA 2003: 11th Annual European Symposium, 230-241 | Proceedings Article | |
| | 2003 | Dhiflaoui, Marcel
Funke, Stefan
Kwappik, Carsten
Mehlhorn, Kurt
Seel, Michael
Schömer, Elmar
Schulte, Ralph
Weber, Dennis | | Certifying and Repairing Solutions to Large LPs - How Good are LP-Solvers?
In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), 255-256 | Proceedings Article | |
| | 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 | |
| | 2003 | Eisenbrand, Friedrich
Funke, Stefan
Reichel, Joachim
[Schömer, Elmar] | | Packing a Trunk
In: Algorithms - ESA 2003: 11th Annual European Symposium, 618-629 | Proceedings Article | |
| | 2002 | Funke, Stefan
Mehlhorn, Kurt | | LOOK - A Lazy Object-Oriented Kernel for Geometric Computation
In: Computational Geometry - Theory and Applications [22], 99-118 | Journal Article | |
| | 2002 | Funke, Stefan
Ramos, Edgar A. | | Smooth-Surface Reconstruction in Near-Linear Time
In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-02), 781-790 | Proceedings Article | |
| | 2001 | [Burnikel, Christoph]
Funke, Stefan
Mehlhorn, Kurt
[Schirra, Stefan]
Schmitt, Susanne | | A Separation Bound for Real Algebraic Expressions
In: Proceedings of the 9th Annual European Symposium on Algorithms (ESA-01), 254-265 | Proceedings Article | |
| | 2001 | Funke, Stefan | | Combinatorial Curve Reconstruction and the Efficient Exact Implementation of Geometric Algorithms
Universität des Saarlandes | Thesis - PhD thesis | |
| | 2001 | Burnikel, Christoph
Funke, Stefan
Seel, Michael | | Exact geometric computation using Cascading
In: International Journal of Computational Geometry & Applications [11], 245-266 | Journal Article | |
| | 2001 | Funke, Stefan
Ramos, Edgar A. | | Reconstructing a Collection of Curves with Corners and Endpoints
In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-01), 344-353 | Proceedings Article | |
| | 2001 | Dey, Tamal K.
Funke, Stefan
Ramos, Edgar A. | | Surface Reconstruction in almost Linear Time under Locally Uniform Sampling
In: Proceedings of the 17th European Workshop on Computational Geometry (EWCG-01), 129-132 | Electronic Proceedings Article | |
| | 2000 | Funke, Stefan
Mehlhorn, Kurt | | LOOK - a Lazy Object-Oriented Kernel for Geometric Computation
In: Proceedings of the 16th Annual Symposium on Computational Geometry (SCG-00), 156-165 | Proceedings Article | |
| | 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 | Burnikel, Christoph
Funke, Stefan
Seel, Michael | | Exact Geometric Predicates using Cascaded Computation
In: Proceedings of the 14th International Annual ACM Symposium on Computational Geometry (SCG-98), 175-183 | Proceedings Article | |
| | 1997 | Funke, Stefan | | Exact Arithmetic using Cascaded Computation
Universität des Saarlandes | Thesis - Masters thesis | |
| 5 |
| Fürer, Martin |
| |
| | 1998 | [Subramanian, C. R.]
[Fürer, Martin]
Veni Madhavan, C. E. | | Algorithms for Coloring Semi-random Graphs
In: Random Structures & Algorithms [13], 125-158 | Journal Article | |
| | 1989 | Fürer, Martin
Mehlhorn, Kurt | | AT$^2$-Optimal Galois Field Multiplier for VLSI
In: IEEE Transactions on Computers [38], 1333-1336 | Journal Article | |
| | 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 | [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 | |
| 1 |
| Fu, Bin (ed.) |
| |
| | 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 | |
| 1 |
| F. Huber (ed.) |
| |
| | 2007 | Giesen, Joachim | | The Combinatorial Structure of Polyhedral Choice Based Conjoint Analysis
In: Conjoint Measurement: Methods and Applications, 259-271 | Part of a Book | |
| 1 |
| F. Smyth, William (ed.) |
| |
| | 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 | |
| 1 |
| Gabow, Harold N. (ed.) |
| |
| | 2005 | [Chlebus, Bogdan S.]
Kowalski, Dariusz | | Cooperative asynchronous update of shared memory
In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC 2005), 733-739 | Proceedings Article | |
| 1 |
| Gabriel, Valiente (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 | |
| 3 |
| Gagie, Travis |
| |
| | 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 | |
| | 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 | |
| 2 |
| Gairing, Martin |
| |
| | 2012 | Friedrich, Tobias
[Gairing, Martin]
Sauerwald, Thomas | | Quasirandom Load Balancing
In: SIAM Journal on Computing [41], 747-771 | Journal Article | |
| | 2010 | Friedrich, Tobias
[Gairing, Martin]
[Sauerwald, Thomas] | | Quasirandom Load Balancing
In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1620-1629 | Proceedings Article | |
| 3 |
| |
| | 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 | |
| | 1976 | Mehlhorn, Kurt
Galil, Zvi | | Monotone Switching Circuits and Boolean Matrix Product
In: Computing [16], 99-111 | Journal Article | |
| | 1975 | Mehlhorn, Kurt
Galil, Zvi | | Monotone Switching Circuits and Boolean Matrix Product
In: Mathematical foundations of computer science (MFCS-75) : 4th symposium, 315-319 | Proceedings Article | |
| 1 |
| Gambardella, Luca Maria (ed.) |
| |
| | 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 | |
| 1 |
| |
| | 2009 | [Gandhi, Rajiv]
Mestre, Julián | | Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
In: Algorithmica [54], 54-71 | Journal Article | |
| 1 |
| |
| | 2009 | [Bringmann, Karl]
[Friedrich, Tobias] | | Approximating the least hypervolume contributor: NP-hard in general, but fast in practice
In: Evolutionary Multi-Criterion Optimization : 5th International Conference, EMO 2009, 6-20 | Proceedings Article | |
| 2 |
| |
| | 2005 | Eigenwillig, Arno
Kettner, Lutz
[Krandick, Werner]
Mehlhorn, Kurt
Schmitt, Susanne
Wolpert, Nicola | | A Descartes algorithm for polynomials with bit-stream coefficients
In: Computer Algebra in Scientific Computing : 8th International Workshop, CASC 2005, 138-149 | Proceedings Article | |
| | 2005 | Schmitt, Susanne | | The diamond operator - Implementation of exact real algebraic numbers
In: Computer Algebra in Scientific Computing, 8th International Workshop, CASC 2005, 355-366 | Proceedings Article | |
| 1 |
| Ganzinger, Harald (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 | |
| 2 |
| Gao, Pu (Jane) |
| |
| | 2011 | Gao, Pu (Jane) | | Distribution of spanning regular subgraphs in random graphs | Unpublished/Draft | |
| | 2010 | Gao, Pu (Jane)
[Wormald, Nicholas]
[Su, Yi] | | Induced subgraphs in sparse random graphs with given degree sequence | Unpublished/Draft | |
| 2 |
| |
| | 1988 | Gao, Shaodi
Jerrum, Mark
Kaufmann, Michael
Mehlhorn, Kurt
Rülling, Wolfgang | | On Continuous Homotopic One Layer Routing
In: Computational geometry (SCG-88) : 4th symposium, 392-402 | Proceedings Article | |
| | 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 | |
| 1 |
| Gardy, Danièle |
| |
| | 2002 | Banderier, Cyril
[Bousquet-Mélou, Mireille]
[Denise, Alain]
[Flajolet, Philippe]
[Gardy, Danièle]
[Gouyou-Beauchamps, Dominique] | | Generating Functions for Generating Trees
In: Discrete Mathematics [246], 29-55 | Journal Article | |
| 1 |
| Gargano, Luisa (ed.) |
| |
| | 2010 | Elmasry, Amr
[Jensen, Claus]
[Katajainen, Jyrki] | | The Magic of a Number System
In: Fun with Algorithms : 5th International Conference, FUN 2010, 156-165 | Proceedings Article | |
| 15 |
| Garg, Naveen |
| |
| | 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 | |
| | 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 | |
| | 2011 | [Anand, S.]
[Garg, Naveen]
Megow, Nicole | | Meeting deadlines: How much speed suffices?
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011. - Pt. I, 232-243 | Proceedings Article | |
| | 2010 | [Garg, Naveen]
[Kavitha, T.]
[Kumar, Amit]
Mehlhorn, Kurt
Mestre, Julián | | Assigning Papers to Referees
In: Algorithmica [58], 119-136 | Journal Article | |
| | 2008 | [Garg, Naveen]
[Kavitha, T.]
[Kumar, Amit]
Mehlhorn, Kurt
Mestre, Julián | | Assigning Papers to Referees | Unpublished/Draft | |
| | 2003 | Eisenbrand, Friedrich
Funke, Stefan
[Garg, Naveen]
[Könemann, Jochen] | | A Combinatorial Algorithm for Computing a Maximum Independent Set in a t-perfect Graph
In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), 517-522 | Proceedings Article | |
| | 2000 | Garg, Naveen
[Konjevod, Goran]
[Ravi, R.] | | Approximation algorithm for the group Steiner tree problem
In: Journal of Algorithms [37], 66-84 | Journal Article | |
| | 2000 | Albers, Susanne
Garg, Naveen
Leonardi, Stefano | | Minimizing stall time in single and parallel disk systems
In: Journal of the ACM [47], 969-986 | Journal Article | |
| | 1999 | [Dinitz, Yefim]
Garg, Naveen
[Goemans, Michel X.] | | On the single-source unsplittable flow problem
In: Combinatorica [19], 17-41 | Journal Article | |
| | 1998 | Albers, Susanne
[Garg, Naveen]
[Leonardi, Stefano] | | Minimizing stall time in single and parallel disk systems
In: Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC-98), 454-462 | Proceedings Article | |
| | 1998 | Chaudhuri, Shiva
Garg, Naveen
[Ravi, R.] | | The $p$-neighbor $k$-center problem
In: Information Processing Letters [65], 131-134 | Journal Article | |
| | 1996 | Garg, Naveen | | A 3-approximation for the minimum tree spanning with k-vertices
In: Foundations of computer science (FOCS-96) : 37th annual symposium, 302-309 | Proceedings Article | |
| | 1996 | Garg, Naveen
[Vazirani, Vijay V.] | | Approximate max-flow min-(multi)cut theorems and their applications
In: SIAM Journal on Computing [25], 235-251 | Journal 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 | Garg, Naveen
[Vazirani, Vijay V.] | | A polyhedron with all s-t cuts as vertices, and adjacency of cuts
In: Mathematical Programming (A) [70], 17-25 | Journal Article | |
| 1 |
| Garg, Naveen (ed.) |
| |
| | 2006 | Doerr, Benjamin
Klein, Christian | | Unbiased Rounding of Rational Matrices
In: FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science: 26th International Conference, 200-211 | Proceedings Article | |
| 2 |
| Garibay, Ivan (ed.) |
| |
| | 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 | [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 | |
| 1 |
| |
| | 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 |
| |
| | 2009 | Gärtner, Tobias
[Hotz, Günter] | | Computability of Analytic Functions with Analytic Machines
In: Mathematical Theory and Computational Practice : 5th Conference on Computability in Europe, CiE 2009, 250-259 | Proceedings Article | |
| 18 |
| |
| | 2007 | [Chrobak, Marek]
[Gasieniec, Leszek]
Kowalski, Dariusz R. | | The wake-up problem in multihop radio networks
In: SIAM Journal on Computing [36], 1453-1471 | Journal 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 | [Chrobak, Marek]
[Gasieniec, Leszek]
Kowalski, Dariusz | | The Wake-Up problem in multi-hop radio networks
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 985-993 | Proceedings Article | |
| | 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 | |
| | 1998 | [Crochemore, Maxime]
Gasieniec, Leszek
[Rytter, Wojciech] | | Constant-space string-matching in sublinear average time
In: Compression and Complexity of SEQUENCES 1997, 230-239 | 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 | |
| | 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 | |
| | 1997 | Gasieniec, Leszek
[Indyk, Piotr] | | Efficient Parallel Computing with Memory Faults
In: Proceedings of the 11th Symposium on Fundamentals of Computation Theory (FCT-97), 188-197 | Proceedings Article | |
| | 1997 | [Das, Gautam]
Fleischer, Rudolf
Gasieniec, Leszek
Gunopulos, Dimitrios
Kärkkäinen, Juha | | Episode matching
In: Combinatorial pattern matching : 8th annual symposium (CPM-97), 12-27 | Proceedings Article | |
| | 1997 | Gasieniec, Leszek
Indyk, Piotr
Krysta, Piotr | | External inverse pattern matching
In: Proceedings of the 8th Symposium on Combinatorial Pattern Matching (CPM-97), 90-101 | Proceedings Article | |
| | 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 | |
| | 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 | |
| | 1996 | Gasieniec, Leszek
[Pelc, Andrzej] | | Adaptive Broadcasting with Faulty Nodes
In: Parallel Computing [22], 903-912 | Journal Article | |
| | 1996 | [Brodal, Gerth Stølting]
Gasieniec, Leszek | | Approximate Dictionary Queries
In: Combinatorial Pattern Matching: 7th Annual Symposium (CPM'96), 65-74 | 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 | 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 | 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 |
| Gast, Christoph |
| |
| | 1997 | Gast, Christoph | | Das Maximum-Weight-Trace-Problem bei multiplem Sequenz-Alignment
Universität des Saarlandes | Thesis - Masters thesis | |
| 5 |
| Gavoille, Cyril (ed.) |
| |
| | 2010 | [Christodoulou, Giorgos]
[Ligett, Katrina]
Pyrga, Evangelia | | Contention Resolution under Selfishness
In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010. - Pt. II, 430-441 | Proceedings Article | |
| | 2010 | [Epstein, Leah]
[Levin, Asaf]
van Stee, Rob | | Max-min online allocations with a reordering buffer
In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010, 336-347 | Proceedings 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 | Kratsch, Stefan
Wahlström, Magnus | | Preprocessing of Min Ones Problems: A Dichotomy
In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010, 653-665 | Proceedings Article | |
| | 1999 | Sibeyn, Jop F. | | Power and Limitations of Optical Reconfigurable Arrays
In: Proceedings of the 6th International Colloquium on Structural Information and Communication Complexity (SIROCCO 6), 249-263 | Proceedings Article | |
| 2 |
| Gavrilova, Marina (ed.) |
| |
| | 2009 | Angelopoulos, Spyros | | Online Priority Steiner Tree Problems
In: Algorithms and Data Structures : 11th International Symposium, WADS 2009, 37-48 | Proceedings Article | |
| | 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 | |
| 17 |
| |
| | 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
[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 | |
| | 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 | |
| | 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 | |
| | 2014 | Gawrychowski, Pawel | | Simple and efficient LZW-compressed multiple pattern matching
In: Journal of Discrete Algorithms [25], 34-41 | Journal 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 | |
| | 2014 | Gawrychowski, Pawel
Jez, Artur
[Jez, Lukasz] | | Validating the Knuth-Morris-Pratt Failure Function, Fast and Online
In: Theory of Computing Systems [54], 337-372 | Journal Article | |
| | 2013 | Gawrychowski, Pawel | | Alphabetic Minimax Trees in Linear Time
In: 8th International Computer Science Symposium in Russia (CSR 2013), 36-48 | Proceedings Article | |
| | 2013 | Gawrychowski, Pawel
[Straszak, Damian] | | Beating O(nm) in Approximate LZW-Compressed Pattern Matching
In: Algorithms and Computation - 24th International Symposium (ISAAC 2013), 78-88 | Proceedings Article | |
| | 2013 | [Bannai, Hideo]
Gawrychowski, Pawel
[Inenaga, Shunsuke]
[Takeda, Masayuki] | | Converting SLP to LZ78 in almost Linear Time
In: Combinatorial Pattern Matching, 24th Annual Symposium (CPM 2013), 38-49 | 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 | |
| | 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 | |
| | 2012 | Gawrychowski, Pawel | | Faster Algorithm for Computing the Edit Distance between SLP-Compressed Strings
In: String Processing and Information Retrieval : 19th International Symposium, SPIRE 2012, 229-236 | Proceedings Article | |
| | 2012 | Gawrychowski, Pawel | | Simple and efficient LZW-compressed multiple pattern matching
In: Combinatorial Pattern Matching : 23rd Annual Symposium, CPM 2012, 232-242 | Proceedings Article | |
| | 2012 | Gawrychowski, Pawel | | Tying up the loose ends in fully LZW-compressed pattern matching
In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, 624-635 | Electronic Proceedings Article | |
| 2 |
| |
| | 1995 | [Bodlaender, Hans L.]
Hagerup, Torben | | Parallel Algorithms with Optimal Speedup for Bounded Treewidth
In: Automata, Languages, and Programming: 22nd International Colloquium (ICALP95), 268-279 | Proceedings Article | |
| | 1995 | Chaudhuri, Shiva
Zaroliagis, Christos | | Shortest Path Queries in Digraphs of Small Treewidth
In: Automata, Languages, and Programming: 22nd International Colloquium (ICALP95), 244-255 | Proceedings Article | |
| 1 |
| Geerke, Daan P. |
| |
| | 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 |
| Geffert, Viliam |
| |
| | 1992 | Alt, Helmut
Geffert, Viliam
Mehlhorn, Kurt | | A lower bound for the nondeterministic space complexity of context-free recognition
In: Information Processing Letters [42], 25-27 | Journal Article | |
| 2 |
| Geismann, Nicola |
| |
| | 2001 | Geismann, Nicola
Hemmer, Michael
Schömer, Elmar | | Computing a 3-dimensional Cell in an Arrangement of Quadrics: Exactly and Actually!
In: Proceedings of the 17th Annual Symposium on Computational Geometry (SCG-01), 264-273 | Proceedings Article | |
| | 2001 | Geismann, Nicola
Hemmer, Michael
Schömer, Elmar | | The Convex Hull of Ellipsoids (Video)
In: Proceedings of the 17th Annual Symposium on Computational Geometry (SCG-01), 321-322 | Proceedings Article | |
| 2 |
| |
| | 2005 | [Georgiou, Chryssis]
Kowalski, Dariusz
[Shvartsman, Alexander] | | Efficient gossip and robust distributed computation
In: Theoretical Computer Science [347], 130-166 | Journal Article | |
| | 2003 | [Georgiou, Chryssis]
Kowalski, Dariusz
[Shvartsman, Alexander] | | Efficient Gossip and Robust Distributed Computation
In: Distributed Computing, 17th International Conference (DISC 2003), 224-238 | Proceedings Article | |
| 1 |
| Gerdt, Vladimir (ed.) |
| |
| | 2009 | Kerber, Michael | | On the Complexity of Reliable Root Approximation
In: Computer Algebra in Scientific Computing : 11th International Workshop, CASC 2009, 155-167 | Proceedings Article | |
| 4 |
| Gergov, Jordan |
| |
| | 2000 | Gergov, Jordan | | Algorithms for Interval Coloring, Geometric Packing and Memory Optimization
Universität des Saarlandes | Thesis - PhD thesis | |
| | 1996 | Gergov, Jordan | | Approximation Algorithms for Dynamic Storage Allocation
In: Algorithms - ESA '96: 4th Annual European Symposium, 52-61 | Proceedings Article | |
| | 1996 | Gergov, Jordan
[Meinel, Christoph] | | Mod-2-OBDDs - a Date Structure that generalizes EXOR-Sum-of-Products and Ordered Binary Decision Diagrams
In: Formal Methods in System Design [8], 273-282 | Journal Article | |
| | 1995 | [Dedorath, Jürgen]
Gergov, Jordan
Hagerup, Torben | | More Efficient Parallel Flow Algorithms
In: Algorithms and Computation: 6th International Symposium (ISAAC95), 234-243 | Proceedings Article | |
| 1 |
| |
| | 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 | |
| 1 |
| |
| | 2013 | [Fanghänel, Alexander]
[Geulen, Sascha]
Hoefer, Martin
[Vöcking, Berthold] | | Online Capacity Maximization in Wireless Networks
In: Journal of Scheduling [16], 81-91 | Journal Article | |
| 1 |
| |
| | 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 | |
| 2 |
| |
| | 2012 | [Giakkoupis, George]
Sauerwald, Thomas
Sun, He
[Woelfel, Philipp] | | Low Randomness Rumor Spreading via Hashing
In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, 314-325 | Electronic Proceedings Article | |
| | 2012 | [Giakkoupis, George]
Sauerwald, Thomas | | Rumor spreading and vertex expansion
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 1623-1641 | Proceedings Article | |
| 2 |
| Giannopoulos, Panos |
| |
| | 2012 | [Giannopoulos, Panos]
[Knauer, Christian]
Wahlström, Magnus
[Werner, Daniel] | | Hardness of discrepancy computation and ε-net verification in high dimension
In: Journal of Complexity [28], 162-176 | Journal Article | |
| | 2010 | [Giannopoulos, Panos]
[Klein, Rolf]
Kutz, Martin
[Marx, Daniel] | | Computing geometric minimum-dilation graphs is NP-hard
In: International Journal of Computational Geometry & Applications [20], 147-173 | Journal Article | |
| 2 |
| Gibbons, Phillip B. (ed.) |
| |
| | 2007 | Ajwani, Deepak
Elbassioni, Khaled
Govindarajan, Sathish
[Ray, Saurabh] | | Conflict-free coloring for rectangle ranges using $n^.382$ colors
In: SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallel Algorithms and Architectures, 181-187 | Proceedings Article | |
| | 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 | |
| 5 |
| Gidenstam, Anders |
| |
| | 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 | |
| 10 |
| Giesen, Joachim |
| |
| | 2009 | [Giesen, Joachim]
Manjunath, Madhusudan | | Minimizing Absolute Gaussian Curvature over Meshes
In: Computational Geometry, 1-16 | Electronic Proceedings Article | |
| | 2008 | Giesen, Joachim | | Conjoint Analysis for Measuring the Perceived Quality in Volume Rendering
In: IEEE Transactions on Visualization and Computer Graphics [13], 1664-1671 | Journal Article | |
| | 2008 | Giesen, Joachim | | Delaunay Triangulation Approximates Anchor Hull
In: Computational Geometry - Theory and Applications [36], 131-143 | Journal Article | |
| | 2008 | Giesen, Joachim | | The Flow Complex: A Data Structure for Geometric Modeling
In: Computational Geometry - Theory and Applications [39], 178-190 | Journal Article | |
| | 2008 | [Eigensatz, Michael]
[Giesen, Joachim]
Manjunath, Madhusudan | | The Solution Path of the Slab Support Vector Machine
In: The 20th Canadian Conference on Computational Geometry, 211-214 | Proceedings Article | |
| | 2007 | Giesen, Joachim
[Mitsche, Dieter]
[Schuberth, Eva] | | Collaborative Ranking: an aggregation algorithm for individuals' preference estimation
In: Algorithmic Aspects in Information and Management : Third International Conference, AAIM 2007, 58-67 | Proceedings Article | |
| | 2007 | Giesen, Joachim
[Schuberth, Eva]
[Simon, Klaus]
[Zolliker, Peter]
[Zweifel, Oliver] | | Image-Dependent Gamut Mapping as Optimization Problem
In: IEEE Transactions on Image Processing [16], 2401-2410 | Journal Article | |
| | 2007 | Giesen, Joachim | | Medial Axis Approximation from Inner Voronoi Balls: A Demo of the Mesecina Tool
In: 23d Annual ACM Symposium on Computational Geometry, 123-124 | Proceedings Article | |
| | 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 | |
| | 2007 | Giesen, Joachim | | The Combinatorial Structure of Polyhedral Choice Based Conjoint Analysis
In: Conjoint Measurement: Methods and Applications, 259-271 | Part of a Book | |
| 3 |
| |
| | 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 | |
| | 2000 | [Fabri, Andreas]
[Giezeman, Geert-Jan]
[Kettner, Lutz]
Schirra, Stefan
[Schönherr, Sven] | | On the Design of CGAL, a computational geometry algorithms library
In: Software - Practice and Experience [30], 1167-1202 | Journal Article | |
| | 1996 | [Fabri, Andreas]
[Giezeman, Geert-Jan]
[Kettner, Lutz]
Schirra, Stefan
[Schönherr, Sven] | | The CGAL Kernel: A Basis for Geometric Computation
In: Applied Computational Geometry: Towards Geometric Engineering Proceedings (WACG'96), 191-202 | Proceedings Article | |
| 11 |
| |
| | 2013 | Doerr, Carola
[Gnewuch, Michael]
Wahlström, Magnus | | Calculation of Discrepancy Measures and Applications
In: A Panorama of Discrepancy Theory, 1-55 | Part of a Book | |
| | 2012 | [Gnewuch, Michael]
Wahlström, Magnus
Winzen, Carola | | A New Randomized Algorithm to Approximate the Star Discrepancy Based on Threshold Accepting
In: SIAM Journal on Numerical Analysis [50], 781-807 | Journal Article | |
| | 2010 | Doerr, Benjamin
[Gnewuch, Michael]
Wahlström, Magnus | | Algorithmic construction of low-discrepancy point sets via dependent randomized rounding
In: Journal of Complexity [26], 490-507 | Journal Article | |
| | 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 | |
| | 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 | |
| | 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 | |
| | 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 | |
| | 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 | |
| | 2006 | Doerr, Benjamin
[Gnewuch, Michael] | | Construction of low-discrepancy point sets of small size by bracketing covers and dependent randomized rounding | Report | |
| | 2006 | Doerr, Benjamin
[Gnewuch, Michael]
Hebbinghaus, Nils | | Discrepancy of Symmetric Products of Hypergraphs
In: The Electronic Journal of Combinatorics [13], 1-12 | Electronic Journal Article | |
| | 2005 | Doerr, Benjamin
[Gnewuch, Michael]
[Srivastav, Anand] | | Bounds and Constructions for the Star-Discrepancy via Delta-Covers
In: Journal of Complexity [21], 691-709 | Journal Article | |
| 2 |
| |
| | 2004 | [Goemans, Michel X.]
Skutella, Martin | | Cooperative facility location games
In: Journal of Algorithms [50], 194-214 | Journal Article | |
| | 1999 | [Dinitz, Yefim]
Garg, Naveen
[Goemans, Michel X.] | | On the single-source unsplittable flow problem
In: Combinatorica [19], 17-41 | Journal Article | |
| 1 |
| Goemans, Michel (ed.) |
| |
| | 2013 | [Sviridenko, Maxim]
Wiese, Andreas | | Approximating the Configuration-LP for Minimizing Weighted Sum of Completion Times on Unrelated Machines
In: Proceedings of the 16th Conference on Integer Programming and Combinatorial Optimization (IPCO 2013), | Proceedings Article | |
| 1 |
| Goesele, Michael |
| |
| | 2002 | Goesele, Michael
Kautz, Jan
Lang, Jochen
Lensch, Hendrik P. A.
Seidel, Hans-Peter | | 7th ACM Symposium on Solid Modeling and Applications; Tutorial T1: Geometric Algorithms for Planning and Simulation Tasks in Virtual Prototyping | Proceedings | |
| 2 |
| Goldberg, Andrew V. (ed.) |
| |
| | 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 | |
| | 2009 | Bast, Holger
Funke, Stefan
Matijevic, Domagoj | | Ultrafast shortest-path queries via transit nodes
In: The shortest path problem : ninth DIMACS implemenation challenge, 175-192 | Part of a Book | |
| 1 |
| |
| | 2006 | Bast, Holger
Funke, Stefan
Matijevic, Domagoj | | TRANSIT: Ultrafast Shortest-Path Queries with Linear-Time Preprocessing
In: 9th DIMACS Implementation Challenge --- Shortest Path, | Electronic Proceedings Article | |
| 6 |
| |
| | 2013 | Doerr, Benjamin
[Goldberg, Leslie Ann] | | Adaptive Drift Analysis
In: Algorithmica [65], 224-250 | Journal Article | |
| | 2011 | Doerr, Benjamin
[Goldberg, Leslie Ann]
[Minder, Lorenz]
Sauerwald, Thomas
[Scheideler, Christian] | | Stabilizing consensus with the power of two choices
In: 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA-11), 149-158 | Proceedings Article | |
| | 2010 | Doerr, Benjamin
[Goldberg, Leslie Ann] | | Adaptive Drift Analysis
In: Parallel Problem Solving from Nature -- PPSN XI. -- Pt. 1, 32-41 | Proceedings Article | |
| | 2010 | Doerr, Benjamin
[Goldberg, Leslie Ann]
[Minder, Lorenz]
[Sauerwald, Thomas]
[Scheideler, Christian] | | Brief Announcement: Stabilizing Consensus with the Power of Two Choices
In: Distributed Computing : 24th International Symposium, DISC 2010, 528-530 | Proceedings Article | |
| | 2010 | Doerr, Benjamin
[Goldberg, Leslie Ann] | | Drift Analysis with Tail Bounds
In: Parallel Problem Solving from Nature – PPSN XI. - Pt. 1, 174-183 | Proceedings Article | |
| | 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 | |
| 1 |
| Goldberg, Leslie Ann (ed.) |
| |
| | 2008 | Christodoulou, George
[Kovács, Annamária]
[Schapira, Michael] | | Bayesian Combinatorial Auctions
In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I, 820-832 | Proceedings Article | |
| 1 |
| Goldberg, Paul W. (ed.) |
| |
| | 2012 | [Chen, Xujin]
Doerr, Benjamin
[Hu, Xiaodong]
[Ma, Weidong]
van Stee, Rob
Winzen, Carola | | The Price of Anarchy for Selfish Ring Routing is Two
In: Internet and Network Economics : 8th International Workshop, WINE 2012, 420-433 | Proceedings Article | |
| 2 |
| Goles, Eric (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 | |
| 7 |
| |
| | 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 | |
| | 2002 | Bradford, Phillip Gnassi
[Golin, Mordecai J.]
[Larmore, Lawrence L.] | | Optimal prefix-free codes for unequal letter costs: Dynamic programming with the Monge property
In: Journal of Algorithms [42], 277-303 | Journal Article | |
| | 1999 | Arya, Sunil
Golin, Mordecai J.
Mehlhorn, Kurt | | On the Expected Depth of Random Circuits
In: Combinatorics, Probability and Computing [8], 209-228 | Journal 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 | [Golin, Mordecai J.]
[Raman, Rajeev]
Schwarz, Christian
Smid, Michiel | | Randomized Data Structures for the Dynamic Closest-Pair Problem
In: SIAM Journal on Computing [27], 1036-1072 | Journal Article | |
| | 1996 | [Devillers, Olivier]
[Golin, Mordecai J.]
[Kedem, Klara]
Schirra, Stefan | | Queries on Voronoi Diagrams of Moving Points
In: Computational Geometry. Theory and Applications [5], 315-327 | Journal Article | |
| | 1995 | Golin, Mordecai J.
[Raman, Rajeev]
Schwarz, Christian
Smid, Michiel | | Simple randomized algorithms for closest pair problems
In: Nordic Journal of Computing [2], 3-27 | Journal Article | |
| 1 |
| |
| | 2006 | [Golumbic, Martin Charles]
[Mintz, Aviad]
[Rotics, Udi] | | Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial k-trees
In: Discrete Applied Mathematics [154], 1465-1477 | Journal Article | |
| 1 |
| Golumbic, Martin Charles (ed.) |
| |
| | 2012 | Hermelin, Danny
[Mestre, Julian]
[Rawitz, Dror] | | Optimization Problems in Dotted Interval Graphs
In: Graph-Theoretic Concepts in Computer Science : 38th InternationalWorkshop, WG 2012, 46-56 | Proceedings Article | |
| 1 |
| |
| | 1982 | Eisenbarth, Bernhard
Ziviani, Nivio
Gonnet, Gaston H.
Mehlhorn, Kurt
Wood, Derick | | The Theory of Fringe Analysis and Its Application to 2-3 Trees and B-Trees
In: Information and Control [55], 125-174 | Journal Article | |
| 1 |
| González-Caro, Cristina N. (ed.) |
| |
| | 2012 | Gawrychowski, Pawel | | Faster Algorithm for Computing the Edit Distance between SLP-Compressed Strings
In: String Processing and Information Retrieval : 19th International Symposium, SPIRE 2012, 229-236 | Proceedings Article | |
| 1 |
| |
| | 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 | |
| 6 |
| |
| | 2001 | Ramos, Edgar A.
[Amato, Nancy M.]
[Goodrich, Michael T.] | | A Randomized Algorithm for Triangulating a Simple Polygon in Linear Time
In: Discrete and Computational Geometry [26], 246-265 | Journal Article | |
| | 2000 | Ramos, Edgar A.
[Amato, Nancy M.]
[Goodrich, Michael T.] | | Computing the arrangement of curve segments: Divide-and-conquer algorithms via sampling
In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-00), 705-706 | Proceedings Article | |
| | 2000 | [Amato, Nancy M.]
[Goodrich, Michael T.]
Ramos, Edgar A. | | Linear-Time Triangulation of a Simple Polygon Made Easier Via Randomization
In: Proceedings of the 16th Annual Symposium on Computational Geometry (SCG-00), 201-212 | Proceedings Article | |
| | 1997 | [Goodrich, Michael T.]
Ramos, Edgar A. | | Bounded-independence derandomization of geometric partitioning with applications to parallel fixed-dimensional linear programming
In: Discrete and Computational Geometry [18], 397-420 | Journal Article | |
| | 1997 | [Duncan, C.A.]
[Goodrich, Michael T.]
Ramos, Edgar A. | | Efficient approximation and optimization algorithms for computational metrology
In: Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-97), 121-130 | Proceedings Article | |
| | 1995 | [Chian, Yi-Feng]
[Goodrich, Michael T.]
Grove, Edward
[Tamassia, Roberto]
[Vengroff, Darren Erik]
[Vitter, Jeffrey Scott] | | External-Memory Graph Algorithms
In: 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA95), 139-149 | Proceedings Article | |
| 3 |
| Goodrich, Michael T. (ed.) |
| |
| | 2000 | Ramos, Edgar A.
[Amato, Nancy M.]
[Goodrich, Michael T.] | | Computing the arrangement of curve segments: Divide-and-conquer algorithms via sampling
In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-00), 705-706 | Proceedings Article | |
| | 1999 | Schirra, Stefan | | A Case Study on the Cost of Geometric Computing
In: Selected papers of the International Workshop on Algorithm Engineering and Experimentation (ALENEX-99), 156-176 | Proceedings Article | |
| | 1999 | Sanders, Peter | | Fast Priority Queues for Cached Memory
In: Selected papers of the International Workshop on Algorithm Engineering and Experimentation (ALENEX-99), 312-327 | Proceedings Article | |
| 1 |
| Gopalakrishnan, Ganesh (ed.) |
| |
| | 2011 | [Alkassar, Eyad]
[Böhme, Sascha]
Mehlhorn, Kurt
Rizkallah, Christine | | Verification of Certifying Computations
In: Computer Aided Verification : 23rd International Conference, CAV 2011, 67-82 | Proceedings Article | |
| 2 |
| Gorlatch, Sergei (ed.) |
| |
| | 1997 | Chlebus, Bogdan S.
Czumaj, Artur
Sibeyn, Jop F. | | Routing on the PADAM: Degrees of Optimality
In: Proceedings of the 3rd International Euro-Par Conference on Parallel Processing (Euro-Par-97), 272-279 | Proceedings Article | |
| | 1997 | Sibeyn, Jop F. | | Sample Sort on Meshes
In: Proceedings of the 3rd International Euro-Par Conference on Parallel Processing (Euro-Par-97), 389-398 | Proceedings Article | |
| 2 |
| |
| | 1997 | Hagerup, Torben | | Dynamic algorithms for graphs of bounded treewidth
In: Proceedings of the 24th International Colloquium on Automata, Languages, and Programming (ICALP-97), 292-302 | 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 | |
| 1 |
| Götschel, Martin (ed.) |
| |
| | 2010 | Megow, Nicole | | Keller oder Dach zuerst
In: Besser als Mathe, 111-116 | Part of a Book | |
| 1 |
| Gotsman, Craig |
| |
| | 2007 | [Gotsman, Craig]
Kaligosi, Kanela
Mehlhorn, Kurt
Michail, Dimitrios
Pyrga, Evangelia | | Cycle Bases of Graphs and Sampled Manifolds
In: Computer Aided Geometric Design [24], 464 | Journal Article | |
| 1 |
| Gotthilf, Zvi |
| |
| | 2010 | [Gotthilf, Zvi]
[Hermelin, Danny]
[Landau, Gad M.]
[Lewenstein, Moshe] | | Restricted LCS
In: 17th International Symposium on String Processing and Information Retrieval, 250-257 | Proceedings Article | |
| 1 |
| Goumopoulos, Christos |
| |
| | 1998 | [Alefragis, Panayiotis]
[Goumopoulos, Christos]
Sanders, Peter
[Takkula, Tuomo]
[Wedelin, Dag] | | Parallel Crew Scheduling in PAROS
In: Proceedings of the 4th International Euro-Par Conference (Euro-Par-98), 1104-1113 | Proceedings Article | |
| 1 |
| Gourves, Laurent |
| |
| | 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 |
| Gouyou-Beauchamps, Dominique |
| |
| | 2002 | Banderier, Cyril
[Bousquet-Mélou, Mireille]
[Denise, Alain]
[Flajolet, Philippe]
[Gardy, Danièle]
[Gouyou-Beauchamps, Dominique] | | Generating Functions for Generating Trees
In: Discrete Mathematics [246], 29-55 | Journal Article | |
| 4 |
| Govindarajan, Sathish |
| |
| | 2012 | [Ajwani, Deepak]
Elbassioni, Khaled
[Govindarajan, Sathish]
Ray, Saurabh | | Conflict-free coloring for rectangle ranges using O(n .382) colors
In: Discrete & Computational Geometry [48], 39-52 | Journal Article | |
| | 2008 | Govindarajan, Sathish
[Dietze, Michael C.]
[Agarwal, Pankaj K.]
[Clark, James S.] | | A scalable algorithm for dispersing population
In: Journal of Intellingent Information Systems [29], 39-61 | Journal Article | |
| | 2007 | Ajwani, Deepak
Elbassioni, Khaled
Govindarajan, Sathish
[Ray, Saurabh] | | Conflict-free coloring for rectangle ranges using $n^.382$ colors
In: SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallel Algorithms and Architectures, 181-187 | Proceedings Article | |
| | 2007 | Ajwani, Deepak
Elbassioni, Khaled M.
Govindarajan, Sathish
[Ray, Saurabh] | | Conflict-Free Coloring for Rectangle Ranges Using $\tildeO(n^.382+\epsilon)$ Colors
In: 19th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 07), (to-appear) | Proceedings Article | |
| 1 |
| |
| | 2005 | Baswana, Surender
[Goyal, Vishrut]
[Sen, Sandeep] | | All-pairs nearly 2-approximate shortest paths in $O(n^2 \mathrm polylog n)$ time
In: STACS 2005 : 22nd Annual Symposium on Theoretical Aspects of Computer Science, 666-679 | Proceedings Article | |
| 2 |
| |
| | 1992 | Baumgarten, Hanna
Jung, Hermann
Mehlhorn, Kurt | | Dynamic Point Location in General Subdivisions
In: Discrete algorithms (SODA-92) : 3rd annual ACM-SIAM symposium, 250-258 | Proceedings Article | |
| | 1992 | Mehlhorn, Kurt
Sharir, Micha
Welzl, Emo | | Tail Estimates for the Space Complexity of Randomised Incremental Algorithms
In: Discrete algorithms (SODA-92) : 3rd annual ACM-SIAM symposium, 89-93 | Proceedings Article | |
| 1 |
| Grahl, Jörn (ed.) |
| |
| | 2009 | | | GECCO 2009: Proceedings of the 11th Annual conference on Genetic and evolutionary computation. | Proceedings | |
| 1 |
| Grammatikakis, M.D. |
| |
| | 1998 | Sibeyn, Jop F.
[Grammatikakis, M.D.]
[Hsu, D.F.]
[Kraetzl, M.] | | Packet Routing in Fixed-Connection Networks: A Survey
In: Journal of Parallel and Distributed Computing [54], 77-132 | Journal Article | |
| 2 |
| Granados, Miguel |
| |
| | 2003 | Granados, Miguel
Hachenberger, Peter
Hert, Susan
Kettner, Lutz
Mehlhorn, Kurt
Seel, Michael | | Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation | Report | |
| | 2003 | Granados, Miguel
Hachenberger, Peter
Hert, Susan
Kettner, Lutz
Mehlhorn, Kurt
Seel, Michael | | Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation
In: Algorithms - ESA 2003: 11th Annual European Symposium, 654-666 | Proceedings Article | |
| 1 |
| |
| | 2013 | [Anagnostopoulos, Aris]
[Grandoni, Fabrizio]
[Leonardi, Stefano]
Wiese, Andreas | | Constant Integrality Gap LP formulations of Unsplittable Flow on a Path
In: Proceedings of the 16th Conference on Integer Programming and Combinatorial Optimization (IPCO 2013), | Proceedings Article | |
| 2 |
| |
| | 2013 | Bringmann, Karl
[Green Larsen, Kasper] | | Succinct Sampling from Discrete Distributions
In: 45th ACM Symposium on Theory of Computing (STOC-13), 775-782 | Proceedings Article | |
| | 2012 | [Afshani, Peyman]
[Agrawal, Manindra]
Doerr, Benjamin
[Green Larsen, Kasper]
Mehlhorn, Kurt
Winzen, Carola | | The Query Complexity of Finding a Hidden Permutation
In: Electronic Colloquium on Computational Complexity (ECCC): Report Series [87 (Revision 1)], 1-36 | Electronic Journal Article | |
| 2 |
| Griebl, Martin (ed.) |
| |
| | 1997 | Chlebus, Bogdan S.
Czumaj, Artur
Sibeyn, Jop F. | | Routing on the PADAM: Degrees of Optimality
In: Proceedings of the 3rd International Euro-Par Conference on Parallel Processing (Euro-Par-97), 272-279 | Proceedings Article | |
| | 1997 | Sibeyn, Jop F. | | Sample Sort on Meshes
In: Proceedings of the 3rd International Euro-Par Conference on Parallel Processing (Euro-Par-97), 389-398 | Proceedings Article | |
| 3 |
| |
| | 2006 | [Grigoriev, Alexander]
[van Loon, Joyce]
Sitters, Rene
[Uetz, Marc] | | How to Sell a Graph: Guidelines for Graph Retailers
In: Graph-Theoretic Concepts in Computer Science : 32nd International Workshop, WG 2006, 125-136 | Proceedings Article | |
| | 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 | |
| | 2006 | [Feremans, Corinne]
[Grigoriev, Alexander]
Sitters, Rene | | The geometric generalized minimum spanning tree problem with grid clustering
In: 4OR: A Quarterly Journal of Operations Research [4], 319-329 | Journal Article | |
| 1 |
| |
| | 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 | |
| 1 |
| |
| | 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 |
| |
| | 2007 | Bast, Holger
Weber, Ingmar | | Managing Helpdesk Tasks with CompleteSearch: A Case Study
In: 4th Conference on Professional Knowledge Management (WM'07), 101-108 | Proceedings Article | |
| 1 |
| |
| | 2007 | [Bodirsky, Manuel]
[Gröpl, Clemens]
Johannsen, Daniel
[Kang, Mihyun] | | A Direct Decomposition of 3-connected Planar Graphs
In: Séminaire Lotharingien de Combinatoire [B54Ak], 15 | Journal Article | |
| 1 |
| |
| | 1998 | Ferragina, Paolo
[Gross, Roberto] | | Optimal On-Line Search and Sublinear Time Update in String Matching
In: SIAM Journal on Computing [27], 713-736 | Journal Article | |
| 1 |
| |
| | 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 | |
| 5 |
| |
| | 1995 | [Barve, Rakesh D.]
Grove, Edward
[Vitter, Jeffrey Scott] | | An Application-Controlled Paging Algorithm for a Shared Cache
In: 36th Annual Symposium on Foundations of Computer Science, 204-213 | Proceedings Article | |
| | 1995 | [Chian, Yi-Feng]
[Goodrich, Michael T.]
Grove, Edward
[Tamassia, Roberto]
[Vengroff, Darren Erik]
[Vitter, Jeffrey Scott] | | External-Memory Graph Algorithms
In: 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA95), 139-149 | Proceedings Article | |
| | 1995 | [Awerbuch, Baruch]
[Azar, Yossi]
Grove, Edward
[Kao, Ming-Yang]
Krishnan, P.
[Vitter, Jeffrey Scott] | | Load Balancing in the Euclidean Norm
In: 36th Annual Symposium on Foundations of Computer Science, 383-391 | Proceedings Article | |
| | 1995 | Grove, Edward | | On-line Bin Packing with Lookahead
In: 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA95), 430-436 | Proceedings Article | |
| | 1995 | Grove, Edward
[Kao, Ming-Yang]
[Krishnan, P.]
[Vitter, Jeffrey Scott] | | Online Perfect Matching and Mobile Computing
In: Algorithms and Data Structures: 4th International Workshop (WADS95), 194-205 | Proceedings Article | |
| 1 |
| |
| | 2009 | Emeliyanenko, Pavel | | Efficient Multiplication of Polynomials on Graphics Hardware
In: Advanced Parallel Processing Technologies : 8th International Symposium, APPT 2009, 134-149 | Proceedings Article | |
| 4 |
| |
| | 1998 | Crauser, Andreas
Mehlhorn, Kurt
Meyer, Ulrich
Sanders, Peter | | A Parallelization of Dijkstra's Shortest Path Algorithm
In: Proceedings of the 23rd International Symposium on the Mathematical Foundations of Computer Science (MFCS-98), 722-731 | 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 | |
| | 1986 | Alt, Helmut
Hagerup, Torben
Mehlhorn, Kurt
Preparata, Franco P. | | Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
In: Mathematical Foundations of Computer Science, 12th Symposium (MFCS 1986), 199-208 | Proceedings 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 | |
| 2 |
| Gudmundsson, Joachim (ed.) |
| |
| | 2008 | Dumitriu, Daniel
[Funke, Stefan]
[Kutz, Martin]
[Milosavljevic, Nikola] | | On the Locality of Extracting a 2-Manifold in $R^3$
In: 11th Scandinavian Workshop on Algorithm Theory (SWAT-2008), 270-281 | Proceedings Article | |
| | 2008 | Harren, Rolf
van Stee, Rob | | Packing Rectangles into 2 OPT Bins using Rotations
In: 11th Scandinavian Workshop on Algorithm Theory, 306-318 | Proceedings Article | |
| 1 |
| |
| | 2004 | Kesselman, Alexander
[Guez, Dan]
[Rosen, Adi] | | Packet-Mode Policies for Input-Queued Switches
In: Sixteenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-04), 93-102 | Proceedings Article | |
| 1 |
| |
| | 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 | |
| 2 |
| |
| | 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 | |
| | 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 |
| Guibas, L. |
| |
| | 1996 | [Alt, Helmut]
[Guibas, L.]
Mehlhorn, Kurt
[Karp, Richard M.]
[Wigderson, A.] | | A Method for Obtaining Randomized Algorithms with Small Tail Probabilities
In: Algorithmica [16], 543-547 | Journal Article | |
| | 1991 | Alt, Helmut
Guibas, L.
Mehlhorn, Kurt
Karp, Richard M.
Wigderson, A. | | A Method for Obtaining Randomized Algorithms with Small Tail Probabilities | Report | |
| 3 |
| |
| | 1999 | Sibeyn, Jop F.
[Guillaume, Frank]
[Seidel, Tillmann] | | Practical Parallel List Ranking
In: Journal of Parallel and Distributed Computing [56], 156-180 | Journal Article | |
| | 1997 | Sibeyn, Jop F.
[Guillaume, Frank]
[Seidel, Tillmann] | | Practical Parallel List Ranking
In: Proceedings of the 4th Symposium on Solving Irregularly Structured Problems in Parallel (IRREGULAR-97), 25-36 | Proceedings Article | |
| | 1997 | Guillaume, Frank | | Praktisches Paralleles Paralleles List Ranking
Universität des Saarlandes | Thesis - Masters thesis | |
| 3 |
| |
| | 1997 | Gunopulos, Dimitrios
Mannila, Heikki
Saluja, Sanjeev | | Discovering all most specific sentences by randomized algorithms
In: Proceedings of the 6th International Conference on Database Theory (ICDT-97), 215-229 | Proceedings Article | |
| | 1997 | [Das, Gautam]
Fleischer, Rudolf
Gasieniec, Leszek
Gunopulos, Dimitrios
Kärkkäinen, Juha | | Episode matching
In: Combinatorial pattern matching : 8th annual symposium (CPM-97), 12-27 | Proceedings Article | |
| | 1996 | [Dobkin, David P.]
Gunopulos, Dimitrios | | Geometric problems in machine learning
In: Applied Computational Geometry: Towards Geometric Engineering (FCRC96 Workshop, WACG96), 121-132 | Proceedings Article | |
| 1 |
| |
| | 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 | |
| 2 |
| |
| | 2013 | [Günther, Elisabeth]
[Maurer, Olaf]
Megow, Nicole
Wiese, Andreas | | A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio
In: 24st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013), | Proceedings Article | |
| | 2010 | [Günther, Elisabeth]
[König, Felix]
Megow, Nicole | | Scheduling and Packing Malleable Tasks with Precedence Constraints of Bounded Width
In: Approximation and Online Algorithms : 7th International Workshop, WAOA 2009, 170-181 | Proceedings Article | |
| 1 |
| Guo, Qi |
| |
| | 2001 | [Beldiceanu, Nicolas]
[Guo, Qi]
Thiel, Sven | | Non-overlapping Constraints between Convex Polytopes
In: Proceedings of the 7th International Symposium on Principles and Practice of Constraint Programming (CP-01), 392-407 | Proceedings Article | |
| 2 |
| Guo, Zeyu |
| |
| | 2011 | [Guo, Zeyu]
Sun, He
[Zhu, Hong] | | Greedy Construction of 2-Approximate Minimum Manhattan Networks
In: International Journal of Computational Geometry and Applications [21], 331-350 | Journal Article | |
| | 2011 | [Chin, Francis Y. L.]
[Guo, Zeyu]
Sun, He | | Minimum Manhattan Network is NP-Complete
In: Discrete & Computational Geometry [45], 701-722 | Journal Article | |
| 3 |
| |
| | 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 | |
| | 2009 | Chan, T-H. Hubert
[Dhamdhere, Kedar]
[Gupta, Anupam]
[Kleinberg, Jon]
[Slivkins, Aleksandrs] | | Metric Embeddings with Relaxed Guarantees
In: SIAM Journal on Computing [38], 2303-2329 | Journal Article | |
| | 2009 | Chan, T.-H. Hubert
[Gupta, Anupam] | | Small Hop-diameter Sparse Spanners for Doubling Metrics
In: Discrete and Computational Geometry [41], 28-44 | Journal Article | |
| 1 |
| |
| | 2012 | [Epstein, Leah]
[Jez, Lukasz]
[Sgall, Jiri]
van Stee, Rob | | Online Scheduling of Jobs with Fixed Start Times on Related Machines
In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 15th International Workshop, APPROX 2012 and 16th International Workshop, RANDOM 2012, 134-145 | Proceedings Article | |
| 2 |
| |
| | 1997 | Gupta, Arvind
[Mahajan, Sanjeev] | | Using amplification to compute majority with small majority gates
In: Computational Complexity [6], 46-63 | Journal Article | |
| | 1996 | [Gupta, Arvind]
[Kaller, Damon]
[Mahajan, Sanjeev]
[Shermer, Thomas C.] | | Vertex partitioning problems on partial k-trees
In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, 161-172 | Proceedings Article | |
| 1 |
| Gupta, Divya |
| |
| | 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 | |
| 8 |
| Gupta, Prosenjit |
| |
| | 1999 | Gupta, Prosenjit
[Janardan, Ravi]
Smid, Michiel | | Efficient algorithms for counting and reporting pairwise intersections between convex polygons
In: Information Processing Letters [69], 7-13 | Journal Article | |
| | 1997 | Gupta, Prosenjit
[Janardan, Ravi]
Smid, Michiel
[Dasgupta, Bhaskar] | | The rectangle enclosure and point-dominance problems revisited
In: International Journal of Computational Geometry and Applications [7], 437-456 | Journal Article | |
| | 1996 | Gupta, Prosenjit
[Janardan, Ravi]
Smid, Michiel | | Algorithms for generalized halfspace range searching and other intersection searching problems
In: Computational Geometry [5], 321-340 | Journal Article | |
| | 1996 | Gupta, Prosenjit
[Janardan, Ravi]
Smid, Michiel | | Algorithms for generalized halfspace range searching and other intersection searching problems
In: Computational Geometry [6], 1-19 | Journal Article | |
| | 1996 | Gupta, Prosenjit
[Janardan, Ravi]
Smid, Michiel | | Fast algorithms for collision and proximity problems involving moving geometric objects
In: Computational Geometry [6], 371-391 | Journal Article | |
| | 1995 | Gupta, Prosenjit
[Janardan, Ravi]
Smid, Michiel | | Further results on generalized intersection searching problems:
counting, reporting, and dynamization
In: Journal of Algorithms [19], 282-317 | Journal Article | |
| | 1995 | Gupta, Prosenjit
[Janardan, Ravi]
Smid, Michiel
[Dasgupta, Bhaskar] | | The rectangle enclosure and point-dominance problems revisited
In: 11th Annual ACM Symposium on Computing Geometry, 162-171 | Proceedings Article | |
| | 1995 | Gupta, Prosenjit
[Janardan, Ravi]
Smid, Michiel | | The rectangle enclosure and point-dominance problems revisited
In: 11th Annual !CM Symposium on Computational Geometry, 162-171 | Proceedings Article | |
| 1 |
| |
| | 2001 | Meyer, Ulrich | | Heaps are better than Buckets: Parallel Shortest Paths on Unbalanced Graphs
In: Proceedings of the 7th International Euro-Par Conference on Parallel Processing (Euro-Par-01) :, 343-351 | Proceedings Article | |
| 45 |
| |
| | 2012 | [Boros, Endre]
Elbassioni, Khaled
[Gurvich, Vladimir]
[Makino, Kazuhisa] | | Every Stochastic Game with Perfect Information Admits a Canonical Form
In: 2nd International ICST Conference on Game Theory for Networks (GameNets 2011), | Unpublished/Draft | |
| | 2012 | [Boros, Endre]
Elbassioni, Khaled
[Gurvich, Vladimir]
[Makino, Kazuhisa] | | On Nash equilibria and improvement cycles in pure positional strategies for Chess-like and Backgammon-like n-person games
In: Discrete Mathematics [312], 772-788 | Journal Article | |
| | 2011 | [Boros, Endre]
Elbassioni, Khaled
[Gurvich, Vladimir]
[Makino, Kazuhisa] | | A lower bound for discounting algorithms solving two-person zero-sum limit average payoff stochastic games | Unpublished/Draft | |
| | 2011 | [Boros, Endre]
Elbassioni, Khaled
[Fouz, Mahmoud]
[Gurvich, Vladimir]
[Makino, Kazuhisa]
[Manthey, Bodo] | | Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 147-158 | Proceedings Article | |
| | 2011 | [Boros, Endre]
Elbassioni, Khaled
[Gurvich, Vladimir]
[Tiwary, Hans Raj] | | The negative cycles polyhedron and hardness of checking some polyhedral properties
In: Annals of Operations Research [188], 63-76 | Journal Article | |
| | 2010 | [Boros, Endre]
Elbassioni, Khaled
[Gurvich, Vladimir]
[Makino, Kazuhisa] | | A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information
In: Integer Programming and Combinatorial Optimization : 14th International Conference, IPCO 2010, 341-354 | Proceedings Article | |
| | 2010 | [Boros, Endre]
Elbassioni, Khaled
[Gurvich, Vladimir]
[Makino, Kazuhisa] | | On effectivity functions of game forms
In: Games and Economic Behavior [68], 512-531 | Journal Article | |
| | 2010 | [Boros, Endre]
Elbassioni, Khaled
[Gurvich, Vladimir]
[Makino, Kazuhisa] | | On Nash Equilibria and Improvement Cycles in Pure Positional Strategies for Chess-like and Backgammon-like $n$-person Games | Unpublished/Draft | |
| | 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 | |
| | 2008 | [Boros, Endre]
Elbassioni, Khaled
[Gurvich, Vladimir]
[Tiwary, Hans Raj] | | Characterization of the vertices and extreme directions of the negative cycle polyhedron and hardness of generating vertices of 0/1-polyhedra
In: CoRR [abs/0801.3790], x-x | Journal Article | |
| | 2008 | [Khachiyan, Leonid]
[Boros, Endre]
Elbassioni, Khaled
[Gurvich, Vladimir] | | Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions
In: Discrete Applied Mathematics [156], 2020-2034 | Journal Article | |
| | 2008 | [Khachiyan, Leonid]
[Boros, Endre]
[Borys, Konrad]
Elbassioni, Khaled
[Gurvich, Vladimir] | | Generating All Vertices of a Polyhedron Is Hard
In: Discrete & Computational Geometry [39], 174-190 | Journal Article | |
| | 2008 | [Khachiyan, Leonid]
[Boros, Endre]
[Borys, Konrad]
Elbassioni, Khaled
[Gurvich, Vladimir]
[Makino, Kazuhisa] | | Generating Cut Conjunctions in Graphs and Related Problems
In: Algorithmica [51], 239-263 | Journal Article | |
| | 2008 | [Khachiyan, Leonid]
[Boros, Endre]
Elbassioni, Khaled
[Gurvich, Vladimir] | | On Enumerating Minimal Dicuts and Strongly Connected Subgraphs
In: Algorithmica [50], 159-172 | Journal Article | |
| | 2008 | [Khachiyan, Leonid]
[Boros, Endre]
[Borys, Konrad]
Elbassioni, Khaled
[Gurvich, Vladimir]
[Rudolf, Gabor]
[Zhao, Jihui] | | On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction
In: Theory Comput. Syst. [43], 204-233 | Journal Article | |
| | 2007 | [Khachiyan, Leonid]
[Boros, Endre]
Elbassioni, Khaled
[Gurvich, Vladimir] | | A global parallel algorithm for the hypergraph transversal problem
In: Information Processing Letters [101], 148-155 | Journal Article | |
| | 2007 | [Khachiyan, Leonid]
[Boros, Endre]
Elbassioni, Khaled
[Gurvich, Vladimir]
[Makino, Kazuhisa] | | Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data
In: Theoretical Computer Science [379], 361-376 | Journal Article | |
| | 2007 | [Khachiyan, Leonid]
[Boros, Endre]
Elbassioni, Khaled
[Gurvich, Vladimir]
[Makino, Kazuhisa] | | Enumerating disjunctions and conjunctions of paths and cuts in reliability theory
In: Discrete Applied Mathematics [155], 137-149 | Journal Article | |
| | 2007 | [Boros, Endre]
[Borys, Konrad]
Elbassioni, Khaled
[Gurvich, Vladimir]
[Makino, Kazuhisa]
[Rudolf, Gabor] | | Generating Minimal k-Vertex Connected Spanning Subgraphs
In: Computing and Combinatorics, 13th Annual International Conference, COCOON 2007, Proceedings, 222-231 | Proceedings Article | |
| | 2007 | [Boros, Endre]
Elbassioni, Khaled M.
[Gurvich, Vladimir]
[Makino, Kazuhisa] | | Generating Vertices of Polyhedra and Related Monotone Generation Problems | Unpublished/Draft | |
| | 2007 | [Khachiyan, Leonid]
[Boros, Endre]
Elbassioni, Khaled
[Gurvich, Vladimir] | | On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs
In: Theoretical Computer Science [382], 139-150 | Journal Article | |
| | 2006 | [Khachiyan, Leonid]
[Boros, Endre]
[Borys, Konrad]
Elbassioni, Khaled M.
[Gurvich, Vladimir]
[Makino, Kazuhisa] | | Enumerating Spanning and Connected Subsets in Graphs and Matroids
In: Algorithms - ESA 2006, 14th Annual European Symposium, 444-455 | Proceedings Article | |
| | 2006 | [Khachiyan, Leonid]
[Boros, Endre]
[Borys, Konrad]
Elbassioni, Khaled M.
[Gurvich, Vladimir] | | Generating All Vertices of a Polyhedron is Hard
In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'06, 758-765 | Proceedings Article | |
| | 2005 | [Khachiyan, Leonid]
[Boros, Endre]
Elbassioni, Khaled M.
[Gurvich, Vladimir] | | A New Algorithm for the Hypergraph Transversal Problem
In: Computing and combinatorics : 11th Annual International Conference, COCOON 2005, 767-776 | Proceedings Article | |
| | 2005 | [Khachiyan, Leonid]
[Boros, Endre]
Elbassioni, Khaled M.
[Gurvich, Vladimir] | | Generating All Minimal Integral Solutions to Monotone $\wedge,\vee$-Systems of Linear, Transversal and Polymatroid Inequalities
In: Mathematical Foundations of Computer Science 2005 : 30th International Symposium, MFCS 2005, 556-567 | Proceedings Article | |
| | 2005 | [Khachiyan, Leonid]
[Boros, Endre]
[Borys, Konrad]
Elbassioni, Khaled M.
[Gurvich, Vladimir] | | Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs
In: Algorithms and computation : 16th International Symposium, ISAAC 2005, 156-165 | Proceedings Article | |
| | 2005 | [Khachiyan, Leonid]
[Boros, Endre]
Elbassioni, Khaled M.
[Gurvich, Vladimir]
[Makino, Kazuhisa] | | On the Complexity of Some Enumeration Problems for Matroids
In: SIAM Journal on Discrete Mathematics [19], 966-984 | Journal Article | |
| | 2004 | [Boros, Endre]
Elbassioni, Khaled M.
[Gurvich, Vladimir] | | Algorithms for Generating Minimal Blockers of Perfect Matchings in Bipartite Graphs and Related Problems
In: Algorithms – ESA 2004: 12th Annual European Symposium, 122-133 | Proceedings Article | |
| | 2004 | [Boros, Endre]
Elbassioni, Khaled M.
[Gurvich, Vladimir]
[Khachiyan, Leonid] | | An Efficient Implementation of a Joint Generation Algorithm
In: Experimental and efficient algorithms : Third International Workshop, WEA 2004, 114-128 | Proceedings Article | |
| | 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 | |
| | 2004 | [Boros, Endre]
Elbassioni, Khaled M.
[Gurvich, Vladimir]
[Khachiyan, Leonid] | | Generating Maximal Independent Sets for Hypergraphs with Bounded Edge-Intersections
In: LATIN 2004: Theoretical Informatics, 6th Latin American Symposium, 488-498 | Proceedings Article | |
| | 2004 | [Boros, Endre]
Elbassioni, Khaled M.
[Gurvich, Vladimir]
[Khachiyan, Leonid]
[Makino, Kazuhisa] | | Generating Paths and Cuts in Multi-pole (Di)graphs
In: Mathematical foundations of computer science 2004 : 29th International Symposium, MFCS 2004, 298-309 | Proceedings Article | |
| | 2003 | [Boros, Endre]
Elbassioni, Khaled M.
[Gurvich, Vladimir]
[Khachiyan, Leonid] | | Algorithms for Enumerating Circuits in Matroids.
In: Algorithms and Computation, 14th International Symposium, ISAAC 2003, 485-494 | Proceedings Article | |
| | 2003 | [Boros, Endre]
Elbassioni, Khaled M.
[Khachiyan, Leonid]
[Gurvich, Vladimir] | | An Efficient Implementation of a Quasi-polynomial Algorithm for Generating Hypergraph Transversals
In: Algorithms - ESA 2003, 11th Annual European Symposium, 556-567 | Proceedings Article | |
| | 2003 | [Boros, Endre]
Elbassioni, Khaled M.
[Khachiyan, Leonid]
[Gurvich, Vladimir] | | An Inequality for Polymatroid Functions and its Applications
In: Discrete Applied mathematics [131], 27 | Journal Article | |
| | 2003 | [Boros, Endre]
Elbassioni, Khaled M.
[Gurvich, Vladimir]
[Khachiyan, Leonid]
[Makino, Kazuhisa] | | An Intersection Inequality for Discrete Distributions and Related Generation Problems
In: Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, 543-555 | Proceedings Article | |
| | 2003 | [Boros, Endre]
Elbassioni, Khaled M.
[Khachiyan, Leonid]
[Gurvich, Vladimir] | | Extending the Balas-Yu Bounds on the Number of Maximal Independent Sets in Graphs to Hypergraphs and Lattices
In: Mathematical Programming, Ser. B [98], 14 | Journal Article | |
| | 2002 | [Boros, Endre]
Elbassioni, Khaled M.
[Khachiyan, Leonid]
[Gurvich, Vladimir]
[Makino, Kazuhisa] | | Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities
In: SIAM Journal on Computing [31], 20 | Journal Article | |
| | 2002 | [Boros, Endre]
Elbassioni, Khaled M.
[Khachiyan, Leonid]
[Gurvich, Vladimir] | | Generating Dual-Bounded Hypergraphs
In: Optimization Methods and Software [17], 33 | Electronic Journal Article | |
| | | | | | | |
| | 2002 | [Boros, Endre]
Elbassioni, Khaled M.
[Khachiyan, Leonid]
[Gurvich, Vladimir] | | Matroid Intersections, Polymatroid Inequalities, and Related Problems
In: Mathematical Foundations of Computer Science 2002, 27th International Symposium, MFCS 2002, 143-154 | Proceedings Article | |
| | 2001 | [Boros, Endre]
Elbassioni, Khaled M.
[Khachiyan, Leonid]
[Gurvich, Vladimir]
[Makino, Kazuhisa] | | On Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities
In: Automata, Languages and Programming, 28th International Colloquium, ICALP 2001, 92-103 | Proceedings Article | |
| | 2000 | [Boros, Endre]
Elbassioni, Khaled M.
[Khachiyan, Leonid]
[Gurvich, Vladimir] | | An Efficient Incremental Algorithm for Generating All Maximal Independent Sets in Hypergraphs of Bounded Dimension
In: Parallel Processing Letters [10], 14 | Journal Article | |
| | 1991 | [Gurvich, Vladimir] | | Criteria for repetition-freeness of functions in the algebra of logic
In: Soviet Math. Dokl. [43], 721-726 | Journal Article | |
| | 1977 | [Gurvich, Vladimir] | | On repetition-free Boolean functions
In: Uspekhi Mat. Nauk. (Russian Math. Surveys) [32], 183-184 | Journal Article | |
| 1 |
| |
| | 2004 | El Kahoui, M'hammed | | Algorithms for recognizing coordinates in two variables over UFD's
In: Proceedings of the 2004 International Symposium Symbolic and Algebraic Computation (ISSAC-04), 135-140 | Proceedings Article | |
| 3 |
| |
| | 1980 | Güttler, Reiner
Mehlhorn, Kurt
Schneider, Wolfgang | | Binary Search Trees: Average and Worst Case Behavior
In: Elektronische Informationsverarbeitung und Kybernetik [16], 41-61 | Journal Article | |
| | 1976 | Güttler, Reiner
Mehlhorn, Kurt
Schneider, Wolfgang | | Binary Search Trees: Average and Worst Case Behavior | Report | |
| | 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 | |
| 4 |
| |
| | 1999 | Gutwenger, Carsten | | Design und Implementierung einer Algorithmen-Bibliothek zum Zeichnen von Graphen
Universität des Saarlandes | Thesis - Masters thesis | |
| | 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 | 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 | |
| | 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 | |
| 4 |
| Győri, Ervin (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 | |
| 5 |
| |
| | 2004 | Bast, Holger
Mehlhorn, Kurt
Schäfer, Guido
[Tamaki, Hisao] | | Matching Algorithms Are Fast in Sparse Random Graphs
In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), 81-92 | 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 | |
| | 2004 | Kovács, Annamária | | Sum-Multicoloring on Paths
In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), 68-80 | Proceedings Article | |
| | 2004 | Schäfer, Guido
Sivadasan, Naveen | | Topology matters: Smoothed competitiveness of metrical task systems
In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), 489-500 | Proceedings 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 | |
| 6 |
| |
| | 2007 | Hachenberger, Peter
Kettner, Lutz
Mehlhorn, Kurt | | Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, Optimized Implementation and Experiments
In: Computational Geometry: Theory and Applications [38], 64-99 | Journal Article | |
| | 2006 | Hachenberger, Peter | | Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms Optimized Implementation, Experiments and Applications
Universität des Saarlandes | Thesis - PhD thesis | |
| | 2005 | Hachenberger, Peter
Kettner, Lutz | | Boolean Operations on 3D Selective Nef Complexes: Optimized Implementation and Experiments
In: ACM Symposium on Solid and Physical Modeling (SPM 2005), 163-174 | Proceedings Article | |
| | 2003 | Granados, Miguel
Hachenberger, Peter
Hert, Susan
Kettner, Lutz
Mehlhorn, Kurt
Seel, Michael | | Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation | Report | |
| | 2003 | Granados, Miguel
Hachenberger, Peter
Hert, Susan
Kettner, Lutz
Mehlhorn, Kurt
Seel, Michael | | Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation
In: Algorithms - ESA 2003: 11th Annual European Symposium, 654-666 | Proceedings Article | |
| | 1999 | Hachenberger, Peter | | Dynamic shortest Path Algorithms for Planar and Outerplanar Graphs
Universität des Saarlandes | Thesis - Masters thesis | |
| 2 |
| Hagedoorn, Michiel |
| |
| | 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 | |
| | 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 | |
| 2 |
| |
| | 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 | |
| | 2008 | Elbassioni, Khaled
[Hagen, Matthias]
Rauf, Imran | | Some Fixed-Parameter Tractable Classes of Hypergraph Duality and Related Problems
In: Parameterized and Exact Computation, Third International Workshop, IWPEC 2008, 91-102 | Proceedings Article | |
| 37 |
| Hagerup, Torben |
| |
| | 2002 | [Agarwal, Pankaj]
[Hagerup, Torben]
Ray, Rahul
[Sharir, Micha]
[Smid, Michiel]
[Welzl, Emo] | | Translating a Planar Object to Maximize Point Containment
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 42-53 | Proceedings Article | |
| | 2000 | Hagerup, Torben | | Dynamic algorithms for graphs of bounded treewidth
In: Algorithmica [27], 292-315 | Journal Article | |
| | 2000 | Hagerup, Torben | | Parallel preprocessing for path queries without concurrent reading
In: Information and Computation [158], 18-28 | Journal Article | |
| | 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 | |
| | 1998 | Hagerup, Torben
Sanders, Peter
[Träff, Jesper Larsson] | | An Implementation of the Binary Blocking Flow Algorithm
In: Proceedings of the 2nd Workshop on Algorithm Engineering (WAE-98), 143-154 | Proceedings Article | |
| | 1998 | [Diks, Krzysztof]
Hagerup, Torben | | More general parallel tree contraction: Register allocation and broadcasting in a tree
In: Theoretical Computer Science [203], 3-29 | Journal Article | |
| | 1998 | [Bodlaender, Hans L.]
Hagerup, Torben | | Parallel Algorithms with Optimal Speedup for Bounded Treewidth
In: SIAM Journal on Computing [27], 1725-1746 | Journal Article | |
| | 1998 | Hagerup, Torben | | Simpler and Faster Dictionaries on the AC° RAM
In: Proceedings of the 25th International Colloquium on Automata, Languages and Programming (ICALP-98), 79-90 | 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 | |
| | 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 | |
| | 1997 | Hagerup, Torben | | Allocating Independent Tasks to Parallel Processors: An Experimental Study
In: Journal of Parallel and Distributed Computing [47], 185-197 | Journal Article | |
| | 1997 | Hagerup, Torben | | Dynamic algorithms for graphs of bounded treewidth
In: Proceedings of the 24th International Colloquium on Automata, Languages, and Programming (ICALP-97), 292-302 | Proceedings Article | |
| | 1997 | Hagerup, Torben
[Kutylowski, Miroslaw] | | Fast integer merging on the EREW PRAM
In: Algorithmica [17], 55-66 | Journal Article | |
| | 1997 | Albers, Susanne
Hagerup, Torben | | Improved Parallel Integer Sorting without Concurrent Writing
In: Information and Computation [136], 25-51 | Journal Article | |
| | 1996 | Hagerup, Torben | | Allocating Independent Tasks to Parallel Processors: An Experimental Study
In: Parallel Algorithms for Irregularly Structured Problems: 3rd International Workshop (IRREGULAR'96), 1-33 | Proceedings Article | |
| | 1996 | [Cheriyan, Joseph]
Hagerup, Torben
Mehlhorn, Kurt | | An o(n³)-Time Maximum-Flow-Algorithm: Can a Maximum Flow be Computed in o(nm) Time?
In: SIAM Journal on Computing [25], 1144-1170 | Journal Article | |
| | 1996 | [Diks, Krzysztof]
Hagerup, Torben | | More general parallel tree contraction: Register allocation and broadcasting in a tree
In: Graph-theoretic concepts in computer science (WG-96) : 22nd international workshop, Cadenabbia, Italy,Graph-theoretic concepts in computer science (WG-96) : 22nd international workshop, 126-140 | Proceedings Article | |
| | 1995 | Hagerup, Torben | | A Lower Bound for the Emulation of PRAM Memories on Processor Networks
In: Information and Computation [119], 124-128 | Journal Article | |
| | 1995 | [Cheriyan, Joseph]
Hagerup, Torben | | A Randomized Maximum-Flow Algorithm
In: SIAM Journal on Computing [24], 203-226 | Journal Article | |
| | 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 | |
| | 1995 | Hagerup, Torben | | Fast Deterministic Processor Allocation
In: Journal of Algorithms [18], 629-649 | Journal Article | |
| | 1995 | Hagerup, Torben
[Keller, Jörg] | | Fast Parallel Permutation Algorithms
In: Parallel Processing Letters [5], 139-148 | Journal Article | |
| | 1995 | Bast, Hannah
Hagerup, Torben | | Fast Parallel Space Allocation, Estimation, and Integer Sorting
In: Information and Computation [123], 72-110 | Journal Article | |
| | 1995 | [Dedorath, Jürgen]
Gergov, Jordan
Hagerup, Torben | | More Efficient Parallel Flow Algorithms
In: Algorithms and Computation: 6th International Symposium (ISAAC95), 234-243 | Proceedings Article | |
| | 1995 | [Bodlaender, Hans L.]
Hagerup, Torben | | Parallel Algorithms with Optimal Speedup for Bounded Treewidth
In: Automata, Languages, and Programming: 22nd International Colloquium (ICALP95), 268-279 | Proceedings Article | |
| | 1995 | Chaudhuri, Shiva
Hagerup, Torben | | Prefix Graphs and their Applications
In: Graph-theoretic Concepts in Computer Science: 20th International Workshop (WG94), 206-218 | Proceedings Article | |
| | 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 | |
