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: 7. Library - 2. All Years - 8. Journal Short Titles

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

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

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