Max-Planck-Institut für Informatik
max planck institut
informatik
mpii logo Minerva of the Max Planck Society
 

MPI-INF D1 Publications

MPI-INF D1 Publications

Entries sorted by: 1. Author,Editor - 2. by Group - 4. with BibTeX cite keys

Login to this database


 

Previous Page | Next Page | Expand All | Collapse All | Search (Full Text)
Show entries starting with: A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

YearTitleBibTeX cite key
Hide details for Christodoulou, Ligett, PyrgaChristodoulou, Ligett, Pyrga
2010Contention Resolution under Selfishness
In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010. - Pt. II, 430-441
CPL2010
Hide details for Christodoulou, Mehlhorn, PyrgaChristodoulou, Mehlhorn, Pyrga
2011Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms
In: Algorithms - ESA 2011 : 19th Annual European Symposium, 119-130
Becker2011
Hide details for Christof, Jünger, Kececioglu, Mutzel, ReineltChristof, Jünger, Kececioglu, Mutzel, Reinelt
1997A Branch-And-Cut Approach to Physical Mapping of Chromosomes by Unique End-Probes
In: Journal of Computational Biology [4], 433-447
CJKMR97
1997A branch-and-cut approach to physical mapping with end-probes
In: Proceedings of the 1st Annual International Conference on Computational Molecular Biology (RECOMB-97), 84-92
Mutzel-et-al-97
Hide details for Chrobak, Dürr, Jawor, Kowalik, KurowskiChrobak, Dürr, Jawor, Kowalik, Kurowski
2006A Note on Scheduling Equal-Length Jobs to Maximize Throughput
In: Journal of Scheduling [9], 71-73
Kowalik2006
Hide details for Chrobak, Gasieniec, KowalskiChrobak, Gasieniec, Kowalski
2007The wake-up problem in multihop radio networks
In: SIAM Journal on Computing [36], 1453-1471
Chrobak2007
2004The Wake-Up problem in multi-hop radio networks
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 985-993
Kowalski-SODA-2004
Hide details for Cilleruelo, HebbinghausCilleruelo, Hebbinghaus
2009Discrepancy in generalized arithmetic progressions
In: European Journal of Combinatorics [30], 1607-1611
Cilleruelo2009
Hide details for ClangetClanget
1999Attachment IconPlattformunabhängiges Toolkit für Grafische Benutzerschnittstellen (GUI)
Universität des Saarlandes
Clanget1999
Hide details for Clarkson, Mehlhorn, SeidelClarkson, Mehlhorn, Seidel
1993Attachment IconFour Results on Randomized Incremental Constructions
In: Computational Geometry: Theory and Applications [3], 185-212
Mehlhorn1993h
1992Four Results on Randomized Incremental Constructions
In: Theoretical aspects of computer science (STACS-92) : 9th annual symposium, 463-474
Mehlhorn92f
Hide details for Clementi, Crescenzi, Doerr, Fraigniaud, Isopi, Panconesi, Pasquale, SilvestriClementi, Crescenzi, Doerr, Fraigniaud, Isopi, Panconesi, Pasquale, Silvestri
2013Rumor Spreading in Random Evolving Graphs
In: Proc. of the 21st European Symposium on Algorithms (ESA 2013), 325-336
Winzen2013z
Hide details for Clementi, Crescenzi, Doerr, Fraigniaud, Pasquale, SilvestriClementi, Crescenzi, Doerr, Fraigniaud, Pasquale, Silvestri
2013Diffusion probabiliste dans les reseaux dynamiques
In: Proc. of the 15èmes Rencontres Francophones pour les Aspects Algorithmiques des Télécommunications (AlgoTel 2013),
DynamicGraphRumor
Hide details for Cole, Farach-Colton, Hariharan, Przytycka, ThorupCole, Farach-Colton, Hariharan, Przytycka, Thorup
2000An O(n log n) algorithm for the maximum agreement subtree problem for binary trees
In: SIAM Journal on Computing [30], 1385-1404
ColeFarachetal2000
Hide details for Cole, HariharanCole, Hariharan
1996An O(n log n) algorithm for the maximum agreement subtree problem for binary trees
In: 7th ACM-SIAM Symposium on Discrete Algorithms (SODA96), 323-332
Cole-Hariharan96
Hide details for Cole, Hariharan, Paterson, ZwickCole, Hariharan, Paterson, Zwick
1995Tighter Lower Bounds on the Exact Complexity of String Matching
In: SIAM Journal on Computing [24], 30-45
Hariharan-et-al95
Hide details for Cole, KowalikCole, Kowalik
2008New Linear-Time Algorithms for Edge-Coloring Planar Graphs
In: Algorithmica [50], 351-368
KowalikEdgeColoring
Hide details for Cole, Kowalik, SkrekovskiCole, Kowalik, Skrekovski
2007A Generalization of Kotzig's Theorem and Its Application
In: SIAM Journal on Discrete Mathematics [21], 93-106
KowalikKotzig
Hide details for Cole, Ost, SchirraCole, Ost, Schirra
2001Edge-Coloring Bipartite Multigraphs in O(E log D) Time
In: Combinatorica [21], 5-12
Schirra2001EdgeColoring
Hide details for Comes, ZiegelmannComes, Ziegelmann
1999An Easy to Use Implementation of Linear Perturbations within CGAL
In: Algorithm engineering (WAE-99) : 3rd International Workshop, WAE'99, 169-182
Ziegelmann1999
Hide details for Cooley, Fountoulakis, Kühn, OsthusCooley, Fountoulakis, Kühn, Osthus
2009Embeddings and Ramsey numbers of sparse k-uniform hypergraphs
In: Combinatorica [29], 263-297
Fountoulakis2009
20083-Uniform hypergraphs of bounded degree have linear Ramsey numbers
In: Journal of Combinatorial Theory B [98], 484-505
Fountoulakis2008a
Hide details for Cooper, Doerr, Friedrich, SpencerCooper, Doerr, Friedrich, Spencer
2010Deterministic Random Walks on Regular Trees
In: Random Structures and Algorithms [37], 353-366
DCFS2010
2008Deterministic Random Walks on Regular Trees
In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, 766-772
Doerr2008-SODAb
2007Deterministic Random Walks on Regular Trees
In: Electronic Notes in Discrete Mathematics [29], 509-513
Doerr2007-ENDMa
Hide details for Cooper, Doerr, Spencer, TardosCooper, Doerr, Spencer, Tardos
2007Deterministic random walks on the integers
In: European Journal of Combinatorics [28], 2072-2090
CDoerrST2007
2006Deterministic Random Walks
In: Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments and the Third Workshop on Analytic Algorithmics and Combinatorics (ALENEX'06 / ANALCO'06), 185-197
DoerrANALCO06
2006Deterministic Random Walks on the Integers
In: ??? [?], 1-27
CDoerrSP2006
2005Deterministic 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
Doerr2005EurocombPropp
Hide details for Cooper, Frieze, Mehlhorn, PriebeCooper, Frieze, Mehlhorn, Priebe
2000Attachment IconAverage-Case Complexity of Shortest-Paths Problems in the Vertex-Potential Model
In: Random Structures & Algorithms [16], 33-46
CooperFriezeMehlhornPriebe00
1997Average-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
CooperFriezeMehlhornPriebe97
Hide details for Correa, Megow, Raman, SuchanCorrea, Megow, Raman, Suchan
2009Cardinality Constrained Graph Partitioning into Cliques with Submodular Costs
In: 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2009), 347-350
CorreaMRS2009
Hide details for CrauserCrauser
2001LEDA-SM:External Memory Algorithms and Data Structures in Theory and Practice
Universität des Saarlandes
Crauser2001
Hide details for Crauser, FerraginaCrauser, Ferragina
2002A theoretical and experimental study on the construction of suffix arrays in external memory
In: Algorithmica [32], 1-35
Crauser-Ferragina2001
1999On Constructing Suffix Arrays in External Memory
In: Proceedings of the 7th Annual European Symposium on Algorithms (ESA-99), 224-235
Crauser1999
Hide details for Crauser, Ferragina, Mehlhorn, Meyer, RamosCrauser, Ferragina, Mehlhorn, Meyer, Ramos
2001Randomized External-Memory Algorithms for Line Segment Intersection and Other Geometric Problems
In: International Journal of Computational Geometry & Applications [11], 305-337
CFMMR2001
1999I/O-optimal computation of segment intersections
In: Proceedings of the DIMACS Workshop on External Algorithms and Visualization, 131-138
CFMMR1999
1998Attachment IconRandomized External-Memory Algorithms for some Geometric Problems
In: Proceedings of the 14th International Annual ACM Symposium on Computational Geometry (SCG-98), 259-268
CFMMR98
Hide details for Crauser, MehlhornCrauser, Mehlhorn
1999Attachment IconLEDA-SM : Extending LEDA to Secondary Memory
In: Algorithm engineering (WAE-99) : 3rd International Workshop, WAE'99, 228-242
Crauser1999a
Hide details for Crauser, Mehlhorn, MeyerCrauser, Mehlhorn, Meyer
1997Kürzeste-Wege-Berechnung bei sehr großen Datenmengen
In: Promotion tut not: Innovationsmotor "Graduiertenkolleg", 113-132
CraMehMey97
Hide details for Crauser, Mehlhorn, Meyer, SandersCrauser, Mehlhorn, Meyer, Sanders
1998Attachment IconA 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
CMMS1998a
Hide details for Crauser, Meyer, BrengelCrauser, Meyer, Brengel
2001An experimental study of priority queues in external memory
In: Journal of Experimental Algorithmics [5], 24
Crauser2000
Hide details for Crochemore, Galil, Gasieniec, Park, RytterCrochemore, Galil, Gasieniec, Park, Rytter
1997Constant-time Randomized Parallel String Matching
In: SIAM Journal on Computing [26], 950-960
Crochemore-et-al.97
Hide details for Crochemore, Gasieniec, Hariharan, Muthukrishnan, RytterCrochemore, Gasieniec, Hariharan, Muthukrishnan, Rytter
1998A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern Matching
In: SIAM Journal on Computing [27], 668-681
CromemoreGasienicHariharanMuthukrishnanRytterSIAMJCOMPUT1998
Hide details for Crochemore, Gasieniec, RytterCrochemore, Gasieniec, Rytter
1998Constant-space string-matching in sublinear average time
In: Compression and Complexity of SEQUENCES 1997, 230-239
Crochemore-Gasieniec-Rytter97
Hide details for CroitoruCroitoru
2013Abstract Debates
In: IEEE International Conference on Tools with Artificial Intelligence (ICTAI) - 2013,
croi13
2012Algorithmic aspects of abstract argumentation frameworks
Universität des Saarlandes
CroitoruMaster2012
Hide details for Croitoru, KötzingCroitoru, Kötzing
2014A Normal Form for Argumentation Frameworks
In: Theory and Applications of Formal Argumentation (TAFA'13), 32-45
croikotzi13
2012Deliberative Acceptability of Arguments
In: STAIRS 2012 - Proceedings of the Sixth Starting AI Researchers' Symposium, 71-82
croikotzi12
Hide details for CsabaCsaba
2007On the Bollobas-Eidrigde conjecture for bipartite graphs
In: Combinatorics, Probability and Computing [16], 1-31
Csaba07
2003Proof of a conjecture of Bollobas and Eldridge for graphs of maximum degree three
In: Combinatorica [23], 35-72
Csaba2003a
Hide details for Csaba, Krysta, KarpinskiCsaba, Krysta, Karpinski
2002Approximability of Dense and Sparse Instances of Minimum 2-Connectivity, TSP and Path Problems
In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-02), 74-83
Krysta2002a
Hide details for Csaba, LodhaCsaba, Lodha
2006A randomized on-line algorithm for the k-server problem on the line
In: Random Structures and Algorithms [29], 82-104
Csaba06
2001A randomized on-line algorithm for the k-server problem on a lineCsaba2001
Hide details for Curticapean, KünnemannCurticapean, Künnemann
2013A Quantization Framework for Smoothed Analysis of Euclidean Optimization Problems
In: 21st Annual European Symposium on Algorithms (ESA 2013), 349-360
CurticapeanK2013
Hide details for Cygan, Dell, Lokshtanov, Marx, Nederlof, Okamoto, Paturi, Saurabh, WahlströmCygan, Dell, Lokshtanov, Marx, Nederlof, Okamoto, Paturi, Saurabh, Wahlström
2012On Problems as Hard as CNF-SAT
In: 2012 IEEE 27th Conference on Computational Complexity (CCC 2012), 74-84
DLMNOPSW2012
Hide details for Cygan, Kratsch, Pilipczuk, Pilipczuk, WahlströmCygan, Kratsch, Pilipczuk, Pilipczuk, Wahlström
2012Clique Cover and Graph Separation: New Incompressibility Results
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 254-265
CyganKratschPilipczukPilipczukWahlstroem2012
Hide details for Cygan, Philip, Pilipczuk, Pilipczuk, WojtaszczykCygan, Philip, Pilipczuk, Pilipczuk, Wojtaszczyk
2011Attachment IconDominating set is fixed parameter tractable in claw-free graphs
In: Theoretical Computer Science [412], 6982-7000
CyganPhilipPilipczukPilipczukWojtaszczyk2011
Hide details for Czumaj, Ferragina, Gasieniec, Muthukrishnan, TräffCzumaj, Ferragina, Gasieniec, Muthukrishnan, Träff
1997The Architecture of a Software Library for String Processing
In: Proceedings of the Workshop on Algorithm Engineering (WAE-97), 166-176
Traff97:string
Hide details for Czumaj, Krysta, VöckingCzumaj, Krysta, Vöcking
2002Selfish Traffic Allocation for Server Farms
In: Proceedings of the 34th ACM Symposium on Theory of Computing (STOC-02), 287-296
Krysta2002b
Hide details for Czumaj, VöckingCzumaj, Vöcking
2002Tight bounds for worst-case equilibria
In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-02), 413-420
CzumajBV02+
Hide details for Czyzowicz, Kowalski, Markou, PelcCzyzowicz, Kowalski, Markou, Pelc
2006Complexity of searching for a black holeCKMP-manus
2005Searching for a black hole in tree networks
In: Principles of distributed systems : 8th International Conference, OPODIS 2004, 67-80
CKMP-OPODIS
Hide details for Dams, Hoefer, KesselheimDams, Hoefer, Kesselheim
2013Sleeping Experts in Wireless Networks
In: 27th International Symposium on Distributed Computing (DISC-13), 344-357
DamsHK2013
Hide details for Das, Fleischer, Gasieniec, Gunopulos, KärkkäinenDas, Fleischer, Gasieniec, Gunopulos, Kärkkäinen
1997Episode matching
In: Combinatorial pattern matching : 8th annual symposium (CPM-97), 12-27
Das-et-al97
Hide details for Das, Kapoor, SmidDas, Kapoor, Smid
1997On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees
In: 16th Conference on Foundations of Software Technology and Theoretical Computer Science, 447-460
In: Algorithmica [19], 447-460
Das-Kapoor-Smid97
1996On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees
In: Foundations of software technology and theoretical computer science (FSTTCS-96) : 16th conference, 64-75
Das-Kapoor-Smid96
Hide details for Datta, Lenhof, Schwarz, SmidDatta, Lenhof, Schwarz, Smid
1995Static and dynamic algorithms for k-point clustering problems
In: Journal of Algorithms [19], 474-503
Lenhof-et-al95
Hide details for de Berg, Schirrade Berg, Schirra
2002Guest Editors' Foreword
In: Selected papers from the 16th Annual Symposium on Computational Geometry (SoCG-00), 1-2
deBergSchirraSoCG2002
Hide details for de Berg, Schirra (ed.)de Berg, Schirra (ed.)
2002Selected papers from the 16th Annual Symposium on Computational Geometry (SoCG-00)deBergSchirra2002
Hide details for de Berg, van Kreveld, Schirrade Berg, van Kreveld, Schirra
1998Topologically correct subdivision simplification using the bandwidth criterion
In: Cartography and Geographic Information Systems [25], 243-257
deBerg-vanKreveld-Schirra1998
Hide details for De Simone, Diehl, Jünger, Mutzel, Reinelt, RinaldiDe Simone, Diehl, Jünger, Mutzel, Reinelt, Rinaldi
1996Exact Ground States of Two-Dimensional +-J Ising Spin Glasses
In: Journal of Statistical Physics [84], 1363-1371
DDJMRR96
Hide details for De SterckDe Sterck
2012A Nonlinear GMRES Optimization Algorithm for Canonical Tensor Decomposition
In: SIAM Journal on Scientific Computing [34], A1351-A1379
DeSterckNGMRES
2012A Self-learning Algebraic Multigrid Method for Extremal Singular Triplets and Eigenpairs
In: SIAM Journal on Scientific Computing [34], A2092-A2117
DeSterckSVD
2012Steepest Descent Preconditioning for Nonlinear GMRES OptimizationDeSterckDescent
Hide details for De Sterck, Henson, SandersDe Sterck, Henson, Sanders
2011Multilevel Aggregation Methods for Small-World Graphs with Application to Random-Walk RankingDHS2011
Hide details for De Sterck, Miller, Sanders, WinlawDe Sterck, Miller, Sanders, Winlaw
2011Recursively accelerated multilevel aggregation for Markov chains
In: SIAM Journal on Scientific Computing [32], 1652-1671
DMSW2010
Hide details for Dedorath, Gergov, HagerupDedorath, Gergov, Hagerup
1995More Efficient Parallel Flow Algorithms
In: Algorithms and Computation: 6th International Symposium (ISAAC95), 234-243
Dedo-Gergov-Hagerup95
Hide details for DementievDementiev
2006Algorithm Engineering for Large Data Sets
Universität des Saarlandes
Diss06Dementiev
Hide details for Dementiev, Kärkkäinen, Mehnert, SandersDementiev, Kärkkäinen, Mehnert, Sanders
2005Attachment IconBetter External Memory Suffix Array Construction
In: Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics
(ALENEX/ANALCO 2005), 86-97
DKMS05
Hide details for Dementiev, Kettner, Mehnert, SandersDementiev, Kettner, Mehnert, Sanders
2004Engineering a Sorted List Data Structure for 32 Bit Key
In: Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics (ALENEX-04), 142-151
Dementiev2004SearchTree
Hide details for Dementiev, Kettner, SandersDementiev, Kettner, Sanders
2005STXXL: Standard Template Library for XXL Data SetsKettner2005StxxlReport
2005STXXL: Standard Template Library for XXL Data Sets
In: Algorithms - ESA 2005 : 13th Annual European Symposium (ESA 2005), 640-651
Kettner2005Stxxl
Hide details for Dementiev, SandersDementiev, Sanders
2003Asynchronous Parallel Disk Sorting
In: Proceedings of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA-03), 138-148
DemSan03
Hide details for Dementiev, Sanders, Schultes, SibeynDementiev, Sanders, Schultes, Sibeyn
2004Attachment IconEngineering an External Memory Minimum Spanning Tree Algorithm
In: 3rd IFIP International Conference on Theoretical Computer Science (TSC2004), 195-208
DSSS04
Hide details for Deng, MahajanDeng, Mahajan
1997The Cost of Derandomization: Computability or Competitiveness
In: SIAM Journal on Computing [26], 786-802
Deng-Mahajan97
Hide details for DennyDenny
2003Solving geometric optimization problems using graphics hardware
In: EUROGRAPHICS 2003 : the European Association for Computer Graphics 24th Annual Conference, 441-451
Denny03
1994Monotones Häufen und Token Distribution auf dem Hypercube
Universität des Saarlandes
Denny94
Hide details for DeSimone, Diehl, Jünger, Mutzel, Reinelt, RinaldiDeSimone, Diehl, Jünger, Mutzel, Reinelt, Rinaldi
1995Exact Ground States of Ising Spin Glasses: New Experimental Results With a Branch and Cut Algorithm
In: Journal of Statistical Physics [80], 487-496
Mutzel-et-al-95
Hide details for Dessmark, Fraigniaud, Kowalski, PelcDessmark, Fraigniaud, Kowalski, Pelc
2006Deterministic rendezvous in graphsDFKP
2006Attachment IconDeterministic Rendezvous in Graphs
In: Algorithmica [46], 69-96
DFKP2006
Hide details for Deussen, MehlhornDeussen, Mehlhorn
1977Attachment IconVan Wijngaarden Grammars and Space Complexity Class EXSPACE
In: Acta Informatica [8], 193-199
mehlhorn77d
Hide details for Devillers, Golin, Kedem, SchirraDevillers, Golin, Kedem, Schirra
1996Queries on Voronoi Diagrams of Moving Points
In: Computational Geometry. Theory and Applications [5], 315-327
Schirra-et-al-1-96
Hide details for Dey, Funke, RamosDey, Funke, Ramos
2001Surface Reconstruction in almost Linear Time under Locally Uniform Sampling
In: Proceedings of the 17th European Workshop on Computational Geometry (EWCG-01), 129-132
DFR2001
Hide details for Dey, Mehlhorn, RamosDey, Mehlhorn, Ramos
2000Attachment IconCurve reconstruction: Connecting dots with good reason
In: Computational Geometry [15], 229-244
Ramos2000b
1999Curve reconstruction: Connecting dots with good reason
In: Proceedings of the 15th Annual Symposium on Computational Geometry (SCG-99), 197-206
DeMeRa1999
Hide details for Dhiflaoui, Funke, Kwappik, Mehlhorn, Seel, Schömer, Schulte, WeberDhiflaoui, Funke, Kwappik, Mehlhorn, Seel, Schömer, Schulte, Weber
2003Attachment IconCertifying 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
dfkmsssw2003
Hide details for DickertDickert
2000Berechnung von Einfach-und Zweifachzusammenhangskomponenten auf einer PRAM
Universität des Saarlandes
Dickert2000
Hide details for Diedrich, Harren, Jansen, Thöle, ThomasDiedrich, Harren, Jansen, Thöle, Thomas
2008Attachment IconApproximation Algorithms for 3D Orthogonal Knapsack
In: Journal of Science and Technology [23], 749-762
DiedrichHarrenJansenThoeleThomas2008
2007Attachment IconApproximation Algorithms for 3D Orthogonal Knapsack
In: Theory and Applications of Models of Computation, 34-45
Harren2007
Hide details for Diedrich, Kehden, NeumannDiedrich, Kehden, Neumann
2008Multi-objective Problems in Terms of Relational Algebra
In: Relations and Kleene Algebra in Computer Science 2008, 84-98
DieKehNeu2008
Hide details for Diedrich, NeumannDiedrich, Neumann
2008Using Fast Matrix Multiplication in Bio-Inspired Computation for Complex Optimization Problems
In: IEEE Congress on Evolutionary Computation 2008, 3828-3833
DieNeuCEC2008
Hide details for Diekert, Jez, PlandowskiDiekert, Jez, Plandowski
2014Finding All Solutions of Equations in Free Groups and Monoids with Involution
In: 9th International Computer Science Symposium in Russia (CSR 2014), 1-15
Jez2014CSR
Hide details for DieteDiete
1995Berechnung der Kontaktoberfläche eines Moleküls
Universität des Saarlandes
Diete95
Hide details for Dietzfelbinger, Hagerup, Katajainen, PenttonenDietzfelbinger, Hagerup, Katajainen, Penttonen
1997A reliable randomized algorithm for the closest-pair problem
In: Journal of Algorithms [25], 19-51
Hagerup-et-al97
Hide details for Dietzfelbinger, Karlin, Mehlhorn, Meyer Auf Der Heide, Rohnert, TarjanDietzfelbinger, Karlin, Mehlhorn, Meyer Auf Der Heide, Rohnert, Tarjan
1994Attachment IconDynamic Perfect Hashing: Upper and Lower Bounds
In: SIAM Journal on Computing [23], 738-761
Mehlhorn94c
1991Dynamic Perfect Hashing: Upper and Lower Boundsmehlhorn91d
1988Dynamic Perfect Hashing: Upper and Lower Bounds
In: 29th Annual Symposium on Foundations of Computer Science (FOCS 1988), 524-531
FOCS::DietzfelbingerKMHRT1988
Hide details for Dietzfelbinger, Mehlhorn, Meyer auf der Heide, RohnertDietzfelbinger, Mehlhorn, Meyer auf der Heide, Rohnert
1988Upper and Lower Bounds for the Dictionary Problem
In: Algorithm theory (SWAT-88) : 1st Scandinavian workshop, 214-215
SWAT::DietzfelbingerMHR1988
Hide details for Dietz, Mehlhorn, Raman, UhrigDietz, Mehlhorn, Raman, Uhrig
1995Attachment IconLower bounds for set intersection queries
In: Algorithmica [14], 154-168
Mehlhorn-Uhrig95
1993Lower Bounds for Set Intersection queries
In: Discrete algorithms (SODA-93) : 4th annual ACM-SIAM symposium, 194-201
Mehlhorn93f
Hide details for Diks, HagerupDiks, Hagerup
1998More general parallel tree contraction: Register allocation and broadcasting in a tree
In: Theoretical Computer Science [203], 3-29
DiksHagerup1998
1996More 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
Diks-Hagerup96
Hide details for DingDing
2003Geometric Rounding without changing the Topology
Universität des Saarlandes
Dipl03/Ding
Hide details for Dinitz, Garg, GoemansDinitz, Garg, Goemans
1999On the single-source unsplittable flow problem
In: Combinatorica [19], 17-41
DinitzGargGoemans1999
Hide details for Dinitz, NutovDinitz, Nutov
1999A 3-approximation algorithm for finding optimum 4,5-vertex-connected spanning subgraphs
In: Journal of Algorithms [32], 21-30
DinitzZeev1999
Hide details for Djidjev, Pantziou, ZaroliagisDjidjev, Pantziou, Zaroliagis
2000Improved algorithms for dynamic shortest paths
In: Algorithmica [28], 367-389
DjidjevPantziouZaroliagis2000
1995Fast Algorithms for Maintaining Shortest Paths
In: Fundamentals of Computation Theory: 10th International Conference (FCT95), 191-200
Djidjev-Pantziou-Zaro-2-95
1995On-line and Dynamic Algorithms for Shortest Path Problems
In: STACS95: 12th Annual Symposium on Theoretical Aspects of Computer Science, 193-204
Djidjev-Pantziou-Zaro-1-95
Hide details for Dobkin, GunopulosDobkin, Gunopulos
1996Geometric problems in machine learning
In: Applied Computational Geometry: Towards Geometric Engineering (FCRC96 Workshop, WACG96), 121-132
Dobkin-Gunopulos96
Hide details for Dobrindt, Mehlhorn, YvinecDobrindt, Mehlhorn, Yvinec
1993A Complete and Efficient Algorithm for the Intersection of a General and a Convex Polyhedronmehlhorn93j
1993Attachment IconA Complete and Efficient Algorithm for the Intersection of a General and a Convex Polyhedron
In: Algorithms and data structures (WADS-93) : 3rd workshop, 314-324
Mehlhorn93b
Hide details for DoerrDoerr
2013Improved approximation algorithms for the Min-Max Selecting Items problem
In: Information Processing Letters [113], 747-749
Doerr2013AppAlg
2012Black-box complexity: from complexity theory to playing mastermind
In: GECCO'12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation, 1079-1092
Doerr12GECCO
2011Drift analysis
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 1311-1320
Doerr11
2009Introducing Quasirandomness to Computer Science
In: Efficient Algorithms : Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday, 99-111
In: Lecture Notes in Computer Science [5760], 99-111
Doerr2009
2007Attachment IconLp Linear discrepancy of totally unimodular matrices
In: Linear Algebra and Its Applications [420], 663-666
LpDisc2006
2007Attachment IconMatrix approximation and Tusnády's problem
In: European Journal of Combinatorics [28], 990-995
DoerrTusnady
2007Partial Colorings of Unimodular Hypergraphs
In: Electronic Notes in Discrete Mathematics [29], 359-363
Doerr2007partial
2007Attachment IconRandomly Rounding Rationals with Cardinality Constraints and Derandomizations
In: STACS 2007 : 24th Annual Symposium on Theoretical Aspects of Computer Science, 441-452
stacs07_rand
2007Roundings respecting hard constraints
In: Theory of Computing Systems [40], 467-483
DoerrTCS2007
2006Attachment IconGenerating Randomized Roundings with Cardinality Constraints and Derandomizations
In: STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, 571-583
DoerrStacs2006
2006Attachment IconMatrix Rounding With Respect to Small Submatrices
In: Random Structures & Algorithms [28], 107-112
RoundSmSub2006
2006Attachment IconNon-independent randomized rounding and coloring
In: Discrete Applied Mathematics [154], 650-659
RandCol2006
2006Non-independent Randomized Rounding, Linear Discrepancy and an Application to Digital Halftoning
In: Eurocomb '03 [3], 95-99
DigHalf2003
2005Integral Approximation
Christian-Albrechts-Universität zu Kiel
Doerr2005Habil
2005Matrix Rounding with Low Error in Small Submatrices
In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2005), 1067-1068
Doerr2005
2005Roundings Respecting Hard Constraints
In: STACS 2005 : 22nd Annual Symposium on Theoretical Aspects of Computer Science (STACS'05), 617-628
DoerrSTACS2005
2004Multi-color discrepancies
In: Oberwolfach Reports [1], 683-685
MultiColor2004
2001Vector Balancing Games with Aging
In: Electronic Notes in Discrete Mathematics [10], xx-xx
GameAging2001
Hide details for Doerr, De RainvilleDoerr, De Rainville
2013Constructing Low Star Discrepancy Point Sets with Genetic Algorithms
In: Proc. of Genetic and Evolutionary Computation Conference (GECCO 2013), 789-796
DoerrDR2013
Hide details for Doerr, Doerr, EbelDoerr, Doerr, Ebel
2013Lessons From the Black-Box: Fast Crossover-Based Genetic Algorithms
In: Proc. of Genetic and Evolutionary Computation Conference (GECCO 2013), 781-788
DoerrDE13
Hide details for Doerr, Doerr, Spöhel, ThomasDoerr, Doerr, Spöhel, Thomas
2013Playing Mastermind with Many Colors
In: arXiv [abs/1207.0773], 1-22
Doerr2012x
Hide details for Doerr, Eremeev, Horoba, Neumann, TheileDoerr, Eremeev, Horoba, Neumann, Theile
2009Evolutionary Algorithms and Dynamic Programming
In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 771-777
DoerretalGECCO2009
Hide details for Doerr, Eremeev, Neumann, Theile, ThyssenDoerr, Eremeev, Neumann, Theile, Thyssen
2011Evolutionary algorithms and dynamic programming
In: Theoretical Computer Science [412], 6020-6035
DoerrENTT11
Hide details for Doerr, FouzDoerr, Fouz
2011Asymptotically Optimal Randomized Rumor Spreading
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 502-513
DoerrM11
2011Asymptotically optimal randomized rumor spreading
In: Electronic Notes in Discrete Mathematics [38], 297-302
DoerrF12
2011Quasi-random rumor spreading: Reducing randomness can be costly
In: Information Processing Letters [111], 227-230
DF2010b
2010Hereditary Discrepancies in Different Numbers of Colors II
In: SIAM Journal on Discrete Mathematics [24], 1205-1213
DoerrFouz2010
2009A Time-Randomness Tradeoff for Quasi-Random Rumour Spreading
In: Electronic Notes in Discrete Mathematics [34], 335 - 339
doerrfouz2009
2006Hereditary Discrepancies in Different Numbers of Colors II
In: ??? [?], 1-19
DoerrFouz2006
Hide details for Doerr, Fouz, FriedrichDoerr, Fouz, Friedrich
2012Asynchronous rumor spreading in preferential attachment graphs
In: Algorithm Theory - SWAT 2012 : 13th Scandinavian Symposium and Workshops, 307-315
DoerrFF12SWAT
2012Experimental analysis of rumor spreading in social networks
In: Design and Analysis of Algorithms First Mediterranean Conference on Algorithms, MedAlg 2012, 159-173
DoerrFF12MedAlg
2012Why Rumors Spread Fast in Social Networks
In: Communications of the ACM [55], 70-75
DoerrFF12CACM
2011Social Networks Spread Rumors in Sublogarithmic Time
In: STOC'11 : Proceedings of the 43rd ACM Symposium on Theory of Computing, 21-30
2011STOC
2011Social 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
DFF11
Hide details for Doerr, Fouz, Schmidt, WahlströmDoerr, Fouz, Schmidt, Wahlström
2009BBOB: Nelder-Mead with resize and halfruns
In: Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference (GECCO 2009), 2239-2246
DoerrFouzSchmidtWahlstroem2009
Hide details for Doerr, Fouz, WittDoerr, Fouz, Witt
2011Sharp bounds by probability-generating functions and variable drift
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 2083-2090
DoerrFW11
2010Quasirandom Evolutionary Algorithms
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 1457-1464
DoerrFW2010
Hide details for Doerr, FriedrichDoerr, Friedrich
2009Deterministic Random Walks on the Two-Dimensional Grid
In: Combinatorics, Probability and Computing [18], 123-144
DF2009
2006Attachment IconDeterministic Random Walks on the Two-Dimensional Grid
In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 474-483
DF2006
2006Attachment IconQuasirandomness in Graphs
In: Electronic Notes in Discrete Mathematics [25], 61-64
2006CTW_Propp
Hide details for Doerr, Friedrich, Klein, OsbildDoerr, Friedrich, Klein, Osbild
2007Unbiased Matrix Rounding
In: Electronic Notes in Discrete Mathematics [28], 41-46
Doerr2007-ENDMb
2006Attachment IconUnbiased Matrix Rounding
In: Algorithm theory - SWAT 2006 : 10th Scandinavian Workshop on Algorithm Theory, 102-112
DFKO06
2005Attachment IconRounding of Sequences and Matrices, with Applications
In: Third Workshop on Approximation and Online Algorithms (WAOA 2005), 96-109
DFKO05
Hide details for Doerr, Friedrich, Künnemann, SauerwaldDoerr, Friedrich, Künnemann, Sauerwald
2011Quasirandom Rumor Spreading: An Experimental Analysis
In: ACM Journal of Experimental Algorithmics [16], Article No. 3.3
DoerrFKS12
2009Quasirandom Rumor Spreading: An Experimental Analysis
In: 2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX), 145-153
DFKS09
Hide details for Doerr, Friedrich, SauerwaldDoerr, Friedrich, Sauerwald
2009Quasirandom Rumor Spreading on Expanders
In: Electronic Notes in Discrete Mathematics [34], 243 - 247
doerrfriedrichsauerwald2009
2009Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness
In: Automata, Languages and Programming : 36th International Colloquium, ICALP 2009, 366-377
DoerrFriedrichSauerwald09
2008Quasirandom Rumor Spreading
In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, 773-781
Doerr2008-SODA
Hide details for Doerr, GnewuchDoerr, Gnewuch
2008Construction 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
DoerrGnewuch2008
2006Construction of low-discrepancy point sets of small size by bracketing covers and dependent randomized roundingSemKiel
Hide details for Doerr, Gnewuch, HebbinghausDoerr, Gnewuch, Hebbinghaus
2006Attachment IconDiscrepancy of Symmetric Products of Hypergraphs
In: The Electronic Journal of Combinatorics [13], 1-12
SymHyp2006
Hide details for Doerr, Gnewuch, Hebbinghaus, NeumannDoerr, Gnewuch, Hebbinghaus, Neumann
2007A Rigorous View On Neutrality
In: IEEE Congress on Evolutionary Computation 2007, 2591-2597
Doerr2007-CECb
Hide details for Doerr, Gnewuch, Kritzer, PillichshammerDoerr, Gnewuch, Kritzer, Pillichshammer
2008Component-by-component construction of low-discrepancy point sets of small size
In: Monte Carlo Methods and Applications [14], 129-149
DoerrGnewuchKritzerPillichshammer2008
2008 Component-by-component construction of low-discrepancy point sets of small size
In: Monte Carlo Methods Applications [14], 129-150
DoerrGKP08
Hide details for Doerr, Gnewuch, SrivastavDoerr, Gnewuch, Srivastav
2005Bounds and Constructions for the Star-Discrepancy via Delta-Covers
In: Journal of Complexity [21], 691-709
Doerr2005gitter
Hide details for Doerr, Gnewuch, WahlströmDoerr, Gnewuch, Wahlström
2013Calculation of Discrepancy Measures and Applications
In: A Panorama of Discrepancy Theory, 1-55
GnewuchWW13
2010Algorithmic construction of low-discrepancy point sets via dependent randomized rounding
In: Journal of Complexity [26], 490-507
DGW10
2009Implementation of a component-by-component algorithm to generate small low-discrepancy samples
In: Monte Carlo and Quasi-Monte Carlo Methods 2008, 323-338
DoerrGW2009
Hide details for Doerr, GoldbergDoerr, Goldberg
2013Adaptive Drift Analysis
In: Algorithmica [65], 224-250
DoerrG13algo
2010Adaptive Drift Analysis
In: Parallel Problem Solving from Nature -- PPSN XI. -- Pt. 1, 32-41
DG2010b
2010Drift Analysis with Tail Bounds
In: Parallel Problem Solving from Nature – PPSN XI. - Pt. 1, 174-183
DG2010a
Hide details for Doerr, Goldberg, Minder, Sauerwald, ScheidelerDoerr, Goldberg, Minder, Sauerwald, Scheideler
2011Stabilizing consensus with the power of two choices
In: 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA-11), 149-158
DoerrGMSS11
2010Brief Announcement: Stabilizing Consensus with the Power of Two Choices
In: Distributed Computing : 24th International Symposium, DISC 2010, 528-530
Doerretal2010b
Hide details for Doerr, HappDoerr, Happ
2008Directed trees: A Powerful Representation for Sorting and Ordering Problems
In: Proceedings of CEC 2008, 3606-3613
DoerrHapp2008
Hide details for Doerr, Happ, KLeinDoerr, Happ, KLein
2012Crossover can provably be useful in evolutionary computation
In: Theoretical Computer Science [425], 17-33
DoerrHK2012TCS
2011Tight Analysis of the (1+1)-EA for the Single Source Shortest Path Problem
In: Evolutionary Computation [19], 673-691
DoerrHK11
2008Crossover Can Provably be Useful in Evolutionary Computation
In: Genetic and Evolutionary Computation Conference 2008, 539-546
Happ2008
2007A Tight Bound for the (1+1)-EA on the Single Source Shortest Path Problem
In: IEEE Congress on Evolutionary Computation 2007, 1890-1895
Doerr2007-CECa
Hide details for Doerr, HebbinghausDoerr, Hebbinghaus
2005Discrepancy of Products of Hypergraphs
In: 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 323-328
Hebbinghaus2005
Hide details for Doerr, Hebbinghaus, NeumannDoerr, Hebbinghaus, Neumann
2007Speeding up Evolutionary Algorithms Through Asymmetric Mutation Operators
In: Evolutionary Computation [15], 401-410
EulerECJ07
2006Attachment IconSpeeding Up Evolutionary Algorithms Through Restricted Mutation Operators
In: Parallel Problem Solving from Nature - PPSN IX, 9th International Conference, 978-987
Hebbinghaus2006
Hide details for Doerr, Hebbinghaus, WerthDoerr, Hebbinghaus, Werth
2006Attachment IconImproved Bounds and Schemes for the Declustering Problem
In: Theoretical Computer Science [359], 123-132
ImpBoun2006
Hide details for Doerr, Hota, KötzingDoerr, Hota, Kötzing
2012Ants easily solve stochastic shortest path problems
In: GECCO'12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation, 17-24
DoerrHK2012GECCO
Hide details for Doerr, Huber, LevaviDoerr, Huber, Levavi
2013Strong robustness of randomized rumor spreading protocols
In: Discrete Applied Mathematics [161], 778-793
DoerrHL13
2009Strong robustness of randomized rumor spreading protocols
In: Algorithms and Computation : 20th International Symposium, ISAAC 2009, 812-821
DHL2009
Hide details for Doerr, JansenDoerr, Jansen
2011Theory of Evolutionary Computation
In: Algorithmica [59], 299-300
DoerrJ11
Hide details for Doerr, Jansen, KleinDoerr, Jansen, Klein
2008Comparing local and global mutations on bit-strings.
In: Genetic and Evolutionary Computation Conference 2008, 929-936
DoerrJansenKlein2008
Hide details for Doerr, Jansen, Sudholt, Winzen, ZargesDoerr, Jansen, Sudholt, Winzen, Zarges
2013Mutation rate matters even when optimizing monotonic functions
In: Evolutionary Computation [21], 1-27
DoerrJSWZ13EvCo
2010Optimizing Monotone Functions Can Be Difficult
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 42-51
DoerrJSWZ10
Hide details for Doerr, JohannsenDoerr, Johannsen
2010Attachment IconEdge-based representation beats vertex-based representation in shortest path problems
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 759-766
DoerrJ2010
2007Attachment IconAdjacency List Matchings --- An Ideal Genotype for Cycle Covers
In: Genetic and Evolutionary Computation Conference (GECCO-2007), 1203-1210
DoerrJohannsen07a
2007Attachment IconRefined Runtime Analysis of a Basic Ant Colony Optimization Algorithm
In: IEEE Congress on Evolutionary Computation 2007, 501-507
DoerrJohannsen2007b
Hide details for Doerr, Johannsen, Kötzing, Lehre, Wagner, WinzenDoerr, Johannsen, Kötzing, Lehre, Wagner, Winzen
2011Faster black-box algorithms through higher arity operators
In: Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI (FOGA 2011), 163-172
Doerr2011
Hide details for Doerr, Johannsen, Kötzing, Neumann, TheileDoerr, Johannsen, Kötzing, Neumann, Theile
2013More effective crossover operators for the all-pairs shortest path problem
In: Theoretical Computer Science [471], 12-26
DoerrJKNT13
2010More Effective Crossover Operators for the All-Pairs Shortest Path Problem
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 184-193
Doe-Joh-Koe-Neu-The:c:10:APSPCrossover
Hide details for Doerr, Johannsen, SchmidtDoerr, Johannsen, Schmidt
2011Attachment IconRuntime analysis of the (1+1) evolutionary algorithm on strings over finite alphabets
In: FOGA'11 : Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, 119-126
DoerrMJ11
Hide details for Doerr, Johannsen, TangDoerr, Johannsen, Tang
2008Attachment IconHow Single Ant ACO Systems Optimize Pseudo-Boolean Functions
In: Parallel Problem Solving from Nature – PPSN X, 378-388
DoerrJohannsenTang2008a
Hide details for Doerr, Johannsen, WinzenDoerr, Johannsen, Winzen
2012Multiplicative Drift Analysis
In: Algorithmica [64], 673-697
DoerrJW12Multi
2012Non-existence of linear universal drift functions
In: Theoretical Computer Science [436], 71-86
DoerrJW12
2010Drift Analysis and Linear Functions Revisited
In: Proceedings of the IEEE Congress on Evolutionary Computation (CEC 2010). - Pt. 3, 1967-1974
DoerrJW10b
2010Multiplicative Drift Analysis
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 1449-1456
DoerrJW10a
Hide details for Doerr, KleinDoerr, Klein
2006Controlled Randomized Rounding
In: Electronic Notes in Discrete Mathematics [25], 39-40
ContRound2006
2006Attachment IconUnbiased Rounding of Rational Matrices
In: FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science: 26th International Conference, 200-211
unbiasmatr2006
Hide details for Doerr, Klein, StorchDoerr, Klein, Storch
2007Attachment IconFaster Evolutionary Algorithms by Superior Graph Representation
In: First IEEE Symposium on Foundations of Computational Intelligence (FOCI-2007), 245-250
bks07
Hide details for Doerr, Kodric, VoigtDoerr, Kodric, Voigt
2013Lower bounds for the runtime of a global multi-objective evolutionary algorithm
In: IEEE Congress on Evolutionary Computation, 432-439
Doerr2013CECemo
Hide details for Doerr, Kötzing, Lengler, WinzenDoerr, Kötzing, Lengler, Winzen
2013Black-Box Complexities of Combinatorial Problems
In: Theoretical Computer Science [471], 84-106
DoerrKLW13
Hide details for Doerr, Kötzing, WinzenDoerr, Kötzing, Winzen
2011Too fast unbiased black-box algorithms
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 2043-2050
DoerrKW11
Hide details for Doerr, KünnemannDoerr, Künnemann
2013How the (1+λ) Evolutionary Algorithm Optimizes Linear Functions
In: 15th Annual Conference on Genetic and Evolutionary Computation Conference (GECCO '13), 1589-1596
DoerrK2013b
2013Royal Road Functions and the (1 + λ) Evolutionary Algorithm: Almost no Speed-up from Larger Offspring Populations
In: 2013 IEEE Congress on Evolutionary Computation (CEC 2013), 424-431
DoerrK2013a
Hide details for Doerr, Künnemann, WahlströmDoerr, Künnemann, Wahlström
2011Dependent Randomized Rounding: The Bipartite Case
In: 2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX), 96-106
DKW2011
2010Randomized Rounding for Routing and Covering Problems: Experiments and Improvements
In: Experimental Algorithms : 9th International Symposium, SEA 2010, 190-201
DoerrKuennemann2010
Hide details for Doerr, Lengler, Kötzing, WinzenDoerr, Lengler, Kötzing, Winzen
2011Black-box complexities of combinatorial problems
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 981-988
DoerrLKW11
Hide details for Doerr, Lengler, SteurerDoerr, Lengler, Steurer
2006Attachment IconThe Interval Liar Game
In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 318-327
IntLiar2006
Hide details for Doerr, LorenzDoerr, Lorenz
2006Attachment IconError Propagation in Game Trees
In: Mathematical Methods of Operations Research [64], 79-93
Doerr2006gametrees
Hide details for Doerr, Moran, Moran, WinzenDoerr, Moran, Moran, Winzen
2012Simple and Optimal Fault-Tolerant Rumor Spreading
In: arXiv [abs/1209.6158], 1-18
DoerrMMW2012arxiv
Hide details for Doerr, NeumannDoerr, Neumann
2010In Memoriam: Ingo Wegener
In: Algorithmica [58], 541-542
DoerrNeumann
Hide details for Doerr, Neumann, Sudholt, WittDoerr, Neumann, Sudholt, Witt
2011Runtime analysis of the 1-ANT ant colony optimizer
In: Theoretical Computer Science [412], 1629-1644
DoerrNSW11
2007On the Runtime Analysis of the 1-ANT ACO algorithm
In: Genetic and Evolutionary Computation Conference 2007, 33-40
AntGECCO07
Hide details for Doerr, Neumann, WegenerDoerr, Neumann, Wegener
2010Editorial
In: Algorithmica [57], 119-120
DoerrNeumannWegener2010
Hide details for Doerr, PohlDoerr, Pohl
2012Run-time analysis of the (1+1) evolutionary algorithm optimizing linear functions over a finite alphabet
In: GECCO'12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation, 1317-1324
DoerrP12GECCO
Hide details for Doerr, Schmidt, RamakrishnaDoerr, Schmidt, Ramakrishna
2013Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time
In: 39th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'13), 225-236
Doerr2013z
Hide details for Doerr, Spöhel, Thomas, WinzenDoerr, Spöhel, Thomas, Winzen
2013Playing Mastermind with many colors
In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013), 695-704
DoerrSTW13
2012Playing Mastermind with Many Colors
In: Proc. of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2012),
DoerrSTW12
Hide details for Doerr, SrivastavDoerr, Srivastav
2001Multi-Color Discrepancies
In: Electronic Notes in Discrete Mathematics [7], xx-xx
MulCol2001
2001Multi-Color Discrepancy of Arithmetic Progressions
In: Electronic Notes in Discrete Mathematics [8], 27-30
AritProg2001
Hide details for Doerr, Sudholt, WittDoerr, Sudholt, Witt
2013When Do Evolutionary Algorithms Optimize Separable Functions in Parallel?
In: ACM/SIGEVO Foundations of Genetic Algorithms (FOGA 2013), 51-63
DoerrSW2013FOGA
Hide details for Doerr, TheileDoerr, Theile
2009Improved Analysis Methods for Crossover-Based Algorithms
In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 247-254
DoerrTheileGECCO2009
Hide details for Doerr, WahlströmDoerr, Wahlström
2009Randomized Rounding in the Presence of a Cardinality Constraint
In: 2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX), 162-174
DW09
Hide details for Doerr, WinzenDoerr, Winzen
2014Ranking-Based Black-Box Complexity
In: Algorithmica [?], ?
DoerrW12Ranking
2012Black-box complexity: Breaking the O(n logn) barrier of LeadingOnes
In: Artificial Evolution 10th International Conference Evolution Artificielle, EA 2011, 205-216
DoerrW12EA
2012Memory-restricted black-box complexity of OneMax
In: Information Processing Letters [112], 32-34
DoerrW12
2012Playing Mastermind with Constant-Size Memory
In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, 441-452
DoerrW12STACS
2012Playing Mastermind with Constant-Size Memory
In: Theory of Computing Systems [Online First], 1-27
DoerrW12ToCS
2012Reducing the arity in unbiased black-box complexity
In: GECCO'12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation, 1309-1316
DoerrW12GECCO
2011Memory-Restricted Black-Box Complexity
In: Electronic Colloquium on Computational Complexity [18], 7
DoerrW11ECCC
2011Towards a Complexity Theory of Randomized Search Heuristics: Ranking-Based Black-Box Complexity
In: Computer Science - Theory and Applications : 6th International Computer Science Symposium in Russia (CSR 2011), 15-28
DoerrW10
Hide details for Donato, Laura, Leonardi, Millozzi, Meyer, SibeynDonato, Laura, Leonardi, Millozzi, Meyer, Sibeyn
2006Attachment IconAlgorithms and Experiments for the Webgraph
In: Journal of Graph Algorithms and Applications [10], 219-236
Donato-etal-Web-07
Hide details for DorchainDorchain
1996An Implementation of a Convex Hull Algorithm Version 2.0
Universität des Saarlandes
Dorchain96
Hide details for DuanDuan
2013Attachment IconBreaking the $O(n^2.5)$ Deterministic Time Barrier for Undirected Unit-Capacity Maximum Flow
In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013), 1171-1179
Duan2013
Hide details for Duan, MehlhornDuan, Mehlhorn
2012A Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market
In: arXiv [abs/1212.0979v1], 1-8
DK2012
Hide details for Dubhashi, Pantziou, Spirakis, ZaroliagisDubhashi, Pantziou, Spirakis, Zaroliagis
1995The Fourth Moment in Luby's Distribution
In: Theoretical Computer Science [148], 133-140
Zaro-et-al-1-95
Hide details for Dubhashi, RanjanDubhashi, Ranjan
1998Balls and Bins: A Study in Negative Dependence
In: Random Structures & Algorithms [13], 99-124
DubhashiRanjan98
Hide details for Dubhashi, Ranjan, Mehlhorn, ThielDubhashi, Ranjan, Mehlhorn, Thiel
1993Attachment IconSearching, Sorting and Randomised Algorithms for Central Elements and Ideal Counting in Posets
In: Foundations of software technology and theoretical computer science (FSTTCS-93) : 13th conference, 436-443
Mehlhorn93e
Hide details for DumitriuDumitriu
2007Attachment IconGraph-based Conservative Surface Reconstruction
Universität des Saarlandes
Dumitriu2007
Hide details for Dumitriu, Funke, Kutz, MilosavljevicDumitriu, Funke, Kutz, Milosavljevic
2009How 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
DFKM2009
2008How much Geometry it takes to Reconstruct a 2-Manifold in $R^3$
In: 10th Workshop on Algorithm Engineering and Experiments (ALENEX-2008), 65-74
DFKM08
2008On the Locality of Extracting a 2-Manifold in $R^3$
In: 11th Scandinavian Workshop on Algorithm Theory (SWAT-2008), 270-281
DFKM2008b
2008On the Locality of Extracting a 2-Manifold in $R^3$
In: Collection of abstracts of the 24th European Workshop on Computational Geometry, 205-208
Dumitriu2008a
Hide details for Duncan, Goodrich, RamosDuncan, Goodrich, Ramos
1997Efficient approximation and optimization algorithms for computational metrology
In: Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-97), 121-130
Duncan-Goodrich-Ramos97
Hide details for Dupont, Hemmer, Petitjean, SchömerDupont, Hemmer, Petitjean, Schömer
2007Attachment IconComplete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics
In: 15th Annual European Symposium on Algorithms, 633-644
Hemmer2007
Hide details for Durrett, Neumann, O'ReillyDurrett, Neumann, O'Reilly
2011Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics
In: FOGA'11 : Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, 69-80
GPFOGA11
Hide details for Eades, Marks, Mutzel, NorthEades, Marks, Mutzel, North
1998Graph Drawing Contest Report
In: Proceedings of the 6th International Symposium on Graph Drawing (GD-98), 423-435
EadMarksMutzelNorth1998
Hide details for Eades, MutzelEades, Mutzel
1998Graph Drawing Algorithms
In: Algorithms and Theory of Computation Handbook, 9-26
EadesMutzel1998
Hide details for EbertEbert
2005Benchmark Data Sets for Conic Arrangements
Universität des Saarlandes
BachEbert05
Hide details for Edelkamp, MeyerEdelkamp, Meyer
2001Theory and Practice of Time-Space Trade-Offs in Memory Limited Search
In: Proceedings of the Joint German/Austrian Conference on AI: Advances in Artificial Intelligence (KI-01), 169-184
EdelkampMeyer2001
Hide details for Edelsbrunner, RamosEdelsbrunner, Ramos
1997Inclusion-exclusion complexes for pseudo-disk collections
In: Discrete and Computational Geometry [17], 287-306
Edelsbrunner-Ramos97
Hide details for Eigensatz, Giesen, ManjunathEigensatz, Giesen, Manjunath
2008The Solution Path of the Slab Support Vector Machine
In: The 20th Canadian Conference on Computational Geometry, 211-214
Manjunath2008
Hide details for EigenwilligEigenwillig
2008Real Root Isolation for Exact and Approximate Polynomials Using Descartes' Rule of Signs
Universität des Saarlandes
eigenwillig-phd-08
2007Attachment IconOn Multiple Roots in Descartes' Rule and Their Distance to Roots of Higher Derivatives
In: Journal of Computational and Applied Mathematics [200], 226-230
Eigenwillig2007a
2003Attachment IconExact Arrangement Computation for Cubic Curves
Universität des Saarlandes
Dipl03/Eigenwillig
Hide details for Eigenwillig, KerberEigenwillig, Kerber
2008Attachment IconExact and Efficient 2D-Arrangements of Arbitrary Algebraic Curves
In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA08), 122-131
ek-eae2aoaac-08
Hide details for Eigenwillig, Kerber, WolpertEigenwillig, Kerber, Wolpert
2007Attachment IconFast and Exact Geometric Analysis of Real Algebraic Plane Curves
In: Proceedings of the 2007 International Symposium on Symbolic and Algebraic Computation, 151-158
ekw-fast-2007
Hide details for Eigenwillig, Kettner, Krandick, Mehlhorn, Schmitt, WolpertEigenwillig, Kettner, Krandick, Mehlhorn, Schmitt, Wolpert
2005Attachment IconA Descartes algorithm for polynomials with bit-stream coefficients
In: Computer Algebra in Scientific Computing : 8th International Workshop, CASC 2005, 138-149
Eigenwillig2005
Hide details for Eigenwillig, Kettner, Schömer, WolpertEigenwillig, Kettner, Schömer, Wolpert
2006Attachment IconExact, Efficient and Complete Arrangement Computation for Cubic Curves
In: Computational Geometry [35], 36-73
eksw-eecaccc-06
2004Complete, Exact and Efficient Computations with Cubic Curves
In: Proceedings of the Twentieth Annual Symposium on Computational Geometry : (SCG'04), 409-418
Eigenwillig2004a
Hide details for Eigenwillig, Kettner, WolpertEigenwillig, Kettner, Wolpert
2007Attachment IconSnap Rounding of Bézier CurvesACS-TR-121108-01
2007Attachment IconSnap rounding of Bézier curves
In: Proceedings of the Twenty-Third Annual Symposium on Computational Geometry (SCG'07), 158-167
Eigenwillig2007b
Hide details for Eigenwillig, Schömer, WolpertEigenwillig, Schömer, Wolpert
2002Sweeping Arrangements of Cubic Segments Exactly and Efficientlyesw-sacsee-02
Hide details for Eigenwillig, Sharma, YapEigenwillig, Sharma, Yap
2006Attachment IconAlmost Tight Recursion Tree Bounds for the Descartes Method
In: ISSAC '06: Proceedings of the 2006 international symposium on Symbolic and algebraic computation, 71-78
Eigenwillig2006a
Hide details for Eiglsperger, Fekete, KlauEiglsperger, Fekete, Klau
2001Orthogonal Graph Drawing
In: Drawing Graphs: Methods and Models, 121-171
EFK00
Hide details for Eisenbarth, Ziviani, Gonnet, Mehlhorn, WoodEisenbarth, Ziviani, Gonnet, Mehlhorn, Wood
1982Attachment IconThe Theory of Fringe Analysis and Its Application to 2-3 Trees and B-Trees
In: Information and Control [55], 125-174
mehlhorn83b
Hide details for Eisenbrand, Funke, Garg, KönemannEisenbrand, Funke, Garg, Könemann
2003A 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
efgk2003
Hide details for Eisenbrand, Funke, Karrenbauer, MatijevicEisenbrand, Funke, Karrenbauer, Matijevic
2008Energy-Aware Stage Illumination
In: International Journal of Computational Geometry and Applications [18], 107-129
EFKM2008
2005Attachment IconEnergy-Aware Stage Illumination
In: Proceedings of the 21st Annual Symposium on Computational Geometry : (SCG05), 336-346
EFKM2005
Hide details for Eisenbrand, Funke, Karrenbauer, Reichel, SchömerEisenbrand, Funke, Karrenbauer, Reichel, Schömer
2007Packing a truck - Now with a twist!
In: International Journal of Computational Geometry & Applications [17], 505-527
EisenbrandIJCGA2007
2005Packing a Trunk - now with a Twist!
In: Proceedings SPM 2005 ACM Symposium on Solid and Physical Modeling, 197-206
Reichel2005
Hide details for Eisenbrand, Funke, Reichel, SchömerEisenbrand, Funke, Reichel, Schömer
2003Attachment IconPacking a Trunk
In: Algorithms - ESA 2003: 11th Annual European Symposium, 618-629
Reichel2003
Hide details for Eisenbrand, Karrenbauer, Skutella, XuEisenbrand, Karrenbauer, Skutella, Xu
2009Multiline Addressing by Network Flow
In: Algorithmica [53], 583-596
EKSX2008
2006Multiline Addressing by Network Flow
In: Algorithms - ESA 2006 : 14th Annual European Symposium, 744-755
EKSX2006
Hide details for Eisenbrand, Karrenbauer, XuEisenbrand, Karrenbauer, Xu
2007Algorithms for longer OLED Lifetime
In: WEA 2007, 338-351
EKX2007
Hide details for El KahouiEl Kahoui
2008Attachment IconComputing with algebraic curves in generic positionElKahoui2005e
2008Attachment IconPolynomial parametrization of nonsingular algebraic curvesElKahoui2005f
2005Attachment IconBirational properties of the gap subresultant varieties
In: Journal of Symbolic Computation [39], 61-71
ElKahoui2005a
2005Attachment IconUFDs with commuting linearly independent locally nilpotent derivations
In: Journal of Algebra [289], 446-452
ElKahoui2005c
2005Attachment Icon$D$-resultant and subresultants
In: Proceedings of the Amercian Mathematical Society [133], 2193-2199
ElKahoui2005b
2004Attachment IconAlgorithms for recognizing coordinates in two variables over UFD's
In: Proceedings of the 2004 International Symposium Symbolic and Algebraic Computation (ISSAC-04), 135-140
ElKahoui2004c
2004Attachment IconContants of derivations in polynomial rings over unique factorization domains
In: Proceedings of the Amercian Mathematical Society [132], 2537-2541
ElKahoui2004a
2004Attachment IconSubresultants and locally nilpotent derivations
In: Linear Algebra and its Applications [380], 253-261
ElKahoui2004b
2003Attachment IconAn elementary approach to subresultants theory
In: Journal of Symbolic Computation [35], 281-292
ElKahoui2003
2002Attachment IconOn plane polynomial vector fields and the Poincar\'e problem
In: Electronic Journal of Differential Equations [2002], 1-23
ElKahoui2002b
2001Attachment IconImproved algorithms for linear complementarity problems arising from collision response
In: Mathematics and Computers in Simulation [56], 69-93
ElKahoui2001
2000Attachment IconDeciding Hopf bifurcations by quantifier elimination in a software-component architecture
In: Journal of Symbolic Computation [30], 161-179
ElKahoui2000
1996Attachment IconAn Improved Upper Complexity Bound for the Topology Computation of a Real Algebraic Plane Curve
In: Journal of Complexity [12], 527-544
ElKahoui1996
Hide details for El Kahoui, RakrakEl Kahoui, Rakrak
2007Attachment IconStructure of Groebner bases with respect to block orders
In: Mathematics of Computation [76], 2181-2187
ElKahoui2005g
Hide details for ElbassioniElbassioni
2012A QPTAS for ε-Envy-Free Profit-Maximizing Pricing on Line Graphs
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 513-524
Elbassioni2012e
2009Algorithms for Dualization over Products of Partially Ordered Sets
In: SIAM Journal on Discrete Mathematics [23], 487-510
Elbassioni2008p
2008A note on systems with max-min and max-product constraints
In: Fuzzy Sets and Systems [159], 2272-2277
Elbassioni2008h
2008On the complexity of monotone dualization and generating minimal hypergraph transversals
In: Discrete Applied Mathematics [156], 2109-2123
Elbassioni2008i
2006Finding All Minimal Infrequent Multi-dimensional Intervals
In: LATIN 2006: Theoretical Informatics, 7th Latin American Symposium, 423-434
Elbassioni2006c
2006Multiconsistency and Robustness with Global Constraints
In: Constraints [11], 335-352
ElbassioniKatriel2006
2006On the Complexity of Monotone Boolean Duality TestingElbassioni2006
2006On the Complexity of the Multiplication Method for Monotone CNF/DNF Dualization
In: Algorithms - ESA 2006, 14th Annual European Symposium, 340-351
Elbassioni2006d
2002Attachment IconAn Algorithm for Dualization in Products of Lattices and Its Applications
In: Algorithms - ESA 2002, 10th Annual European Symposium, 424-435
Elbassioni2002d
2002Attachment IconOn Dualization in Products of Forests.
In: STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, 142-153
Elbassioni2004
Hide details for Elbassioni, Chalermsook, Nanongkai, SunElbassioni, Chalermsook, Nanongkai, Sun
2013Multi-Attribute Profit-Maximizing PricingElbassioni2013a
Hide details for Elbassioni, ChanElbassioni, Chan
2010A QPTAS for TSP with Fat Weakly Disjoint Neighborhoods in Doubling Metrics
In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 256-267
Elbassioni2010a
Hide details for Elbassioni, Elmasry, KamelElbassioni, Elmasry, Kamel
2008Indexing Schemes for Multi-dimensional Moving Objects
In: Encyclopedia of GIS, 523-529
Elbassioni2008o
2005An Indexing Method for Answering Queries on Moving Objects
In: Distributed and Parallel Databases [17], 215-249
Elbassioni2005ja
2003Attachment IconAn Efficient Indexing Scheme for Multi-dimensional Moving Objects
In: Database Theory - ICDT 2003, 9th International Conference, 425-439
Elbassioni2003dz
Hide details for Elbassioni, Elmasry, MakinoElbassioni, Elmasry, Makino
2011Finding Simplices containing the Origin in Two and Three Dimensions
In: International Journal of Computational Geometry & Applications [21], 495-506
Elbassioni2011i
Hide details for Elbassioni, Fishkin, Mustafa, SittersElbassioni, Fishkin, Mustafa, Sitters
2005Approximation algorithms for Euclidean Group TSP
In: Automata, languages and programming : 32nd International Colloquim, ICALP 2005, 1115-1126
Sitters2005b
Hide details for Elbassioni, Fishkin, SittersElbassioni, Fishkin, Sitters
2009Approximation algorithms for the Euclidean traveling salesman problem with discrete and continuous neighborhoods
In: International Journal of Computational Geometry & Applications [19], 173-193
Elbassioni2009x
2006On Approximating the TSP with Intersecting Neighborhoods
In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 213-222
Elbassioni2006g
Hide details for Elbassioni, Fouad, BertinoElbassioni, Fouad, Bertino
2012Modeling 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
Elbassioni2012f
Hide details for Elbassioni, Fouz, SwamyElbassioni, Fouz, Swamy
2010Approximation Algorithms for Non-single-minded Profit-Maximization Problems with Limited Supply
In: Internet and Network Economics : 6th International Workshop, WINE 2010, 462-472
Elbassioni2010g
Hide details for Elbassioni, Garg, Gupta, Kumar, Narula, PalElbassioni, Garg, Gupta, Kumar, Narula, Pal
2012Approximation 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
Elbassioni2012g
Hide details for Elbassioni, Hagen, RaufElbassioni, Hagen, Rauf
2008Some Fixed-Parameter Tractable Classes of Hypergraph Duality and Related Problems
In: Parameterized and Exact Computation, Third International Workshop, IWPEC 2008, 91-102
Elbassioni2008b
Hide details for Elbassioni, Jeli´c, Matijevi`cElbassioni, Jeli´c, Matijevi`c
2012The relation of Connected Set Cover and Group Steiner Tree
In: Theoretical Computer Science [438], 96-101
Elbassioni2012i
Hide details for Elbassioni, KatrielElbassioni, Katriel
2005Multiconsistency and Robustness with Global Constraints
In: Integration of AI and OR techniques in constraint programming for combinatorial optimization problems : Second International Conference, CPAIOR 2005, 168-182
ElbassioniKatriel2004
Hide details for Elbassioni, Katriel, Kutz, MahajanElbassioni, Katriel, Kutz, Mahajan
2005Simultaneous Matchings
In: Algorithms and computation : 16th International Symposium, ISAAC 2005, 106-115
Elbassioni2005g
Hide details for Elbassioni, Krohn, Matijevic, Mestre, SeverdijaElbassioni, Krohn, Matijevic, Mestre, Severdija
2011Improved Approximations for Guarding 1.5-Dimensional Terrains
In: Algorithmica [60], 451-463
Elbassioni2011m
2009Improved Approximation Algorithms for 1.5D Terrain Guarding
In: Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS), 361-371
conf/stacs/ElbassioniKMMS2009
2009Improved Approximations for Guarding 1.5-Dimensional Terrains
In: Algorithmica [Online First], 1-13
ElbassioniMestre2009a
Hide details for Elbassioni, Lotker, SeidelElbassioni, Lotker, Seidel
2006Upper bound on the number of vertices of polyhedra with 0, 1-constraint matrices
In: Information Processing Letters [100], 69 - 71
Elbassioni2006e
Hide details for Elbassioni, Makino, Mehlhorn, RamezaniElbassioni, Makino, Mehlhorn, Ramezani
2013On Randomized Fictitious Play for Approximating Saddle Points over Convex Sets
In: 19th Annual International Computing and Combinatorics Conference (COCOON-13), 65-76
Ramezani2013
Hide details for Elbassioni, Makino, RaufElbassioni, Makino, Rauf
2011On the readability of monotone Boolean formulae
In: Journal of Combinatorial Optimization [22], 293-304
JOCO:EMR10
2009Attachment IconOn the Readability of Monotone Boolean Formulae
In: Computing and Combinatorics :15th Annual International Conference, COCOON 2009, 496-505
EMR09
2009Attachment IconOutput-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs
In: Algorithms - ESA 2009 : 17th Annual European Symposium, 143-154
ESA:EMR09
Hide details for Elbassioni, Matijevic, SeverdijaElbassioni, Matijevic, Severdija
2012Guarding 1.5D terrains with demands
In: International Journal of Computer Mathematics [89], 2143-2151
Elbassioni2012z
2010Guarding 1.5-Dimensional with Demands
In: 26th European Workshop on Computational Geometry (EuroCG 2010), 133-136
Elbassioni2010b
Hide details for Elbassioni, MustafaElbassioni, Mustafa
2006Conflict-Free Colorings of Rectangle Ranges
In: STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, 254-263
Elbassioni2006b
2005Attachment IconConflict-Free Colorings of Rectangle Ranges for Wireless NetworksElbassioni2005a
Hide details for Elbassioni, Paluch, van ZuylenElbassioni, Paluch, van Zuylen
2012Simpler Approximation of the Maximum Asymmetric Traveling Salesman Problem
In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, 501-506
Elbassioni2012a
Hide details for Elbassioni, Raman, Ray, SittersElbassioni, Raman, Ray, Sitters
2012On the complexity of the highway problem
In: Theoretical Computer Science [460], 70-77
Elbassioni2012h
2009Attachment IconOn Profit-Maximizing Pricing for the Highway and Tollbooth Problems
In: Algorithmic Game Theory : Second International Symposium, SAGT 2009, 275-286
In: ArXiv.org [5814], 275-286
Raman2009
2009On the approximability of the maximum feasible subsystem problem with 0/1-coefficients
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 1210-1219
Elbassioni2009a
Hide details for Elbassioni, RaufElbassioni, Rauf
2010Polynomial-time dualization of r-exact hypergraphs with applications in geometry
In: Discrete Mathematics [310], 2356-2363
ElbassioniRauf2010
2010Polynomial-time Dualization of $r$-Exact Hypergraphs with Applications in GeometryElbRau09a
Hide details for Elbassioni, Rauf, RayElbassioni, Rauf, Ray
??On Enumerating Minimal Transversals of Geometric HypergraphsElbassioni2012d
2011Enumerating Minimal Transversals of Geometric Hypergraphs
In: 23rd Canadian Conference on Computational Geometry (CCCG 2011), 437-442
Elbassioni2011g
Hide details for Elbassioni, Sitters, ZhangElbassioni, Sitters, Zhang
2007Attachment IconA Quasi-PTAS for Envy-free Pricing on Line GraphsElbassioni2007b
2007A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs
In: Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings, 451-462
Elbassioni2007d
Hide details for Elbassioni, TiwaryElbassioni, Tiwary
2012Complexity of Approximating the Vertex Centroid of a Polyhedron
In: Theoretical Computer Science [421], 56-61
Elbassioni2012b
2011On a cone covering problem
In: Computational Geometry [44], 129-134
Elbassioni2011a
2009Complexity of Approximating the Vertex Centroid of a Polyhedron
In: Algorithms and Computation, 20th International Symposium (ISAAC), 413-422
Elbassioni2009ISAAC
2008On a Cone Covering Problem
In: Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 171-174
Elbassioni2008e
2008On Computing the Vertex Centroid of a Polyhedron
In: CoRR [abs/0806.3456], x-x
Elbassioni2008l
Hide details for ElmasryElmasry
2010Pairing heaps, scrambled pairing and square-root trees
In: International Journal of Computer Mathematics [87], 3096-3110
Elmasry2010
2010The longest almost-increasing subsequence
In: Information Processing Letters [110], 655-658
Elmasry2010a
2009Computing the subset partial order for dense families of sets
In: Information Processing Letters [109], 1082-1086
Elmasry2009x
2009Attachment IconPairing Heaps with O(log log n) decrease Cost
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 471-476
Elmasry2009
2008Attachment IconViolation Heaps: A Better Substitute for Fibonacci HeapsElmasry2008d
Hide details for Elmasry, ElbassioniElmasry, Elbassioni
2005Output-Sensitive Algorithms for Enumerating and Counting Simplices Containing a Given Point in th Plane
In: 17th Canadian Conference on Computational Geometry (CCCG'05), 248-251
Mal05
Hide details for Elmasry, HammadElmasry, Hammad
2008Attachment IconInversion-Sensitive Sorting Algorithms in Practice
In: ACM Journal of Experimental Algorithmics [13], 1-18
Elmasry2008a
Hide details for Elmasry, Jensen, KatajainenElmasry, Jensen, Katajainen
2010Strictly-regular number system and data structures
In: Algorithm Theory - SWAT 2010 : 12th Scandinavian Symposium and Workshops
on Algorithm Theory, 26-37
Elmasry2010b
2010The Magic of a Number System
In: Fun with Algorithms : 5th International Conference, FUN 2010, 156-165
Elmasry2010c
2008Attachment IconMultipartite Priority Queues
In: ACM Transactions on Algorithms [5], 1-19
Elmasry2008b
2008Attachment IconTwo New Methods for Constructing Double-Ended Priority Queues from Priority Queues
In: Computing [83], 193-204
Elmasry2008c
Hide details for Elmasry, ManjunathElmasry, Manjunath
2009Enumerating Trichromatic Triangles Containing the Origin in Linear Time
In: Japanese Conference in Computational Geometry and Graphs 2009, 101-103
Manjunath2009b
Hide details for Elmasry, Mehlhorn, SchmidtElmasry, Mehlhorn, Schmidt
2013Every DFS tree of a 3-connected graph contains a contractible edge
In: Journal of Graph Theory [72], 112-121
Elmasry2013
2012An O(n+m) Certifying Triconnnectivity Algorithm for Hamiltonian Graphs
In: Algorithmica [62], 754-766
Elmasry2012
2010An $O(m+n)$ Certifying Triconnectivity Algorithm for Hamiltonian Graphs
In: Algorithmica [Online First], 1-13
ElmasryMehlhornSchmidt2010
Hide details for Elsaesser, SauerwaldElsaesser, Sauerwald
2011Tight bounds for the cover time of multiple random walks
In: Theoretical Computer Science [412], 2623-2641
ElsaesserS2011
Hide details for EmeliyanenkoEmeliyanenko
2012Attachment IconComputing resultants on Graphics Processing Units: Towards GPU-accelerated computer algebra
In: Journal of Parallel and Distributed Computing [In press], 1-14
emel-res-2012
2012Harnessing the Power of GPUs for Problems in Real Algebraic Geometry
Universität des Saarlandes
PhDEmeliyanenko12
2011Attachment IconHigh-performance polynomial GCD computations on graphics processors
In: Proceedings of the 2011 International Conference on High Performance Computing & Simulation (HPCS 2011), 215-224
emel-gcd-11
2010Attachment IconA complete modular resultant algorithm targeted for realization on graphics hardware
In: PASCO '10 : Proceedings of the 4th International Workshop on Parallel and Symbolic Computation, 35-43
res_2010
2010Accelerating Symbolic Computations on NVIDIA Fermi
In: Poster presentation at GTC'10 (NVIDIA research summit), -
Emel-gtc-10
2010Attachment IconModular Resultant Algorithm for Graphics Processors
In: Algorithms and Architectures for Parallel Processing : 10th International Conference, ICA3PP 2010. - Pt. 1, 427-440
emel_gpures_2010
2009Attachment IconEfficient Multiplication of Polynomials on Graphics Hardware
In: Advanced Parallel Processing Technologies : 8th International Symposium, APPT 2009, 134-149
emel_gpgpu_09
2007Attachment IconVisualization of Points and Segments of Real Algebraic Plane Curves
Universität des Saarlandes
Emel2007
Hide details for Emeliyanenko, Berberich, SagraloffEmeliyanenko, Berberich, Sagraloff
2009Attachment IconVisualizing Arcs of Implicit Algebraic Curves, Exactly and Fast
In: Advances in Visual Computing : 5th International Symposium, ISVC 2009, 608-619
EBS_09
Hide details for Emeliyanenko, KerberEmeliyanenko, Kerber
2008Attachment IconAn implementation of the 2D Algebraic Kernelacs-tr-363602-01
2008Attachment IconVisualizing and Exploring Planar Algebraic Arrangements -- a Web Application
In: Proceedings of the 24th ACM Symposium on Computational Geometry, 224-225
ek-vaepaa-08
2008Attachment IconVisualizing and Exploring Planar Algebraic Arrangements - a Web Applicationacs-tr-363608-02
Hide details for Emeliyanenko, SagraloffEmeliyanenko, Sagraloff
2012On the Complexity of Solving a Bivariate Polynomial System
In: ISSAC 2012 : Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation, 154-161
ES-complexity-12
Hide details for Emiris, Hemmer, Karavelas, Limbach, Mourrain, Tsigaridas, ZafeirakopoulosEmiris, Hemmer, Karavelas, Limbach, Mourrain, Tsigaridas, Zafeirakopoulos
2008Cross-benchmarks of univariate algebraic kernelsACS-TR-363602-02
Hide details for Emiris, Hemmer, Karavelas, Mourrain, Tsigaridas, ZafeirakopoulosEmiris, Hemmer, Karavelas, Mourrain, Tsigaridas, Zafeirakopoulos
2008Attachment IconExperimental evaluation and cross-benchmarking of univariate real solversINRIA-00340887:1
Hide details for Emiris, Hemmer, Tsigaridas, TzoumasEmiris, Hemmer, Tsigaridas, Tzoumas
2008Voronoi diagram of ellipses: CGAL-based implementationACS-TR-363603-01
Hide details for EmminghausEmminghaus
1995Effiziente Sortieralgorithmen für den d-dimensionalen Hypercube
Universität des Saarlandes
Emminghaus95
Hide details for Epstein, Imreh, van SteeEpstein, Imreh, van Stee
2002More on weighted servers or FIFO is better than LRU
In: Mathematical Foundations of Computer Science 2002 : 27th International Symposium, MFCS 2002, 257-268
Imreh2001
Hide details for Epstein, Jez, Sgall, van SteeEpstein, Jez, Sgall, van Stee
2012Attachment IconOnline 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
EpJeSS12
Hide details for Epstein, KesselmanEpstein, Kesselman
2006On the remote server problem or more about TCP acknowledgments
In: Theoretical Computer Science [369], 285
Epstein2006
Hide details for Epstein, Kleiman, MestreEpstein, Kleiman, Mestre
2009Parametric Packing of Selfish Items and the Subset Sum Algorithm
In: Internet and Network Economics : 5th International Workshop, WINE 2009, 67-78
Mestre2008
Hide details for Epstein, Kleiman, van SteeEpstein, Kleiman, van Stee
2009Maximizing the Minimum Load: The Cost of Selfishness
In: Internet and Network Economics : 5th International Workshop, WINE 2009, 232-243
EpKlSt2009
Hide details for Epstein, Levin, Marchetti-Spaccamela, Megow, Mestre, Skutella, StougieEpstein, Levin, Marchetti-Spaccamela, Megow, Mestre, Skutella, Stougie
2012Universal sequencing on an unreliable machine
In: SIAM Journal on Computing [41], 565-586
Megow2012-universal
2010Universal sequencing on a single machine
In: Integer Programming and Combinatorial Optimization : 14th International Conference, IPCO 2010, 230-243
EpsteinAMMMSS2010
Hide details for Epstein, Levin, Mestre, SegevEpstein, Levin, Mestre, Segev
2010Improved approximation guarantees for weighted matching in the semi-streaming model
In: 27th International Symposium on Theoretical Aspects of Computer Science (STACS 2010), 347-358
Mestre2010b
Hide details for Epstein, Levin, van SteeEpstein, Levin, van Stee
2013Attachment IconA unified approach to truthful scheduling on related machines
In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, 1243-1252
EpLeSt13
2012Attachment IconApproximation Schemes for Packing Splittable Items with Cardinality Constraints
In: Algorithmica [62], 102-129
EpLeSt12
2011Attachment IconMax-min online allocations with a reordering buffer
In: SIAM Journal on Discrete Mathematics [25], 1230-1250
EpLeSt11a
2010Attachment IconMax-min online allocations with a reordering buffer
In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010, 336-347
EpLeSt10
2008Attachment IconOnline unit clustering: Variations on a theme
In: Theoretical Computer Science [407], 85-96
vanStee2008g
2008Attachment IconTwo-dimensional packing with conflicts
In: Acta Informatica [45], 155-175
vanStee2008e
Hide details for Epstein, van SteeEpstein, van Stee
2012Attachment IconThe price of anarchy on uniformly related machines revisited
In: Information and Computation [212], 37-54
EpsSte12
2011Attachment IconImproved results for a memory allocation problem
In: Theory of Computing Systems [48], 79-92
EpsSte11
2011On the online unit clustering problem
In: ACM Transactions on Algorithms [7], 7:1-7:1
vanSteeTALG2011
2010Maximizing the minimum load for selfish agents
In: Theoretical Computer Science [411], 44-57
EpsSte2009
2010Attachment IconOn the online unit clustering problem
In: ACM Transactions on Algorithms [7], 1-18
vanStee2009a
2008Attachment IconApproximation schemes for packing splittable items with cardinality constraints
In: Approximation and Online Algorithms, 5th International Workshop, WAOA 2007, 232-245
vanStee2008j
2008Attachment IconMaximizing the minimum load for selfish agents
In: LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, 264-275
vanStee2008a
2008Attachment IconOn the Online Unit Clustering Problem
In: Approximation and Online Algorithms, 5th International Workshop, WAOA 2007, 193-206
vanStee2008k
2008Attachment IconThe price of anarchy on uniformly related machines revisited
In: Algorithmic Game Theory, First International Symposium, SAGT 2008, 46-57
vanStee2008
Hide details for Epstein, van Stee, TamirEpstein, van Stee, Tamir
2009Attachment IconPaging with request sets
In: Theory of Computing Systems [44], 67-81
EpStTa2009
Hide details for Evans, Schwarz, TeichEvans, Schwarz, Teich
1995Automated design of two-dimensional rational decimation systems
In: Proceedings of IEEE Asilomar Conference on Signals, Systems, and Computers, 498-502
Schwarz-et-al95a
Hide details for Evans, Schwarz, Teich, Vainshtein, WelzlEvans, Schwarz, Teich, Vainshtein, Welzl
1995Minimal enclosing parallelogram with application
In: 11th Annual ACM Symposium on Computational Geometry (SCG95), C34-C35
Schwarz-et-al95b
Hide details for Fabri, Giezeman, Kettner, Schirra, SchönherrFabri, Giezeman, Kettner, Schirra, Schönherr
2000On the Design of CGAL, a computational geometry algorithms library
In: Software - Practice and Experience [30], 1167-1202
Schirra2000DesignCGAL
1996The CGAL Kernel: A Basis for Geometric Computation
In: Applied Computational Geometry: Towards Geometric Engineering Proceedings (WACG'96), 191-202
Schirra-et-al-2-96
Hide details for Fanghänel, Geulen, Hoefer, VöckingFanghänel, Geulen, Hoefer, Vöcking
2013Online Capacity Maximization in Wireless Networks
In: Journal of Scheduling [16], 81-91
FanghaenelGHV2013
Hide details for Farzan, Gagie, NavarroFarzan, Gagie, Navarro
2010Entropy-Bounded Representation of Point Grids
In: Algorithms and Computation : 21st International Symposium, ISAAC 2010. - Pt. II, 327-338
Farzan2010
Hide details for Farzan, MunroFarzan, Munro
2011Succinct representation of dynamic trees
In: Theoretical Computer Science [412], 2668-2678
FarzanDynamic2011
Hide details for Fatourou, SpirakisFatourou, Spirakis
2000Attachment IconEfficient Scheduling of Strict Multithreaded Computations
In: Theory of Computing Systems [33], 173-232
Fatourou2000
Hide details for Fekete, Fiethe, Friedrichs, Michalik, OrlisFekete, Fiethe, Friedrichs, Michalik, Orlis
2014Efficient reconfiguration of processing modules on FPGAs for space instruments
In: Adaptive Hardware and Systems (AHS), 2014 NASA/ESA Conference on, 15-22
fffmo-eropmoffsi-14
Hide details for Fekete, Friedrichs, Kröller, SchmidtFekete, Friedrichs, Kröller, Schmidt
2013Facets for Art Gallery Problems
In: Computing and Combinatorics, 208-220
ffks-ffagp-13
Hide details for Fekete, Skutella, WoegingerFekete, Skutella, Woeginger
2003Attachment IconThe complexity of economic equilibria for house allocation markets
In: Information Processing Letters [88], 219-223
Skutella2003
Hide details for FeldFeld
1998Analyse und Implementierung von Algorithmen zum Minimum Cost Circulation Problem
Universität des Saarlandes
Feld98
Hide details for FeldmannFeldmann
2012Stochastic optimization with fitness proportional ant systems

Universität des Saarlandes
FeldmannBachelor2012
Hide details for Fellows, Fertin, Hermelin, VialetteFellows, Fertin, Hermelin, Vialette
2011Upper and lower bounds for finding connected motifs in vertex-colored graphs
In: Journal of Computer and System Sciences [77], 799-811
FellowsFertinHermelinVialette2011
Hide details for Fellows, Friedrich, Hermelin, Narodytska, RosamondFellows, Friedrich, Hermelin, Narodytska, Rosamond
2011Constraint Satisfaction Problems: Convexity Makes All Different Constraints Tractable
In: Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (IJCAI 2011), 522-527
FellowsFriedrichHermelinEtAL2011
Hide details for Fellows, Hartman, Hermelin, Landau, Rosamond, RozenbergFellows, Hartman, Hermelin, Landau, Rosamond, Rozenberg
2011Haplotype Inference Constrained by Plausible Haplotype Data
In: IEEE/ACM Transactions on Computational Biology and Bioinformatics [8], 1692-1699
FellowsHatrmanHermelinEtAl2011
Hide details for Fellows, Hermelin, RosamondFellows, Hermelin, Rosamond
2012Well Quasi Orders in Subclasses of Bounded Treewidth Graphs and Their Algorithmic Applications
In: Algorithmica [64], 3-18
Fellows2012
Hide details for Feremans, Grigoriev, SittersFeremans, Grigoriev, Sitters
2006The geometric generalized minimum spanning tree problem with grid clustering
In: 4OR: A Quarterly Journal of Operations Research [4], 319-329
Sitters2006a
Hide details for Fernau, Fomin, Lokshtanov, Mnich, Philip, SaurabhFernau, Fomin, Lokshtanov, Mnich, Philip, Saurabh
2011Attachment IconRanking and Drawing in Subexponential Time
In: Combinatorial Algorithms - 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers,
FernauFominLokshtanovMnichPhilipSaurabh2010
Hide details for Fernau, Fomin, Philip, SaurabhFernau, Fomin, Philip, Saurabh
2010Attachment IconThe 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
FernauFominPhilipSaurabh2010
Hide details for Ferragina, GrossFerragina, Gross
1998Optimal On-Line Search and Sublinear Time Update in String Matching
In: SIAM Journal on Computing [27], 713-736
FerraginaGrossSIAMJCOMPUT1998
Hide details for FialkoFialko
1997Das planare Augmentierungsproblem
Universität des Saarlandes
Fialko97
Hide details for Fialko, MutzelFialko, Mutzel
1998A new approximation algorithm for the planar augmentation problem
In: Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-98), 260-269
FM97
Hide details for FinkFink
2001Oberflächenrekonstruktion von planaren Konturen
Universität des Saarlandes
FinkDipl01
Hide details for FinklerFinkler
1997Design of Efficient and Correct Algorithms: Theoretical Results and Runtime Prediction of Implementations in Practice
Universität des Saarlandes
Finkler-Diss97
Hide details for Finkler, MehlhornFinkler, Mehlhorn
1999Checking Priority Queues
In: Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-99), 901-902
mehlhorn99
1997Runtime Prediction of Real Programs on Real Machines
In: Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-97), 380-389
Finkler-Mehlhorn97
Hide details for FleischerFleischer
1999Decision trees: old and new results
In: Information and computation [152], 44-61
Fleischer_dectrees_1999
1999Effiziente und Online-Algorithmen
Universität des Saarlandes
Fleischer1999
1999FUN with implementing algorithms
In: Proceedings of the International Conference on FUN with Algorithms (FUN-98), 88-98
Fleischer-FUN-1999
1998On the Bahncard problem
In: Proceedings of the 4th International Conference on Computing and Combinatorics (COCOON-98), 65-74
Fleischer1998bahncard
1996A simple balanced search tree with $O(1)$ worst-case update time
In: International Journal of Foundations of Computer Science [7], 137-149
Fleischer96
Hide details for Fleischer, Fries, Mehlhorn, Meiser, Näher, Rohnert, Schirra, Simon, Tsakalidis, UhrigFleischer, Fries, Mehlhorn, Meiser, Näher, Rohnert, Schirra, Simon, Tsakalidis, Uhrig
1992Selected 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
Mehlhorn92e
Hide details for Fleischer, Jung, MehlhornFleischer, Jung, Mehlhorn
1995A communication-randomness tradeoff for two-processor systems
In: Information and Computation [116], 155-161
Fleischer-Jung-Mehlhorn95
1991A Time-Randomness Tradeoff for Communication Complexity
In: Distributed Algorithms, 4th International Workshop, 390-401
Mehlhorn91d
Hide details for Fleischer, Mehlhorn, Rote, Welzl, YapFleischer, Mehlhorn, Rote, Welzl, Yap
1992Simultaneous Inner and Outer Approximation of Shapes
In: Algorithmica [8], 365-389
ALGOR::FleischerMRWY1992
1990On Simultaneous Inner and Outer Approximation of Shapes
In: Computational geometry (SCG-90) : 6th annual symposium, 216-224
SCG90*216
Hide details for Fleischer, SkutellaFleischer, Skutella
2003Attachment IconMinimum Cost Flows Over Time without Intermediate Storage
In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), 66-75
FleischerSkutella2003
Hide details for Fleischer, WahlFleischer, Wahl
2000Online scheduling revisited
In: Algorithms - ESA 2000, Proceedings of the 8th Annual European Symposium (ESA-00), 202-210
Paterson2000
Hide details for Fogel, Halperin, Kettner, Teillaud, Wein, WolpertFogel, Halperin, Kettner, Teillaud, Wein, Wolpert
2007Attachment IconArrangements
In: Effective Computational Geometry for Curves and Surfaces, 1-66
Kettner2007ECGBookz
Hide details for Follert, Schömer, Sellen, Smid, ThielFollert, Schömer, Sellen, Smid, Thiel
1997Computing the largest empty anchored cylinder, and related problems
In: International Journal of Computational Geometry and Applications [7], 563-580
FollertSchoemerSellenSmidThiel97
1995Computing a largest empty anchored cylinder, and related problems
In: Foundations of Software Technology and Theoretical Computer Science: 15th Conference, 428-442
Smid-et-al-1-95
Hide details for Fomin, Lokshtanov, Misra, Philip, SaurabhFomin, Lokshtanov, Misra, Philip, Saurabh
2011Attachment IconHitting 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
FominLokshtanovMisraPhilipSaurabh2011
Hide details for Fomin, Philip, VillangerFomin, Philip, Villanger
2011Attachment IconMinimum 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
FominPhilipVillanger2011
Hide details for FontaineFontaine
2003Computing the Filtration Efficiency of Shape-Index-Filters for Approximate String Matching
Universität des Saarlandes
Dipl03/Fontaine
Hide details for Fontet, Mehlhorn (ed.)Fontet, Mehlhorn (ed.)
1984Theoretical aspects of computer science (STACS-84) : [1st] symposiummehlhorn84e
Hide details for FotakisFotakis
2004Attachment IconIncremental Algorithms for Facility Location and k-Median
In: Algorithms – ESA 2004: 12th Annual European Symposium, 347-358
Fotakis2004a
2003Attachment IconOn the Competitive Ratio for Online Facility Location
In: Automata, languages and programming : 30th International Colloquium, ICALP 2003, 637-652
Fot03
Hide details for Fotakis, Kontogiannis, Koutsoupias, Mavronicolas, SpirakisFotakis, Kontogiannis, Koutsoupias, Mavronicolas, Spirakis
2002Attachment IconThe Structure and Complexity of Nash Equilibria for a Selfish Routing Game
In: Automata, Languages and Programming : 29th International Colloquium, ICALP 2002, 123-134
FKKMS02
Hide details for Fotakis, Nikoletseas, Papadopoulou, SpirakisFotakis, Nikoletseas, Papadopoulou, Spirakis
2002Attachment IconRadiocolorings 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
FNPS02
Hide details for Fotakis, Pagh, Sanders, SpirakisFotakis, Pagh, Sanders, Spirakis
2005Space Efficient Hash Tables With Worst Case Constant Access Time
In: Theory of Computing Systems [38], 229-248
Sanders2005b
2003Attachment IconSpace 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
FPSS03
Hide details for Fotakis, SpirakisFotakis, Spirakis
2002Attachment IconMinimum Congestion Redundant Assignments to Tolerate Random Faults
In: Algorithmica [32], 396-422
FS2002a
Hide details for FountoulakisFountoulakis
2007Percolation on sparse random graphs with given degree sequence
In: Internet Mathematics [4], 329-356
Fountoulakis2009a
Hide details for Fountoulakis, Friedrich, HermelinFountoulakis, Friedrich, Hermelin
2011Average Case Parameterized ComplexityavgFPTsubmitted
Hide details for Fountoulakis, HuberFountoulakis, Huber
2009Quasirandom rumor spreading on the complete graph is as fast as randomized rumor spreading
In: SIAM Journal on Discrete Mathematics [23], 1964-1991
HF2009
Hide details for Fountoulakis, Huber, PanagiotouFountoulakis, Huber, Panagiotou
2010Reliable broadcasting in random networks and the effect of density
In: 2010 Proceedings IEEE INFOCOM, 2552-2560
FHPInfocom10
2009Brief Announcement: The Speed of Broadcasting in Random Networks - Density Does Not Matter
In: Distributed Computing : 23rd International Symposium, DISC 2009, 529-530
FHP2009
2009The Speed of Broadcasting in Random Networks: Density Does Not Matter
In: 23rd International Symposium on Distributed Computing (DISC '09), 529-530
FountoulakisHuberPanagiotouBrief2010
Hide details for Fountoulakis, Kang, McDiarmidFountoulakis, Kang, McDiarmid
2010The t-stability number of a random graph
In: The Electronic Journal of Combinatorics [17], R59,1-R59,29
FKMcEJC2010
Hide details for Fountoulakis, Khosla, PanagiotouFountoulakis, Khosla, Panagiotou
2011The Multiple-orientability Thresholds for Random Hypergraphs
In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), 1222-1236
FountoulakisKhoslaPanagiotou2010
Hide details for Fountoulakis, Kühn, OsthusFountoulakis, Kühn, Osthus
2009Minors in random regular graphs
In: Random Structures and Algorithms [35], 444-463
Fountoulakis2009b
2008The order of the largest complete minor in a random graph
In: Random Structures and Algorithms [33], 127-141
Fountoulakis2008b
Hide details for Fountoulakis, PanagiotouFountoulakis, Panagiotou
2013On the Insertion Time of Cuckoo Hashing
In: SIAM Journal on Computing [?], ?-?
FPSSICOMP2013
2012Tight Load Thresholds for Cuckoo Hashing
In: Random Structures and Algorithms [41], 306-333
FP12RSA
20113-Connected Cores In Random Planar Graphs
In: Combinatorics, Probability & Computing [20], 381-412
Fountoulakis2011
2010Orientability of random hypergraphs and the power of multiple choices
In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010. - Pt. 1, 348-359
FPIcalp2010
2010Rumor 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
FPRandom10
Hide details for Fountoulakis, Panagiotou, SauerwaldFountoulakis, Panagiotou, Sauerwald
2012Ultra-fast rumor spreading in social networks
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 1642-1660
FountoulakisPS12
Hide details for Fountoulakis, ReedFountoulakis, Reed
2008The 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
Fountoulakis2008
2007Faster Mixing and Small Bottlenecks
In: Probability Theory and Related Fields [137], 475-486
Fountoulakis2007
Hide details for FouzFouz
2012Randomized Rumor Spreading in Social Networks & Complete Graphs
Universität des Saarlandes
FouzDiss2012
2006Hereditary Discrepancy in Different Numbers of Colors
Universität des Saarlandes
BachFouz06
Hide details for Fraigniaud, Gasieniec, Kowalski, PelcFraigniaud, Gasieniec, Kowalski, Pelc
2004Collective Tree Exploration
In: LATIN 2004: Theoretical informatics, 6th Latin American Symposium, 141-151
Kowalski-LATIN-2004
Hide details for Frederickson, Solis-ObaFrederickson, Solis-Oba
1998Algorithms for Measuring Perturbability in Matroid Optimization
In: Combinatorica [18], 503-518
FredericksonSolis-Oba98
Hide details for Fredman, KhachiyanFredman, Khachiyan
1996On the Complexity of Dualization of Monotone Disjunctive Normal Forms
In: J. Algorithms [21], 618-628
FredmanKhachiyan96
Hide details for FriedrichFriedrich
2007Use and Avoidance of Randomness
Universität des Saarlandes
FriedrichPhD2007
2005Attachment IconDeterministic Random Walks on Infinite Grids
Friedrich-Schiller-Universität Jena
Friedrich2005
Hide details for Friedrichs, Kulau, WolfFriedrichs, Kulau, Wolf
2014Energy-efficient voltage scheduling of peripheral components on wireless sensor nodes
In: Communications Workshops (ICC), 2014 IEEE International Conference on, 860-865
fkw-eevsopcowsn-14
Hide details for Friedrich, Bringmann, Voss, IgelFriedrich, Bringmann, Voss, Igel
2011The Logarithmic Hypervolume Indicator
In: FOGA'11 : Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, 81-92
FBVI2011
Hide details for Friedrich, Gairing, SauerwaldFriedrich, Gairing, Sauerwald
2012Quasirandom Load Balancing
In: SIAM Journal on Computing [41], 747-771
FriedrichGS2012
2010Quasirandom Load Balancing
In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1620-1629
Friedrich2009
Hide details for Friedrich, HebbinghausFriedrich, Hebbinghaus
2011Average update times for fully-dynamic all-pairs shortest paths
In: Discrete Applied Mathematics [159], 1751-1758
FriedrichDAM2011
2008Average Update Times for Fully-Dynamic All-Pairs Shortest Paths.
In: Proceedings of the 19th International Symposium on Algorithms and Computation (ISAAC 2008), 693-704
FH08
Hide details for Friedrich, Hebbinghaus, NeumannFriedrich, Hebbinghaus, Neumann
2009Comparison of Simple Diversity Mechanisms on Plateau Functions
In: Theoretical Computer Science [410], 2455-2462
FriHebNeuTCS2009
2007Plateaus Can Be Harder in Multi-Objective Optimization
In: IEEE Congress on Evolutionary Computation 2007, 2622-2629
setcover07
2007Rigorous Analyses of Simple Diversity Mechanisms
In: Genetic and Evolutionary Computation Conference 2007, 1219-1225
selection07
Hide details for Friedrich, Hebbinhaus, NeumannFriedrich, Hebbinhaus, Neumann
2010Plateaus Can Be Harder in Multi-Objective Optimization
In: Theoretical Computer Science [411], 854-864
FHN10
Hide details for Friedrich, He, Hebbinghaus, Neumann, WittFriedrich, He, Hebbinghaus, Neumann, Witt
2010Approximating Covering Problems by Randomized Search Heuristics using Multi-Objective Models
In: Evolutionary Computation [18], 617 - 633
FHHNW10
2009Analyses of Simple Hybrid Algorithms for the Vertex Cover Problem
In: Evolutionary Computation, [17], 3-19
FrietalECJ2009
2007Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models
In: Genetic and Evolutionary Computation Conference 2007, 797-804
MultVC07
2007On Improving Approximate Solutions by Evolutionary Algorithms
In: IEEE Congress on Evolutionary Computation 2007, 2614-2621
HybridVC07
Hide details for Friedrich, Horoba, NeumannFriedrich, Horoba, Neumann
2011Illustration of fairness in evolutionary multi-objective optimization
In: Theoretical Computer Science [412], 1546-1556
FriedrichTCS2011
2009Multiplicative Approximations and the Hypervolume Indicator
In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 571-578
FriHorNeuGECCO2009
2008Runtime Analyses for Using Fairness in Evolutionary Multi-Objective Optimization
In: Parallel Problem Solving from Nature (PPSN X), 671-680
FriHorNeuPPSN2008
Hide details for Friedrich, Kroeger, NeumannFriedrich, Kroeger, Neumann
2012Weighted preferences in evolutionary multi-objective optimization
In: International Journal of Machine Learning and Cybernetics [Online First], 1-10
FriedrichKN2011
Hide details for Friedrich, NeumannFriedrich, Neumann
2010When to Use Bit-Wise Neutrality
In: Natural Computing [9], 283 - 294
FriNeuNat2009
2008When to Use Bit-wise Neutrality
In: IEEE Congress on Evolutionary Computation 2008, 997-1003
FriNeuCEC2008
Hide details for Friedrich, Oliveto, Sudholt, WittFriedrich, Oliveto, Sudholt, Witt
2009Analysis of Diversity-Preserving Mechanisms for Global Exploration
In: Evolutionary Computation [17], 455-476
FriedrichOSW2009
2008Theoretical Analysis of Diversity Mechanisms for Global Exploration
In: Proceedings of the 10th annual conference on Genetic and evolutionary computation (GECCO 2008), 945-952
FOSW08
Hide details for Friedrich, SauerwaldFriedrich, Sauerwald
2010The Cover Time of Deterministic Random Walks
In: Computing and Combinatorics : 16th Annual International Conference, COCOON 2010, 130-139
FriedrichSauerwald2010
2010The Cover Time of Deterministic Random Walks
In: The Electronic Journal of Combinatorics [17], R167,1-R167,30
FriedrichSauerwald2010EJC
2009Near-Perfect Load Balancing by Randomized Rounding
In: STOC09 : Proceedings of the 2009 ACM International Symposium on Theory of Computing, 121-130
FS09
Hide details for Friedrich, Sauerwald, StaufferFriedrich, Sauerwald, Stauffer
2011Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary Dimensions
In: 22nd International Symposium on Algorithms and Computation (ISAAC-11), 190-199
FriedrichSS11
Hide details for Friedrich, Sauerwald, VilenchikFriedrich, Sauerwald, Vilenchik
2011Smoothed analysis of balancing networks
In: Random Structures & Algorithms [39], 115-138
FriedrichRSA2011
2010Smoothed Analysis of Balancing Networks
In: Random Structures and Algorithms [Early View], 1-24
TF_RSA2
2009Smoothed Analysis of Balancing Networks
In: Automata, Languages and Programming : 36th International Colloquium, ICALP 2009, 472-483
FriedrichSauerwaldVilenchik09
Hide details for FriesFries
2001Implementation of a Dynamic Convex Hall Algorithm in Arbitrary Dimension
Universität des Saarlandes
FriesDipl01
2000Implementation of a Dynamic Convex Hull Algorithm in Arbitrary Dimension
Universität des Saarlandes
Fries2000
Hide details for Fries, Mehlhorn, NäherFries, Mehlhorn, Näher
1985Dynamization of geometric data structuresmehlhorn85z
1985Dynamization of geometric data structures
In: Computational geometry (SCG-85) : 1st symposium, 168-176
mehlhorn85e
Hide details for Fries, Mehlhorn, Näher, TsakalidisFries, Mehlhorn, Näher, Tsakalidis
1987A $\log \log n$ data structure for three-sided range queries
In: Information Processing Letters [25], 269-273
IPL::FriesMNT1987
Hide details for Frigioni, Miller, Nanni, Pasqualone, Schäfer, ZaroliagisFrigioni, Miller, Nanni, Pasqualone, Schäfer, Zaroliagis
1998An experimental study of dynamic algorithms for directed graphs
In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), 368-380
Frigioni-et-al-98
Hide details for Froyland, Koch, Megow, Duane, WrenFroyland, Koch, Megow, Duane, Wren
2008Optimizing the Landside Operation of a Container Terminal
In: OR Spectrum [30], 53-75
FroylandKMDW08
Hide details for Fürer, MehlhornFürer, Mehlhorn
1989Attachment IconAT$^2$-Optimal Galois Field Multiplier for VLSI
In: IEEE Transactions on Computers [38], 1333-1336
journals/tc/FurerM89
1986AT$^2$-Optimal Galois Field Multiplier for VLSI
In: VLSI Algorithms and Architectures, Aegean Workshop on Computing, 217-225
mehlhorn86d
1986VLSI Algorithms and Architectures, Aegean Workshop on Computing - >> Dublette
In: VLSI Algorithms and Architectures, Aegean Workshop on Computing, 328
mehlhorn86d
1986VLSI Algorithms and Architectures, Aegean Workshop on Computing - >> Dublette
In: VLSI Algorithms and Architectures, Aegean Workshop on Computing, 328
mehlhorn86d
Hide details for Fuhrmann, SchömerFuhrmann, Schömer
2001A 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
fs-rsm-01
Hide details for FunkeFunke
2005Topological 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
FunkeHD2005
2001Combinatorial Curve Reconstruction and the Efficient Exact Implementation of Geometric Algorithms
Universität des Saarlandes
FunkeDiss2001
1997Exact Arithmetic using Cascaded Computation
Universität des Saarlandes
Funke97
Hide details for Funke, Guibas, Nguyen, WangFunke, Guibas, Nguyen, Wang
2006Distance-Sensitive Information Brokerage in Sensor Networks
In: Distributed Computing in Sensor Systems, Second IEEE International Conference, DCOSS 2006, 234-251
FuGui2006
Hide details for Funke, Kesselman, Kuhn, Lotker, SegalFunke, Kesselman, Kuhn, Lotker, Segal
2007Attachment IconImproved approximation algorithms for connected sensor cover
In: Wireless Networks [13], 153-164
FKKLS07
Hide details for Funke, Kesselman, Lotker, SegalFunke, Kesselman, Lotker, Segal
2004Improved Approximation Algorithms for Connected Sensor Cover
In: Ad-hoc, mobil and wireless networks : Third International Conference, ADHOC-NOW 2004, 56-69
FKLS2004
Hide details for Funke, Kesselman, Meyer, SegalFunke, Kesselman, Meyer, Segal
2006A Simple Improved Distributed Algorithm for Minimum CDS in Unit Disk Graphs
In: ACM Transactions on Sensor Networks [2], 444-453
FKesselmanMeyerS2006
2005A 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
FKMS2005b
Hide details for Funke, KleinFunke, Klein
2006Attachment IconHole Detection or: "How Much Geometry Hides in Connectivity?"
In: Proceedings of the 22nd Annual Symposium on Computational Geometry, SCG'06, 377-385
FK2006
Hide details for Funke, Klein, Mehlhorn, SchmittFunke, Klein, Mehlhorn, Schmitt
2006Attachment IconControlled Perturbation for Delaunay Triangulationsacstr123109-01
2005Attachment IconControlled Perturbation for Delaunay Triangulations
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 1047-1056
FKMS2005
Hide details for Funke, LaueFunke, Laue
2007Attachment IconBounded-Hop Energy-Efficient Broadcast in Low-Dimensional Metrics Via Coresets
In: STACS 2007 : 24th Annual Symposium on Theoretical Aspects of Computer Science, 272-283
FL2007
Hide details for Funke, Laue, Lotker, NaujoksFunke, Laue, Lotker, Naujoks
2011Power 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
Naujoks2011
Hide details for Funke, Laue, NaujoksFunke, Laue, Naujoks
2007Minimum Energy Broadcast with Few Senders
In: Distributed Computing in Sensor Systems : Third IEEE International Conference, DCOSS 2007, 404-416
FLN2007
Hide details for Funke, Laue, Naujoks, LotkerFunke, Laue, Naujoks, Lotker
2008Power 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
FLNL2008
2006Power Assignment Problems in Wireless Communication
In: ??? [?], 1-14
FunkeLaueLotkerNaujoks2006
Hide details for Funke, Malamatos, Matijevic, WolpertFunke, Malamatos, Matijevic, Wolpert
2006Attachment Icon(Approximate) Conic Nearest Neighbors and the induced Voronoi Diagram
In: 18th Canadian Conference on Computational Geometry, 23-26
FMMW2006
Hide details for Funke, Malamatos, RayFunke, Malamatos, Ray
2004Finding Planar Regions in a Terrain
In: 20th European Workshop on Computational Geometry (EWCG), 1-4
FMR2004b
2004Finding 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
FMR2004
Hide details for Funke, Matijevic, SandersFunke, Matijevic, Sanders
2004Attachment IconConstant Time Queries for Energy Efficient Paths in Multi-Hop Wireless Networks
In: First International Workshop on Algorithms for Wireless and Mobile Networks, 97-111
FMS2004
2003Attachment IconApproximating Energy Efficient Paths in Wireless Multi-hop Networks
In: Algorithms - ESA 2003: 11th Annual European Symposium, 230-241
FMS2003
Hide details for Funke, MehlhornFunke, Mehlhorn
2002LOOK - A Lazy Object-Oriented Kernel for Geometric Computation
In: Computational Geometry - Theory and Applications [22], 99-118
fm-look-2002
2000Attachment IconLOOK - a Lazy Object-Oriented Kernel for Geometric Computation
In: Proceedings of the 16th Annual Symposium on Computational Geometry (SCG-00), 156-165
fm-lalokfgc-00
Hide details for Funke, Mehlhorn, NäherFunke, Mehlhorn, Näher
2005Attachment IconStructural filtering: a paradigm for efficient and exact geometric programs
In: Computational Geometry [31], 179-194
mehlhorn05z
1999Attachment IconStructural Filtering: a Paradigm for Efficient and Exact Geometric Programs
In: Abstracts for the 11th Canadian Conference on Computational Geometry (CCCG-99), 39-42
FMN1999
Hide details for Funke, Mehlhorn, Schmitt, Burnikel, Fleischer, SchirraFunke, Mehlhorn, Schmitt, Burnikel, Fleischer, Schirra
2004The LEDA class real number -- extended versionBFFMSS04
Hide details for Funke, MilosavljevicFunke, Milosavljevic
2007Guaranteed-delivery Geographic Routing under Uncertain Node Locations
In: IEEE INFOCOM 2007 : 26th IEEE International Conference on Computer Communications, 1244-1252
FM2007b
2007Network 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
FM2007
2005Infrastructure-Establishment from Scratch in Wireless Sensor Networks
In: Distributed computing in sensor systems : First IEEE International Conference, DCOSS 2005, 354-367
FunkeIE2005
Hide details for Funke, RamosFunke, Ramos
2002Smooth-Surface Reconstruction in Near-Linear Time
In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-02), 781-790
fr-ssrinlt-02
2001Reconstructing a Collection of Curves with Corners and Endpoints
In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-01), 344-353
fr-rcwcae-01
Hide details for Funke, RaufFunke, Rauf
2007Information 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
FunkeRauf07
Hide details for Gärtner, HotzGärtner, Hotz
2009Computability of Analytic Functions with Analytic Machines
In: Mathematical Theory and Computational Practice : 5th Conference on Computability in Europe, CiE 2009, 250-259
GaertnerHotzr2009
Hide details for Gagie, Gawrychowski, Kärkkäinen, Nekrich, PuglisiGagie, Gawrychowski, Kärkkäinen, Nekrich, Puglisi
2014LZ77-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
Gawrychowski2014a
Hide details for Gagie, Gawrychowski, NekrichGagie, Gawrychowski, Nekrich
2013Heaviest Induced Ancestors and Longest Common Substrings
In: 25th Canadian Conference on Computational Geometry (CCCG 13), 145-150
Gawrychowski2013ancestors
Hide details for Gandhi, MestreGandhi, Mestre
2009Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
In: Algorithmica [54], 54-71
journal/algo/GandhiM2007
Hide details for GaoGao
2011Distribution of spanning regular subgraphs in random graphsGao2012dFactor
Hide details for Gao, Jerrum, Kaufmann, Mehlhorn, RüllingGao, Jerrum, Kaufmann, Mehlhorn, Rülling
1988Attachment IconOn Continuous Homotopic One Layer Routing
In: Computational geometry (SCG-88) : 4th symposium, 392-402
conf/compgeom/GaoJKMR89
Hide details for Gao, Kaufmann, Mehlhorn, Rülling, Storb, JerrumGao, Kaufmann, Mehlhorn, Rülling, Storb, Jerrum
1988On Continuous Homotopic One Layer Routing (Extended Abstract)
In: Computational geometry and its applications (CG-88) : international workshop, 55-70
lncs333*55
Hide details for Gao, Wormald, SuGao, Wormald, Su
2010Attachment IconInduced subgraphs in sparse random graphs with given degree sequenceGao2010DegSub
Hide details for GargGarg
1996A 3-approximation for the minimum tree spanning with k-vertices
In: Foundations of computer science (FOCS-96) : 37th annual symposium, 302-309
GSV
Hide details for Garg, Kavitha, Kumar, Mehlhorn, MestreGarg, Kavitha, Kumar, Mehlhorn, Mestre
2010Assigning Papers to Referees
In: Algorithmica [58], 119-136
MehlhonMestre2009
2008Attachment IconAssigning Papers to RefereesMehlhorn2008a
Hide details for Garg, Konjevod, RaviGarg, Konjevod, Ravi
2000Approximation algorithm for the group Steiner tree problem
In: Journal of Algorithms [37], 66-84
GargKonjevodRavi2000
Hide details for Garg, Papatriantafilou, TsigasGarg, Papatriantafilou, Tsigas
1996Distributed 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
Garg-et-al96
Hide details for Garg, VaziraniGarg, Vazirani
1996Approximate max-flow min-(multi)cut theorems and their applications
In: SIAM Journal on Computing [25], 235-251
Garg-Vazirani96
1995A polyhedron with all s-t cuts as vertices, and adjacency of cuts
In: Mathematical Programming (A) [70], 17-25
Garg-Vazirani-95
Hide details for Gasieniec, IndykGasieniec, Indyk
1997Efficient Parallel Computing with Memory Faults
In: Proceedings of the 11th Symposium on Fundamentals of Computation Theory (FCT-97), 188-197
GasieniecIndyk97
Hide details for Gasieniec, Indyk, KrystaGasieniec, Indyk, Krysta
1997External inverse pattern matching
In: Proceedings of the 8th Symposium on Combinatorial Pattern Matching (CPM-97), 90-101
Gasieniec-Indyk-Krysta97
Hide details for Gasieniec, Jansson, Lingas, ÖstlinGasieniec, Jansson, Lingas, Östlin
1997On the complexity of computing evolutionary trees
In: Proceedings of the 3rd International Conference on Computing and Combinatorics (COCOON-97), 134-145
GasienicJanssonLingasOestlin1997
Hide details for Gasieniec, Karpinski, Plandowski, RytterGasieniec, Karpinski, Plandowski, Rytter
1996Efficient Algorithms for Lempel-Ziv Encoding
In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, 392-403
Gasieniec1-96
1996Randomized Efficient Algorithms for Compressed Strings: the Finger-Print Approach
In: Combinatorial Pattern Matching: 7th Annual Symposium (CPM'96), 39-49
Gasieniec5-96
Hide details for Gasieniec, Kranakis, Krizanc, PelcGasieniec, Kranakis, Krizanc, Pelc
1996Minimizing Congestion of Layouts for ATM Networks with Faulty Links
In: Mathematical Foundations of Computer Science 1996: 21st International Symposium (MFCS'96), 392-403
Gasieniec3-96
Hide details for Gasieniec, PelcGasieniec, Pelc
1997Broadcasting with a bounded fraction of faulty nodes
In: Journal of Parallel and Distributed Computing [42], 11-20
GasieniecPelc97
1996Adaptive Broadcasting with Faulty Nodes
In: Parallel Computing [22], 903-912
Gasieniec6-96
Hide details for GastGast
1997Das Maximum-Weight-Trace-Problem bei multiplem Sequenz-Alignment
Universität des Saarlandes
Gast97
Hide details for GawrychowskiGawrychowski
2014Simple and efficient LZW-compressed multiple pattern matching
In: Journal of Discrete Algorithms [25], 34-41
Gawrychowski2014e
2013Alphabetic Minimax Trees in Linear Time
In: 8th International Computer Science Symposium in Russia (CSR 2013), 36-48
Gawrychowski2013alphabetic
2012Faster Algorithm for Computing the Edit Distance between SLP-Compressed Strings
In: String Processing and Information Retrieval : 19th International Symposium, SPIRE 2012, 229-236
Gawrychowski2012c
2012Simple and efficient LZW-compressed multiple pattern matching
In: Combinatorial Pattern Matching : 23rd Annual Symposium, CPM 2012, 232-242
Gawrychowski2012b
2012Tying up the loose ends in fully LZW-compressed pattern matching
In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, 624-635
Gawrychowski2012a
Hide details for Gawrychowski, Jez, JezGawrychowski, Jez, Jez
2014Validating the Knuth-Morris-Pratt Failure Function, Fast and Online
In: Theory of Computing Systems [54], 337-372
GawrychowskiJez2014
Hide details for Gawrychowski, Kucherov, Nekrich, StarikovskayaGawrychowski, Kucherov, Nekrich, Starikovskaya
2013Minimal Discriminating Words Problem Revisited
In: String Processing and Information Retrieval - 20th International Symposium (SPIRE 2013),
Gawrychowski2013discriminating
Hide details for Gawrychowski, Manea, Mercas, Nowotka, TiseanuGawrychowski, Manea, Mercas, Nowotka, Tiseanu
2013Finding Pseudo-repetitions
In: 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), 257-268
Gawrychowski2013
Hide details for Gawrychowski, Manea, NowotkaGawrychowski, Manea, Nowotka
2014Testing Generalised Freeness of Words
In: 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 337-349
Gawrychowski2014
2013Discovering Hidden Repetitions in Words
In: 9th Conference on Computability in Europe (CiE 2013), 210-219
Gawrychowski2013discovering
Hide details for Gawrychowski, Mozes, WeimannGawrychowski, Mozes, Weimann
2014Improved 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
Gawrychowski2014b
Hide details for Gawrychowski, StraszakGawrychowski, Straszak
2013Beating O(nm) in Approximate LZW-Compressed Pattern Matching
In: Algorithms and Computation - 24th International Symposium (ISAAC 2013), 78-88
Gawrychowski2013beating
Hide details for Gawrychowski, UznanskiGawrychowski, Uznanski
2014Order-Preserving Pattern Matching with k Mismatches
In: Combinatorial Pattern Matching - 25th Annual Symposium, CPM 2014, Moscow, Russia, June 16-18, 2014. Proceedings, 130-139
Gawrychowski2014c
Hide details for Geismann, Hemmer, SchömerGeismann, Hemmer, Schömer
2001Computing 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
ghs-qsi-01
2001The Convex Hull of Ellipsoids (Video)
In: Proceedings of the 17th Annual Symposium on Computational Geometry (SCG-01), 321-322
ghs-che-01
Hide details for Georgiou, Kowalski, ShvartsmanGeorgiou, Kowalski, Shvartsman
2005Efficient gossip and robust distributed computation
In: Theoretical Computer Science [347], 130-166
GKS
2003Efficient Gossip and Robust Distributed Computation
In: Distributed Computing, 17th International Conference (DISC 2003), 224-238
GKS-DISC2003
Hide details for GergovGergov
2000Algorithms for Interval Coloring, Geometric Packing and Memory Optimization
Universität des Saarlandes
GergovDiss00
1996Approximation Algorithms for Dynamic Storage Allocation
In: Algorithms - ESA '96: 4th Annual European Symposium, 52-61
Gergov-et-al96
Hide details for Gergov, MeinelGergov, Meinel
1996Mod-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
Gergov-Meinel96
Hide details for Giakkoupis, SauerwaldGiakkoupis, Sauerwald
2012Rumor spreading and vertex expansion
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 1623-1641
GiakkoupisS12
Hide details for Giakkoupis, Sauerwald, Sun, WoelfelGiakkoupis, Sauerwald, Sun, Woelfel
2012Low Randomness Rumor Spreading via Hashing
In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, 314-325
Sun2012a
Hide details for Giannopoulos, Klein, Kutz, MarxGiannopoulos, Klein, Kutz, Marx
2010Computing geometric minimum-dilation graphs is NP-hard
In: International Journal of Computational Geometry & Applications [20], 147-173
Giannopoulos2010
Hide details for Giannopoulos, Knauer, Wahlström, WernerGiannopoulos, Knauer, Wahlström, Werner
2012Hardness of discrepancy computation and ε-net verification in high dimension
In: Journal of Complexity [28], 162-176
GKWahlstroemW2012
Hide details for Gidenstam, PapatriantafilouGidenstam, Papatriantafilou
2007LFthreads: A Lock-Free Thread Library
In: 11th International Conference On Principles Of Distributed Systems (OPODIS), 217-231
Gidenstam2007a
Hide details for Gidenstam, Papatriantafilou, Sundell, TsigasGidenstam, Papatriantafilou, Sundell, Tsigas
2009Efficient and Reliable Lock-Free Memory Reclamation Based on Reference Counting
In: IEEE Transactions on Parallel and Distributed Systems [20], 1173-1187
Gidenstam200902
Hide details for Gidenstam, Papatriantafilou, TsigasGidenstam, Papatriantafilou, Tsigas
2010NBmalloc: Allocating Memory in a Lock-Free Manner
In: Algorithmica [58], 304-338
Gidenstam2010
2009NBmalloc : Allocating Memory in a Lock-Free Manner
In: Algorithmica [Online First], 1-35
Gidenstam200903
Hide details for GiesenGiesen
2008Conjoint Analysis for Measuring the Perceived Quality in Volume Rendering
In: IEEE Transactions on Visualization and Computer Graphics [13], 1664-1671
Giesen2007c
2008Delaunay Triangulation Approximates Anchor Hull
In: Computational Geometry - Theory and Applications [36], 131-143
Giesen2007b
2008The Flow Complex: A Data Structure for Geometric Modeling
In: Computational Geometry - Theory and Applications [39], 178-190
Giesen2008z
2007Medial Axis Approximation from Inner Voronoi Balls: A Demo of the Mesecina Tool
In: 23d Annual ACM Symposium on Computational Geometry, 123-124
Giesen2007e
2007The Combinatorial Structure of Polyhedral Choice Based Conjoint Analysis
In: Conjoint Measurement: Methods and Applications, 259-271
Giesen2007conj
Hide details for Giesen, ManjunathGiesen, Manjunath
2009Minimizing Absolute Gaussian Curvature over Meshes
In: Computational Geometry, 1-16
Manjunath2009a

Previous Page | Next Page | Expand All | Collapse All | Search (Full Text)