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: 3. Type of Publication - 1. All Types

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

#Author/EditorYearTitle
16
Show details for BookBook
50
Show details for Part of a BookPart of a Book
18
Show details for ProceedingsProceedings
1060
Show details for Proceedings ArticleProceedings Article
37
Show details for Electronic Proceedings ArticleElectronic Proceedings Article
1
Show details for PosterPoster
713
Hide details for Journal ArticleJournal Article
Abraham, David J.
Irving, Robert W.
Kavitha, Telikepalli
Mehlhorn, Kurt
2007Attachment IconPopular Matchings
In: SIAM Journal on Computing [37], 1030-1045
Adler, Micah
Räcke, Harald
Sivadasan, Naveen
Sohler, Christian
Vöcking, Berthold
2003Attachment IconRandomized Pursuit-Evasion in Graphs
In: Combinatorics, Probability and Computing [12], 225-244
Ahuja, Nitin
Baltz, Andreas
Doerr, Benjamin
Privetivy, Ales
Srivastav, Anand
2007On the Minimum Load Coloring Problem
In: Journal of Discrete Algorithms [5], 533-545
Ahuja, Nitin
Baltz, Andreas
Doerr, Benjamin
Srivastav, Anand
2004Coloring Graphs with Minimal Load
In: Electronic Notes in Discrete Mathematics [17], 129-133
Ahuja, Ravindra K.
Mehlhorn, Kurt
Orlin, James B.
Tarjan, Robert E.
1990Attachment IconFaster algorithms for the shortest path problem
In: Journal of the ACM [37], 213-223
Ailon, Nir
Avigdor-Elgrabli, Noa
Liberty, Edo
van Zuylen, Anke
2012Improved Approximation Algorithms for Bipartite Correlation Clustering
In: SIAM Journal on Computing [41], 1110-1121
Ajwani, Deepak
Elbassioni, Khaled
Govindarajan, Sathish
Ray, Saurabh
2012Conflict-free coloring for rectangle ranges using O(n .382) colors
In: Discrete & Computational Geometry [48], 39-52
Ajwani, Deepak
Friedrich, Tobias
2010Average-case Analysis of Incremental Topological Ordering
In: Discrete Applied Mathematics [158], 240-250
Ajwani, Deepak
Friedrich, Tobias
Meyer, Ulrich
2008An $O(n^2.75)$ algorithm for incremental topological ordering
In: ACM Transactions on Algorithms [4], 1-14
Albers, Susanne1999Better bounds for online scheduling
In: SIAM Journal on Computing [29], 459-473
Albers, Susanne1998A competitive analysis of the list update problem with lookahead
In: Theoretical Computer Science [197], 95-109
Albers, Susanne1998Improved randomized on-line algorithms for the list update problem
In: SIAM Journal on Computing [27], 682-693
Albers, Susanne1997On the Influence of Lookahead in Competitive Paging Algorithms
In: Algorithmica [18], 283-305
Albers, Susanne
Garg, Naveen
Leonardi, Stefano
2000Minimizing stall time in single and parallel disk systems
In: Journal of the ACM [47], 969-986
Albers, Susanne
Hagerup, Torben
1997Improved Parallel Integer Sorting without Concurrent Writing
In: Information and Computation [136], 25-51
Albers, Susanne
Koga, Hisashi
1998New on-line algorithms for the page replication problem
In: Journal of Algorithms [27], 75-96
Albers, Susanne
Kursawe, Klaus
Schuierer, Sven
2002Exploring unkown environments with obstacles
In: Algorithmica [32], 123-143
Albers, Susanne
Mitzenmacher, Michael
2000Average-Case Analyses of First Fit and Random Fit Bin Packing
In: Random Structures & Algorithms [16], 240 - 259
Albers, Susanne
Mitzenmacher, Michael
1998Average case analyses of list update algorithms, with applications to data compression
In: Algorithmica [21], 312-329
Albers, Susanne
Mitzenmacher, Michael
1997Revisiting the COUNTER algorithms for list update
In: Information Processing Letters [64], 155-160
Albers, Susanne
von Stengel, Bernhard
Wechner, Ralph
1995A combined BIT and TIMESTAMP algorithm for the list update problem
In: Information Processing Letters [56], 135-139
Alcaraz, Nicolas
Friedrich, Tobias
Kötzing, Timo
Krohmer, Anton
Müller, Joachim
Pauling, Josch
Baumbach, Jan
2012Efficient key pathway mining: combining networks and OMICS data
In: Integrative Biology [4], 756-764
Alon, Noga
Bradford, Phillip Gnassi
Fleischer, Rudolf
1996Matching nuts and bolts faster
In: Information Processing Letters [59], 123-127
Altenkamp, Doris
Mehlhorn, Kurt
1980Attachment IconCodes: Unequal Probabilities, Unequal Letter Cost
In: Journal of the ACM [27], 412-427
Althaus, Ernst
Calinescu, Gruia
Mandoiu, Ion
Prasad, Sushil
Tchervenski, Nickolay
Zelikovsly, Alexander
2006Power efficient range assignment for symmetric connectivity in static ad-hoc wireless networks
In: Wireless Networks [12], 287-299
Althaus, Ernst
Canzar, Stefan
2008A Lagrangian relaxation approach for the multiple sequence alignment problem
In: Journal of Combinatorial Optimization [16], 127-154
Althaus, Ernst
Canzar, Stefan
Elbassioni, Khaled
Karrenbauer, Andreas
Mestre, Julian
2011Approximation Algorithms for the Interval Constrained Coloring Problem
In: Algorithmica [61], 342-361
Althaus, Ernst
Caprara, Alberto
Lenhof, Hans-Peter
Reinert, Knut
2006Aligning multiple sequences by cutting planes
In: Mathematical Programming [2006], 387-425
Althaus, Ernst
Duchier, Denys
Koller, Alexander
Mehlhorn, Kurt
Niehren, Joachim
Thiel, Sven
2003Attachment IconAn Efficient Algorithm for the Configuration Problem of Dominance Graphs
In: Journal of Algorithms [48], 194-219
Althaus, Ernst
Funke, Stefan
Har-Peled, Sariel
Könemann, Jochen
Ramos, Edgar A.
Skutella, Martin
2005Approximating k-Hop Minimum-Spanning Trees
In: Operations Research Letters [33], 115-120
Althaus, Ernst
Kohlbacher, Oliver
Lenhof, Hans-Peter
Müller, Peter
2002A combinatorial approach to protein docking with flexible side chains
In: Journal of Computational Biology [9], 597-612
Althaus, Ernst
Mehlhorn, Kurt
2001Attachment IconTraveling Salesman-Based Curve Reconstruction in Polynomial Time
In: SIAM Journal on Computing [31], 27-66
Althaus, Ernst
Mehlhorn, Kurt
1998Attachment IconMaximum Network Flow with Floating Point Arithmetic
In: Information Processing Letters [66], 109-113
Alt, Helmut
Blum, Norbert
Mehlhorn, Kurt
Paul, Markus
1991Attachment IconComputing a maximum cardinality matching in a bipartite graph in time $O(n^1.5 \sqrtm/\log n)$
In: Information Processing Letters [37], 237-240
Alt, Helmut
Fleischer, Rudolf
Kaufmann, Michael
Mehlhorn, Kurt
Näher, Stefan
Schirra, Stefan
Uhrig, Christian
1992Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
In: Algorithmica [8], 391-408
Alt, Helmut
Geffert, Viliam
Mehlhorn, Kurt
1992Attachment IconA lower bound for the nondeterministic space complexity of context-free recognition
In: Information Processing Letters [42], 25-27
Alt, Helmut
Guibas, L.
Mehlhorn, Kurt
Karp, Richard M.
Wigderson, A.
1996Attachment IconA Method for Obtaining Randomized Algorithms with Small Tail Probabilities
In: Algorithmica [16], 543-547
Alt, Helmut
Hagerup, Torben
Mehlhorn, Kurt
Preparata, Franco P.
1987Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
In: SIAM Journal on Computing [16], 808-835
Alt, Helmut
Mehlhorn, Kurt
1985Attachment IconSearching Semisorted Tables
In: SIAM Journal on Computing [14], 840-848
Alt, Helmut
Mehlhorn, Kurt
1979Attachment IconComplexity arguments in algebraic language theory
In: Revue française d'automatique, d'informatique et de recherche opérationnelle : RAIRO / Association Française pour la Cybernétique Economique et Technique [13], 217-225
Alt, Helmut
Mehlhorn, Kurt
1975Attachment IconA Language over a One Symbol Alphabet Requiring only O(log log n) Space
In: SIGACT News [7], 31-33
Alt, Helmut
Mehlhorn, Kurt
Munro, J.
1984On the complexity of partial match retrieval
In: Information Processing Letters [19], 61-65
Alt, Helmut
Mehlhorn, Kurt
Munro, J. Ian
1984Attachment IconPartial match retrieval in implicit data structures
In: Information Processing Letters [19], 61-65
Alt, Helmut
Mehlhorn, Kurt
Wagener, Hubert
Welzl, Emo
1988Attachment IconCongruence, Similarity, and Symmetries of Geometric Objects
In: Discrete and Computational Geometry [3], 237-256
Amini, Omid
Pérennes, Stéphane
Sau, Ignasi
2009Hardness and approximation of traffic grooming
In: Theoretical Computer Science [410], 3751-3760
Andersson, Arne
Hagerup, Torben
Hastad, Johan
Petersson, Ola
2000Tight bounds for searching a sorted array of strings
In: SIAM Journal on Computing [30], 1552-1578
Angelopoulos, Spyros
Borodin, Allan
2010Randomized Priority Algorithms
In: Theoretical Computer Science [411], 2542-2558
Arge, Lars
Meyer, Ulrich
Toma, Laura
Zeh, Norbert
2003On external-memory planar depth first search
In: Journal of Graph Algorithms and Applications [7], 105-129
Arikati, Srinivasa Rao
Chaudhuri, Shiva
Zaroliagis, Christos
1998All-Pairs Min-Cut in Sparse Networks
In: Journal of Algorithms [29], 82-110
Arikati, Srinivasa Rao
Dessmark, Anders
Lingas, Andrzej
Marathe, Madhav V.
2001Approximation algorithms for maximum two-dimensional pattern matching
In: Theoretical Computer Science [255], 51-62
Arikati, Srinivasa Rao
Maheshwari, Anil
1996Realizing degree sequences in parallel
In: SIAM Journal of Computing [9], 317-338
Arikati, Srinivasa Rao
Maheshwari, Anil
Zaroliagis, Christos
1997Efficient Computation of implicit representations of sparse graphs
In: Discrete Applied Mathematics [78], 1-16
Arikati, Srinivasa Rao
Mehlhorn, Kurt
1999Attachment IconA correctness certificate for the Stoer-Wagner min-cut algorithm
In: Information Processing Letters [70], 251-254
Aronov, Boris
Asano, Tetsuo
Katoh, Naoki
Mehlhorn, Kurt
Tokuyama, Takeshi
2006Polyline Fitting of Planar Points under Min-sum Criteria
In: International Journal of Computational Geometry and Applications [16], 97-116
Arya, Sunil
Golin, Mordecai J.
Mehlhorn, Kurt
1999On the Expected Depth of Random Circuits
In: Combinatorics, Probability and Computing [8], 209-228
Arya, Sunil
Malamatos, Theocharis
Mount, David M.
2007A simple entropy-based algorithm for planar point location
In: ACM Transactions on Algorithms [3], 17
Arya, Sunil
Malamatos, Theocharis
Mount, David M.
Wong, Ka Chun
2007Optimal expected-case planar point location
In: SIAM Journal on Computing [37], 584-610
Arya, Sunil
Mount, David M.
2000Approximate range searching
In: Computational Geometry [17], 135-152
Arya, Sunil
Mount, David M.
Narayan, Oruttom
1996Accounting for boundary effects in nearest neighbor searching
In: Discrete & Computational Geometry [16], 155-176
Arya, Sunil
Smid, Michiel
1997Efficient construction of a bounded degree spanner with low weight
In: Algorithmica [17], 33-54
Auletta, Vincenzo
Dinitz, Yefim
Nutov, Zeev
Parente, Domenico
1999A 2-approximation algorithm for finding an optimum 3-vertex-connected spanning subgraph
In: Journal of Algorithms [32], 21-30
Bachrach, Ran
El-Yaniv, Ran
Reinstädtler, Martin
2002On the competitive theory and practice of online list accessing algorithms
In: Algorithmica [32], 201-246
Banderier, Cyril2001Random Maps, Coalescing Saddles, Singularity Analysis, and Airy Phenomena
In: Random Structures & Algorithms [19], 194-246
Banderier, Cyril
Bousquet-Mélou, Mireille
Denise, Alain
Flajolet, Philippe
Gardy, Danièle
Gouyou-Beauchamps, Dominique
2002Generating Functions for Generating Trees
In: Discrete Mathematics [246], 29-55
Banderier, Cyril
Flajolet, Philippe
2002Basic analytic combinatorics of directed lattice paths
In: Theoretical Computer Science [281], 37-80
Bansal, Nikhil
Chan, Ho-Leung
Pruhs, KIrk
2011Competitive Algorithms for Due Date Schedulin
In: Algorithmica [59], 569-582
Bar-Yehuda, Reuven
Hermelin, Danny
Rawitz, Dror
2011Minimum vertex cover in rectangle graphs
In: Computational Geometry [44], 356-364
Bárány, Imre
Doerr, Benjamin
2006Attachment IconBalanced partitions of vector sequences
In: Linear Algebra and Its Applications [414], 464-469
Barnes, Greg
Edmonds, Jeff A.
1998Time-Space Lower Bounds for Directed st-Connectivity on Graph Automata Models
In: SIAM Journal on Computing [27], 1190-1202
Baruah, Sanjoy
Bonifaci, Vincenzo
D'Angelo, Gianlorenzo
Li, Haohan
Marchetti-Spaccamela, Alberto
Megow, Nicole
Stougie, Leen
2012Scheduling Real-Time Mixed-Criticality Jobs
In: IEEE Transactions on Computers [61], 1140-1152
Baruah, Sanjoy
Bonifaci, Vincenzo
Marchetti-Spaccamela, Alberto
Stiller, Sebastian
2010Attachment IconImproved Multiprocessor Global Schedulability Analysis
In: Real-Time Systems [46], 3-24
Basit, Abdul
Mustafa, Nabil H.
Ray, Saurabh
Raza, Sarfraz
2010Centerpoints and Tverberg's technique
In: Computational Geometry [43], 593-600
Bast, Hannah2000On Scheduling Parallel Tasks at Twilight
In: Theory of Computing Systems [33], 489-563
Bast, Hannah
Hagerup, Torben
1995Fast Parallel Space Allocation, Estimation, and Integer Sorting
In: Information and Computation [123], 72-110
Bast, Holger2005Attachment IconPräzisionssuche im homöopathischen Netz
In: Homöopathie-Zeitschrift [I/05], 119-122
Bast, Holger
Funke, Stefan
Sanders, Peter
Schultes, Dominik
2007Fast Routing in Road Networks using Transit Nodes
In: Science [316], 566
Bast, Holger
Mehlhorn, Kurt
Schäfer, Guido
Tamaki, Hisao
2006Attachment IconMatching Algorithms are Fast in Sparse Random Graphs
In: Theory of Computing Systems [39], 3-14
Bast, Holger
Mehlhorn, Kurt
Schäfer, Guido
Tamaki, Hisao
2003Attachment IconA Heuristic for Dijkstra's Algorithm With Many Targets and its Use in Weighted Matching Algorithms
In: Algorithmica [36], 75-88
Baswana, Surender
Kavitha, Telikepalli
Mehlhorn, Kurt
Pettie, Seth
2011Additive Spanners and (α, β)-Spanners
In: ACM Transactions on Algorithms [7], 5:1-5:26
Baswana, Surender
Sen, Sandeep
2007A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs
In: Random Structures & Algorithms [30], 532-563
Batra, Prashant
Sharma, Vikram
2010Bounds on absolute positiveness of multivariate polynomials
In: Journal of Symbolic Computation [45], 617-628
Baumgarten, Hanna
Jung, Hermann
Mehlhorn, Kurt
1994Attachment IconDynamic point location in general subdivisions
In: Journal of Algorithms [3], 342-380
Becker, Michael
Degenhardt, W.
Doenhardt, J.
Hertel, S.
Kaninke, G.
Kerber, W.
Mehlhorn, Kurt
Näher, Stefan
Rohnert, H.
Winter, T.
1982Attachment IconA Probabilistic Algorithm for Vertex Connectivity of Graphs
In: Information Processing Letters [15], 135-136
Becker, Michael
Mehlhorn, Kurt
1986Attachment IconAlgorithms for Routing in Planar Graphs
In: Acta Informatica [23], 163-176
Beier, René
Czumaj, Artur
Krysta, Piotr
Vöcking, Berthold
2006Attachment IconComputing Equilibria for a Service Provider Game with (Im)perfect Information
In: ACM Transactions on Algorithms [2], 679-706
Beier, Rene
Funke, Stefan
Matijevic, Domagoj
Sanders, Peter
2011Energy-Efficient Paths in Radio Networks
In: Algorithmica [61], 298-319
Beier, René
Vöcking, Berthold
2006Attachment IconAn Experimental Study of Random Knapsack Problems
In: Algorithmica [45], 121-136
Beier, René
Vöcking, Berthold
2006Attachment IconTypical Properties of Winners and Losers in Discrete Optimization
In: SIAM Journal on Computing [35], 855-881
Beier, René
Vöcking, Berthold
2004Random knapsack in expected polynomial time
In: Journal of Computer and System Sciences [69], 306-329
Bein, Wolfgang W.
Fleischer, Rudolf
Larmore, Lawrence L.
2000Limited bookmark randomized online algorithms for the paging problem
In: Information Processing Letters [76], 155-162
Beldiceanu, Nicolas
Katriel, Irit
Thiel, Sven
2007Filtering Algorithms for the Same and UsedBy Constraints
In: Archives of Control Sciences [to appear], to appear
Belfrage, Michael
Mütze, Torsten
Spöhel, Reto
2012Probabilistic one-player Ramsey games via deterministic two-player games
In: SIAM Journal on Discrete Mathematics [26], 1031-1049
Ben-Asher, Y.
Schuster, Assaf
Sibeyn, Jop F.
1995Load balancing: A programmer's approach or the impact of task-length parameter on the load balancing performance of parallel programs
In: International Journal on High-Speed Computing [7], 303-326
Ben-Zwi, Oren
Hermelin, Danny
Lokshtanov, Daniel
Newman, Ilan
2011Treewidth governs the complexity of target set selection
In: Discrete Optimization [8], 87-96
Berberich, Eric
Emeliyanenko, Pavel
Kobel, Alexander
Sagraloff, Michael
2013Exact symbolic–numeric computation of planar algebraic curves
In: Theoretical Computer Science [491], 1-32
Berberich, Eric
Fogel, Efi
Halperin, Dan
Kerber, Michael
Setter, Ophir
2010Arrangements on Parametric Surfaces II: Concretizations and Applications
In: Mathematics in Computer Science [4], 67-91
Berberich, Eric
Fogel, Efi
Halperin, Dan
Mehlhorn, Kurt
Wein, Ron
2010Arrangements on Parametric Surfaces I: General Framework and Infrastructure
In: Mathematics in Computer Science [4], 45-66
Berberich, Eric
Halperin, Dan
Kerber, Michael
Pogalnikova, Roza
2012Deconstructing Approximate Offsets
In: Discrete & Computational Geometry [48], 964-989
Berberich, Eric
Kerber, Michael
Sagraloff, Michael
2010An efficient algorithm for the stratification and triangulation of an algebraic surface
In: Computational Geometry: Theory and Applications (CGTA) [43], 257-278
Berberich, Eric
Sagraloff, Michael
2009A Generic and Flexible Framework for the Geometrical and Topological Analysis of (Algebraic) Surfaces
In: Computer Aided Geometric Design (CAGD) [26], 627-647
Bilardi, Gianfranco
Chaudhuri, Shiva
Dubhashi, Devdatt
Mehlhorn, Kurt
1994Attachment IconA lower bound for area-universal graphs
In: Information Processing Letters [51], 101-105
Blum, Norbert
Mehlhorn, Kurt
1980Attachment IconOn the Average Number of Rebalancing Operations in Weight-Balanced Trees
In: Theoretical Computer Science [11], 303-320
Bodirsky, Manuel
Gröpl, Clemens
Johannsen, Daniel
Kang, Mihyun
2007Attachment IconA Direct Decomposition of 3-connected Planar Graphs
In: Séminaire Lotharingien de Combinatoire [B54Ak], 15
Bodirsky, Manuel
Kutz, Martin
2007Determining the consistency of partial tree descriptions
In: Artificial Intelligence [171], 185-196
Bodlaender, Hans L.
Deogun, Jitender S.
Jansen, Klaus
Kloks, Ton
Kratsch, Dieter
Müller, Haiko
Tuza, Zsolt
1998Ranking of Graphs
In: SIAM Journal on Discrete Mathematics [11], 168-181
Bodlaender, Hans L.
Hagerup, Torben
1998Parallel Algorithms with Optimal Speedup for Bounded Treewidth
In: SIAM Journal on Computing [27], 1725-1746
Bonifaci, Vincenzo
Chan, Ho-Leung
Marchetti-Spaccamela, Alberto
Megow, Nicole
2012Algorithms and Complexity for Periodic Real-Time Scheduling
In: ACM Transactions on Algorithms [9], 601-619
Bonifaci, Vincenzo
Harks, Tobias
Schäfer, Guido
2010Attachment IconStackelberg Routing in Arbitrary Networks
In: Mathematics of Operations Research [35], 330 - 346
Bonifaci, Vincenzo
Korteweg, Peter
Marchetti-Spaccamela, Alberto
Stougie, Leen
2011Attachment IconMinimizing Flow Time in the Wireless Gathering Problem
In: ACM Transactions on Algorithms [7], 33:1-33:20
Bonifaci, Vincenzo
Korteweg, Peter
Marchetti-Spaccamela, Alberto
Stougie, Leen
2011Attachment IconThe Distributed Wireless Gathering Problem
In: Theoretical Computer Science [412], 633-641
Bonifaci, Vincenzo
Marchetti-Spaccamela, Alberto
2012Attachment IconFeasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems
In: Algorithmica [63], 763-780
Bonifaci, Vincenzo
Marchetti-Spaccamela, Alberto
Stiller, Sebastian
2012Attachment IconA Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling
In: Algorithmica [62], 1034-1049
Bonifaci, Vincenzo
Mehlhorn, Kurt
Varma, Girish
2012Physarum Can Compute Shortest Paths
In: Journal of Theoretical Biology [309], 121-133
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa
2012On Nash equilibria and improvement cycles in pure positional strategies for Chess-like and Backgammon-like n-person games
In: Discrete Mathematics [312], 772-788
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa
2010On effectivity functions of game forms
In: Games and Economic Behavior [68], 512-531
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Tiwary, Hans Raj
2011The negative cycles polyhedron and hardness of checking some polyhedral properties
In: Annals of Operations Research [188], 63-76
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Tiwary, Hans Raj
2008Characterization of the vertices and extreme directions of the negative cycle polyhedron and hardness of generating vertices of 0/1-polyhedra
In: CoRR [abs/0801.3790], x-x
Boros, Endre
Elbassioni, Khaled
Makino, Kazuhisa
2010Left-to-right multiplication for monotone Boolean dualization
In: SIAM Journal on Computing [39], 3424-3439
Boros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, Vladimir
2003Attachment IconAn Inequality for Polymatroid Functions and its Applications
In: Discrete Applied mathematics [131], 27
Boros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, Vladimir
2003Attachment IconExtending the Balas-Yu Bounds on the Number of Maximal Independent Sets in Graphs to Hypergraphs and Lattices
In: Mathematical Programming, Ser. B [98], 14
Boros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, Vladimir
2000Attachment IconAn Efficient Incremental Algorithm for Generating All Maximal Independent Sets in Hypergraphs of Bounded Dimension
In: Parallel Processing Letters [10], 14
Boros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, Vladimir
Makino, Kazuhisa
2002Attachment IconDual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities
In: SIAM Journal on Computing [31], 20
Bouziane, Driss
El Kahoui, M'hammed
2002Attachment IconComputation of the dual of a plane projective curve
In: Journal of Symbolic Computation [34], 105-117
Bradford, Phillip Gnassi
Capoyleas, Vasilis
1997Weak epsilon-Nets for Points on a Hypersphere
In: Discrete & Computational Geometry [18], 83-91
Bradford, Phillip Gnassi
Fleischer, Rudolf
Smid, Michiel
1997More efficient parallel totally monotone matrix searching
In: Journal of Algorithms [23], 386-400
Bradford, Phillip Gnassi
Golin, Mordecai J.
Larmore, Lawrence L.
2002Optimal prefix-free codes for unequal letter costs: Dynamic programming with the Monge property
In: Journal of Algorithms [42], 277-303
Bradford, Phillip Gnassi
Rawlins, Gregory J.E.
Shannon, Greogory E.
1998Efficient Matrix Chain Ordering in Polylog Time
In: SIAM Journal on Computing [27], 466-490
Brandenburg, Franz J.
Jünger, Michael
Mutzel, Petra
1997Algorithmen zum automatischen Zeichnen von Graphen
In: Informatik Spektrum [20], 199-207
Breslauer, Dany
Jiang, Tao
Jiang, Zhigen
1997Rotations of periodic strings and short superstrings
In: Journal of Algorithms [24], 340-353
Breslauer, Dany
Ramesh, Hariharan
1996Optimal Parallel Construction of Minimal Suffix and Factor Automata
In: Parallel Processing Letters [6], 35-44
Brightwell, Graham
Panagiotou, Konstantinos
Steger, Angelika
2012Extremal subgraphs of random graphs
In: Random Structures & Algorithms [41], 147-178
Bringmann, Karl2012Attachment IconAn improved algorithm for Klee's measure problem on fat boxes
In: Computational Geometry: Theory and Applications [45], 225-233
Bringmann, Karl
Friedrich, Tobias
2013Approximation Quality of the Hypervolume Indicator
In: Artificial Intelligence [195], 265–290
Bringmann, Karl
Friedrich, Tobias
2012Approximating the least hypervolume contributor: NP-hard in general, but fast in practice
In: Theoretical Computer Science [425], 104-116
Bringmann, Karl
Friedrich, Tobias
2010An Efficient Algorithm for Computing Hypervolume Contributions
In: Evolutionary Computation [18], 383-402
Bringmann, Karl
Friedrich, Tobias
2010Approximating the volume of unions and intersections of high-dimensional geometric objects
In: Computational Geometry [43], 601-610
Bringmann, Karl
Friedrich, Tobias
Igel, Christian
Voß, Thomas
2013Speeding Up Many-Objective Optimization by Monte Carlo Approximations
In: Artificial Intelligence [204], 22–29
Brockhoff, Dimo
Friedrich, Tobias
Hebbinghaus, Nils
Klein, Christian
Neumann, Frank
Zitzler, Eckart
2009On the Effects of Adding Objectives to Plateau Functions
In: IEEE Transactions on Evolutionary Computation [13], 591-603
Brodal, Gerth Stølting
Chaudhuri, Shiva
Radhakrishnan, R.
1996The randomized complexity of maintaining the minimum
In: Nordic Journal of Computing [3], 337-351
Brodal, Gerth Stølting
Träff, Jesper Larsson
Zaroliagis, Christos
1998A Parallel Priority Queue with Constant Time Operations
In: Journal of Parallel and Distributed Computing, Special Issue on Parallel Data Structures [49], 4-21
Brönnimann, Hervé
Burnikel, Christoph
Pion, Sylvain
2001Interval arithmetic yields efficient dynamic filters for computational geometry
In: Discrete Applied Mathematics [109], 25-47
Brönnimann, Hervé
Kettner, Lutz
Pocchiola, Michel
Snoeyink, Jack
2006Attachment IconCounting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm
In: SIAM Journal on Computing [36], 721-739
Brown, Christopher
El Kahoui, M'hammed
Novotni, Dominik
Weber, Andreas
2006Attachment IconAlgorithmic methods for investigating equilibria in epidemic modeling
In: Journal of Symbolic Computation [41], 1157-1173
Bundy, David
Hebbinghaus, Nils
Stellmacher, Bernd
2006Attachment IconThe Local C(G,T) Theorem
In: Journal of Algebra [300], 741-789
Burkhardt, Stefan
Kärkkäinen, Juha
2003Better Filtering with Gapped q-Grams
In: Fundamenta Informaticae [56], 51-70
Burnikel, Christoph
Fleischer, Rudolf
Mehlhorn, Kurt
Schirra, Stefan
2000Attachment IconA strong and easily computable separation bound for arithmetic expressions involving radicals
In: Algorithmica [27], 87-99
Burnikel, Christoph
Funke, Stefan
Mehlhorn, Kurt
Schirra, Stefan
Schmitt, Susanne
2009A Separation Bound for Real Algebraic Expressions
In: Algorithmica [55], 14-28
Burnikel, Christoph
Funke, Stefan
Seel, Michael
2001Exact geometric computation using Cascading
In: International Journal of Computational Geometry & Applications [11], 245-266
Butman, Ayelet
Hermelin, Danny
Lewenstein, Moshe
Rawitz, Dror
2010Optimization problems in multiple-interval graphs
In: ACM Transactions on Algorithms [6], 40,1-40,18
Calinescu, Gruia
Fernandes, Cristina G.
Finkler, Ulrich
Karloff, Howard
1998A Better Approximation Algorithm for Finding Planar Subgraphs
In: Journal of Algorithms [27], 269-302
Caragiannis, Ioannis
Fishkin, Aleksei V.
Kaklamanis, Christos
Papaioannou, Evi
2007A tight bound for online colouring of disk graphs
In: Theoretical Computer Science [384], 152-160
Case, John
Kötzing, Timo
2012Computability-theoretic learning complexity
In: Philosophical Transaction of the Royal Society A [370], 3570-3596
Case, John
Kötzing, Timo
2012Learning secrets interactively. Dynamic modeling in inductive inference
In: Information and Computation [220-221], 60-73
Chan, Ho-Leung
Edmonds, Jeff
Lam, Tak-Wah
Lee, Lap-Kei
Marchetti-Spaccamela, Alberto
Pruhs, Kirk
2011Nonclairvoyant speed scaling for flow and energy
In: Algorithmica [61], 507-517
Chan, Ho-Leung
Lam, Tak-Wah
Lee, Lap-Kei
Ting, Hing-Fung
2012Continuous Monitoring of Distributed Data Streams over a Time-Based Sliding Window
In: Algorithmica [62], 1088-1111
Chan, Ho-Leung
Megow, Nicole
Sitters, René
van Stee, Rob
2012Attachment IconA note on sorting buffers offline
In: Theoretical Computer Science [423], 11-18
Chan, T-H. Hubert
Dhamdhere, Kedar
Gupta, Anupam
Kleinberg, Jon
Slivkins, Aleksandrs
2009Metric Embeddings with Relaxed Guarantees
In: SIAM Journal on Computing [38], 2303-2329
Chan, T.-H. Hubert
Elbassioni, Khaled
2011A QPTAS for TSP with Fat Weakly Disjoint Neighborhoods in Doubling Metrics
In: Discrete & Computational Geometry [46], 704-723
Chan, T.-H. Hubert
Gupta, Anupam
2009Small Hop-diameter Sparse Spanners for Doubling Metrics
In: Discrete and Computational Geometry [41], 28-44
Chaudhuri, Shiva1996Sensitive functions and approximate problems
In: Information and Computation [126], 161-168
Chaudhuri, Shiva
Dimopoulos, Yannis
Zaroliagis, Christos
1996On the Parallel Complexity of Acyclic Logic Programs
In: Parallel Processing Letters [6], 223-230
Chaudhuri, Shiva
Dubhashi, Devdatt
1997Probabilistic recurrence relations revisited
In: Theoretical Computer Science [181], 45-56
Chaudhuri, Shiva
Garg, Naveen
Ravi, R.
1998The $p$-neighbor $k$-center problem
In: Information Processing Letters [65], 131-134
Chaudhuri, Shiva
Radhakrishnan, Jaikumar
1997The Complexity of Parallel Prefix Problems on Small Domains
In: Information and Computation [138], 1-22
Chaudhuri, Shiva
Subrahmanyam, K. V.
Wagner, Frank
Zaroliagis, Christos
2000Computing mimicking networks
In: Algorithmica [26], 31-49
Chaudhuri, Shiva
Zaroliagis, Christos
2000Shortest paths in digraphs of small treewidth. Part I, Sequential algorithms
In: Algorithmica [27], 212-226
Chaudhuri, Shiva
Zaroliagis, Christos
1998Shortest paths in digraphs of small treewidth. Part II: Optimal parallel algorithms
In: Theoretical Computer Science [203], 205-223
Chen, Xujin
Epstein, Leah
Kleiman, Elena
van Stee, Rob
2013Attachment IconMaximizing the minimum load: The cost of selfishness
In: Theoretical Computer Science [482], 9-19
Cheriyan, Joseph
Hagerup, Torben
1995A Randomized Maximum-Flow Algorithm
In: SIAM Journal on Computing [24], 203-226
Cheriyan, Joseph
Hagerup, Torben
Mehlhorn, Kurt
1996An o(n³)-Time Maximum-Flow-Algorithm: Can a Maximum Flow be Computed in o(nm) Time?
In: SIAM Journal on Computing [25], 1144-1170
Cheriyan, Joseph
Mehlhorn, Kurt
1999Attachment IconAn analysis of the highest-level selection rule in the preflow-push max-flow algorithm
In: Information Processing Letters [69], 239-242
Cheriyan, Joseph
Mehlhorn, Kurt
1996Attachment IconAlgorithms for Dense Graphs and Networks on the Random Access Computer
In: Algorithmica [15], 521-549
Ching, Yu-Tai
Mehlhorn, Kurt
Smid, Michiel H. M.
1990Dynamic deferred data structuring
In: Information Processing Letters [35], 37-40
Chin, Francis Y. L.
Guo, Zeyu
Sun, He
2011Minimum Manhattan Network is NP-Complete
In: Discrete & Computational Geometry [45], 701-722
Chlebus, Bogdan S.
Kowalski, Dariusz
2004Randomization helps to perform independent tasks reliably
In: Random Structures and Algorithms [24], 11-41
Chong, Ka Wong
Lam, Tak Wah
1998Approximating Biconnectivity in Parallel
In: Algorithmica [21], 395-410
Christodoulou, George
Koutsoupias, Elias
2009Mechanism Design for Scheduling
In: Bulletin of European Association for Theoretical Computer Science [97], 40-59
Christodoulou, George
Koutsoupias, Elias
Kovács, Annamária
2010Mechanism Design for Fractional Scheduling on Unrelated Machines
In: ACM Transactions on Algorithms [6], 38:1-38:18
Christodoulou, George
Koutsoupias, Elias
Nanavati, Akash
2009Coordination Mechanisms
In: Theoretical Computer Science [410], 3327-3336
Christodoulou, George
Koutsoupias, Elias
Vidali, Angelina
2009A lower bound for scheduling mechanisms
In: Algorithmica [85], 729-740
Christodoulou, George
Kovacs, Annamaria
van Stee, Rob
2013Attachment IconA truthful constant approximation for maximizing the minimum load on related machines
In: Theoretical Computer Science [489-490], 88-98
Christof, Thomas
Jünger, Michael
Kececioglu, John
Mutzel, Petra
Reinelt, Gerhard
1997A Branch-And-Cut Approach to Physical Mapping of Chromosomes by Unique End-Probes
In: Journal of Computational Biology [4], 433-447
Chrobak, Marek
Dürr, Christoph
Jawor, Wojciech
Kowalik, Lukasz
Kurowski, Maciej
2006A Note on Scheduling Equal-Length Jobs to Maximize Throughput
In: Journal of Scheduling [9], 71-73
Chrobak, Marek
Gasieniec, Leszek
Kowalski, Dariusz R.
2007The wake-up problem in multihop radio networks
In: SIAM Journal on Computing [36], 1453-1471
Cilleruelo, Javier
Hebbinghaus, Nils
2009Discrepancy in generalized arithmetic progressions
In: European Journal of Combinatorics [30], 1607-1611
Clarkson, Kenneth L.
Mehlhorn, Kurt
Seidel, Raimund
1993Attachment IconFour Results on Randomized Incremental Constructions
In: Computational Geometry: Theory and Applications [3], 185-212
Cole, Richard
Farach-Colton, Martin
Hariharan, Ramesh
Przytycka, Teresa
Thorup, Mikkel
2000An O(n log n) algorithm for the maximum agreement subtree problem for binary trees
In: SIAM Journal on Computing [30], 1385-1404
Cole, Richard
Hariharan, Ramesh
Paterson, Mike
Zwick, Uri
1995Tighter Lower Bounds on the Exact Complexity of String Matching
In: SIAM Journal on Computing [24], 30-45
Cole, Richard
Kowalik, Lukasz
2008New Linear-Time Algorithms for Edge-Coloring Planar Graphs
In: Algorithmica [50], 351-368
Cole, Richard
Kowalik, Lukasz
Skrekovski, Riste
2007A Generalization of Kotzig's Theorem and Its Application
In: SIAM Journal on Discrete Mathematics [21], 93-106
Cole, Richard
Ost, Kirstin
Schirra, Stefan
2001Edge-Coloring Bipartite Multigraphs in O(E log D) Time
In: Combinatorica [21], 5-12
Cooley, Oliver
Fountoulakis, Nikolaos
Kühn, Daniela
Osthus, Deryk
2009Embeddings and Ramsey numbers of sparse k-uniform hypergraphs
In: Combinatorica [29], 263-297
Cooley, Oliver
Fountoulakis, Nikolaos
Kühn, Daniela
Osthus, Deryk
20083-Uniform hypergraphs of bounded degree have linear Ramsey numbers
In: Journal of Combinatorial Theory B [98], 484-505
Cooper, Colin
Frieze, Alan M.
Mehlhorn, Kurt
Priebe, Volker
2000Attachment IconAverage-Case Complexity of Shortest-Paths Problems in the Vertex-Potential Model
In: Random Structures & Algorithms [16], 33-46
Cooper, Joshua
Doerr, Benjamin
Friedrich, Tobias
Spencer, Joel
2010Deterministic Random Walks on Regular Trees
In: Random Structures and Algorithms [37], 353-366
Cooper, Joshua
Doerr, Benjamin
Friedrich, Tobias
Spencer, Joel
2007Deterministic Random Walks on Regular Trees
In: Electronic Notes in Discrete Mathematics [29], 509-513
Cooper, Joshua
Doerr, Benjamin
Spencer, Joel
Tardos, Gábor
2007Deterministic random walks on the integers
In: European Journal of Combinatorics [28], 2072-2090
Crauser, Andreas
Ferragina, Paolo
2002A theoretical and experimental study on the construction of suffix arrays in external memory
In: Algorithmica [32], 1-35
Crauser, Andreas
Ferragina, Paolo
Mehlhorn, Kurt
Meyer, Ulrich
Ramos, Edgar A.
2001Randomized External-Memory Algorithms for Line Segment Intersection and Other Geometric Problems
In: International Journal of Computational Geometry & Applications [11], 305-337
Crochemore, Maxime
Galil, Zvi
Gasieniec, Leszek
Park, Kunsoo
Rytter, Wojciech
1997Constant-time Randomized Parallel String Matching
In: SIAM Journal on Computing [26], 950-960
Crochemore, Maxime
Gasieniec, Leszek
Hariharan, Ramesh
Muthukrishnan, S.
Rytter, Wojciech
1998A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern Matching
In: SIAM Journal on Computing [27], 668-681
Csaba, Bela2007On the Bollobas-Eidrigde conjecture for bipartite graphs
In: Combinatorics, Probability and Computing [16], 1-31
Csaba, Bela2003Proof of a conjecture of Bollobas and Eldridge for graphs of maximum degree three
In: Combinatorica [23], 35-72
Csaba, Bela
Lodha, S.
2006A randomized on-line algorithm for the k-server problem on the line
In: Random Structures and Algorithms [29], 82-104
Cygan, Marek
Philip, Geevarghese
Pilipczuk, Marcin
Pilipczuk, Micha\l{}
Wojtaszczyk, Jakub Onufry
2011Attachment IconDominating set is fixed parameter tractable in claw-free graphs
In: Theoretical Computer Science [412], 6982-7000
Das, Gautam
Kapoor, Sanjiv
Smid, Michiel
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
Datta, Amitava
Lenhof, Hans-Peter
Schwarz, Christian
Smid, Michiel
1995Static and dynamic algorithms for k-point clustering problems
In: Journal of Algorithms [19], 474-503
de Berg, Marc
van Kreveld, Marc
Schirra, Stefan
1998Topologically correct subdivision simplification using the bandwidth criterion
In: Cartography and Geographic Information Systems [25], 243-257
De Simone, Caterina
Diehl, Martin
Jünger, Michael
Mutzel, Petra
Reinelt, Gerhard
Rinaldi, Giovanni
1996Exact Ground States of Two-Dimensional +-J Ising Spin Glasses
In: Journal of Statistical Physics [84], 1363-1371
De Sterck, Hans2012A Nonlinear GMRES Optimization Algorithm for Canonical Tensor Decomposition
In: SIAM Journal on Scientific Computing [34], A1351-A1379
De Sterck, Hans2012A Self-learning Algebraic Multigrid Method for Extremal Singular Triplets and Eigenpairs
In: SIAM Journal on Scientific Computing [34], A2092-A2117
De Sterck, Hans
Miller, Killian
Sanders, Geoff
Winlaw, Manda
2011Recursively accelerated multilevel aggregation for Markov chains
In: SIAM Journal on Scientific Computing [32], 1652-1671
Deng, Xiaotie
Mahajan, Sanjeev
1997The Cost of Derandomization: Computability or Competitiveness
In: SIAM Journal on Computing [26], 786-802
DeSimone, Caterina
Diehl, Martin
Jünger, Michael
Mutzel, Petra
Reinelt, Gerhard
Rinaldi, Giovanni
1995Exact Ground States of Ising Spin Glasses: New Experimental Results With a Branch and Cut Algorithm
In: Journal of Statistical Physics [80], 487-496
Dessmark, Anders
Fraigniaud, Pierre
Kowalski, Dariusz
Pelc, Andrzej
2006Attachment IconDeterministic Rendezvous in Graphs
In: Algorithmica [46], 69-96
Deussen, Peter
Mehlhorn, Kurt
1977Attachment IconVan Wijngaarden Grammars and Space Complexity Class EXSPACE
In: Acta Informatica [8], 193-199
Devillers, Olivier
Golin, Mordecai J.
Kedem, Klara
Schirra, Stefan
1996Queries on Voronoi Diagrams of Moving Points
In: Computational Geometry. Theory and Applications [5], 315-327
Dey, Tamal K.
Mehlhorn, Kurt
Ramos, Edgar A.
2000Attachment IconCurve reconstruction: Connecting dots with good reason
In: Computational Geometry [15], 229-244
Diedrich, Florian
Harren, Rolf
Jansen, Klaus
Thöle, Ralf
Thomas, Henning
2008Attachment IconApproximation Algorithms for 3D Orthogonal Knapsack
In: Journal of Science and Technology [23], 749-762
Dietzfelbinger, Martin
Hagerup, Torben
Katajainen, Jyrki
Penttonen, Martti
1997A reliable randomized algorithm for the closest-pair problem
In: Journal of Algorithms [25], 19-51
Dietzfelbinger, Martin
Karlin, Anna
Mehlhorn, Kurt
Meyer Auf Der Heide, Friedhelm
Rohnert, Hans
Tarjan, Robert E.
1994Attachment IconDynamic Perfect Hashing: Upper and Lower Bounds
In: SIAM Journal on Computing [23], 738-761
Dietz, Paul
Mehlhorn, Kurt
Raman, Rajeev
Uhrig, Christian
1995Attachment IconLower bounds for set intersection queries
In: Algorithmica [14], 154-168
Diks, Krzysztof
Hagerup, Torben
1998More general parallel tree contraction: Register allocation and broadcasting in a tree
In: Theoretical Computer Science [203], 3-29
Dinitz, Yefim
Garg, Naveen
Goemans, Michel X.
1999On the single-source unsplittable flow problem
In: Combinatorica [19], 17-41
Dinitz, Yefim
Nutov, Zeev
1999A 3-approximation algorithm for finding optimum 4,5-vertex-connected spanning subgraphs
In: Journal of Algorithms [32], 21-30
Djidjev, Hristo N.
Pantziou, G. E.
Zaroliagis, Christos
2000Improved algorithms for dynamic shortest paths
In: Algorithmica [28], 367-389
Doerr, Benjamin2013Improved approximation algorithms for the Min-Max Selecting Items problem
In: Information Processing Letters [113], 747-749
Doerr, Benjamin2007Attachment IconLp Linear discrepancy of totally unimodular matrices
In: Linear Algebra and Its Applications [420], 663-666
Doerr, Benjamin2007Attachment IconMatrix approximation and Tusnády's problem
In: European Journal of Combinatorics [28], 990-995
Doerr, Benjamin2007Partial Colorings of Unimodular Hypergraphs
In: Electronic Notes in Discrete Mathematics [29], 359-363
Doerr, Benjamin2007Roundings respecting hard constraints
In: Theory of Computing Systems [40], 467-483
Doerr, Benjamin2006Attachment IconMatrix Rounding With Respect to Small Submatrices
In: Random Structures & Algorithms [28], 107-112
Doerr, Benjamin2006Attachment IconNon-independent randomized rounding and coloring
In: Discrete Applied Mathematics [154], 650-659
Doerr, Benjamin2006Non-independent Randomized Rounding, Linear Discrepancy and an Application to Digital Halftoning
In: Eurocomb '03 [3], 95-99
Doerr, Benjamin2004Multi-color discrepancies
In: Oberwolfach Reports [1], 683-685
Doerr, Benjamin2001Vector Balancing Games with Aging
In: Electronic Notes in Discrete Mathematics [10], xx-xx
Doerr, Benjamin
Eremeev, Anton
Neumann, Frank
Theile, Madeleine
Thyssen, Christian
2011Evolutionary algorithms and dynamic programming
In: Theoretical Computer Science [412], 6020-6035
Doerr, Benjamin
Fouz, Mahmoud
2011Quasi-random rumor spreading: Reducing randomness can be costly
In: Information Processing Letters [111], 227-230
Doerr, Benjamin
Fouz, Mahmoud
2010Hereditary Discrepancies in Different Numbers of Colors II
In: SIAM Journal on Discrete Mathematics [24], 1205-1213
Doerr, Benjamin
Fouz, Mahmoud
2009A Time-Randomness Tradeoff for Quasi-Random Rumour Spreading
In: Electronic Notes in Discrete Mathematics [34], 335 - 339
Doerr, Benjamin
Fouz, Mahmoud
Friedrich, Tobias
2012Why Rumors Spread Fast in Social Networks
In: Communications of the ACM [55], 70-75
Doerr, Benjamin
Friedrich, Tobias
2009Deterministic Random Walks on the Two-Dimensional Grid
In: Combinatorics, Probability and Computing [18], 123-144
Doerr, Benjamin
Friedrich, Tobias
2006Attachment IconQuasirandomness in Graphs
In: Electronic Notes in Discrete Mathematics [25], 61-64
Doerr, Benjamin
Friedrich, Tobias
Klein, Christian
Osbild, Ralf
2007Unbiased Matrix Rounding
In: Electronic Notes in Discrete Mathematics [28], 41-46
Doerr, Benjamin
Friedrich, Tobias
Künnemann, Marvin
Sauerwald, Thomas
2011Quasirandom Rumor Spreading: An Experimental Analysis
In: ACM Journal of Experimental Algorithmics [16], Article No. 3.3
Doerr, Benjamin
Friedrich, Tobias
Sauerwald, Thomas
2009Quasirandom Rumor Spreading on Expanders
In: Electronic Notes in Discrete Mathematics [34], 243 - 247
Doerr, Benjamin
Gnewuch, Michael
Kritzer, Peter
Pillichshammer, Friedrich
2008Component-by-component construction of low-discrepancy point sets of small size
In: Monte Carlo Methods and Applications [14], 129-149
Doerr, Benjamin
Gnewuch, Michael
Kritzer, Peter
Pillichshammer, Peter
2008 Component-by-component construction of low-discrepancy point sets of small size
In: Monte Carlo Methods Applications [14], 129-150
Doerr, Benjamin
Gnewuch, Michael
Srivastav, Anand
2005Bounds and Constructions for the Star-Discrepancy via Delta-Covers
In: Journal of Complexity [21], 691-709
Doerr, Benjamin
Gnewuch, Michael
Wahlström, Magnus
2010Algorithmic construction of low-discrepancy point sets via dependent randomized rounding
In: Journal of Complexity [26], 490-507
Doerr, Benjamin
Goldberg, Leslie Ann
2013Adaptive Drift Analysis
In: Algorithmica [65], 224-250
Doerr, Benjamin
Happ, Edda
Klein, Christian
2012Crossover can provably be useful in evolutionary computation
In: Theoretical Computer Science [425], 17-33
Doerr, Benjamin
Happ, Edda
Klein, Christian
2011Tight Analysis of the (1+1)-EA for the Single Source Shortest Path Problem
In: Evolutionary Computation [19], 673-691
Doerr, Benjamin
Hebbinghaus, Nils
Neumann, Frank
2007Speeding up Evolutionary Algorithms Through Asymmetric Mutation Operators
In: Evolutionary Computation [15], 401-410
Doerr, Benjamin
Hebbinghaus, Nils
Werth, Sören
2006Attachment IconImproved Bounds and Schemes for the Declustering Problem
In: Theoretical Computer Science [359], 123-132
Doerr, Benjamin
Huber, Anna
Levavi, Ariel
2013Strong robustness of randomized rumor spreading protocols
In: Discrete Applied Mathematics [161], 778-793
Doerr, Benjamin
Jansen, Thomas
2011Theory of Evolutionary Computation
In: Algorithmica [59], 299-300
Doerr, Benjamin
Jansen, Thomas
Sudholt, Dirk
Winzen, Carola
Zarges, Christine
2013Mutation rate matters even when optimizing monotonic functions
In: Evolutionary Computation [21], 1-27
Doerr, Benjamin
Johannsen, Daniel
Kötzing, Timo
Neumann, Frank
Theile, Madeleine
2013More effective crossover operators for the all-pairs shortest path problem
In: Theoretical Computer Science [471], 12-26
Doerr, Benjamin
Johannsen, Daniel
Winzen, Carola
2012Multiplicative Drift Analysis
In: Algorithmica [64], 673-697
Doerr, Benjamin
Johannsen, Daniel
Winzen, Carola
2012Non-existence of linear universal drift functions
In: Theoretical Computer Science [436], 71-86
Doerr, Benjamin
Kötzing, Timo
Lengler, Johannes
Winzen, Carola
2013Black-Box Complexities of Combinatorial Problems
In: Theoretical Computer Science [471], 84-106
Doerr, Benjamin
Lorenz, Ulf
2006Attachment IconError Propagation in Game Trees
In: Mathematical Methods of Operations Research [64], 79-93
Doerr, Benjamin
Neumann, Frank
2010In Memoriam: Ingo Wegener
In: Algorithmica [58], 541-542
Doerr, Benjamin
Neumann, Frank
Sudholt, Dirk
Witt, Carsten
2011Runtime analysis of the 1-ANT ant colony optimizer
In: Theoretical Computer Science [412], 1629-1644
Doerr, Benjamin
Neumann, Frank
Wegener, Ingo
2010Editorial
In: Algorithmica [57], 119-120
Doerr, Benjamin
Srivastav, Anand
2001Multi-Color Discrepancies
In: Electronic Notes in Discrete Mathematics [7], xx-xx
Doerr, Benjamin
Srivastav, Anand
2001Multi-Color Discrepancy of Arithmetic Progressions
In: Electronic Notes in Discrete Mathematics [8], 27-30
Doerr, Benjamin
Winzen, Carola
2014Ranking-Based Black-Box Complexity
In: Algorithmica [?], ?
Doerr, Benjamin
Winzen, Carola
2012Memory-restricted black-box complexity of OneMax
In: Information Processing Letters [112], 32-34
Dubhashi, Devdatt
Pantziou, Grammati E.
Spirakis, Paul G.
Zaroliagis, Christos
1995The Fourth Moment in Luby's Distribution
In: Theoretical Computer Science [148], 133-140
Dubhashi, Devdatt
Ranjan, Desh
1998Balls and Bins: A Study in Negative Dependence
In: Random Structures & Algorithms [13], 99-124
Edelsbrunner, Herbert
Ramos, Edgar A.
1997Inclusion-exclusion complexes for pseudo-disk collections
In: Discrete and Computational Geometry [17], 287-306
Eigenwillig, Arno2007Attachment IconOn Multiple Roots in Descartes' Rule and Their Distance to Roots of Higher Derivatives
In: Journal of Computational and Applied Mathematics [200], 226-230
Eigenwillig, Arno
Kettner, Lutz
Schömer, Elmar
Wolpert, Nicola
2006Attachment IconExact, Efficient and Complete Arrangement Computation for Cubic Curves
In: Computational Geometry [35], 36-73
Eisenbarth, Bernhard
Ziviani, Nivio
Gonnet, Gaston H.
Mehlhorn, Kurt
Wood, Derick
1982Attachment IconThe Theory of Fringe Analysis and Its Application to 2-3 Trees and B-Trees
In: Information and Control [55], 125-174
Eisenbrand, Friedrich
Funke, Stefan
Karrenbauer, Andreas
Matijevic, Domagoj
2008Energy-Aware Stage Illumination
In: International Journal of Computational Geometry and Applications [18], 107-129
Eisenbrand, Friedrich
Funke, Stefan
Karrenbauer, Andreas
Reichel, Joachim
Schömer, Elmar
2007Packing a truck - Now with a twist!
In: International Journal of Computational Geometry & Applications [17], 505-527
Eisenbrand, Friedrich
Karrenbauer, Andreas
Skutella, Martin
Xu, Chihao
2009Multiline Addressing by Network Flow
In: Algorithmica [53], 583-596
El Kahoui, M'hammed2005Attachment IconBirational properties of the gap subresultant varieties
In: Journal of Symbolic Computation [39], 61-71
El Kahoui, M'hammed2005Attachment IconUFDs with commuting linearly independent locally nilpotent derivations
In: Journal of Algebra [289], 446-452
El Kahoui, M'hammed2005Attachment Icon$D$-resultant and subresultants
In: Proceedings of the Amercian Mathematical Society [133], 2193-2199
El Kahoui, M'hammed2004Attachment IconContants of derivations in polynomial rings over unique factorization domains
In: Proceedings of the Amercian Mathematical Society [132], 2537-2541
El Kahoui, M'hammed2004Attachment IconSubresultants and locally nilpotent derivations
In: Linear Algebra and its Applications [380], 253-261
El Kahoui, M'hammed2003Attachment IconAn elementary approach to subresultants theory
In: Journal of Symbolic Computation [35], 281-292
El Kahoui, M'hammed2002Attachment IconOn plane polynomial vector fields and the Poincar\'e problem
In: Electronic Journal of Differential Equations [2002], 1-23
El Kahoui, M'hammed2001Attachment IconImproved algorithms for linear complementarity problems arising from collision response
In: Mathematics and Computers in Simulation [56], 69-93
El Kahoui, M'hammed2000Attachment IconDeciding Hopf bifurcations by quantifier elimination in a software-component architecture
In: Journal of Symbolic Computation [30], 161-179
El Kahoui, M'hammed1996Attachment IconAn Improved Upper Complexity Bound for the Topology Computation of a Real Algebraic Plane Curve
In: Journal of Complexity [12], 527-544
El Kahoui, M'hammed
Rakrak, Said
2007Attachment IconStructure of Groebner bases with respect to block orders
In: Mathematics of Computation [76], 2181-2187
Elbassioni, Khaled2009Algorithms for Dualization over Products of Partially Ordered Sets
In: SIAM Journal on Discrete Mathematics [23], 487-510
Elbassioni, Khaled2008A note on systems with max-min and max-product constraints
In: Fuzzy Sets and Systems [159], 2272-2277
Elbassioni, Khaled2008On the complexity of monotone dualization and generating minimal hypergraph transversals
In: Discrete Applied Mathematics [156], 2109-2123
Elbassioni, Khaled
Elmasry, Amr
Makino, Kazuhisa
2011Finding Simplices containing the Origin in Two and Three Dimensions
In: International Journal of Computational Geometry & Applications [21], 495-506
Elbassioni, Khaled
Fishkin, Aleksei V.
Sitters, René
2009Approximation algorithms for the Euclidean traveling salesman problem with discrete and continuous neighborhoods
In: International Journal of Computational Geometry & Applications [19], 173-193
Elbassioni, Khaled
Jeli´c, Slobodan
Matijevi`c, Domagoj
2012The relation of Connected Set Cover and Group Steiner Tree
In: Theoretical Computer Science [438], 96-101
Elbassioni, Khaled
Krohn, Erik
Matijevic, Domagoj
Mestre, Julian
Severdija, Domagoj
2011Improved Approximations for Guarding 1.5-Dimensional Terrains
In: Algorithmica [60], 451-463
Elbassioni, Khaled
Makino, Kazuhisa
Rauf, Imran
2011On the readability of monotone Boolean formulae
In: Journal of Combinatorial Optimization [22], 293-304
Elbassioni, Khaled
Matijevic, Domagoj
Severdija, Domagoj
2012Guarding 1.5D terrains with demands
In: International Journal of Computer Mathematics [89], 2143-2151
Elbassioni, Khaled
Raman, Rajiv
Ray, Saurabh
Sitters, René
2012On the complexity of the highway problem
In: Theoretical Computer Science [460], 70-77
Elbassioni, Khaled
Rauf, Imran
2010Polynomial-time dualization of r-exact hypergraphs with applications in geometry
In: Discrete Mathematics [310], 2356-2363
Elbassioni, Khaled
Tiwary, Hans Raj
2012Complexity of Approximating the Vertex Centroid of a Polyhedron
In: Theoretical Computer Science [421], 56-61
Elbassioni, Khaled
Tiwary, Hans Raj
2011On a cone covering problem
In: Computational Geometry [44], 129-134
Elbassioni, Khaled
Tiwary, Hans Raj
2008On Computing the Vertex Centroid of a Polyhedron
In: CoRR [abs/0806.3456], x-x
Elbassioni, Khaled M.2006Multiconsistency and Robustness with Global Constraints
In: Constraints [11], 335-352
Elbassioni, Khaled M.
Elmasry, Amr
Kamel, Ibrahim
2005An Indexing Method for Answering Queries on Moving Objects
In: Distributed and Parallel Databases [17], 215-249
Elbassioni, Khaled M.
Lotker, Zvi
Seidel, Raimund
2006Upper bound on the number of vertices of polyhedra with 0, 1-constraint matrices
In: Information Processing Letters [100], 69 - 71
Elmasry, Amr2010Pairing heaps, scrambled pairing and square-root trees
In: International Journal of Computer Mathematics [87], 3096-3110
Elmasry, Amr2010The longest almost-increasing subsequence
In: Information Processing Letters [110], 655-658
Elmasry, Amr2009Computing the subset partial order for dense families of sets
In: Information Processing Letters [109], 1082-1086
Elmasry, Amr
Hammad, Abdelrahman
2008Attachment IconInversion-Sensitive Sorting Algorithms in Practice
In: ACM Journal of Experimental Algorithmics [13], 1-18
Elmasry, Amr
Jensen, Claus
Katajainen, Jyrki
2008Attachment IconMultipartite Priority Queues
In: ACM Transactions on Algorithms [5], 1-19
Elmasry, Amr
Jensen, Claus
Katajainen, Jyrki
2008Attachment IconTwo New Methods for Constructing Double-Ended Priority Queues from Priority Queues
In: Computing [83], 193-204
Elmasry, Amr
Mehlhorn, Kurt
Schmidt, Jens M.
2013Every DFS tree of a 3-connected graph contains a contractible edge
In: Journal of Graph Theory [72], 112-121
Elmasry, Amr
Mehlhorn, Kurt
Schmidt, Jens M.
2012An O(n+m) Certifying Triconnnectivity Algorithm for Hamiltonian Graphs
In: Algorithmica [62], 754-766
Elsaesser, Robert
Sauerwald, Thomas
2011Tight bounds for the cover time of multiple random walks
In: Theoretical Computer Science [412], 2623-2641
Epstein, Leah
Kesselman, Alexander
2006On the remote server problem or more about TCP acknowledgments
In: Theoretical Computer Science [369], 285
Epstein, Leah
Levin, Asaf
Marchetti-Spaccamela, Alberto
Megow, Nicole
Mestre, Julian
Skutella, Martin
Stougie, Leen
2012Universal sequencing on an unreliable machine
In: SIAM Journal on Computing [41], 565-586
Epstein, Leah
Levin, Asaf
van Stee, Rob
2012Attachment IconApproximation Schemes for Packing Splittable Items with Cardinality Constraints
In: Algorithmica [62], 102-129
Epstein, Leah
Levin, Asaf
van Stee, Rob
2011Attachment IconMax-min online allocations with a reordering buffer
In: SIAM Journal on Discrete Mathematics [25], 1230-1250
Epstein, Leah
Levin, Asaf
van Stee, Rob
2008Attachment IconOnline unit clustering: Variations on a theme
In: Theoretical Computer Science [407], 85-96
Epstein, Leah
Levin, Asaf
van Stee, Rob
2008Attachment IconTwo-dimensional packing with conflicts
In: Acta Informatica [45], 155-175
Epstein, Leah
van Stee, Rob
2012Attachment IconThe price of anarchy on uniformly related machines revisited
In: Information and Computation [212], 37-54
Epstein, Leah
van Stee, Rob
2011Attachment IconImproved results for a memory allocation problem
In: Theory of Computing Systems [48], 79-92
Epstein, Leah
van Stee, Rob
2011On the online unit clustering problem
In: ACM Transactions on Algorithms [7], 7:1-7:1
Epstein, Leah
van Stee, Rob
2010Maximizing the minimum load for selfish agents
In: Theoretical Computer Science [411], 44-57
Epstein, Leah
van Stee, Rob
2010Attachment IconOn the online unit clustering problem
In: ACM Transactions on Algorithms [7], 1-18
Epstein, Leah
van Stee, Rob
Tamir, Tami
2009Attachment IconPaging with request sets
In: Theory of Computing Systems [44], 67-81
Fabri, Andreas
Giezeman, Geert-Jan
Kettner, Lutz
Schirra, Stefan
Schönherr, Sven
2000On the Design of CGAL, a computational geometry algorithms library
In: Software - Practice and Experience [30], 1167-1202
Fanghänel, Alexander
Geulen, Sascha
Hoefer, Martin
Vöcking, Berthold
2013Online Capacity Maximization in Wireless Networks
In: Journal of Scheduling [16], 81-91
Farzan, Arash
Munro, J. Ian
2011Succinct representation of dynamic trees
In: Theoretical Computer Science [412], 2668-2678
Fatourou, Panagiota
Spirakis, Paul G.
2000Attachment IconEfficient Scheduling of Strict Multithreaded Computations
In: Theory of Computing Systems [33], 173-232
Fekete, Sandor P.
Skutella, Martin
Woeginger, Gerhard J.
2003Attachment IconThe complexity of economic equilibria for house allocation markets
In: Information Processing Letters [88], 219-223
Fellows, Michael R.
Fertin, Guillaume
Hermelin, Danny
Vialette, Stephane
2011Upper and lower bounds for finding connected motifs in vertex-colored graphs
In: Journal of Computer and System Sciences [77], 799-811
Fellows, Michael R.
Hartman, Tzvika
Hermelin, Danny
Landau, Gad M.
Rosamond, Frances A.
Rozenberg, Liat
2011Haplotype Inference Constrained by Plausible Haplotype Data
In: IEEE/ACM Transactions on Computational Biology and Bioinformatics [8], 1692-1699
Fellows, Michael R.
Hermelin, Danny
Rosamond, Fraces A.
2012Well Quasi Orders in Subclasses of Bounded Treewidth Graphs and Their Algorithmic Applications
In: Algorithmica [64], 3-18
Feremans, Corinne
Grigoriev, Alexander
Sitters, Rene
2006The geometric generalized minimum spanning tree problem with grid clustering
In: 4OR: A Quarterly Journal of Operations Research [4], 319-329
Ferragina, Paolo
Gross, Roberto
1998Optimal On-Line Search and Sublinear Time Update in String Matching
In: SIAM Journal on Computing [27], 713-736
Fleischer, Rudolf1999Decision trees: old and new results
In: Information and computation [152], 44-61
Fleischer, Rudolf1996A simple balanced search tree with $O(1)$ worst-case update time
In: International Journal of Foundations of Computer Science [7], 137-149
Fleischer, Rudolf
Jung, Hermann
Mehlhorn, Kurt
1995A communication-randomness tradeoff for two-processor systems
In: Information and Computation [116], 155-161
Fleischer, Rudolf
Mehlhorn, Kurt
Rote, Günter
Welzl, Emo
Yap, Chee-Keng
1992Simultaneous Inner and Outer Approximation of Shapes
In: Algorithmica [8], 365-389
Follert, Frank
Schömer, Elmar
Sellen, Jürgen
Smid, Michiel
Thiel, Christian
1997Computing the largest empty anchored cylinder, and related problems
In: International Journal of Computational Geometry and Applications [7], 563-580
Fotakis, Dimitris
Pagh, Rasmus
Sanders, Peter
Spirakis, Paul G.
2005Space Efficient Hash Tables With Worst Case Constant Access Time
In: Theory of Computing Systems [38], 229-248
Fotakis, Dimitris
Spirakis, Paul G.
2002Attachment IconMinimum Congestion Redundant Assignments to Tolerate Random Faults
In: Algorithmica [32], 396-422
Fountoulakis, Nikolaos2007Percolation on sparse random graphs with given degree sequence
In: Internet Mathematics [4], 329-356
Fountoulakis, Nikolaos
Huber, Anna
2009Quasirandom rumor spreading on the complete graph is as fast as randomized rumor spreading
In: SIAM Journal on Discrete Mathematics [23], 1964-1991
Fountoulakis, Nikolaos
Kühn, Daniela
Osthus, Deryk
2009Minors in random regular graphs
In: Random Structures and Algorithms [35], 444-463
Fountoulakis, Nikolaos
Kühn, Daniela
Osthus, Deryk
2008The order of the largest complete minor in a random graph
In: Random Structures and Algorithms [33], 127-141
Fountoulakis, Nikolaos
Panagiotou, Konstantinos
2013On the Insertion Time of Cuckoo Hashing
In: SIAM Journal on Computing [?], ?-?
Fountoulakis, Nikolaos
Panagiotou, Konstantinos
2012Tight Load Thresholds for Cuckoo Hashing
In: Random Structures and Algorithms [41], 306-333
Fountoulakis, Nikolaos
Panagiotou, Konstantinos
20113-Connected Cores In Random Planar Graphs
In: Combinatorics, Probability & Computing [20], 381-412
Fountoulakis, Nikolaos
Reed, Bruce
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
Fountoulakis, Nikolaos
Reed, Bruce
2007Faster Mixing and Small Bottlenecks
In: Probability Theory and Related Fields [137], 475-486
Frederickson, Greg N.
Solis-Oba, Roberto
1998Algorithms for Measuring Perturbability in Matroid Optimization
In: Combinatorica [18], 503-518
Fredman, Michael
Khachiyan, Leonid
1996On the Complexity of Dualization of Monotone Disjunctive Normal Forms
In: J. Algorithms [21], 618-628
Friedrich, Tobias
Gairing, Martin
Sauerwald, Thomas
2012Quasirandom Load Balancing
In: SIAM Journal on Computing [41], 747-771
Friedrich, Tobias
Hebbinghaus, Nils
2011Average update times for fully-dynamic all-pairs shortest paths
In: Discrete Applied Mathematics [159], 1751-1758
Friedrich, Tobias
Hebbinghaus, Nils
Neumann, Frank
2009Comparison of Simple Diversity Mechanisms on Plateau Functions
In: Theoretical Computer Science [410], 2455-2462
Friedrich, Tobias
Hebbinhaus, Nils
Neumann, Frank
2010Plateaus Can Be Harder in Multi-Objective Optimization
In: Theoretical Computer Science [411], 854-864
Friedrich, Tobias
He, Jun
Hebbinghaus, Nils
Neumann, Frank
Witt, Carsten
2010Approximating Covering Problems by Randomized Search Heuristics using Multi-Objective Models
In: Evolutionary Computation [18], 617 - 633
Friedrich, Tobias
He, Jun
Hebbinghaus, Nils
Neumann, Frank
Witt, Carsten
2009Analyses of Simple Hybrid Algorithms for the Vertex Cover Problem
In: Evolutionary Computation, [17], 3-19
Friedrich, Tobias
Horoba, Christian
Neumann, Frank
2011Illustration of fairness in evolutionary multi-objective optimization
In: Theoretical Computer Science [412], 1546-1556
Friedrich, Tobias
Neumann, Frank
2010When to Use Bit-Wise Neutrality
In: Natural Computing [9], 283 - 294
Friedrich, Tobias
Oliveto, Pietro
Sudholt, Dirk
Witt, Carsten
2009Analysis of Diversity-Preserving Mechanisms for Global Exploration
In: Evolutionary Computation [17], 455-476
Friedrich, Tobias
Sauerwald, Thomas
Vilenchik, Dan
2011Smoothed analysis of balancing networks
In: Random Structures & Algorithms [39], 115-138
Fries, O.
Mehlhorn, Kurt
Näher, Stefan
Tsakalidis, A.
1987A $\log \log n$ data structure for three-sided range queries
In: Information Processing Letters [25], 269-273
Froyland, Gary
Koch, Thorsten
Megow, Nicole
Duane, Emily
Wren, Howard
2008Optimizing the Landside Operation of a Container Terminal
In: OR Spectrum [30], 53-75
Funke, Stefan
Kesselman, Alexander
Kuhn, Fabian
Lotker, Zvi
Segal, Michael
2007Attachment IconImproved approximation algorithms for connected sensor cover
In: Wireless Networks [13], 153-164
Funke, Stefan
Kesselman, Alexander
Meyer, Ulrich
Segal, Michael
2006A Simple Improved Distributed Algorithm for Minimum CDS in Unit Disk Graphs
In: ACM Transactions on Sensor Networks [2], 444-453
Funke, Stefan
Laue, Soeren
Lotker, Zvi
Naujoks, Rouven
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
Funke, Stefan
Mehlhorn, Kurt
2002LOOK - A Lazy Object-Oriented Kernel for Geometric Computation
In: Computational Geometry - Theory and Applications [22], 99-118
Funke, Stefan
Mehlhorn, Kurt
Näher, Stefan
2005Attachment IconStructural filtering: a paradigm for efficient and exact geometric programs
In: Computational Geometry [31], 179-194
Fürer, Martin
Mehlhorn, Kurt
1989Attachment IconAT$^2$-Optimal Galois Field Multiplier for VLSI
In: IEEE Transactions on Computers [38], 1333-1336
Gandhi, Rajiv
Mestre, Julián
2009Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
In: Algorithmica [54], 54-71
Garg, Naveen
Kavitha, T.
Kumar, Amit
Mehlhorn, Kurt
Mestre, Julián
2010Assigning Papers to Referees
In: Algorithmica [58], 119-136
Garg, Naveen
Konjevod, Goran
Ravi, R.
2000Approximation algorithm for the group Steiner tree problem
In: Journal of Algorithms [37], 66-84
Garg, Naveen
Vazirani, Vijay V.
1996Approximate max-flow min-(multi)cut theorems and their applications
In: SIAM Journal on Computing [25], 235-251
Garg, Naveen
Vazirani, Vijay V.
1995A polyhedron with all s-t cuts as vertices, and adjacency of cuts
In: Mathematical Programming (A) [70], 17-25
Gasieniec, Leszek
Pelc, Andrzej
1997Broadcasting with a bounded fraction of faulty nodes
In: Journal of Parallel and Distributed Computing [42], 11-20
Gasieniec, Leszek
Pelc, Andrzej
1996Adaptive Broadcasting with Faulty Nodes
In: Parallel Computing [22], 903-912
Gawrychowski, Pawel2014Simple and efficient LZW-compressed multiple pattern matching
In: Journal of Discrete Algorithms [25], 34-41
Gawrychowski, Pawel
Jez, Artur
Jez, Lukasz
2014Validating the Knuth-Morris-Pratt Failure Function, Fast and Online
In: Theory of Computing Systems [54], 337-372
Georgiou, Chryssis
Kowalski, Dariusz
Shvartsman, Alexander
2005Efficient gossip and robust distributed computation
In: Theoretical Computer Science [347], 130-166
Gergov, Jordan
Meinel, Christoph
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
Giannopoulos, Panos
Klein, Rolf
Kutz, Martin
Marx, Daniel
2010Computing geometric minimum-dilation graphs is NP-hard
In: International Journal of Computational Geometry & Applications [20], 147-173
Giannopoulos, Panos
Knauer, Christian
Wahlström, Magnus
Werner, Daniel
2012Hardness of discrepancy computation and ε-net verification in high dimension
In: Journal of Complexity [28], 162-176
Gidenstam, Anders
Papatriantafilou, Marina
Sundell, Håkan
Tsigas, Philippas
2009Efficient and Reliable Lock-Free Memory Reclamation Based on Reference Counting
In: IEEE Transactions on Parallel and Distributed Systems [20], 1173-1187
Gidenstam, Anders
Papatriantafilou, Marina
Tsigas, Philippas
2010NBmalloc: Allocating Memory in a Lock-Free Manner
In: Algorithmica [58], 304-338
Giesen, Joachim2008Conjoint Analysis for Measuring the Perceived Quality in Volume Rendering
In: IEEE Transactions on Visualization and Computer Graphics [13], 1664-1671
Giesen, Joachim2008Delaunay Triangulation Approximates Anchor Hull
In: Computational Geometry - Theory and Applications [36], 131-143
Giesen, Joachim2008The Flow Complex: A Data Structure for Geometric Modeling
In: Computational Geometry - Theory and Applications [39], 178-190
Giesen, Joachim
Schuberth, Eva
Simon, Klaus
Zolliker, Peter
Zweifel, Oliver
2007Image-Dependent Gamut Mapping as Optimization Problem
In: IEEE Transactions on Image Processing [16], 2401-2410
Gnewuch, Michael
Wahlström, Magnus
Winzen, Carola
2012A New Randomized Algorithm to Approximate the Star Discrepancy Based on Threshold Accepting
In: SIAM Journal on Numerical Analysis [50], 781-807
Goemans, Michel X.
Skutella, Martin
2004Attachment IconCooperative facility location games
In: Journal of Algorithms [50], 194-214
Goldberg, Leslie Ann
MacKenzie, Philip D.
Paterson, Mike
Srinivasan, Aravind
2000Contention resolution with constant expected delay
In: Journal of the ACM [42], 1048-1096
Golin, Mordecai J.
Raman, Rajeev
Schwarz, Christian
Smid, Michiel
1998Randomized Data Structures for the Dynamic Closest-Pair Problem
In: SIAM Journal on Computing [27], 1036-1072
Golin, Mordecai J.
Raman, Rajeev
Schwarz, Christian
Smid, Michiel
1995Simple randomized algorithms for closest pair problems
In: Nordic Journal of Computing [2], 3-27
Golumbic, Martin Charles
Mintz, Aviad
Rotics, Udi
2006Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial k-trees
In: Discrete Applied Mathematics [154], 1465-1477
Goodrich, Michael T.
Ramos, Edgar A.
1997Bounded-independence derandomization of geometric partitioning with applications to parallel fixed-dimensional linear programming
In: Discrete and Computational Geometry [18], 397-420
Gotsman, Craig
Kaligosi, Kanela
Mehlhorn, Kurt
Michail, Dimitrios
Pyrga, Evangelia
2007Attachment IconCycle Bases of Graphs and Sampled Manifolds
In: Computer Aided Geometric Design [24], 464
Govindarajan, Sathish
Dietze, Michael C.
Agarwal, Pankaj K.
Clark, James S.
2008Attachment IconA scalable algorithm for dispersing population
In: Journal of Intellingent Information Systems [29], 39-61
Guo, Zeyu
Sun, He
Zhu, Hong
2011Greedy Construction of 2-Approximate Minimum Manhattan Networks
In: International Journal of Computational Geometry and Applications [21], 331-350
Gupta, Arvind
Mahajan, Sanjeev
1997Using amplification to compute majority with small majority gates
In: Computational Complexity [6], 46-63
Gupta, Prosenjit
Janardan, Ravi
Smid, Michiel
1999Efficient algorithms for counting and reporting pairwise intersections between convex polygons
In: Information Processing Letters [69], 7-13
Gupta, Prosenjit
Janardan, Ravi
Smid, Michiel
1996Algorithms for generalized halfspace range searching and other intersection searching problems
In: Computational Geometry [5], 321-340
Gupta, Prosenjit
Janardan, Ravi
Smid, Michiel
1996Algorithms for generalized halfspace range searching and other intersection searching problems
In: Computational Geometry [6], 1-19
Gupta, Prosenjit
Janardan, Ravi
Smid, Michiel
1996Fast algorithms for collision and proximity problems involving moving geometric objects
In: Computational Geometry [6], 371-391
Gupta, Prosenjit
Janardan, Ravi
Smid, Michiel
1995Further results on generalized intersection searching problems:
counting, reporting, and dynamization
In: Journal of Algorithms [19], 282-317
Gupta, Prosenjit
Janardan, Ravi
Smid, Michiel
Dasgupta, Bhaskar
1997The rectangle enclosure and point-dominance problems revisited
In: International Journal of Computational Geometry and Applications [7], 437-456
Gurvich, Vladimir1991Criteria for repetition-freeness of functions in the algebra of logic
In: Soviet Math. Dokl. [43], 721-726
Gurvich, Vladimir1977On repetition-free Boolean functions
In: Uspekhi Mat. Nauk. (Russian Math. Surveys) [32], 183-184
Güttler, Reiner
Mehlhorn, Kurt
Schneider, Wolfgang
1980Attachment IconBinary Search Trees: Average and Worst Case Behavior
In: Elektronische Informationsverarbeitung und Kybernetik [16], 41-61
Hachenberger, Peter
Kettner, Lutz
Mehlhorn, Kurt
2007Attachment IconBoolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, Optimized Implementation and Experiments
In: Computational Geometry: Theory and Applications [38], 64-99
Hagerup, Torben2000Dynamic algorithms for graphs of bounded treewidth
In: Algorithmica [27], 292-315
Hagerup, Torben2000Parallel preprocessing for path queries without concurrent reading
In: Information and Computation [158], 18-28
Hagerup, Torben1997Allocating Independent Tasks to Parallel Processors: An Experimental Study
In: Journal of Parallel and Distributed Computing [47], 185-197
Hagerup, Torben1995A Lower Bound for the Emulation of PRAM Memories on Processor Networks
In: Information and Computation [119], 124-128
Hagerup, Torben1995Fast Deterministic Processor Allocation
In: Journal of Algorithms [18], 629-649
Hagerup, Torben1995The Parallel Complexity of Integer Prefix Summation
In: Information Processing Letters [56], 59-64
Hagerup, Torben
Keller, Jörg
1995Fast Parallel Permutation Algorithms
In: Parallel Processing Letters [5], 139-148
Hagerup, Torben
Kutylowski, Miroslaw
1997Fast integer merging on the EREW PRAM
In: Algorithmica [17], 55-66
Han, Xiaofeng
Kelsen, Pierre
Ramachandran, Vijaya
Tarjan, Robert E.
1995Computing minimal spanning subgraphs in linear time
In: SIAM Journal on Computing [24], 1332-1358
Han, Xin
Lam, Tak-Wah
Lee, Lap-Kei
To, Isaac K. K.
Wong, Prudence W. H.
2010Deadline scheduling and power management for speed bounded processors
In: Theoretical Computer Science [411], 3587-3600
Hariharan, Ramesh
Kapoor, Sanjiv
1995Algorithms for Enumerating all Spanning Trees of an Undirected Graph
In: SIAM Journal on Computing [24], 247-265
Hariharan, Ramesh
Muthukrishnan, S.
1995String Matching over a General Matching Relation
In: Information and Computation [122], 140-148
Harks, Tobias
Hoefer, Martin
Klimm, Max
Skopalik, Alexander
2013Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games
In: Mathematical Programming [141], 193-215
Harren, Rolf2009Attachment IconApproximation Algorithms for Orthogonal Packing Problems for Hypercubes
In: Theoretical Computer Science [410], 4504-4532
Harren, Rolf
van Stee, Rob
2012Absolute Approximation Ratios for Packing Rectangles into Bins
In: Journal of Scheduling [15], 63-75
Heinz, Jeffrey
Kasprzik, Anna
Kötzing, Timo
2012Learning in the limit with lattice-structured hypothesis spaces
In: Theoretical Computer Science [457], 111 - 127
Hemmer, Michael
Dupon, Laurent
Petitjean, Sylvain
Schomer, Elmar
2011A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics
In: Journal of Symbolic Computation [46], 467-494
Henzinger, Monika R.
Leonardi, Stefano
2003Scheduling multicasts on unit-capacity trees and meshes
In: Journal of Computer and System Sciences [66], 567-611
Henz, Martin
Müller, Tobias
Thiel, Sven
2004Global constraints for round robin tournament scheduling
In: European Journal of Operational Research [153], 92-101
Hermelin, Danny
Rawitz, Dror
2011Optimization problems in multiple subtree graphs
In: Discrete Applied Mathematics [159], 588-594
Hertel, Stefan
Mäntylä, Martti
Mehlhorn, Kurt
Nievergelt, Jurg
1984Attachment IconSpace Sweep Solves Intersection of Convex Polyhedra
In: Acta Informatica [21], 501-519
Hertel, Stefan
Mehlhorn, Kurt
1985Attachment IconFast Triangulation of the Plane with Respect to Simple Polygons
In: Information and Control [64], 52-76
Hert, Susan
Hoffmann, Michael
Kettner, Lutz
Pion, Sylvain
Seel, Michael
2007An adaptable and extensible geometry kernel
In: Computational Geometry: Theory and Applications [38], 16-36
Hert, Susan
Lumelsky, Vladimir
1999Motion Planning in R^3 for Multiple Tethered Robots
In: IEEE Transactions on Robotics and Automation [15], 623-639
Heydrich, Sandy
van Stee, Rob
2015Dividing Connected Chores Fairly
In: Theoretical Computer Science [593], 51-61
Hoefer, Martin2013Local Matching Dynamics in Social Networks
In: Information & Computation [222], 20-35
Hoefer, Martin2013Strategic Cooperation in Cost Sharing Games
In: International Journal of Game Theory [42], 29-53
Hoefer, Martin
Skopalik, Alexander
2013Altruism in Atomic Congestion Games
In: ACM Transactions on Economics and Computation [1], 21
Hoefer, Martin
Skopalik, Alexander
2013On the Complexity of Pareto-optimal Nash and Strong Equilibria
In: Theory of Computing Systems [53], 441-453
Hoffmann, K
Mehlhorn, Kurt
1984Intersecting a line and a simple polygon
In: EATCS Bulletin [22], 120-121
Hoffmann, Kurt
Mehlhorn, Kurt
Rosenstiehl, Pierre
Tarjan, Robert E.
1986Attachment IconSorting Jordan Sequences in Linear Time Using Level-Linked Search Trees
In: Information and Control [68], 170-184
Höhn, Wiebke
Jacobs, Tobias
Megow, Nicole
2012On Eulerian extensions and their application to no-wait flowshop scheduling
In: Journal of Scheduling [15], 295-309
Hong, Jia-Wei
Mehlhorn, Kurt
Rosenberg, Arnold L.
1983Attachment IconCost Trade-offs in Graph Embeddings, with Applications
In: Journal of the ACM [30], 709-728
Hoogeveen, Han
Skutella, Martin
Woeginger, Gerhard J.
2003Attachment IconPreemptive scheduling with rejection
In: Mathematical Programming [94], 361-374
Huang, Chien-Chung2010Circular stable matching and 3-way kidney transplant
In: Algorithmica [58], 137-150
Huang, Chien-Chung
Kavitha, Telikepalli
Michael, Dimitrios
Nasr, Meghana
2011Bounded Unpopularity Matchings
In: Algorithmica [61], 738-757
Huddleston, Scott
Mehlhorn, Kurt
1982A New Data Structure for Representing Sorted Lists
In: Acta Informatica [17], 157-184
Hutchinson, David A.
Sanders, Peter
Vitter, Jeffrey Scott
2005Duality Between Prefetching and Queued Writing with Parallel Disks
In: SIAM Journal on Computing [34], 1443-1463
Iacono, G.
Ramezani, Fahimeh
Soranzo, N.
Altafani, C.
2010Determining the distance to monotonicity of a biological network: a graph-theoretical approach
In: IET Systems Biology [4], 223-235
Irving, Robert W.
Telikepalli, Kavitha
Mehlhorn, Kurt
Michail, Dimitrios
Paluch, Katarzyna
2006Attachment IconRank-Maximal Matchings
In: ACM Transactions on Algorithms [2], 602-610
Jansen, Klaus
Porkolab, Lorant
2002Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks
In: Algorithmica [32], 507-520
Jansen, Thomas
Neumann, Frank
2010Editorial for the Special Issue on Theoretical Aspects of Evolutionary Multi-Objective Optimization
In: Evolutionary Computation [18], 333-334
Jez, Artur2014The Complexity of Compressed Membership Problems for Finite Automata
In: Theory of Computing Systems [55], 685-718
Jez, Artur
Maletti, Andreas
2013Hyper-minimization for deterministic tree automata
In: International Journal of Foundations of Computer Science [24], 815-830
Jez, Artur
Okhotin, Alexander
2014Computational completeness of equations over sets of natural numbers
In: Information and Computation [237], 56-94
Jünger, Michael
Leipert, Sebastian
Mutzel, Petra
1998A Note on Computing a Maximal Planar Subgraph using PQ-Trees
In: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems [17], 609-612
Jünger, Michael
Mutzel, Petra
19972-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms
In: Journal of Graph Algorithms and Applications [1], 1-25
Jünger, Michael
Mutzel, Petra
1996Maximum planar subgraphs and nice embeddings: Practical layout tools
In: Algorithmica [16], 33-59
Jünger, Michael
Mutzel, Petra
Odenthal, Thomas
Scharbrodt, M.
1998The thickness of a minor-excluded class of graphs
In: Discrete Mathematics [182], 169-176
Jung, Bernd
Lenhof, Hans-Peter
Müller, Peter
Rüb, Christine
2000Simulating synthetic polymer chains in parallel
In: Future Generation Computer Systems [16], 513-522
Jung, Bernd
Lenhof, Hans-Peter
Müller, Peter
Rüb, Christine
1997Langevin dynamics simulations of macromolecules on parallel computers
In: Macromolecular Theory and Simulation [6], 507-521
Jung, Hermann
Mehlhorn, Kurt
1988Attachment IconParallel algorithms for computing maximal independent sets in trees and for updating minimum spanning trees
In: Information Processing Letters [27], 227-236
Kagaris, Dimitrios
Pantziou, Grammati E.
Tragoudas, Spyros
Zaroliagis, Christos
1999Transmissions in a network with capacities and delays
In: Networks [33
], 167-174
Kapoor, Sanjiv
Smid, Michiel
1996New techniques for exact and approximate dynamic closest-point problems
In: SIAM Journal on Computing [25], 775-796
Katriel, Irit2004On the Algebraic Complexity of Set Equality and Inclusion
In: Information Processing Letters [92], 175-178
Katriel, Irit
Michel, Laurent
Van Hentenryck, Pascal
2005Maintaining Longest Paths Incrementally
In: Constraints [10], 159-183
Katriel, Irit
Thiel, Sven
2005Complete Bound Consistency for the Global Cardinality Constraint
In: Constraints [10], 191-217
Kaufmann, Michael
Mehlhorn, Kurt
1994Attachment IconA linear-time algorithm for the homotopic routing problem in grid graphs
In: SIAM Journal on Computing [23], 227-246
Kaufmann, Michael
Mehlhorn, Kurt
1992Attachment IconOn local routing of two-terminal nets
In: Journal of Combinatorial Theory / Series B [55], 33-72
Kaufmann, Michael
Mehlhorn, Kurt
1986Attachment IconRouting through a Generalized Switchbox
In: Journal of Algorithms [7], 510-531
Kaufmann, Michael
Meyer, Ulrich
Sibeyn, Jop F.
1997Matrix Transpose on Meshes: Theory and Practice
In: Computers and Artificial Intelligence [16], 107-140
Kaufmann, Michael
Raman, Rajeev
Sibeyn, Jop F.
1997Routing on Meshes with Buses
In: Algorithmica [18], 417-444
Kaufmann, Michael
Schröder, Heiko
Sibeyn, Jop F.
1995Asymptotically Optimal and Practical Routing on the Reconfigurable Mesh
In: Parallel Processing Letters [5], 81-95
Kaufmann, Michael
Sibeyn, Jop F.
1997Randomized Multipacket Routing and Sorting on Meshes
In: Algorithmica [17], 224-244
Kavitha, Telikepalli
Mehlhorn, Kurt
2007Attachment IconAlgorithms to compute minimum cycle basis in directed graphs
In: Theory of Computing Systems [40], 485-505
Kavitha, Telikepalli
Mehlhorn, Kurt
Michail, Dimitrios
2011New Approximation Algorithms for Minimum Cycle Bases of Graphs
In: Algorithmica [59], 471-488
Kavitha, Telikepalli
Mehlhorn, Kurt
Michail, Dimitrios
Paluch, Katarzyna E.
2007Attachment IconStrongly stable matchings in time O(nm) and extension to the hospitals-residents problem
In: ACM Transactions on Algorithms [3], 15.1-15.18
Kavitha, Telikepalli
Mestre, Julián
2012Max-coloring paths: tight bounds and extensions
In: Journal of Combinatiorial Optimization [24], 1-14
Kavitha, Telikepalli
Mestre, Julian
Nasre, Meghana
2011Popular mixed matchings
In: Theoretical Computer Science [412], 2679-2690
Kavitha, T.
Liebchen, Ch.
Mehlhorn, K.
Michail, D.
Rizzi, R.
Ueckerdt, T.
Zweig, K.
2009Attachment IconCycle Bases in Graphs: Characterization, Algorithms, Complexity, and Applications
In: Computer Science Review [3], 199-243
Kavvadias, Dimitris J.
Pantziou, Grammati E.
Spirakis, Paul G.
Zaroliagis, Christos
1996Hammock-on-ears decomposition : a technique for the efficient parallel solution of shortest paths and other problems
In: Theoretical Computer Science [168], 121-154
Kayal, Neeraj
Saha, Chandan
2012Attachment IconOn the Sum of Square Roots of Polynomials and Related Problems
In: The ACM Transactions on Computation Theory [4], 9:1-9:15
Kececioglu, John
Lenhof, Hans-Peter
Mehlhorn, Kurt
Mutzel, Petra
Reinert, Knut
Vingron, Martin
2000Attachment IconA polyhedral approach to sequence alignment problems
In: Discrete Applied Mathematics [104], 143-186
Kerber, Michael2009Division-Free Computation of Subresultants Using Bezout Matrices
In: International Journal of Computer Mathematics [86], 2186-2200
Kerber, Michael
Sagraloff, Michael
2012A worst-case bound for topology computation of algebraic curves
In: Journal of Symbolic Computation [47], 239-258
Kerber, Michael
Sagraloff, Michael
2011A Note on the Complexity of Real Algebraic Hypersurfaces
In: Graphs and Combinatorics [27], 419-430
Kesselman, Alexander
Kowalski, Dariusz
Segal, Michael
2005Attachment IconEnergy efficient communication in ad hoc networks from user's and designer's perspective
In: Proceedings of the n?th Conference on, 15-26
In: ACM SIGMOBILE Mobile Computing and Communications Review [9], 15-26
Kesselman, Alexander
Lotker, Zvi
Mansour, Yishay
Patt-Shamir, Boaz
Schieber, Baruch
Sviridenko, Maxim
2004Buffer Overflow Management in QoS Switches
In: SIAM Journal on Computing [33], 563-583
Kesselman, Alexander
Mansour, Yishay
2004Harmonic Buffer Management for Shared-Memory Switches
In: Theoretical Computer Science [324], 161-182
Kettner, Lutz
Kirkpatrick, David
Mantler, Andrea
Snoeyink, Jack
Speckmann, Bettina
Takeuchi, Fumihiko
2003Tight Degree Bounds for Pseudo-triangulations of Points
In: Computational Geometry - Theory and Applications [25], 3-12
Kettner, Lutz
Mehlhorn, Kurt
Pion, Sylvain
Schirra, Stefan
Yap, Chee
2008Attachment IconClassroom Examples of Robustness Problems in Geometric Computations
In: Computational Geometry: Theory and Applications [40], 61-78
Kettner, Lutz
Rossignac, Jarek
Snoeyink, Jack
2003The Safari Interface for Visualizing Time-dependent Volume Data Using Iso-surfaces and Contour Spectra
In: Computational Geometry - Theory and Applications [25], 97-116
Khachiyan, Leonid
Boros, Endre
Borys, Konrad
Elbassioni, Khaled
Gurvich, Vladimir
2008Generating All Vertices of a Polyhedron Is Hard
In: Discrete & Computational Geometry [39], 174-190
Khachiyan, Leonid
Boros, Endre
Borys, Konrad
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa
2008Generating Cut Conjunctions in Graphs and Related Problems
In: Algorithmica [51], 239-263
Khachiyan, Leonid
Boros, Endre
Borys, Konrad
Elbassioni, Khaled
Gurvich, Vladimir
Rudolf, Gabor
Zhao, Jihui
2008On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction
In: Theory Comput. Syst. [43], 204-233
Khachiyan, Leonid
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
2008Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions
In: Discrete Applied Mathematics [156], 2020-2034
Khachiyan, Leonid
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
2008On Enumerating Minimal Dicuts and Strongly Connected Subgraphs
In: Algorithmica [50], 159-172
Khachiyan, Leonid
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
2007A global parallel algorithm for the hypergraph transversal problem
In: Information Processing Letters [101], 148-155
Khachiyan, Leonid
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
2007On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs
In: Theoretical Computer Science [382], 139-150
Khachiyan, Leonid
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa
2007Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data
In: Theoretical Computer Science [379], 361-376
Khachiyan, Leonid
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa
2007Enumerating disjunctions and conjunctions of paths and cuts in reliability theory
In: Discrete Applied Mathematics [155], 137-149
Khachiyan, Leonid
Boros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir
Makino, Kazuhisa
2005On the Complexity of Some Enumeration Problems for Matroids
In: SIAM Journal on Discrete Mathematics [19], 966-984
Khachiyan, Leonid
Porkolab, Lorant
2000Integer optimization on convex semialgebraic sets
In: Discrete & Computational Geometry [23], 207-224
Kirousis, Lefteris
Spirakis, Paul G.
Tsigas, Philippas
1996Simple Atomic Snapshots: A Linear Complexity Solution with Unbounded Time-Stamps
In: Information Processing Letters [58], 47-53
Klein, Rolf
Mehlhorn, Kurt
Meiser, Stefan
1993Attachment IconRandomized incremental construction of abstract Voronoi diagrams
In: Computational Geometry: Theory and Applications [3], 157-184
Knauer, Christian
Schlipf, Lena
Schmidt, Jens M.
Tiwary, Hans Raj
2012Largest Inscribed Rectangles in Convex Polygons
In: Journal of Discrete Algorithms [13], 78-85
Kohlbacher, Oliver
Lenhof, Hans-Peter
2000BALL - Rapid Software Prototyping in Computational Molecular Biology
In: Bioinformatics [16], 815-824
Kontogiannis, Spyros
Pantziou, Grammati E.
Spirakis, Paul G.
Yung, Moti
2000Attachment IconRobust Parallel Computations through Randomization
In: Theory of Computing Systems [33], 427-464
Kötzing, Timo
Neumann, Frank
Röglin, Heiko
Witt, Carsten
2012Theoretical analysis of two ACO approaches for the traveling salesman problem
In: Swarm Intelligence [6], 1-21
Kowalik, Lukasz2009Improved edge-coloring with three colors
In: Theoretical Computer Science [410], 3733-3742
Kowalik, Lukasz2007Adjacency Queries in Dynamic Sparse Graphs
In: Inf. Proc. Lett. [-], -
Kowalski, Dariusz
Pelc, Andrzej
2005Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism
In: Theoretical Computer Science [333], 355-371
Kowalski, Dariusz
Pelc, Andrzej
2004Time of deterministic broadcasting in radio networks with local knowledge
In: SIAM Journal on Computing [33], 870-891
Krandick, Werner
Mehlhorn, Kurt
2006Attachment IconNew bounds for the Descartes method
In: Journal of Symbolic Computation [41], 49-66
Kratsch, Dieter
McConnell, Ross
Mehlhorn, Kurt
Spinrad, Jeremy P.
2006Attachment IconCertifying Algorithms for Recognizing Interval Graphs and Permutation Graphs
In: Siam Journal on Computing, 326-353
In: SIAM Journal on Computing [36], 326-353
Krick, Christof
Meyer auf der Heide, Friedhelm
Räcke, Harald
Vöcking, Berthold
Westermann, Matthias
2003Data Management in Networks: Experimental Evaluation of a Provably Good Strategy
In: Theory of Computing Systems [35], 217-245
Krivelevich, Michael
Spöhel, Reto
2012Creating small subgraphs in Achlioptas processes with growing parameter
In: SIAM Journal on Discrete Mathematics [26], 670-686
Krumke, Sven Oliver
Schwahn, Anne
van Stee, Rob
Westphal, Stephan
2008Attachment IconA monotone approximation algorithm for scheduling with precedence constraints
In: Operations Research Letters [36], 247-249
Krysta, Piotr2003Approximating Minimum Size 1,2-Connected Networks
In: Discrete Applied Mathematics [125], 267-288
Krysta, Piotr
Pacholski, Leszek
1999The STO problem is NP-complete
In: Journal of Symbolic Computation [27], 207-219
Krysta, Piotr
Solis-Oba, Roberto
2001Approximation Algorithms for Bounded Facility Location
In: Journal of Combinatorial Optimization [5], 233-247
Kumar, V. S. Anil2001Coupling vs. conductance for the Jerrum-Sinclair chain
In: Random Structures & Algorithms [18], 1-17
Kutz, Martin2005Conway's Angel in three dimensions
In: Theoretical Computer Science [349], 443-451
Kutz, Martin
Elbassioni, Khaled
Katriel, Irit
Mahajan, Meena
2008Simultaneous matchings: Hardness and approximation
In: J. Comput. Syst. Sci. [74], 884-897
Kwek, St.
Mehlhorn, Kurt
2003Attachment IconOptimal Search for Rationals
In: Information Processing Letters [86], 23-26
Lee, Jae-Ha
Park, Sang-Min
Chwa, Kyung-Yong
2000Searching a polygonal room with one door by a 1-searcher
In: International Journal of Computational Geometry and Applications [10], 201-220
Lee, Jae-Ha
Shin, Chan-Su
Chwa, Kyung-Yong
2000Optimal Embedding of Multiple Directed Hamiltonian Rings into d-dimensional Meshes
In: Journal of Parallel and Distributed Computing [60], 775-783
Lehnert, Jörg
Schweitzer, Pascal
2007The Co-Word Problem for the Higman-Thompson Group is context-free
In: Bulletin of the London Mathematical Society [39], 235-241
Lengauer, Thomas
Mehlhorn, Kurt
1984Attachment IconFour results on the complexity of VLSI computation
In: Advances in Computing Research [2], 1-22
Lengauer, Thomas
Mehlhorn, Kurt
1981On the Complexity of VLSI-Computations
In: VLSI Systems and Computations [??], 89-99
Lenhof, Hans-Peter
Morgenstern, Burkhard
Reinert, Knut
1999An exact solution for the segment-to-segment multiple sequence alignment problem
In: Bioinformatics [15], 203-210
Lenhof, Hans-Peter
Reinert, Knut
Vingron, Martin
1998A Polyhedral Approach to RNA Sequence Structure Alignment
In: Journal of Computational Biology [5], 517-530
Lenhof, Hans-Peter
Smid, Michiel
1995Maintaining the visibility map of spheres while moving the viewpoint
In: Algorithmica [13], 301-312
Lenhof, Hans-Peter
Smid, Michiel
1995Sequential and parallel algorithms for the k closest pairs problem
In: International Journal of Computational Geometry & Applications [5], 273-288
Lenhof, Hans-Peter
Smid, Michiel
1994Using persistent data structures for adding range restrictions to searching problems
In: RAIRO Theoretical Informatics and Applications [28], 25-49
Lenhof, Hans-Peter
Smid, Michiel
1993An optimal construction method for generalized convex layers
In: International Journal of Computational Geometry & Applications [3], 245-267
Leonardi, Stefano
Schäfer, Guido
2004Cross-monotonic cost sharing methods for connected facility location games
In: Theoretical Computer Science [326], 431-442
Lermen, Martin
Reinert, Knut
2000The practical use of the A* algorithm for exact multiple sequence alignment
In: Journal of Computational Biology [7], 665-671
Maggs, Bruce M.
Vöcking, Berthold
2000Improved Routing and Sorting on Multibutterflies
In: Algorithmica [28], 438-464
Malamatos, Theocharis2008Lower Bounds for expected-case planar point location
In: Computational Geometry Theory and Applications [39], 91-103
Manjunath, Madhusudan
Sharma, Vikram
2011Applications of dimensionality reduction and exponential sums to graph automorphism
In: Theoretical Computer Science [412], 3639-3649
Mannila, Heikki
Mehlhorn, Kurt
1985Attachment IconA fast algorithm for renaming a set of clauses as a Horn set
In: Information Processing Letters [21], 269-272
Megow, Nicole
Mehlhorn, Kurt
Schweitzer, Pascal
2012Online Graph Exploration: New Results on Old and New Algorithms
In: Theoretical Computer Science [463], 62-72
Megow, Nicole
Möhring, Rolf H.
Schulz, Jens
2011Decision Support and Optimization in Shutdown and Turnaround Scheduling
In: INFORMS Journal on Computing [23], 189 - 204
Mehlhorn, Kurt1995Guest Editor's Foreword
In: Discrete and Computational Geometry [14], 363-363
Mehlhorn, Kurt1988Attachment IconA faster approximation algorithm for the Steiner problem in graphs
In: Information Processing Letters [27], 125-128
Mehlhorn, Kurt1986Attachment IconÜber Verdrahtungsalgorithmen
In: Informatik Spektrum [9], 227-234
Mehlhorn, Kurt1984$AT^2$-optimal VLSI integer division and integer square rooting
In: Integration, the VLSI Journal [2], 163-167
Mehlhorn, Kurt1982Attachment IconA Partial Analysis of Height-Balanced Trees Under Random Insertions and Deletions
In: SIAM Journal on Computing [11], 748-760
Mehlhorn, Kurt1981Attachment IconArbitrary Weight Changes in Dynamic Trees
In: Revue française d'automatique, d'informatique et de recherche opérationnelle : RAIRO [15], 183-211
Mehlhorn, Kurt1981Attachment IconLower bounds on the efficiency of transforming static data structures into dynamic structures
In: Mathematical Systems Theory [15], 1-16
Mehlhorn, Kurt1980Attachment IconAn Efficient Algorithm for Constructing Nearly Optimal Prefix Codes
In: IEEE Transactions on Information Theory [26], 513-517
Mehlhorn, Kurt1979Attachment IconDynamic Binary Search
In: SIAM Journal on Computing [8], 175-198
Mehlhorn, Kurt1979Attachment IconDynamic data structures
In: Mathematical Centre Tracts [108], 71-96
Mehlhorn, Kurt1979Attachment IconParsing Macro Grammars Top Down
In: Information and Control [40], 123-143
Mehlhorn, Kurt1979Attachment IconSome Remarks on Boolean Sums
In: Acta Informatica [12], 371-375
Mehlhorn, Kurt1978Attachment IconEffiziente Algorithmen: Ein Beispiel
In: Informatik Spektrum [1], 81-89
Mehlhorn, Kurt1977Attachment IconA best possible bound for the weighted path length of binary search trees
In: SIAM Journal on Computing [6], 235-239
Mehlhorn, Kurt1976Attachment IconAn Improved Lower Bound on the Formula Complexity of Context-Free Recognition
In: Elektronische Informationsverarbeitung und Kybernetik [12], 523-524
Mehlhorn, Kurt1976Attachment IconBracket-languages are recognizable in logarithmic space
In: Information Processing Letters [5], 168-170
Mehlhorn, Kurt1976Attachment IconPolynomial and abstract subrecursive classes
In: Journal of Computer and System Sciences [12], 147-178
Mehlhorn, Kurt1975Attachment IconNearly Optimal Binary Search Trees
In: Acta Informatica [5], 287-295
Mehlhorn, Kurt
Galil, Zvi
1976Attachment IconMonotone Switching Circuits and Boolean Matrix Product
In: Computing [16], 99-111
Mehlhorn, Kurt
Kavitha, T.
Hariharan, R.
2008Attachment IconFaster Deterministic and Randomized Algorithms for Minimum Cycle Basis in Directed Graphs
In: SIAM Journal of Computing [38], 1430-1447
Mehlhorn, Kurt
Meiser, Stefan
O'Dúnlaing, Colm
1991On the construction of abstract Voronoi diagrams
In: Discrete & Computational Geometry [6], 211-224
Mehlhorn, Kurt
Meiser, Stefan
Rasch, Ronald
2001Attachment IconFurthest site abstract Voronoi diagrams
In: International Journal of Computational Geometry & Applications [11], 583-616
Mehlhorn, Kurt
Müller, Michael
Näher, Stefan
Schirra, Stefan
Seel, Michael
Uhrig, Christian
Ziegler, Joachim
1998A computational basis for higher-dimensional computational geometry and applications
In: Computational Geometry: Theory and Applications [10], 289-304
Mehlhorn, Kurt
Mutzel, Petra
1996Attachment IconOn the Embedding Phase of the Hopcroft and Tarjan Planarity Testing Algorithm
In: Algorithmica [16], 233-242
Mehlhorn, Kurt
Näher, Stefan
1995Attachment IconLEDA: A Platform for Combinatorial and Geometric Computing
In: Communications of the ACM [38], 96-102
Mehlhorn, Kurt
Näher, Stefan
1990A faster compaction algorithm with automatic jog insertion
In: IEEE Transactions on CAD of Integrated Circuits and Systems [9], 158-166
Mehlhorn, Kurt
Näher, Stefan
1990Bounded ordered dictionaries in $O(\log \log n)$ time and $O(n)$ space
In: Information Processing Letters [35], 183-189
Mehlhorn, Kurt
Näher, Stefan
1990Attachment IconDynamic Fractional Cascading
In: Algorithmica [5], 215-241
Mehlhorn, Kurt
Näher, Stefan
Alt, Helmut
1988A Lower Bound on the Complexity of the Union-Split-Find Problem
In: SIAM Journal on Computing [17], 1093-1102
Mehlhorn, Kurt
Näher, Stefan
Nievergelt, Jurg
1994Attachment IconIntroduction
In: Journal of Symbolic Computation [17], 295-295
Mehlhorn, Kurt
Näher, Stefan
Rauch, Monika
1990On the Complexity of a Game Related to the Dictionary Problem
In: SIAM Journal on Computing [19], 902-906
Mehlhorn, Kurt
Näher, Stefan
Schweitzer, Pascal
2011Certifying algorithms
In: Computer Science Review [5], 119-161
Mehlhorn, Kurt
Näher, Stefan
Seel, Michael
Seidel, Raimund
Schilz, Thomas
Schirra, Stefan
Uhrig, Christian
1999Attachment IconChecking geometric programs or verification of geometric structures
In: Computational Geometry: Theory and Applications [12], 85-104
Mehlhorn, Kurt
Näher, Stefan
Uhrig, Christian
1990Attachment IconHidden line elimination for isooriented rectangles
In: Information Processing Letters [35], 137-143
Mehlhorn, Kurt
Osbild, Ralf
Sagraloff, Michael
2011A General Approach to the Analysis of Controlled Perturbation Algorithms
In: Computational Geometry [44], 507-528
Mehlhorn, Kurt
Overmars, Mark H.
1981Attachment IconOptimal dynamization of decomposable searching problems
In: Information Processing Letters [12], 93-98
Mehlhorn, Kurt
Paul, Wolfgang J.
Uhrig, C
1992Attachment Icon$k$ versus $k+1$ Index Registers and Modifiable versus Non-modifiable Programs
In: Information and Computation [101], 123-129
Mehlhorn, Kurt
Preparata, Franco P.
1987Attachment IconArea-Time Optimal Division for $T=\Omega((\log n)^1+\epsilon)$
In: Information and Computation [72], 270-282
Mehlhorn, Kurt
Preparata, Franco P.
1983Attachment IconArea-Time Optimal VLSI Integer Mutliplier with Minimum Computation Time
In: Information and Control [58], 137-156
Mehlhorn, Kurt
Preparata, Franco P.
Sarrafzadeh, Maji
1986Attachment IconChannel Routing in Knock-Knee Mode: Simplified Algorithms and Proofs
In: Algorithmica [1], 213-221
Mehlhorn, Kurt
Preparata, F. P.
1986Attachment IconRouting through a Rectangle
In: Journal of the ACM [33], 60-85
Mehlhorn, Kurt
Preparata, F. P.
1983$AT^2$-optimal VLSI multipliers with minimum computation time
In: Information & Control [58], 137-196
Mehlhorn, Kurt
Priebe, Volker
1997On the All-Pairs Shortest-Path Algorithm of Moffat and Takaoka
In: Random Structures Algorithms [10], 205-220
Mehlhorn, Kurt
Priebe, Volker
Schäfer, Guido
Sivadasan, Naveen
2002Attachment IconAll-Pairs Shortest-Paths Computation in the Presence of Negative Cycles
In: Information Processing Letters [81], 341-343
Mehlhorn, Kurt
Ray, Saurabh
2010Faster algorithms for computing Hong's bound on absolute positiveness
In: Journal of Symbolic Computation [45], 677-683
Mehlhorn, Kurt
Rülling, W.
1990Attachment IconCompaction on the torus
In: IEEE Transactions on CAD of Integrated Circuits and Systems [9], 389-397
Mehlhorn, Kurt
Sack, Jörg-Rüdiger
2000Editorial
In: Computational Geometry [17], 1-2
Mehlhorn, Kurt
Sack, Jörg-Rüdiger
Urrutia, Jorg
1999Editorial
In: Computational Geometry [12], 153-154
Mehlhorn, Kurt
Sagraloff, Michael
2011A deterministic algorithm for isolating real roots of a real polynomial
In: Journal of Symbolic Computation [46], 70-90
Mehlhorn, Kurt
Sanders, Peter
2003Attachment IconScanning Multiple Sequences via Cache Memory
In: Algorithmica [35], 75-93
Mehlhorn, Kurt
Schmidt, Bernd H.
1986Attachment IconOn BF-orderable graphs
In: Discrete Applied Mathematics [15], 315-327
Mehlhorn, Kurt
Seel, Michael
2003Attachment IconInfimaximal frames: A technique for making lines look like segments
In: International Journal of Computational Geometry & Applications [13], 241-255
Mehlhorn, Kurt
Sharir, Micha
Welzl, Emo
1993Attachment IconTail Estimates for the Efficiency of Randomized Incremental Algorithms for Line Segment Intersection
In: Computational Geometry: Theory and Applications [3], 235-246
Mehlhorn, Kurt
Sundar, R.
Uhrig, Christian
1997Maintaining Dynamic Sequences under Equality Tests in Polylogarithmic Time
In: Algorithmica [17], 183-198
Mehlhorn, Kurt
Tsagarakis, M.
1979On the isomorphism of two algorithms: Hu/Tucker and Garsia/Wachs
In: Colloque de Lille `Les Arbres en Algebre et en Programmation' [??], ??
Mehlhorn, Kurt
Tsakalidis, Athanasios K.
1993Dynamic Interpolation Search
In: Journal of the ACM [40], 621-634
Mehlhorn, Kurt
Tsakalidis, Athanasios K.
1986Attachment IconAn Amortized Analysis of Insertions into AVL-Trees
In: SIAM Journal on Computing [15], 22-33
Mehlhorn, Kurt
Vishkin, Uzi
1984Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories
In: Acta Informatica [21], 339-374
Mehlhorn, Kurt
Yap, Chee-Keng
1991Constructive Whitney-Graustein theorem, or how to untangle closed planar curves
In: SIAM Journal on Computing [20], 603-621
Mestre, Julian2010Adaptive local ratio
In: SIAM Journal on Computing [39], 3038-3057
Meyerhenke, Henning
Sauerwald, Thomas
2012Beyond Good Partition Shapes: An Analysis of Diffusive Graph Partitioning
In: Algorithmica [64], 329-361
Meyer, Ulrich2003Average-case complexity of single-source shortest-path algorithms: lower and upper bounds
In: Journal of Algorithms [48], 91-134
Meyer, Ulrich
Sanders, Peter
2003$\Delta$-stepping: a parallelizable shortest path algorithm
In: Journal of Algorithms [49], 114-152
Meyer, Ulrich
Sibeyn, Jop F.
2002Oblivious Gossiping on Tori
In: Journal of Algorithms [42], 1-19
Michail, Dimitrios2007Reducing rank-maximal to maximum weight matching
In: Theoretical Computer Science [389], 125-132
Misra, Neeldhara
Philip, Geevarghese
Raman, Venkatesh
Saurabh, Saket
2012Attachment IconOn Parameterized Independent Feedback Vertex Set
In: Theoretical Computer Science [461], 65-75
Misra, Neeldhara
Philip, Geevarghese
Raman, Venkatesh
Saurabh, Saket
Sikdar, Somnath
2012Attachment IconFPT Algorithms for Connected Feedback Vertex Set
In: Journal of Combinatorial Optimization [24], 131-146
Moehring, Rolf H.
Skutella, Martin
Stork, Frederik
2004Attachment IconScheduling with AND/OR Precedence Constraints
In: SIAM Journal on Computing [33], 393-415
Müller, Michael
Rüb, Christine
Rülling, Wolfgang
1996A Circuit for Exact Summation of Floating-Point Numbers
In: Information Processing Letters [57], 159-163
Müller, Tobias
Perez-Gimenez, Xavier
Wormald, Nicholas
2011Disjoint Hamilton cycles in the random geometric graph
In: Journal of Graph Theory [68], 299-322
Mustafa, Nabil H.
Ray, Saurabh
2010Improved Results on Geometric Hitting Set Problems
In: Discrete & Computational Geometry [44], 883-895
Mutzel, Petra2001An alternative method to crossing minimization on hierarchical graphs
In: SIAM Journal on Optimization [11], 1065-1080
Mutzel, Petra
Odenthal, Thomas
Scharbrodt, M.
1998The thickness of graphs: A survey
In: Graphs and Combinatorics [14], 59-73
Neumann, Frank2008Expected Runtimes of Evolutionary Algorithms for the Eulerian Cycle Problem
In: Computers and Operations Research [35], 2750-2759
Neumann, Frank
Reichel, Joachim
Skutella, Martin
2011Computing Minimum Cuts by Randomized Search Heuristics
In: Algorithmica [59], 323-342
Neumann, Frank
Sudholt, Dirk
Witt, Carsten
2009Analysis of Different MMAS ACO Algorithms on Unimodal Functions and Plateaus
In: Swarm Intelligence [3], 35-68
Neumann, Frank
Wegener, Ingo
2007Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem
In: Theoretical Computer Science [378], 32-40
Neumann, Frank
Witt, Carsten
2010Ant Colony Optimization and the minimum spanning tree problem
In: Theoretical Computer Science [411], 2406-2413
Neumann, Frank
Witt, Carsten
2009Runtime Analysis of a Simple Ant Colony Optimization Algorithm
In: Algorithmica [54], 243-255
Niedermeier, Rolf
Reinhard, Klaus
Sanders, Peter
2002Towards Optimal Locality in Mesh-Indexings
In: Discrete Applied Mathematics [117], 211-237
Nor, Igor
Hermlin, Danny
Charlat, Sylvain
Engelstadter, Jan
Reuter, Max
Duron, Olivier
Sagot, Marie-France
2012Mod/Resc Parsimony Inference: Theory and application
In: Information and Computation [213], 23-32
Nutov, Zeev
Penn, Michael
2000On Integrality, Stability and Composition of Dicycle Packings and Covers
In: Journal of Combinatorial Optimization [4], 235 - 252
Panagiotou, Konstantinos2009The Degree Sequence of Random Graphs from Subcritical Classes
In: Combinatorics, Probability and Computing [18], 647-681
Panagiotou, Konstantinos
Sinha, Makrand
2012Vertices of degree k in random unlabeled trees
In: Journal of Graph Theory [69], 114-130
Panagiotou, Konstantinos
Spöhel, Reto
Steger, Angelika
Thomas, Henning
2013Explosive percolation in Erdös-Rényi-like random graph processes
In: Combinatorics, Probability and Computing [22], 133-145
Panagiotou, Konstantinos
Steger, Angelika
2010Maximal Biconnected Subgraphs of Random Planar Graphs
In: ACM Transactions on Algorithms [6], 31,1-31,21
Panconesi, Alessandro
Papatriantafilou, Marina
Tsigas, Philippas
Vitanyi, Paul
1998Randomized Naming Using Wait-Free Shared Variables
In: Distributed Computing [11], 113-124
Papatriantafilou, Marina
Tsigas, Philippas
1997Self-Stabilizing Wait-Free Clock Synchronization
In: Parallel Processing Letters [7], 321-328
Pemmaraju, Sriram V.
Raman, Rajiv
Varadarajan, Kasturi
2011Max-coloring and online coloring with bandwidths on interval graphs
In: ACM Transactions on Algorithms [7], 35:1-35:21
Pettie, Seth
Sanders, Peter
2004Attachment IconA simpler linear time 2/3 - eps approximation for maximum weight matching
In: Information Processing Letters [91], 271-276
Philip, Geevarghese
Raman, Venkatesh
Sikdar, Somnath
2012Polynomial kernels for dominating set in graphs of bounded degeneracy and beyond
In: ACM Transactions on Algorithms [9], 23
Polzin, Tobias
Vahdati Daneshmand, Siavash
2003On Steiner trees and minimum spanning trees in hypergraphs
In: Operations Research Letters [31], 12-20
Polzin, Tobias
Vahdati Daneshmand, Siavash
2001A Comparison of Steiner Tree Relaxations
In: Discrete Applied Mathematics [112], 241-261
Polzin, Tobias
Vahdati Daneshmand, Siavash
2001Improved Algorithms for the Steiner Problem in Networks
In: Discrete Applied Mathematics [112], 263-300
Pruhs, Kirk
van Stee, Rob
Uthaisombut, Patchrawat
2008Attachment IconSpeed Scaling of Tasks with Precedence Constraints
In: Theory of Computing Systems [43], 67-80
Pyrga, Evangelia
Schulz, Frank
Wagner, Dorothea
Zaroliagis, Christos
2007Efficient models for timetable information in public transportation systems
In: ACM Journal of Experimental Algorithmics [12], 1-39
Ramos, Edgar A.2001An Optimal Deterministic Algorithm for Computing the Diameter of a Three-Dimensional Point Set
In: Discrete and Computational Geometry [26], 233-244
Ramos, Edgar A.2001Solving Some Discrepancy Problems in NC
In: Algorithmica [29], 371-395
Ramos, Edgar A.1997Intersection of unit-balls and diameter of a point set in R³
In: Computational Geometry Theory and Applications [8], 57-65
Ramos, Edgar A.
Amato, Nancy M.
Goodrich, Michael T.
2001A Randomized Algorithm for Triangulating a Simple Polygon in Linear Time
In: Discrete and Computational Geometry [26], 246-265
Rathe, Ulrich
Sanders, Peter
Knight, Peter
1999A case study in scalability: an ADI method for the two-dimensional time-dependent Dirac equation
In: Parallel Computing [25], 525-534
Rieger, Joachim1995Generic Evolutions of Edges on Families of Diffused Greyvalue Surfaces
In: Journal of Mathematical Imaging and Vision [5], 207-217
Rüb, Christine1997On the average running time of odd-even merge sort
In: Journal of Algorithms [22], 329-346
Rusinov, Momchil
Schweitzer, Pascal
2010Homomorphism -- homogeneous graphs
In: Journal of Graph Theory [65], 253-262
Sagraloff, Michael2010A General Approach to Isolating Roots of a Bitstream Polynomial
In: Mathematics in Computer Science [4], 481-506
Sanders, Peter2003Asynchronous Scheduling of Redundant Disk Arrays
In: IEEE Transactions on Computers [52], 1170-1184
Sanders, Peter2002Randomized Receiver Initiated Load Balancing Algorithms for Tree Shaped Computations
In: The Computer Journal [45], 561-573
Sanders, Peter2002Reconciling simplicity and realism in parallel disk models
In: Parallel Computing [28], 705-723
Sanders, Peter1999Analysis of nearest neighbor load balancing algorithms for random loads
In: Parallel Computing [25], 1013-1033
Sanders, Peter1998Random Permutations on Distributed, External and Hierarchical Memory
In: Information Processing Letters [67], 305-309
Sanders, Peter1998Random Permutations on Distributed, External and Hierarchical Memory
In: PARS-Mitteilungen, 160-165
In: PARS-Mitteilungen [1998], 160-165
Sanders, Peter1998Randomized Priority Queues for Fast Parallel Access
In: Journal Parallel and Distributed Computing [49], 86-97
Sanders, Peter
Sibeyn, Jop F.
2003A Bandwidth Latency Tradeoff for Broadcast and Reduction
In: Information Processing Letters [86], 33-38
Sanders, Peter
Singler, Johannes
van Stee, Rob
2013Attachment IconReal-time prefetching and caching
In: Journal of Scheduling [16], 47-58
Sanders, Peter
Sivadasan, Naveen
Skutella, Martin
2009Online scheduling with bounded migration
In: Mathematics of Operations Research [34], 481-498
Sanders, Peter
Solis-Oba, Roberto
2001How Helpers Hasten h-Relations
In: Journal of Algorithms [41], 86-98
Sanders, Peter
Vöcking, Berthold
2003Tail bounds and expectations for random arc allocation and applications
In: Combinatorics, Probability and Computing [12], 225-244
Sanders, Peter
Vollmar, R.
Worsch, T.
2002Feasible models of computation: Three-dimensionality and energy consumption
In: Fundamenta Informaticae [52], 233-248
Schmidt, Jens M.2013A Simple Test on 2-Vertex- and 2-Edge-Connectivity
In: Information Processing Letters [113], 241-244
Schmidt, Jens M.2013Contractions, Removals and Certifying 3-Connectivity in Linear Time
In: SIAM Journal on Computing [42], 494-535
Schmidt, Jens M.2012Construction Sequences and Certifying 3-Connectivity
In: Algorithmica [62], 192-208
Schömer, Elmar
Wolpert, Nicola
2006An Exact and Efficient Approach for Computing a Cell in an Arrangement of Quadrics
In: Computational Geometry [33], 65 - 97
Schweitzer, Pascal2009Using the Incompressibility Method to obtain Local Lemma results for Ramsey-type Problems
In: Information Processing Letters [109], 229-232
Schweitzer, Pascal
Schweitzer, Patrick
2010Connecting face hitting sets in planar graphs
In: Information Processing Letters [111], 11-15
Seiden, Steve S.2000Online randomized multiprocessor scheduling
In: Algorithmica [28], 173-216
Seiden, Steve S.1999Randomized online scheduling with delivery times
In: Journal of Combinatorial Optimization [3], 399-416
Shervashidze, Nino
Schweitzer, Pascal
van Leeuwen, Erik Jan
Mehlhorn, Kurt
Borgwardt, Karsten M.
2011Weisfeiler-Lehman graph kernels
In: Journal of Machine Learning Research [12], 2539-2561
Sibeyn, Jop F.2000Solving fundamental problems on sparse-meshes
In: IEEE Transactions on Parallel & Distributed Systems [11], 1324-1332
Sibeyn, Jop F.1999Row-Major Sorting on Meshes
In: SIAM Journal on Computing [28], 847-863
Sibeyn, Jop F.1998List Ranking on Meshes
In: Acta Informatica [35], 543-566
Sibeyn, Jop F.1997Routing on Triangles, Tori and Honeycombs
In: International Journal on the Foundations of Computer Science [8], 269-287
Sibeyn, Jop F.
Grammatikakis, M.D.
Hsu, D.F.
Kraetzl, M.
1998Packet Routing in Fixed-Connection Networks: A Survey
In: Journal of Parallel and Distributed Computing [54], 77-132
Sibeyn, Jop F.
Guillaume, Frank
Seidel, Tillmann
1999Practical Parallel List Ranking
In: Journal of Parallel and Distributed Computing [56], 156-180
Sibeyn, Jop F.
Juurlink, Ben
Rao, P. Srinivasa
1998Gossiping on Meshes and Tori
In: IEEE Transactions on Parallel and Distributed Systems [9], 513-525
Sibeyn, Jop F.
Kaufmann, Michael
1997Randomized Multipacket Routing and Sorting on Meshes
In: Algorithmica [17], 224-244
Sibeyn, Jop F.
Kaufmann, Michael
Chlebus, Bogdan S.
1997Deterministic Permutation Routing on Meshes
In: Journal of Algorithms [22], 111-141
Sitters, Rene2005Complexity of preemptive minsum scheduling on unrelated parallel machines
In: Journal of Algorithms [57], 37-48
Sitters, Rene
Stougie, Leen
2006The general two-server problem
In: Journal of the ACM [53], 437-458
Smid, Michiel1995Dynamic rectangular point location, with an application to the closest pair problem
In: Information and Computation [16], 1-9
Smid, Michiel
Ray, Rahul
Wendt, Ulrich
Lange, Katharina
2004Computing Large Planar Regions in Terrains, with an Application to Fracture Surface
In: Discrete Applied Mathematics [139], 253-264
Soranzo, Nicola
Ramezani, Fahimeh
Iacono, Giovanni
Altafini, Claudio
2012Decompositions of large-scale biological systems based on dynamical properties
In: Bioinformatics [28], 76-83
Sridharan, K
Subramanian, C. R.
Sudha, N
1998Some Properties of Touching Distances for Polygons and Polyhedra
In: Applied Mathematics Letters [11], 1-7
Subramanian, C. R.2000Algorithms for Colouring Random k-colourable Graphs
In: Combinatorics, Probability and Computing [9], 45-77
Subramanian, C. R.1999Minimum Coloring k-Colorable Graphs in Polynomial Average Time
In: Journal of Algorithms [33], 112-123
Subramanian, C. R.
Fürer, Martin
Veni Madhavan, C. E.
1998Algorithms for Coloring Semi-random Graphs
In: Random Structures & Algorithms [13], 125-158
Teramoto, Sachio
Asano, Tetsuo
Katoh, Naoki
Doerr, Benjamin
2006Inserting Points Uniformly at Every Instance
In: IEICE - Transactions on Information and Systems [E89-D], 2348-2356
Thorup, Mikkel2000Floats, Integers, and Single Source Shortest Paths
In: Journal of Algorithms [35], 189 -201
Träff, Jesper Larsson1996A Heuristic for Blocking Flow Algorithms
In: European Journal of Operational Research [89], 564-569
Träff, Jesper Larsson1995An Experimental Comparison of two Distributed Singel-Source Shortest Path Algorithm
In: Parallel Computing [21], 1505-1532
Träff, Jesper Larsson
Zaroliagis, Christos
2000A simple parallel algorithm for the single-source shortest path problem on planar digraphs
In: Journal of Parallel and Distributed Computing [60], 1103-1124
van Stee, Rob2013SIGACT News Online Algorithms Column 22
In: SIGACT News [44], 125
van Stee, Rob2012Attachment IconAn improved algorithm for online rectangle filling
In: Theoretical Computer Science [423], 59-74
van Stee, Rob2012Attachment IconSIGACT News Online Algorithms Column 20: The Power of Harmony
In: SIGACT News [43], 127-136
van Stee, Rob2012Attachment IconSIGACT News Online Algorithms Column 21: APPROX and ALGO
In: SIGACT News [43], 123-129
van Zuylen, Anke2011An improved monotone algorithm for scheduling related machines with precedence constraints
In: Operations Research Letters [39], 423-427
van Zuylen, Anke2011Deterministic Sampling Algorithms for Network Design
In: Algorithmica [60], 110-151
van Zuylen, Anke2011Linear programming based approximation algorithms for feedback set problems in bipartite tournaments.
In: Theoretical Computer Science [412], 2556-2561
von Braunmühl, Burchard
Cook, Stephen
Mehlhorn, Kurt
Verbeek, Rutger
1983The Recognition of Deterministic CFL's in Small Time and Space
In: Information and Control [56], 34-51
Wahlström, Magnus2011New Plain-Exponential Time Classes for Graph Homomorphism
In: Theory of Computing Systems [49], 273-282
Wendt, Ulrich
Lange, Katharina
Smid, Michiel
Ray, Rahul
Tönnies, Klaus-Dietz
2002Surface Topography Quantification by Integral and Feature-related Parameters
In: Materialwissenschaft und Werkstofftechnik [33], 621-627
Winzen, Carola2013Direction-Reversing Quasi-Random Rumor Spreading with Restarts
In: Information Processing Letters [113], 921-926
Xu, Chihao
Karrenbauer, Andreas
Soh, Kian Min
Codrea, Cosmin
2008Consecutive multiline addressing: A scheme for addressing PMOLEDs
In: Journal of the Society for Information Display [16], 211-219
Zaroliagis, Christos1997Simple and Work-Efficient Parallel Algorithms for the Minimum Spanning Tree Problem
In: Parallel Processing Letters [7], 25-37
Zotenko, Elena
Mestre, Julián
O'Leary, Dianne
Przytyzka, Teresa
2008Essential Complex Biological Modules Explain the Centrality-Lethality Rule
In: PLoS Computational Biology [x], x-x
49
Show details for Electronic Journal ArticleElectronic Journal Article
127
Show details for ReportReport
10
Show details for Thesis - Bachelor thesisThesis - Bachelor thesis
155
Show details for Thesis - Master's thesisThesis - Master's thesis
60
Show details for Thesis - Doctoral dissertationThesis - Doctoral dissertation
8
Show details for Thesis - Habilitation thesisThesis - Habilitation thesis
1
Show details for Thesis - Diploma thesisThesis - Diploma thesis
1
Show details for Thesis - otherThesis - other
4
Show details for ManualManual
36
Show details for Unpublished/DraftUnpublished/Draft
12
Show details for MiscellaneousMiscellaneous
1
Show details for *yet unkown Form:eBookForm*yet unkown Form:eBookForm
2359

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