 | Journal Full Title / ISSN | Year | Author/Editor | | Title | |
|---|
 | 0178-4617 |
| |
| Algorithmica
0178-4617 | 2011 | Kavitha, Telikepalli
Mehlhorn, Kurt
Michail, Dimitrios | | New Approximation Algorithms for Minimum Cycle Bases of Graphs
In: Algorithmica [59], 471-488 | |
| Algorithmica
- | 2009 | Neumann, Frank
Witt, Carsten | | Runtime Analysis of a Simple Ant Colony Optimization Algorithm
In: Algorithmica [54], 243-255 | |
|
| |
| Acta Informatica
0001-5903 | 1998 | Sibeyn, Jop F. | | List Ranking on Meshes
In: Acta Informatica [35], 543-566 | |
|
| |
| Algorithmica
0178-4617 | 1997 | Arya, Sunil
Smid, Michiel | | Efficient construction of a bounded degree spanner with low weight
In: Algorithmica [17], 33-54 | |
| Algorithmica
0178-4617 | 1997 | Kaufmann, Michael
Sibeyn, Jop F. | | Randomized Multipacket Routing and Sorting on Meshes
In: Algorithmica [17], 224-244 | |
| Algorithmica
0178-4617 | 1997 | Mehlhorn, Kurt
Sundar, R.
Uhrig, Christian | | Maintaining Dynamic Sequences under Equality Tests in Polylogarithmic Time
In: Algorithmica [17], 183-198 | |
| Algorithmica
0178-4617 | 1996 | Cheriyan, Joseph
Mehlhorn, Kurt |  | Algorithms for Dense Graphs and Networks on the Random Access Computer
In: Algorithmica [15], 521-549 | |
| Algorithmica
0178-4617 | 1996 | Jünger, Michael
Mutzel, Petra | | Maximum planar subgraphs and nice embeddings: Practical layout tools
In: Algorithmica [16], 33-59 | |
| Algorithmica
0178-4617 | 1996 | Mehlhorn, Kurt
Mutzel, Petra | | On the Embedding Phase of the Hopcroft and Tarjan Planarity Testing Algorithm
In: Algorithmica [16], 233-242 | |
| Algorithmica
0178-4617 | 1995 | Dietz, Paul
Mehlhorn, Kurt
Raman, Rajeev
Uhrig, Christian | | Lower bounds for set intersection queries
In: Algorithmica [14], 154-168 | |
| Algorithmica
0178-4617 | 1995 | Lenhof, Hans-Peter
Smid, Michiel | | Maintaining the visibility map of spheres while moving the viewpoint
In: Algorithmica [13], 301-312 | |
| Algorithmica |
| |
| Algorithmica
0178-4617 | 1998 | Albers, Susanne
Mitzenmacher, Michael | | Average case analyses of list update algorithms, with applications to data compression
In: Algorithmica [21], 312-329 | |
| Algorithmica
0178-4617 | 1998 | Chong, Ka Wong
Lam, Tak Wah | | Approximating Biconnectivity in Parallel
In: Algorithmica [21], 395-410 | |
|
| |
| Applied Mathematics Letters
0893-9659 | 1998 | Sridharan, K
Subramanian, C. R.
Sudha, N | | Some Properties of Touching Distances for Polygons and Polyhedra
In: Applied Mathematics Letters [11], 1-7 | |
|
| |
| Computational Geometry: Theory and Applications
- | 2008 | Kettner, Lutz
Mehlhorn, Kurt
Pion, Sylvain
Schirra, Stefan
Yap, Chee | | Classroom Examples of Robustness Problems in Geometric Computations
In: Computational Geometry: Theory and Applications [40], 61-78 | |
|
| |
| Combinatorica
0209-9683 | 1998 | Frederickson, Greg N.
Solis-Oba, Roberto | | Algorithms for Measuring Perturbability in Matroid Optimization
In: Combinatorica [18], 503-518 | |
|
| |
| Communications of the ACM
0001-0782 | 1995 | Mehlhorn, Kurt
Näher, Stefan | | LEDA: A Platform for Combinatorial and Geometric Computing
In: Communications of the ACM [38], 96-102 | |
|
| |
| Computational Geometry. Theory and Applications
0925-7721 | 1996 | Devillers, Olivier
Golin, Mordecai J.
Kedem, Klara
Schirra, Stefan | | Queries on Voronoi Diagrams of Moving Points
In: Computational Geometry. Theory and Applications [5], 315-327 | |
| Computational Geometry
0925-7721 | 1996 | Gupta, 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 | 1996 | Gupta, 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 | 1996 | Gupta, Prosenjit
Janardan, Ravi
Smid, Michiel | | Fast algorithms for collision and proximity problems involving moving geometric objects
In: Computational Geometry [6], 371-391 | |
| Comput. Geom., Theory Appl. |
| |
| Computational Geometry: Theory and Applications
0925-7721 | 1998 | Mehlhorn, Kurt
Müller, Michael
Näher, Stefan
Schirra, Stefan
Seel, Michael
Uhrig, Christian
Ziegler, Joachim | | A computational basis for higher-dimensional computational geometry and applications
In: Computational Geometry: Theory and Applications [10], 289-304 | |
| Discrete Comput. Geom. |
| |
| Discrete & Computational Geometry
0179-5376 | 1996 | Arya, Sunil
Mount, David M.
Narayan, Oruttom | | Accounting for boundary effects in nearest neighbor searching
In: Discrete & Computational Geometry [16], 155-176 | |
| Discrete Math. |
| |
| Discrete Mathematics
0012-365X | 1998 | Jünger, Michael
Mutzel, Petra
Odenthal, Thomas
Scharbrodt, M. | | The thickness of a minor-excluded class of graphs
In: Discrete Mathematics [182], 169-176 | |
| Distrib. Comput. |
| |
| Distributed Computing
0178-2770 | 1998 | Panconesi, Alessandro
Papatriantafilou, Marina
Tsigas, Philippas
Vitanyi, Paul | | Randomized Naming Using Wait-Free Shared Variables
In: Distributed Computing [11], 113-124 | |
| EATCS Bulletin |
| |
| Bulletin of European Association for Theoretical Computer Science
0252-9742 | 2009 | Christodoulou, George
Koutsoupias, Elias | | Mechanism Design for Scheduling
In: Bulletin of European Association for Theoretical Computer Science [97], 40-59 | |
| EIK |
| |
| Elektronische Informationsverarbeitung und Kybernetik
- | 1976 | Mehlhorn, Kurt | | An Improved Lower Bound on the Formula Complexity of Context-Free Recognition
In: Elektronische Informationsverarbeitung und Kybernetik [12], 523-524 | |
| Eur. J. Oper. Res. |
| |
| European Journal of Operational Research
0377-2217 | 1996 | Träff, Jesper Larsson | | A Heuristic for Blocking Flow Algorithms
In: European Journal of Operational Research [89], 564-569 | |
| Form. Methods Syst. Des. |
| |
| Formal Methods in System Design
0925-9856 | 1996 | Gergov, Jordan
Meinel, Christoph | | Mod-2-OBDDs - a Date Structure that generalizes EXOR-Sum-of-Products and Ordered Binary Decision Diagrams
In: Formal Methods in System Design [8], 273-282 | |
| Graphs Comb. |
| |
| Graphs and Combinatorics
0911-0119 | 1998 | Mutzel, Petra
Odenthal, Thomas
Scharbrodt, M. | | The thickness of graphs: A survey
In: Graphs and Combinatorics [14], 59-73 | |
| IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst. |
| |
| IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
0278-0070 | 1998 | Jünger, Michael
Leipert, Sebastian
Mutzel, Petra | | A Note on Computing a Maximal Planar Subgraph using PQ-Trees
In: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems [17], 609-612 | |
| IEEE Trans. Parallel Distrib. Syst. |
| |
| IEEE Transactions on Parallel and Distributed Systems
1045-9219 | 1998 | Sibeyn, Jop F.
Juurlink, Ben
Rao, P. Srinivasa | | Gossiping on Meshes and Tori
In: IEEE Transactions on Parallel and Distributed Systems [9], 513-525 | |
| IEICE Trans. Inf. & Syst. |
| |
| IEICE - Transactions on Information and Systems
0916-8532 | 2006 | Teramoto, Sachio
Asano, Tetsuo
Katoh, Naoki
Doerr, Benjamin | | Inserting Points Uniformly at Every Instance
In: IEICE - Transactions on Information and Systems [E89-D], 2348-2356 | |
| IJCGA |
| |
| International Journal of Computational Geometry & Applications
0218-1959 | 2011 | Elbassioni, 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 | 2007 | Eisenbrand, Friedrich
Funke, Stefan
Karrenbauer, Andreas
Reichel, Joachim
Schömer, Elmar | | Packing a truck - Now with a twist!
In: International Journal of Computational Geometry & Applications [17], 505-527 | |
| International Journal of Computational Geometry and Applications
- | 2006 | Aronov, 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 | |
| Inf. Comput. |
| |
| Information and Computation
0890-5401 | 1996 | Chaudhuri, Shiva | | Sensitive functions and approximate problems
In: Information and Computation [126], 161-168 | |
| Information and Computation
0890-5401 | 1995 | Bast, Hannah
Hagerup, Torben | | Fast Parallel Space Allocation, Estimation, and Integer Sorting
In: Information and Computation [123], 72-110 | |
| Information and Computation
0890-5401 | 1995 | Fleischer, 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 | 1995 | Hagerup, Torben | | A Lower Bound for the Emulation of PRAM Memories on Processor Networks
In: Information and Computation [119], 124-128 | |
| Information and Computation
0890-5401 | 1995 | Hariharan, Ramesh
Muthukrishnan, S. | | String Matching over a General Matching Relation
In: Information and Computation [122], 140-148 | |
| Information and Computation
0890-5401 | 1995 | Smid, Michiel | | Dynamic rectangular point location, with an application to the closest pair problem
In: Information and Computation [16], 1-9 | |
|
| |
| Information Processing Letters
0020-0190 | 1998 | Althaus, Ernst
Mehlhorn, Kurt | | Maximum Network Flow with Floating Point Arithmetic
In: Information Processing Letters [66], 109-113 | |
| Information Processing Letters
0020-0190 | 1998 | Chaudhuri, Shiva
Garg, Naveen
Ravi, R. | | The $p$-neighbor $k$-center problem
In: Information Processing Letters [65], 131-134 | |
| Information Processing Letters
0020-0190 | 1998 | Sanders, Peter | | Random Permutations on Distributed, External and Hierarchical Memory
In: Information Processing Letters [67], 305-309 | |
| Information Processing Letters
0020-0190 | 1996 | Alon, Noga
Bradford, Phillip Gnassi
Fleischer, Rudolf | | Matching nuts and bolts faster
In: Information Processing Letters [59], 123-127 | |
| Information Processing Letters
0020-0190 | 1996 | Kirousis, 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 | 1996 | Müller, Michael
Rüb, Christine
Rülling, Wolfgang | | A Circuit for Exact Summation of Floating-Point Numbers
In: Information Processing Letters [57], 159-163 | |
| Information Processing Letters
0020-0190 | 1995 | Albers, 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 | 1995 | Hagerup, Torben | | The Parallel Complexity of Integer Prefix Summation
In: Information Processing Letters [56], 59-64 | |
| Int. J. Found. Comput. Sci. |
| |
| International Journal of Foundations of Computer Science
0129-0541 | 1996 | Fleischer, Rudolf | | A simple balanced search tree with $O(1)$ worst-case update time
In: International Journal of Foundations of Computer Science [7], 137-149 | |
| IPL |
| |
| Information Processing Letters
0020-0190 | 2010 | Elmasry, Amr | | The longest almost-increasing subsequence
In: Information Processing Letters [110], 655-658 | |
| Information Processing Letters
0020-0190 | 2010 | Schweitzer, Pascal
Schweitzer, Patrick | | Connecting face hitting sets in planar graphs
In: Information Processing Letters [111], 11-15 | |
|
| |
| Journal of Intellingent Information Systems
0925-9902 | 2008 | Govindarajan, Sathish
Dietze, Michael C.
Agarwal, Pankaj K.
Clark, James S. | | A scalable algorithm for dispersing population
In: Journal of Intellingent Information Systems [29], 39-61 | |
|
| |
| Journal of Algorithms
0196-6774 | 1998 | Albers, Susanne
Koga, Hisashi | | New on-line algorithms for the page replication problem
In: Journal of Algorithms [27], 75-96 | |
| Journal of Algorithms
0196-6774 | 1998 | Arikati, 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 | 1995 | Gupta, Prosenjit
Janardan, Ravi
Smid, Michiel | | Further results on generalized intersection searching problems:
counting, reporting, and dynamization
In: Journal of Algorithms [19], 282-317 | |
| Journal of Algorithms
0196-6774 | 1995 | Hagerup, Torben | | Fast Deterministic Processor Allocation
In: Journal of Algorithms [18], 629-649 | |
| J. Parallel Distrib. Comput. |
| |
| Journal of Parallel and Distributed Computing
0743-7315 | 1999 | Sibeyn, 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 | 1998 | Brodal, 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 | 1998 | Sanders, Peter | | Randomized Priority Queues for Fast Parallel Access
In: Journal Parallel and Distributed Computing [49], 86-97 | |
| Journal of Parallel and Distributed Computing
0743-7315 | 1998 | Sibeyn, Jop F.
Grammatikakis, M.D.
Hsu, D.F.
Kraetzl, M. | | Packet Routing in Fixed-Connection Networks: A Survey
In: Journal of Parallel and Distributed Computing [54], 77-132 | |
|
| |
| Mathematics of Computation
0025-5718 | 2007 | El Kahoui, M'hammed
Rakrak, Said | | Structure of Groebner bases with respect to block orders
In: Mathematics of Computation [76], 2181-2187 | |
|
| |
| Mathematical Programming (A)
0025-5610 | 1995 | Garg, Naveen
Vazirani, Vijay V. | | A polyhedron with all s-t cuts as vertices, and adjacency of cuts
In: Mathematical Programming (A) [70], 17-25 | |
|
| |
| Mathematics in Computer Science
- | 2010 | Sagraloff, Michael | | A General Approach to Isolating Roots of a Bitstream Polynomial
In: Mathematics in Computer Science [4], 481-506 | |
|
| |
| Nordic Journal of Computing
1236-6064 | 1996 | Brodal, Gerth Stølting
Chaudhuri, Shiva
Radhakrishnan, R. | | The randomized complexity of maintaining the minimum
In: Nordic Journal of Computing [3], 337-351 | |
|
| |
| Parallel Computing
0167-8191 | 1996 | Gasieniec, Leszek
Pelc, Andrzej | | Adaptive Broadcasting with Faulty Nodes
In: Parallel Computing [22], 903-912 | |
| Parallel Processing Letters |
| |
| Parallel Processing Letters
- | 1996 | Chaudhuri, Shiva
Dimopoulos, Yannis
Zaroliagis, Christos | | On the Parallel Complexity of Acyclic Logic Programs
In: Parallel Processing Letters [6], 223-230 | |
|
| |
| Revue française d'automatique, d'informatique et de recherche opérationnelle : RAIRO
0399-0540 | 1981 | Mehlhorn, Kurt | | Arbitrary Weight Changes in Dynamic Trees
In: Revue française d'automatique, d'informatique et de recherche opérationnelle : RAIRO [15], 183-211 | |
| Random Struct. Algorithms |
| |
| Random Structures & Algorithms
1042-9832 | 1998 | Dubhashi, Devdatt
Ranjan, Desh | | Balls and Bins: A Study in Negative Dependence
In: Random Structures & Algorithms [13], 99-124 | |
| Random Structures & Algorithms
1042-9832 | 1998 | Subramanian, C. R.
Fürer, Martin
Veni Madhavan, C. E. | | Algorithms for Coloring Semi-random Graphs
In: Random Structures & Algorithms [13], 125-158 | |
| RSA |
| |
| Random Structures & Algorithms
1042-9832 | 2007 | Baswana, Surender
Sen, Sandeep | | A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs
In: Random Structures & Algorithms [30], 532-563 | |
| SIAM J. Comput. |
| |
| SIAM Journal on Computing
0097-5397 | 2010 | Boros, 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 | 1998 | Albers, Susanne | | Improved randomized on-line algorithms for the list update problem
In: SIAM Journal on Computing [27], 682-693 | |
| SIAM Journal on Computing
0097-5397 | 1998 | Barnes, 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 | 1998 | Bodlaender, 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 | 1998 | Bradford, 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 | 1998 | Crochemore, Maxime
Gasieniec, Leszek
Hariharan, Ramesh
Muthukrishnan, S.
Rytter, Wojciech | | A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern Matching
In: SIAM Journal on Computing [27], 668-681 | |
| SIAM Journal on Computing
0097-5397 | 1998 | Ferragina, 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 | 1998 | Golin, Mordecai J.
Raman, Rajeev
Schwarz, Christian
Smid, Michiel | | Randomized Data Structures for the Dynamic Closest-Pair Problem
In: SIAM Journal on Computing [27], 1036-1072 | |
| SIAM Journal of Computing
0097-5397 | 1996 | Arikati, Srinivasa Rao
Maheshwari, Anil | | Realizing degree sequences in parallel
In: SIAM Journal of Computing [9], 317-338 | |
| SIAM Journal on Computing
0097-5397 | 1996 | Cheriyan, Joseph
Hagerup, Torben
Mehlhorn, Kurt | | An o(n³)-Time Maximum-Flow-Algorithm: Can a Maximum Flow be Computed in o(nm) Time?
In: SIAM Journal on Computing [25], 1144-1170 | |
| SIAM Journal on Computing
0097-5397 | 1996 | Garg, 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 | 1996 | Kapoor, 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 | 1995 | Cheriyan, Joseph
Hagerup, Torben | | A Randomized Maximum-Flow Algorithm
In: SIAM Journal on Computing [24], 203-226 | |
| SIAM Journal on Computing
0097-5397 | 1995 | Cole, Richard
Hariharan, Ramesh
Paterson, Mike
Zwick, Uri | | Tighter Lower Bounds on the Exact Complexity of String Matching
In: SIAM Journal on Computing [24], 30-45 | |
| SIAM Journal on Computing
0097-5397 | 1995 | Han, 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 | 1995 | Hariharan, Ramesh
Kapoor, Sanjiv | | Algorithms for Enumerating all Spanning Trees of an Undirected Graph
In: SIAM Journal on Computing [24], 247-265 | |
|
| |
| SIAM Journal on Computing
0097-5397 | 2007 | Abraham, David J.
Irving, Robert W.
Kavitha, Telikepalli
Mehlhorn, Kurt | | Popular Matchings
In: SIAM Journal on Computing [37], 1030-1045 | |
| SIAM Journal on Computing
0097-5397 | 2007 | Chrobak, Marek
Gasieniec, Leszek
Kowalski, Dariusz R. | | The wake-up problem in multihop radio networks
In: SIAM Journal on Computing [36], 1453-1471 | |
| SIDMA |
| |
| SIAM Journal on Discrete Mathematics
0895-4801 | 2007 | Cole, Richard
Kowalik, Lukasz
Skrekovski, Riste | | A Generalization of Kotzig's Theorem and Its Application
In: SIAM Journal on Discrete Mathematics [21], 93-106 | |
| TALG |
| |
| ACM Transactions on Algorithms
1549-6325 | 2011 | Baswana, 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 | 2011 | Epstein, 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 | 2011 | Pemmaraju, Sriram V.
Raman, Rajiv
Varadarajan, Kasturi | | Max-coloring and online coloring with bandwidths on interval graphs
In: ACM Transactions on Algorithms [7], 35:1-35:21 | |
| ACM Transactions on Algorithms
1549-6325 | 2010 | Christodoulou, 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 | 2007 | Kavitha, Telikepalli
Mehlhorn, Kurt
Michail, Dimitrios
Paluch, Katarzyna E. | | Strongly stable matchings in time O(nm) and extension to the hospitals-residents problem
In: ACM Transactions on Algorithms [3], 15.1-15.18 | |
| ACM Transactions on Algorithms
- | 2006 | Irving, Robert W.
Telikepalli, Kavitha
Mehlhorn, Kurt
Michail, Dimitrios
Paluch, Katarzyna | | Rank-Maximal Matchings
In: ACM Transactions on Algorithms [2], 602-610 | |
|
| |
| Theory of Computing Systems
1432-4350 | 2011 | Epstein, Leah
van Stee, Rob | | Improved results for a memory allocation problem
In: Theory of Computing Systems [48], 79-92 | |
| Theoretical Computer Science
0304-3975 | 2011 | Friedrich, 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 | 2011 | Kavitha, Telikepalli
Mestre, Julian
Nasre, Meghana | | Popular mixed matchings
In: Theoretical Computer Science [412], 2679-2690 | |
| Theoretical Computer Science
0304-3975 | 2011 | Manjunath, 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 | 2010 | Neumann, Frank
Witt, Carsten | | Ant Colony Optimization and the minimum spanning tree problem
In: Theoretical Computer Science [411], 2406-2413 | |
| Theoretical Computer Science
0304-3975 | 2009 | Christodoulou, George
Koutsoupias, Elias
Nanavati, Akash | | Coordination Mechanisms
In: Theoretical Computer Science [410], 3327-3336 | |
| Theoretical Computer Science
0304-3975 | 2007 | Caragiannis, Ioannis
Fishkin, Aleksei V.
Kaklamanis, Christos
Papaioannou, Evi | | A tight bound for online colouring of disk graphs
In: Theoretical Computer Science [384], 152-160 | |
| Theory of Computing Systems
1432-4350 | 2007 | Doerr, Benjamin | | Roundings respecting hard constraints
In: Theory of Computing Systems [40], 467-483 | |
| Theoretical Computer Science
0304-3975 | 2007 | Michail, Dimitrios | | Reducing rank-maximal to maximum weight matching
In: Theoretical Computer Science [389], 125-132 | |
| Theoretical Computer Science
0304-3975 | 2006 | Epstein, Leah
Kesselman, Alexander | | On the remote server problem or more about TCP acknowledgments
In: Theoretical Computer Science [369], 285 | |
| Theor. Comput. Sci. |
| |
| Theoretical Computer Science
0304-3975 | 1998 | Albers, Susanne | | A competitive analysis of the list update problem with lookahead
In: Theoretical Computer Science [197], 95-109 | |
| Theoretical Computer Science
0304-3975 | 1998 | Chaudhuri, 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 | 1998 | Diks, 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 | 1996 | Kavvadias, Dimitris J.
Pantziou, Grammati E.
Spirakis, Paul G.
Zaroliagis, Christos | | Hammock-on-ears decomposition : a technique for the efficient parallel solution of shortest paths and other problems
In: Theoretical Computer Science [168], 121-154 | |
|
| |
| The ACM Transactions on Computation Theory
1942-3454 | 2012 | Kayal, Neeraj
Saha, Chandan | | On the Sum of Square Roots of Polynomials and Related Problems
In: The ACM Transactions on Computation Theory [4], 9:1-9:15 | |
|
| |
| ACM Transactions on Sensor Networks
- | 2006 | Funke, Stefan
Kesselman, Alexander
Meyer, Ulrich
Segal, Michael | | A Simple Improved Distributed Algorithm for Minimum CDS in Unit Disk Graphs
In: ACM Transactions on Sensor Networks [2], 444-453 | |
|
| |
| Algorithmica
0178-4617 | 2014 | Doerr, Benjamin
Winzen, Carola | | Ranking-Based Black-Box Complexity
In: Algorithmica [?], ? | |
| Theoretical Computer Science
0304-3975 | 2013 | Berberich, Eric
Emeliyanenko, Pavel
Kobel, Alexander
Sagraloff, Michael | | Exact symbolic–numeric computation of planar algebraic curves
In: Theoretical Computer Science [491], 1-32 | |
| Artificial Intelligence
- | 2013 | Bringmann, Karl
Friedrich, Tobias | | Approximation Quality of the Hypervolume Indicator
In: Artificial Intelligence [195], 265–290 | |
| Artificial Intelligence
- | 2013 | Bringmann, 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 | 2013 | Chen, Xujin
Epstein, Leah
Kleiman, Elena
van Stee, Rob | | Maximizing the minimum load: The cost of selfishness
In: Theoretical Computer Science [482], 9-19 | |
| Theoretical Computer Science
0304-3975 | 2013 | Christodoulou, George
Kovacs, Annamaria
van Stee, Rob | | A truthful constant approximation for maximizing the minimum load on related machines
In: Theoretical Computer Science [489-490], 88-98 | |
| Information Processing Letters
0020-0190 | 2013 | Doerr, Benjamin | | Improved approximation algorithms for the Min-Max Selecting Items problem
In: Information Processing Letters [113], 747-749 | |
| Algorithmica
0178-4617 | 2013 | Doerr, Benjamin
Goldberg, Leslie Ann | | Adaptive Drift Analysis
In: Algorithmica [65], 224-250 | |
| Discrete Applied Mathematics
0166-218X | 2013 | Doerr, Benjamin
Huber, Anna
Levavi, Ariel | | Strong robustness of randomized rumor spreading protocols
In: Discrete Applied Mathematics [161], 778-793 | |
| Evolutionary Computation
1063-6560 | 2013 | Doerr, 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 | 2013 | Doerr, Benjamin
Johannsen, Daniel
Kötzing, Timo
Neumann, Frank
Theile, Madeleine | | More effective crossover operators for the all-pairs shortest path problem
In: Theoretical Computer Science [471], 12-26 | |
| Theoretical Computer Science
0304-3975 | 2013 | Doerr, 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
- | 2013 | Elmasry, 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
- | 2013 | Fanghä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
- | 2013 | Fountoulakis, Nikolaos
Panagiotou, Konstantinos | | On the Insertion Time of Cuckoo Hashing
In: SIAM Journal on Computing [?], ?-? | |
| Mathematical Programming
- | 2013 | Harks, Tobias
Hoefer, Martin
Klimm, Max
Skopalik, Alexander | | Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games
In: Mathematical Programming [141], 193-215 | |
| Information & Computation
- | 2013 | Hoefer, Martin | | Local Matching Dynamics in Social Networks
In: Information & Computation [222], 20-35 | |
| International Journal of Game Theory
- | 2013 | Hoefer, Martin | | Strategic Cooperation in Cost Sharing Games
In: International Journal of Game Theory [42], 29-53 | |
| ACM Transactions on Economics and Computation
- | 2013 | Hoefer, Martin
Skopalik, Alexander | | Altruism in Atomic Congestion Games
In: ACM Transactions on Economics and Computation [1], 21 | |
| Theory of Computing Systems
- | 2013 | Hoefer, 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 | 2013 | Jez, 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 | 2013 | Panagiotou, Konstantinos
Spöhel, Reto
Steger, Angelika
Thomas, Henning | | Explosive percolation in Erdös-Rényi-like random graph processes
In: Combinatorics, Probability and Computing [22], 133-145 | |
| Journal of Scheduling
1094-6136 | 2013 | Sanders, Peter
Singler, Johannes
van Stee, Rob | | Real-time prefetching and caching
In: Journal of Scheduling [16], 47-58 | |
| Information Processing Letters
- | 2013 | Schmidt, Jens M. | | A Simple Test on 2-Vertex- and 2-Edge-Connectivity
In: Information Processing Letters [113], 241-244 | |
| SIAM Journal on Computing
- | 2013 | Schmidt, Jens M. | | Contractions, Removals and Certifying 3-Connectivity in Linear Time
In: SIAM Journal on Computing [42], 494-535 | |
| SIGACT News
0163-5700 | 2013 | van Stee, Rob | | SIGACT News Online Algorithms Column 22
In: SIGACT News [44], 125 | |
| Information Processing Letters
- | 2013 | Winzen, Carola | | Direction-Reversing Quasi-Random Rumor Spreading with Restarts
In: Information Processing Letters [113], 921-926 | |
| SIAM Journal on Computing
0097-5397 | 2012 | Ailon, 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 | 2012 | Ajwani, Deepak
Elbassioni, Khaled
Govindarajan, Sathish
Ray, Saurabh | | Conflict-free coloring for rectangle ranges using O(n .382) colors
In: Discrete & Computational Geometry [48], 39-52 | |
| Integrative Biology
1757-9694 | 2012 | Alcaraz, Nicolas
Friedrich, Tobias
Kötzing, Timo
Krohmer, Anton
Müller, Joachim
Pauling, Josch
Baumbach, Jan | | Efficient key pathway mining: combining networks and OMICS data
In: Integrative Biology [4], 756-764 | |
| IEEE Transactions on Computers
0018-9340 | 2012 | Baruah, 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 | 2012 | Belfrage, Michael
Mütze, Torsten
Spöhel, Reto | | Probabilistic one-player Ramsey games via deterministic two-player games
In: SIAM Journal on Discrete Mathematics [26], 1031-1049 | |
| Discrete & Computational Geometry
0179-5376 | 2012 | Berberich, Eric
Halperin, Dan
Kerber, Michael
Pogalnikova, Roza | | Deconstructing Approximate Offsets
In: Discrete & Computational Geometry [48], 964-989 | |
| ACM Transactions on Algorithms
- | 2012 | Bonifaci, 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 | 2012 | Bonifaci, Vincenzo
Marchetti-Spaccamela, Alberto | | Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems
In: Algorithmica [63], 763-780 | |
| Algorithmica
0178-4617 | 2012 | Bonifaci, Vincenzo
Marchetti-Spaccamela, Alberto
Stiller, Sebastian | | A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling
In: Algorithmica [62], 1034-1049 | |
| Journal of Theoretical Biology
0022-5193 | 2012 | Bonifaci, Vincenzo
Mehlhorn, Kurt
Varma, Girish | | Physarum Can Compute Shortest Paths
In: Journal of Theoretical Biology [309], 121-133 | |
| Discrete Mathematics
0012-365X | 2012 | Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa | | On Nash equilibria and improvement cycles in pure positional strategies for Chess-like and Backgammon-like n-person games
In: Discrete Mathematics [312], 772-788 | |
| Random Structures & Algorithms
1042-9832 | 2012 | Brightwell, Graham
Panagiotou, Konstantinos
Steger, Angelika | | Extremal subgraphs of random graphs
In: Random Structures & Algorithms [41], 147-178 | |
| Computational Geometry: Theory and Applications
0925-7721 | 2012 | Bringmann, Karl | | An improved algorithm for Klee's measure problem on fat boxes
In: Computational Geometry: Theory and Applications [45], 225-233 | |
| Theoretical Computer Science
- | 2012 | Bringmann, Karl
Friedrich, Tobias | | Approximating the least hypervolume contributor: NP-hard in general, but fast in practice
In: Theoretical Computer Science [425], 104-116 | |
| Philosophical Transaction of the Royal Society A
- | 2012 | Case, John
Kötzing, Timo | | Computability-theoretic learning complexity
In: Philosophical Transaction of the Royal Society A [370], 3570-3596 | |
| Information and Computation
- | 2012 | Case, John
Kötzing, Timo | | Learning secrets interactively. Dynamic modeling in inductive inference
In: Information and Computation [220-221], 60-73 | |
| Algorithmica
0178-4617 | 2012 | Chan, 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 | 2012 | Chan, Ho-Leung
Megow, Nicole
Sitters, René
van Stee, Rob | | A note on sorting buffers offline
In: Theoretical Computer Science [423], 11-18 | |
| SIAM Journal on Scientific Computing
1064-8275 | 2012 | De Sterck, Hans | | A Nonlinear GMRES Optimization Algorithm for Canonical Tensor Decomposition
In: SIAM Journal on Scientific Computing [34], A1351-A1379 | |
| SIAM Journal on Scientific Computing
1064-8275 | 2012 | De Sterck, Hans | | A 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 | 2012 | Doerr, 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 | 2012 | Doerr, Benjamin
Happ, Edda
Klein, Christian | | Crossover can provably be useful in evolutionary computation
In: Theoretical Computer Science [425], 17-33 | |
| Algorithmica
0178-4617 | 2012 | Doerr, Benjamin
Johannsen, Daniel
Winzen, Carola | | Multiplicative Drift Analysis
In: Algorithmica [64], 673-697 | |
| Theoretical Computer Science
0304-3975 | 2012 | Doerr, Benjamin
Johannsen, Daniel
Winzen, Carola | | Non-existence of linear universal drift functions
In: Theoretical Computer Science [436], 71-86 | |
| Information Processing Letters
0020-0190 | 2012 | Doerr, Benjamin
Winzen, Carola | | Memory-restricted black-box complexity of OneMax
In: Information Processing Letters [112], 32-34 | |
| Theoretical Computer Science
- | 2012 | Elbassioni, 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
- | 2012 | Elbassioni, Khaled
Matijevic, Domagoj
Severdija, Domagoj | | Guarding 1.5D terrains with demands
In: International Journal of Computer Mathematics [89], 2143-2151 | |
| Theoretical Computer Science
- | 2012 | Elbassioni, Khaled
Raman, Rajiv
Ray, Saurabh
Sitters, René | | On the complexity of the highway problem
In: Theoretical Computer Science [460], 70-77 | |
| Theoretical Computer Science
- | 2012 | Elbassioni, Khaled
Tiwary, Hans Raj | | Complexity of Approximating the Vertex Centroid of a Polyhedron
In: Theoretical Computer Science [421], 56-61 | |
| Algorithmica
0178-4617 | 2012 | Elmasry, 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
- | 2012 | Epstein, 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 | 2012 | Epstein, Leah
Levin, Asaf
van Stee, Rob | | Approximation Schemes for Packing Splittable Items with Cardinality Constraints
In: Algorithmica [62], 102-129 | |
| Information and Computation
0890-5401 | 2012 | Epstein, Leah
van Stee, Rob | | The price of anarchy on uniformly related machines revisited
In: Information and Computation [212], 37-54 | |
| Algorithmica
0178-4617 | 2012 | Fellows, Michael R.
Hermelin, Danny
Rosamond, Fraces A. | | Well Quasi Orders in Subclasses of Bounded Treewidth Graphs and Their Algorithmic Applications
In: Algorithmica [64], 3-18 | |
| Random Structures and Algorithms
- | 2012 | Fountoulakis, Nikolaos
Panagiotou, Konstantinos | | Tight Load Thresholds for Cuckoo Hashing
In: Random Structures and Algorithms [41], 306-333 | |
| SIAM Journal on Computing
- | 2012 | Friedrich, Tobias
Gairing, Martin
Sauerwald, Thomas | | Quasirandom Load Balancing
In: SIAM Journal on Computing [41], 747-771 | |
| Journal of Complexity
0885-064X | 2012 | Giannopoulos, Panos
Knauer, Christian
Wahlström, Magnus
Werner, Daniel | | Hardness of discrepancy computation and ε-net verification in high dimension
In: Journal of Complexity [28], 162-176 | |
| SIAM Journal on Numerical Analysis
1095-7170 | 2012 | Gnewuch, Michael
Wahlström, Magnus
Winzen, Carola | | A New Randomized Algorithm to Approximate the Star Discrepancy Based on Threshold Accepting
In: SIAM Journal on Numerical Analysis [50], 781-807 | |
| Journal of Scheduling
1094-6136 | 2012 | Harren, Rolf
van Stee, Rob | | Absolute Approximation Ratios for Packing Rectangles into Bins
In: Journal of Scheduling [15], 63-75 | |
| Theoretical Computer Science
0304-3975 | 2012 | Heinz, 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 | 2012 | Hö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 | 2012 | Kavitha, 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 | 2012 | Kerber, 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
- | 2012 | Knauer, 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 | 2012 | Kötzing, Timo
Neumann, Frank
Röglin, Heiko
Witt, Carsten | | Theoretical analysis of two ACO approaches for the traveling salesman problem
In: Swarm Intelligence [6], 1-21 | |
| SIAM Journal on Discrete Mathematics
0895-4801 | 2012 | Krivelevich, 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 | 2012 | Megow, 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 | 2012 | Meyerhenke, Henning
Sauerwald, Thomas | | Beyond Good Partition Shapes: An Analysis of Diffusive Graph Partitioning
In: Algorithmica [64], 329-361 | |
| Theoretical Computer Science
- | 2012 | Misra, Neeldhara
Philip, Geevarghese
Raman, Venkatesh
Saurabh, Saket | | On Parameterized Independent Feedback Vertex Set
In: Theoretical Computer Science [461], 65-75 | |
| Journal of Combinatorial Optimization
1382-6905 | 2012 | Misra, Neeldhara
Philip, Geevarghese
Raman, Venkatesh
Saurabh, Saket
Sikdar, Somnath | | FPT Algorithms for Connected Feedback Vertex Set
In: Journal of Combinatorial Optimization [24], 131-146 | |
| Information and Computation
0890-5401 | 2012 | Nor, Igor
Hermlin, Danny
Charlat, Sylvain
Engelstadter, Jan
Reuter, Max
Duron, Olivier
Sagot, Marie-France | | Mod/Resc Parsimony Inference: Theory and application
In: Information and Computation [213], 23-32 | |
| Journal of Graph Theory
- | 2012 | Panagiotou, 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 | 2012 | Philip, Geevarghese
Raman, Venkatesh
Sikdar, Somnath | | Polynomial kernels for dominating set in graphs of bounded degeneracy and beyond
In: ACM Transactions on Algorithms [9], 23 | |
| Algorithmica
- | 2012 | Schmidt, Jens M. | | Construction Sequences and Certifying 3-Connectivity
In: Algorithmica [62], 192-208 | |
| Bioinformatics
- | 2012 | Soranzo, 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 | 2012 | van Stee, Rob | | An improved algorithm for online rectangle filling
In: Theoretical Computer Science [423], 59-74 | |
| SIGACT News
0163-5700 | 2012 | van Stee, Rob | | SIGACT News Online Algorithms Column 20: The Power of Harmony
In: SIGACT News [43], 127-136 | |
| SIGACT News
0163-5700 | 2012 | van Stee, Rob | | SIGACT News Online Algorithms Column 21: APPROX and ALGO
In: SIGACT News [43], 123-129 | |
| Algorithmica
0178-4617 | 2011 | Althaus, 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 | 2011 | Bansal, Nikhil
Chan, Ho-Leung
Pruhs, KIrk | | Competitive Algorithms for Due Date Schedulin
In: Algorithmica [59], 569-582 | |
| Computational Geometry
0925-772 | 2011 | Bar-Yehuda, Reuven
Hermelin, Danny
Rawitz, Dror | | Minimum vertex cover in rectangle graphs
In: Computational Geometry [44], 356-364 | |
| Algorithmica
0178-4617 | 2011 | Beier, Rene
Funke, Stefan
Matijevic, Domagoj
Sanders, Peter | | Energy-Efficient Paths in Radio Networks
In: Algorithmica [61], 298-319 | |
| Discrete Optimization
1572-5286 | 2011 | Ben-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 | 2011 | Bonifaci, Vincenzo
Korteweg, Peter
Marchetti-Spaccamela, Alberto
Stougie, Leen | | Minimizing Flow Time in the Wireless Gathering Problem
In: ACM Transactions on Algorithms [7], 33:1-33:20 | |
| Theoretical Computer Science
0304-3975 | 2011 | Bonifaci, Vincenzo
Korteweg, Peter
Marchetti-Spaccamela, Alberto
Stougie, Leen | | The Distributed Wireless Gathering Problem
In: Theoretical Computer Science [412], 633-641 | |
| Annals of Operations Research
- | 2011 | Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Tiwary, Hans Raj | | The negative cycles polyhedron and hardness of checking some polyhedral properties
In: Annals of Operations Research [188], 63-76 | |
| Algorithmica
- | 2011 | Chan, 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
- | 2011 | Chan, 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
- | 2011 | Chin, 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 | 2011 | Cygan, Marek
Philip, Geevarghese
Pilipczuk, Marcin
Pilipczuk, Micha\l{}
Wojtaszczyk, Jakub Onufry | | Dominating set is fixed parameter tractable in claw-free graphs
In: Theoretical Computer Science [412], 6982-7000 | |
| SIAM Journal on Scientific Computing
- | 2011 | De 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 | 2011 | Doerr, 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 | 2011 | Doerr, Benjamin
Fouz, Mahmoud | | Quasi-random rumor spreading: Reducing randomness can be costly
In: Information Processing Letters [111], 227-230 | |
| ACM Journal of Experimental Algorithmics
- | 2011 | Doerr, Benjamin
Friedrich, Tobias
Künnemann, Marvin
Sauerwald, Thomas | | Quasirandom Rumor Spreading: An Experimental Analysis
In: ACM Journal of Experimental Algorithmics [16], Article No. 3.3 | |
| Evolutionary Computation
1063-6560 | 2011 | Doerr, 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 | 2011 | Doerr, Benjamin
Jansen, Thomas | | Theory of Evolutionary Computation
In: Algorithmica [59], 299-300 | |
| Theoretical Computer Science
0304-3975 | 2011 | Doerr, Benjamin
Neumann, Frank
Sudholt, Dirk
Witt, Carsten | | Runtime analysis of the 1-ANT ant colony optimizer
In: Theoretical Computer Science [412], 1629-1644 | |
| Algorithmica
- | 2011 | Elbassioni, 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
- | 2011 | Elbassioni, Khaled
Makino, Kazuhisa
Rauf, Imran | | On the readability of monotone Boolean formulae
In: Journal of Combinatorial Optimization [22], 293-304 | |
| Computational Geometry
- | 2011 | Elbassioni, Khaled
Tiwary, Hans Raj | | On a cone covering problem
In: Computational Geometry [44], 129-134 | |
| Theoretical Computer Science
- | 2011 | Elsaesser, 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 | 2011 | Epstein, Leah
Levin, Asaf
van Stee, Rob | | Max-min online allocations with a reordering buffer
In: SIAM Journal on Discrete Mathematics [25], 1230-1250 | |
| Theoretical Computer Science
0304-3975 | 2011 | Farzan, Arash
Munro, J. Ian | | Succinct representation of dynamic trees
In: Theoretical Computer Science [412], 2668-2678 | |
| Journal of Computer and System Sciences
0022-0000 | 2011 | Fellows, Michael R.
Fertin, Guillaume
Hermelin, Danny
Vialette, Stephane | | Upper and lower bounds for finding connected motifs in vertex-colored graphs
In: Journal of Computer and System Sciences [77], 799-811 | |
| IEEE/ACM Transactions on Computational Biology and Bioinformatics
1545-5963 | 2011 | Fellows, Michael R.
Hartman, Tzvika
Hermelin, Danny
Landau, Gad M.
Rosamond, Frances A.
Rozenberg, Liat | | Haplotype Inference Constrained by Plausible Haplotype Data
In: IEEE/ACM Transactions on Computational Biology and Bioinformatics [8], 1692-1699 | |
| Combinatorics, Probability & Computing
0963-5483 | 2011 | Fountoulakis, Nikolaos
Panagiotou, Konstantinos | | 3-Connected Cores In Random Planar Graphs
In: Combinatorics, Probability & Computing [20], 381-412 | |
| Discrete Applied Mathematics
0166-218X | 2011 | Friedrich, 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 | 2011 | Friedrich, Tobias
Sauerwald, Thomas
Vilenchik, Dan | | Smoothed analysis of balancing networks
In: Random Structures & Algorithms [39], 115-138 | |
| Ad Hoc Networks
1570-8705 | 2011 | Funke, Stefan
Laue, Soeren
Lotker, Zvi
Naujoks, Rouven | | Power assignment problems in wireless communication: Covering points by disks, reaching few receivers quickly, and energy-efficient travelling salesman tours
In: Ad Hoc Networks [9], 1028-1035 | |
| International Journal of Computational Geometry and Applications
- | 2011 | Guo, Zeyu
Sun, He
Zhu, Hong | | Greedy Construction of 2-Approximate Minimum Manhattan Networks
In: International Journal of Computational Geometry and Applications [21], 331-350 | |
| Journal of Symbolic Computation
0747-7171 | 2011 | Hemmer, Michael
Dupon, Laurent
Petitjean, Sylvain
Schomer, Elmar | | A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics
In: Journal of Symbolic Computation [46], 467-494 | |
| Discrete Applied Mathematics
- | 2011 | Hermelin, Danny
Rawitz, Dror | | Optimization problems in multiple subtree graphs
In: Discrete Applied Mathematics [159], 588-594 | |
| Algorithmica
0178-4617 | 2011 | Huang, Chien-Chung
Kavitha, Telikepalli
Michael, Dimitrios
Nasr, Meghana | | Bounded Unpopularity Matchings
In: Algorithmica [61], 738-757 | |
| Graphs and Combinatorics
- | 2011 | Kerber, 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 | 2011 | Megow, 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
- | 2011 | Mehlhorn, Kurt
Näher, Stefan
Schweitzer, Pascal | | Certifying algorithms
In: Computer Science Review [5], 119-161 | |
| Computational Geometry
- | 2011 | Mehlhorn, 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
- | 2011 | Mehlhorn, 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 | 2011 | Müller, Tobias
Perez-Gimenez, Xavier
Wormald, Nicholas | | Disjoint Hamilton cycles in the random geometric graph
In: Journal of Graph Theory [68], 299-322 | |
| Algorithmica
0178-4617 | 2011 | Neumann, Frank
Reichel, Joachim
Skutella, Martin | | Computing Minimum Cuts by Randomized Search Heuristics
In: Algorithmica [59], 323-342 | |
| Journal of Machine Learning Research
1532-4435 | 2011 | Shervashidze, 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
- | 2011 | van Zuylen, Anke | | An improved monotone algorithm for scheduling related machines with precedence constraints
In: Operations Research Letters [39], 423-427 | |
| Algorithmica
- | 2011 | van Zuylen, Anke | | Deterministic Sampling Algorithms for Network Design
In: Algorithmica [60], 110-151 | |
| Theoretical Computer Science
- | 2011 | van Zuylen, Anke | | Linear programming based approximation algorithms for feedback set problems in bipartite tournaments.
In: Theoretical Computer Science [412], 2556-2561 | |
| Theory of Computing Systems
1432-4350 | 2011 | Wahlström, Magnus | | New Plain-Exponential Time Classes for Graph Homomorphism
In: Theory of Computing Systems [49], 273-282 | |
| Discrete Applied Mathematics
0166-218X | 2010 | Ajwani, Deepak
Friedrich, Tobias | | Average-case Analysis of Incremental Topological Ordering
In: Discrete Applied Mathematics [158], 240-250 | |
| Theoretical Computer Science
0304-3975 | 2010 | Angelopoulos, Spyros
Borodin, Allan | | Randomized Priority Algorithms
In: Theoretical Computer Science [411], 2542-2558 | |
| Real-Time Systems
0922-6443 | 2010 | Baruah, Sanjoy
Bonifaci, Vincenzo
Marchetti-Spaccamela, Alberto
Stiller, Sebastian | | Improved Multiprocessor Global Schedulability Analysis
In: Real-Time Systems [46], 3-24 | |
| Computational Geometry
0925-7721 | 2010 | Basit, 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 | 2010 | Batra, Prashant
Sharma, Vikram | | Bounds on absolute positiveness of multivariate polynomials
In: Journal of Symbolic Computation [45], 617-628 | |
| Mathematics in Computer Science
1661-8270 | 2010 | Berberich, Eric
Fogel, Efi
Halperin, Dan
Kerber, Michael
Setter, Ophir | | Arrangements on Parametric Surfaces II: Concretizations and Applications
In: Mathematics in Computer Science [4], 67-91 | |
| Mathematics in Computer Science
1661-8270 | 2010 | Berberich, Eric
Fogel, Efi
Halperin, Dan
Mehlhorn, Kurt
Wein, Ron | | Arrangements on Parametric Surfaces I: General Framework and Infrastructure
In: Mathematics in Computer Science [4], 45-66 | |
| Computational Geometry: Theory and Applications (CGTA)
0925-7721 | 2010 | Berberich, 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 | 2010 | Bonifaci, Vincenzo
Harks, Tobias
Schäfer, Guido | | Stackelberg Routing in Arbitrary Networks
In: Mathematics of Operations Research [35], 330 - 346 | |
| Games and Economic Behavior
0899-8256 | 2010 | Boros, 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 | 2010 | Bringmann, Karl
Friedrich, Tobias | | An Efficient Algorithm for Computing Hypervolume Contributions
In: Evolutionary Computation [18], 383-402 | |
| Computational Geometry
0925-7721 | 2010 | Bringmann, 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 | 2010 | Butman, 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 | 2010 | Cooper, 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 | 2010 | Doerr, 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 | 2010 | Doerr, Benjamin
Gnewuch, Michael
Wahlström, Magnus | | Algorithmic construction of low-discrepancy point sets via dependent randomized rounding
In: Journal of Complexity [26], 490-507 | |
| Algorithmica
0178-4617 | 2010 | Doerr, Benjamin
Neumann, Frank | | In Memoriam: Ingo Wegener
In: Algorithmica [58], 541-542 | |
| Algorithmica
0178-4617 | 2010 | Doerr, Benjamin
Neumann, Frank
Wegener, Ingo | | Editorial
In: Algorithmica [57], 119-120 | |
| Discrete Mathematics
0012-365X | 2010 | Elbassioni, 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 | 2010 | Elmasry, Amr | | Pairing heaps, scrambled pairing and square-root trees
In: International Journal of Computer Mathematics [87], 3096-3110 | |
| Theoretical Computer Science
0304-3975 | 2010 | Epstein, Leah
van Stee, Rob | | Maximizing the minimum load for selfish agents
In: Theoretical Computer Science [411], 44-57 | |
| ACM Transactions on Algorithms
1549-6325 | 2010 | Epstein, Leah
van Stee, Rob | | On the online unit clustering problem
In: ACM Transactions on Algorithms [7], 1-18 | |
| Theoretical Computer Science
0304-3975 | 2010 | Friedrich, Tobias
Hebbinhaus, Nils
Neumann, Frank | | Plateaus Can Be Harder in Multi-Objective Optimization
In: Theoretical Computer Science [411], 854-864 | |
| Evolutionary Computation
1063-6560 | 2010 | Friedrich, Tobias
He, Jun
Hebbinghaus, Nils
Neumann, Frank
Witt, Carsten | | Approximating Covering Problems by Randomized Search Heuristics using Multi-Objective Models
In: Evolutionary Computation [18], 617 - 633 | |
| Natural Computing
1567-7818 | 2010 | Friedrich, Tobias
Neumann, Frank | | When to Use Bit-Wise Neutrality
In: Natural Computing [9], 283 - 294 | |
| Algorithmica
0178-4617 | 2010 | Garg, 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 | 2010 | Giannopoulos, Panos
Klein, Rolf
Kutz, Martin
Marx, Daniel | | Computing geometric minimum-dilation graphs is NP-hard
In: International Journal of Computational Geometry & Applications [20], 147-173 | |
| Algorithmica
0178-4617 | 2010 | Gidenstam, Anders
Papatriantafilou, Marina
Tsigas, Philippas | | NBmalloc: Allocating Memory in a Lock-Free Manner
In: Algorithmica [58], 304-338 | |
| Theoretical Computer Science
0304-3975 | 2010 | Han, 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 | 2010 | Huang, Chien-Chung | | Circular stable matching and 3-way kidney transplant
In: Algorithmica [58], 137-150 | |
| IET Systems Biology
1751-8849 | 2010 | Iacono, 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 | 2010 | Jansen, Thomas
Neumann, Frank | | Editorial for the Special Issue on Theoretical Aspects of Evolutionary Multi-Objective Optimization
In: Evolutionary Computation [18], 333-334 | |
| Journal of Symbolic Computation
0747-7171 | 2010 | Mehlhorn, 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 | 2010 | Mestre, Julian | | Adaptive local ratio
In: SIAM Journal on Computing [39], 3038-3057 | |
| Discrete & Computational Geometry
0179-5376 | 2010 | Mustafa, Nabil H.
Ray, Saurabh | | Improved Results on Geometric Hitting Set Problems
In: Discrete & Computational Geometry [44], 883-895 | |
| ACM Transactions on Algorithms
1549-63285 | 2010 | Panagiotou, 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 | 2010 | Rusinov, Momchil
Schweitzer, Pascal | | Homomorphism -- homogeneous graphs
In: Journal of Graph Theory [65], 253-262 | |
| Theoretical Computer Science
0304-3975 | 2009 | Amini, 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 | 2009 | Berberich, 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 | 2009 | Brockhoff, Dimo
Friedrich, Tobias
Hebbinghaus, Nils
Klein, Christian
Neumann, Frank
Zitzler, Eckart | | On the Effects of Adding Objectives to Plateau Functions
In: IEEE Transactions on Evolutionary Computation [13], 591-603 | |
| Algorithmica
0178-4617 | 2009 | Burnikel, 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 | 2009 | Chan, T-H. Hubert
Dhamdhere, Kedar
Gupta, Anupam
Kleinberg, Jon
Slivkins, Aleksandrs | | Metric Embeddings with Relaxed Guarantees
In: SIAM Journal on Computing [38], 2303-2329 | |
| Discrete and Computational Geometry
0179-5376 | 2009 | Chan, T.-H. Hubert
Gupta, Anupam | | Small Hop-diameter Sparse Spanners for Doubling Metrics
In: Discrete and Computational Geometry [41], 28-44 | |
| Algorithmica
0178-4617 | 2009 | Christodoulou, George
Koutsoupias, Elias
Vidali, Angelina | | A lower bound for scheduling mechanisms
In: Algorithmica [85], 729-740 | |
| European Journal of Combinatorics
0195-6698 | 2009 | Cilleruelo, Javier
Hebbinghaus, Nils | | Discrepancy in generalized arithmetic progressions
In: European Journal of Combinatorics [30], 1607-1611 | |
| Combinatorica
0209-9683 | 2009 | Cooley, 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 | 2009 | Doerr, 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 | 2009 | Doerr, 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 | 2009 | Doerr, Benjamin
Friedrich, Tobias
Sauerwald, Thomas | | Quasirandom Rumor Spreading on Expanders
In: Electronic Notes in Discrete Mathematics [34], 243 - 247 | |
| Algorithmica
1432-0541 | 2009 | Eisenbrand, Friedrich
Karrenbauer, Andreas
Skutella, Martin
Xu, Chihao | | Multiline Addressing by Network Flow
In: Algorithmica [53], 583-596 | |
| SIAM Journal on Discrete Mathematics
- | 2009 | Elbassioni, Khaled | | Algorithms 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 | 2009 | Elbassioni, Khaled
Fishkin, Aleksei V.
Sitters, René | | Approximation algorithms for the Euclidean traveling salesman problem with discrete and continuous neighborhoods
In: International Journal of Computational Geometry & Applications [19], 173-193 | |
| Information Processing Letters
0020-0190 | 2009 | Elmasry, Amr | | Computing the subset partial order for dense families of sets
In: Information Processing Letters [109], 1082-1086 | |
| Theory of Computing Systems
1432-4350 | 2009 | Epstein, Leah
van Stee, Rob
Tamir, Tami | | Paging with request sets
In: Theory of Computing Systems [44], 67-81 | |
| SIAM Journal on Discrete Mathematics
- | 2009 | Fountoulakis, Nikolaos
Huber, Anna | | Quasirandom rumor spreading on the complete graph is as fast as randomized rumor spreading
In: SIAM Journal on Discrete Mathematics [23], 1964-1991 | |
| Random Structures and Algorithms
- | 2009 | Fountoulakis, Nikolaos
Kühn, Daniela
Osthus, Deryk | | Minors in random regular graphs
In: Random Structures and Algorithms [35], 444-463 | |
| Theoretical Computer Science
0304-3975 | 2009 | Friedrich, Tobias
Hebbinghaus, Nils
Neumann, Frank | | Comparison of Simple Diversity Mechanisms on Plateau Functions
In: Theoretical Computer Science [410], 2455-2462 | |
| Evolutionary Computation,
1063-6560 | 2009 | Friedrich, Tobias
He, Jun
Hebbinghaus, Nils
Neumann, Frank
Witt, Carsten | | Analyses of Simple Hybrid Algorithms for the Vertex Cover Problem
In: Evolutionary Computation, [17], 3-19 | |
| Evolutionary Computation
1063-6560 | 2009 | Friedrich, Tobias
Oliveto, Pietro
Sudholt, Dirk
Witt, Carsten | | Analysis of Diversity-Preserving Mechanisms for Global Exploration
In: Evolutionary Computation [17], 455-476 | |
| Algorithmica
0178-4617 | 2009 | Gandhi, 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 | 2009 | Gidenstam, Anders
Papatriantafilou, Marina
Sundell, Håkan
Tsigas, Philippas | | Efficient and Reliable Lock-Free Memory Reclamation Based on Reference Counting
In: IEEE Transactions on Parallel and Distributed Systems [20], 1173-1187 | |
| Theoretical Computer Science
0304-3975 | 2009 | Harren, Rolf | | Approximation Algorithms for Orthogonal Packing Problems for Hypercubes
In: Theoretical Computer Science [410], 4504-4532 | |
| Computer Science Review
1574-0137 | 2009 | Kavitha, T.
Liebchen, Ch.
Mehlhorn, K.
Michail, D.
Rizzi, R.
Ueckerdt, T.
Zweig, K. | | Cycle Bases in Graphs: Characterization, Algorithms, Complexity, and Applications
In: Computer Science Review [3], 199-243 | |
| International Journal of Computer Mathematics
0020-7160 | 2009 | Kerber, Michael | | Division-Free Computation of Subresultants Using Bezout Matrices
In: International Journal of Computer Mathematics [86], 2186-2200 | |
| Theoretical Computer Science
0304-3975 | 2009 | Kowalik, Lukasz | | Improved edge-coloring with three colors
In: Theoretical Computer Science [410], 3733-3742 | |
| Swarm Intelligence
- | 2009 | Neumann, 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
- | 2009 | Panagiotou, Konstantinos | | The Degree Sequence of Random Graphs from Subcritical Classes
In: Combinatorics, Probability and Computing [18], 647-681 | |
| Mathematics of Operations Research
0364-765X | 2009 | Sanders, Peter
Sivadasan, Naveen
Skutella, Martin | | Online scheduling with bounded migration
In: Mathematics of Operations Research [34], 481-498 | |
| Information Processing Letters
0020-0190 | 2009 | Schweitzer, Pascal | | Using 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 | 2008 | Ajwani, Deepak
Friedrich, Tobias
Meyer, Ulrich | | An $O(n^2.75)$ algorithm for incremental topological ordering
In: ACM Transactions on Algorithms [4], 1-14 | |
| Journal of Combinatorial Optimization
- | 2008 | Althaus, Ernst
Canzar, Stefan | | A Lagrangian relaxation approach for the multiple sequence alignment problem
In: Journal of Combinatorial Optimization [16], 127-154 | |
| CoRR
- | 2008 | Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Tiwary, Hans Raj | | Characterization of the vertices and extreme directions of the negative cycle polyhedron and hardness of generating vertices of 0/1-polyhedra
In: CoRR [abs/0801.3790], x-x | |
| Algorithmica
- | 2008 | Cole, Richard
Kowalik, Lukasz | | New Linear-Time Algorithms for Edge-Coloring Planar Graphs
In: Algorithmica [50], 351-368 | |
| Journal of Combinatorial Theory B
- | 2008 | Cooley, Oliver
Fountoulakis, Nikolaos
Kühn, Daniela
Osthus, Deryk | | 3-Uniform hypergraphs of bounded degree have linear Ramsey numbers
In: Journal of Combinatorial Theory B [98], 484-505 | |
| Journal of Science and Technology
1860-4749 | 2008 | Diedrich, Florian
Harren, Rolf
Jansen, Klaus
Thöle, Ralf
Thomas, Henning | | Approximation Algorithms for 3D Orthogonal Knapsack
In: Journal of Science and Technology [23], 749-762 | |
| Monte Carlo Methods and Applications
0929-9629 | 2008 | Doerr, Benjamin
Gnewuch, Michael
Kritzer, Peter
Pillichshammer, Friedrich | | Component-by-component construction of low-discrepancy point sets of small size
In: Monte Carlo Methods and Applications [14], 129-149 | |
| Monte Carlo Methods Applications
- | 2008 | Doerr, Benjamin
Gnewuch, Michael
Kritzer, Peter
Pillichshammer, Peter | | Component-by-component construction of low-discrepancy point sets of small size
In: Monte Carlo Methods Applications [14], 129-150 | |
| International Journal of Computational Geometry and Applications
- | 2008 | Eisenbrand, 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
- | 2008 | Elbassioni, Khaled | | A note on systems with max-min and max-product constraints
In: Fuzzy Sets and Systems [159], 2272-2277 | |
| Discrete Applied Mathematics
- | 2008 | Elbassioni, Khaled | | On the complexity of monotone dualization and generating minimal hypergraph transversals
In: Discrete Applied Mathematics [156], 2109-2123 | |
| CoRR
- | 2008 | Elbassioni, 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 | 2008 | Elmasry, Amr
Hammad, Abdelrahman | | Inversion-Sensitive Sorting Algorithms in Practice
In: ACM Journal of Experimental Algorithmics [13], 1-18 | |
| ACM Transactions on Algorithms
1549-6325 | 2008 | Elmasry, Amr
Jensen, Claus
Katajainen, Jyrki | | Multipartite Priority Queues
In: ACM Transactions on Algorithms [5], 1-19 | |
| Computing
1436-5057 | 2008 | Elmasry, Amr
Jensen, Claus
Katajainen, Jyrki | | Two New Methods for Constructing Double-Ended Priority Queues from Priority Queues
In: Computing [83], 193-204 | |
| Theoretical Computer Science
0304-3975 | 2008 | Epstein, Leah
Levin, Asaf
van Stee, Rob | | Online unit clustering: Variations on a theme
In: Theoretical Computer Science [407], 85-96 | |
| Acta Informatica
0001-5903 | 2008 | Epstein, Leah
Levin, Asaf
van Stee, Rob | | Two-dimensional packing with conflicts
In: Acta Informatica [45], 155-175 | |
| Random Structures and Algorithms
- | 2008 | Fountoulakis, Nikolaos
Kühn, Daniela
Osthus, Deryk | | The order of the largest complete minor in a random graph
In: Random Structures and Algorithms [33], 127-141 | |
| Random Structures and Algorithms
- | 2008 | Fountoulakis, Nikolaos
Reed, Bruce | | The evolution of the mixing rate of a simple random walk on the giant component of a random graph
In: Random Structures and Algorithms [33], 68-86 | |
| OR Spectrum
- | 2008 | Froyland, Gary
Koch, Thorsten
Megow, Nicole
Duane, Emily
Wren, Howard | | Optimizing the Landside Operation of a Container Terminal
In: OR Spectrum [30], 53-75 | |
| IEEE Transactions on Visualization and Computer Graphics
- | 2008 | Giesen, Joachim | | Conjoint 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
- | 2008 | Giesen, Joachim | | Delaunay Triangulation Approximates Anchor Hull
In: Computational Geometry - Theory and Applications [36], 131-143 | |
| Computational Geometry - Theory and Applications
- | 2008 | Giesen, Joachim | | The Flow Complex: A Data Structure for Geometric Modeling
In: Computational Geometry - Theory and Applications [39], 178-190 | |
| Discrete & Computational Geometry
- | 2008 | Khachiyan, Leonid
Boros, Endre
Borys, Konrad
Elbassioni, Khaled
Gurvich, Vladimir | | Generating All Vertices of a Polyhedron Is Hard
In: Discrete & Computational Geometry [39], 174-190 | |
| Algorithmica
- | 2008 | Khachiyan, Leonid
Boros, Endre
Borys, Konrad
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa | | Generating Cut Conjunctions in Graphs and Related Problems
In: Algorithmica [51], 239-263 | |
| Theory Comput. Syst.
- | 2008 | Khachiyan, Leonid
Boros, Endre
Borys, Konrad
Elbassioni, Khaled
Gurvich, Vladimir
Rudolf, Gabor
Zhao, Jihui | | On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction
In: Theory Comput. Syst. [43], 204-233 | |
| Discrete Applied Mathematics
- | 2008 | Khachiyan, Leonid
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir | | Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions
In: Discrete Applied Mathematics [156], 2020-2034 | |
| Algorithmica
- | 2008 | Khachiyan, 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 | 2008 | Krumke, Sven Oliver
Schwahn, Anne
van Stee, Rob
Westphal, Stephan | | A monotone approximation algorithm for scheduling with precedence constraints
In: Operations Research Letters [36], 247-249 | |
| J. Comput. Syst. Sci.
- | 2008 | Kutz, 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 | 2008 | Malamatos, Theocharis | | Lower Bounds for expected-case planar point location
In: Computational Geometry Theory and Applications [39], 91-103 | |
| SIAM Journal of Computing
1042-9832 | 2008 | Mehlhorn, Kurt
Kavitha, T.
Hariharan, R. | | Faster Deterministic and Randomized Algorithms for Minimum Cycle Basis in Directed Graphs
In: SIAM Journal of Computing [38], 1430-1447 | |
| Computers and Operations Research
- | 2008 | Neumann, Frank | | Expected Runtimes of Evolutionary Algorithms for the Eulerian Cycle Problem
In: Computers and Operations Research [35], 2750-2759 | |
| Theory of Computing Systems
1432-4350 | 2008 | Pruhs, Kirk
van Stee, Rob
Uthaisombut, Patchrawat | | Speed Scaling of Tasks with Precedence Constraints
In: Theory of Computing Systems [43], 67-80 | |
| Journal of the Society for Information Display
- | 2008 | Xu, 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
- | 2008 | Zotenko, Elena
Mestre, Julián
O'Leary, Dianne
Przytyzka, Teresa | | Essential Complex Biological Modules Explain the Centrality-Lethality Rule
In: PLoS Computational Biology [x], x-x | |
| Journal of Discrete Algorithms
1570-8667 | 2007 | Ahuja, 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
- | 2007 | Arya, 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
- | 2007 | Arya, Sunil
Malamatos, Theocharis
Mount, David M.
Wong, Ka Chun | | Optimal expected-case planar point location
In: SIAM Journal on Computing [37], 584-610 | |
| Science
0036-8075 | 2007 | Bast, Holger
Funke, Stefan
Sanders, Peter
Schultes, Dominik | | Fast Routing in Road Networks using Transit Nodes
In: Science [316], 566 | |
| Archives of Control Sciences
- | 2007 | Beldiceanu, 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
- | 2007 | Bodirsky, Manuel
Gröpl, Clemens
Johannsen, Daniel
Kang, Mihyun | | A Direct Decomposition of 3-connected Planar Graphs
In: Séminaire Lotharingien de Combinatoire [B54Ak], 15 | |
| Artificial Intelligence
0004-3702 | 2007 | Bodirsky, Manuel
Kutz, Martin | | Determining the consistency of partial tree descriptions
In: Artificial Intelligence [171], 185-196 | |
| Electronic Notes in Discrete Mathematics
1571-0653 | 2007 | Cooper, 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 | 2007 | Cooper, 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
- | 2007 | Csaba, Bela | | On the Bollobas-Eidrigde conjecture for bipartite graphs
In: Combinatorics, Probability and Computing [16], 1-31 | |
| Linear Algebra and Its Applications
0024-3795 | 2007 | Doerr, Benjamin | | Lp Linear discrepancy of totally unimodular matrices
In: Linear Algebra and Its Applications [420], 663-666 | |
| European Journal of Combinatorics
0195-6698 | 2007 | Doerr, Benjamin | | Matrix approximation and Tusnády's problem
In: European Journal of Combinatorics [28], 990-995 | |
| Electronic Notes in Discrete Mathematics
1571-0653 | 2007 | Doerr, Benjamin | | Partial Colorings of Unimodular Hypergraphs
In: Electronic Notes in Discrete Mathematics [29], 359-363 | |
| Electronic Notes in Discrete Mathematics
1571-0653 | 2007 | Doerr, Benjamin
Friedrich, Tobias
Klein, Christian
Osbild, Ralf | | Unbiased Matrix Rounding
In: Electronic Notes in Discrete Mathematics [28], 41-46 | |
| Evolutionary Computation
- | 2007 | Doerr, 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 | 2007 | Eigenwillig, Arno | | On 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 | 2007 | Fountoulakis, Nikolaos | | Percolation on sparse random graphs with given degree sequence
In: Internet Mathematics [4], 329-356 | |
| Probability Theory and Related Fields
- | 2007 | Fountoulakis, Nikolaos
Reed, Bruce | | Faster Mixing and Small Bottlenecks
In: Probability Theory and Related Fields [137], 475-486 | |
| Wireless Networks
1022-0038 | 2007 | Funke, Stefan
Kesselman, Alexander
Kuhn, Fabian
Lotker, Zvi
Segal, Michael | | Improved approximation algorithms for connected sensor cover
In: Wireless Networks [13], 153-164 | |
| IEEE Transactions on Image Processing
1057-7149 | 2007 | Giesen, Joachim
Schuberth, Eva
Simon, Klaus
Zolliker, Peter
Zweifel, Oliver | | Image-Dependent Gamut Mapping as Optimization Problem
In: IEEE Transactions on Image Processing [16], 2401-2410 | |
| Computer Aided Geometric Design
- | 2007 | Gotsman, Craig
Kaligosi, Kanela
Mehlhorn, Kurt
Michail, Dimitrios
Pyrga, Evangelia | | Cycle Bases of Graphs and Sampled Manifolds
In: Computer Aided Geometric Design [24], 464 | |
| Computational Geometry: Theory and Applications
0925-7721 | 2007 | Hachenberger, Peter
Kettner, Lutz
Mehlhorn, Kurt | | Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, Optimized Implementation and Experiments
In: Computational Geometry: Theory and Applications [38], 64-99 | |
| Computational Geometry: Theory and Applications
0925-7721 | 2007 | Hert, Susan
Hoffmann, Michael
Kettner, Lutz
Pion, Sylvain
Seel, Michael | | An adaptable and extensible geometry kernel
In: Computational Geometry: Theory and Applications [38], 16-36 | |
| Theory of Computing Systems
1432-4350 | 2007 | Kavitha, Telikepalli
Mehlhorn, Kurt | | Algorithms to compute minimum cycle basis in directed graphs
In: Theory of Computing Systems [40], 485-505 | |
| Information Processing Letters
0020-0190 | 2007 | Khachiyan, Leonid
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir | | A global parallel algorithm for the hypergraph transversal problem
In: Information Processing Letters [101], 148-155 | |
| Theoretical Computer Science
0304-3975 | 2007 | Khachiyan, Leonid
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir | | On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs
In: Theoretical Computer Science [382], 139-150 | |
| Theoretical Computer Science
0304-3975 | 2007 | Khachiyan, Leonid
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa | | Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data
In: Theoretical Computer Science [379], 361-376 | |
| Discrete Applied Mathematics
0166-218X | 2007 | Khachiyan, Leonid
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa | | Enumerating disjunctions and conjunctions of paths and cuts in reliability theory
In: Discrete Applied Mathematics [155], 137-149 | |
| Inf. Proc. Lett.
- | 2007 | Kowalik, Lukasz | | Adjacency Queries in Dynamic Sparse Graphs
In: Inf. Proc. Lett. [-], - | |
| Bulletin of the London Mathematical Society
0024-6093 | 2007 | Lehnert, 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 | 2007 | Neumann, 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 | 2007 | Pyrga, 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
- | 2006 | Althaus, Ernst
Calinescu, Gruia
Mandoiu, Ion
Prasad, Sushil
Tchervenski, Nickolay
Zelikovsly, Alexander | | Power efficient range assignment for symmetric connectivity in static ad-hoc wireless networks
In: Wireless Networks [12], 287-299 | |
| Mathematical Programming
- | 2006 | Althaus, 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 | 2006 | Bárány, Imre
Doerr, Benjamin | | Balanced partitions of vector sequences
In: Linear Algebra and Its Applications [414], 464-469 | |
| Theory of Computing Systems
1432-4350 | 2006 | Bast, Holger
Mehlhorn, Kurt
Schäfer, Guido
Tamaki, Hisao | | Matching Algorithms are Fast in Sparse Random Graphs
In: Theory of Computing Systems [39], 3-14 | |
| ACM Transactions on Algorithms
1549-6325 | 2006 | Beier, René
Czumaj, Artur
Krysta, Piotr
Vöcking, Berthold | | Computing Equilibria for a Service Provider Game with (Im)perfect Information
In: ACM Transactions on Algorithms [2], 679-706 | |
| Algorithmica
0178-4617 | 2006 | Beier, René
Vöcking, Berthold | | An Experimental Study of Random Knapsack Problems
In: Algorithmica [45], 121-136 | |
| SIAM Journal on Computing
- | 2006 | Beier, René
Vöcking, Berthold | | Typical Properties of Winners and Losers in Discrete Optimization
In: SIAM Journal on Computing [35], 855-881 | |
| SIAM Journal on Computing
0097-5397 | 2006 | Brönnimann, Hervé
Kettner, Lutz
Pocchiola, Michel
Snoeyink, Jack | | Counting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm
In: SIAM Journal on Computing [36], 721-739 | |
| Journal of Symbolic Computation
- | 2006 | Brown, Christopher
El Kahoui, M'hammed
Novotni, Dominik
Weber, Andreas | | Algorithmic methods for investigating equilibria in epidemic modeling
In: Journal of Symbolic Computation [41], 1157-1173 | |
| Journal of Algebra
0021-8693 | 2006 | Bundy, David
Hebbinghaus, Nils
Stellmacher, Bernd | | The Local C(G,T) Theorem
In: Journal of Algebra [300], 741-789 | |
| Journal of Scheduling
- | 2006 | Chrobak, 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
- | 2006 | Csaba, 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 | 2006 | Dessmark, Anders
Fraigniaud, Pierre
Kowalski, Dariusz
Pelc, Andrzej | | Deterministic Rendezvous in Graphs
In: Algorithmica [46], 69-96 | |
| Random Structures & Algorithms
1042-9832 | 2006 | Doerr, Benjamin | | Matrix Rounding With Respect to Small Submatrices
In: Random Structures & Algorithms [28], 107-112 | |
| Discrete Applied Mathematics
- | 2006 | Doerr, Benjamin | | Non-independent randomized rounding and coloring
In: Discrete Applied Mathematics [154], 650-659 | |
| Eurocomb '03
- | 2006 | Doerr, Benjamin | | Non-independent Randomized Rounding, Linear Discrepancy and an Application to Digital Halftoning
In: Eurocomb '03 [3], 95-99 | |
| Electronic Notes in Discrete Mathematics
1571-0653 | 2006 | Doerr, Benjamin
Friedrich, Tobias | | Quasirandomness in Graphs
In: Electronic Notes in Discrete Mathematics [25], 61-64 | |
| Theoretical Computer Science
0304-3975 | 2006 | Doerr, Benjamin
Hebbinghaus, Nils
Werth, Sören | | Improved Bounds and Schemes for the Declustering Problem
In: Theoretical Computer Science [359], 123-132 | |
| Mathematical Methods of Operations Research
1432-2994 | 2006 | Doerr, Benjamin
Lorenz, Ulf | | Error Propagation in Game Trees
In: Mathematical Methods of Operations Research [64], 79-93 | |
| Computational Geometry
0925-7721 | 2006 | Eigenwillig, Arno
Kettner, Lutz
Schömer, Elmar
Wolpert, Nicola | | Exact, Efficient and Complete Arrangement Computation for Cubic Curves
In: Computational Geometry [35], 36-73 | |
| Constraints
- | 2006 | Elbassioni, Khaled M. | | Multiconsistency and Robustness with Global Constraints
In: Constraints [11], 335-352 | |
| Information Processing Letters
- | 2006 | Elbassioni, 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
- | 2006 | Feremans, Corinne
Grigoriev, Alexander
Sitters, Rene | | The geometric generalized minimum spanning tree problem with grid clustering
In: 4OR: A Quarterly Journal of Operations Research [4], 319-329 | |
| Discrete Applied Mathematics
- | 2006 | Golumbic, Martin Charles
Mintz, Aviad
Rotics, Udi | | Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial k-trees
In: Discrete Applied Mathematics [154], 1465-1477 | |
| Journal of Symbolic Computation
- | 2006 | Krandick, Werner
Mehlhorn, Kurt | | New bounds for the Descartes method
In: Journal of Symbolic Computation [41], 49-66 | |
| SIAM Journal on Computing
0097-5397 | 2006 | Kratsch, Dieter
McConnell, Ross
Mehlhorn, Kurt
Spinrad, Jeremy P. | | Certifying 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
- | 2006 | Schö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
- | 2006 | Sitters, Rene
Stougie, Leen | | The general two-server problem
In: Journal of the ACM [53], 437-458 | |
| Operations Research Letters
0167-6377 | 2005 | Althaus, Ernst
Funke, Stefan
Har-Peled, Sariel
Könemann, Jochen
Ramos, Edgar A.
Skutella, Martin | | Approximating k-Hop Minimum-Spanning Trees
In: Operations Research Letters [33], 115-120 | |
| Homöopathie-Zeitschrift
0943-6839 | 2005 | Bast, Holger | | Präzisionssuche im homöopathischen Netz
In: Homöopathie-Zeitschrift [I/05], 119-122 | |
| Journal of Complexity
0885-064X | 2005 | Doerr, Benjamin
Gnewuch, Michael
Srivastav, Anand | | Bounds and Constructions for the Star-Discrepancy via Delta-Covers
In: Journal of Complexity [21], 691-709 | |
| Journal of Symbolic Computation
0747-7171 | 2005 | El Kahoui, M'hammed | | Birational properties of the gap subresultant varieties
In: Journal of Symbolic Computation [39], 61-71 | |
| Journal of Algebra
- | 2005 | El Kahoui, M'hammed | | UFDs with commuting linearly independent locally nilpotent derivations
In: Journal of Algebra [289], 446-452 | |
| Proceedings of the Amercian Mathematical Society
- | 2005 | El Kahoui, M'hammed | | $D$-resultant and subresultants
In: Proceedings of the Amercian Mathematical Society [133], 2193-2199 | |
| Distributed and Parallel Databases
- | 2005 | Elbassioni, 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
- | 2005 | Fotakis, Dimitris
Pagh, Rasmus
Sanders, Peter
Spirakis, Paul G. | | Space Efficient Hash Tables With Worst Case Constant Access Time
In: Theory of Computing Systems [38], 229-248 | |
| Computational Geometry
- | 2005 | Funke, Stefan
Mehlhorn, Kurt
Näher, Stefan | | Structural filtering: a paradigm for efficient and exact geometric programs
In: Computational Geometry [31], 179-194 | |
| Theoretical Computer Science
- | 2005 | Georgiou, Chryssis
Kowalski, Dariusz
Shvartsman, Alexander | | Efficient gossip and robust distributed computation
In: Theoretical Computer Science [347], 130-166 | |
| SIAM Journal on Computing
- | 2005 | Hutchinson, 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) | 2005 | Katriel, Irit
Michel, Laurent
Van Hentenryck, Pascal | | Maintaining Longest Paths Incrementally
In: Constraints [10], 159-183 | |
| Constraints
- | 2005 | Katriel, Irit
Thiel, Sven | | Complete Bound Consistency for the Global Cardinality Constraint
In: Constraints [10], 191-217 | |
| ACM SIGMOBILE Mobile Computing and Communications Review
- | 2005 | Kesselman, Alexander
Kowalski, Dariusz
Segal, Michael | | Energy 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
- | 2005 | Khachiyan, Leonid
Boros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir
Makino, Kazuhisa | | On the Complexity of Some Enumeration Problems for Matroids
In: SIAM Journal on Discrete Mathematics [19], 966-984 | |
| Theoretical Computer Science
- | 2005 | Kowalski, 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
- | 2005 | Kutz, Martin | | Conway's Angel in three dimensions
In: Theoretical Computer Science [349], 443-451 | |
| Journal of Algorithms
- | 2005 | Sitters, Rene | | Complexity of preemptive minsum scheduling on unrelated parallel machines
In: Journal of Algorithms [57], 37-48 | |
| Electronic Notes in Discrete Mathematics
1571-0653 | 2004 | Ahuja, 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
- | 2004 | Beier, René
Vöcking, Berthold | | Random knapsack in expected polynomial time
In: Journal of Computer and System Sciences [69], 306-329 | |
| Random Structures and Algorithms
- | 2004 | Chlebus, Bogdan S.
Kowalski, Dariusz | | Randomization helps to perform independent tasks reliably
In: Random Structures and Algorithms [24], 11-41 | |
| Oberwolfach Reports
- | 2004 | Doerr, Benjamin | | Multi-color discrepancies
In: Oberwolfach Reports [1], 683-685 | |
| Proceedings of the Amercian Mathematical Society
0002-9939 | 2004 | El Kahoui, M'hammed | | Contants 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 | 2004 | El Kahoui, M'hammed | | Subresultants and locally nilpotent derivations
In: Linear Algebra and its Applications [380], 253-261 | |
| Journal of Algorithms
0196-6774 | 2004 | Goemans, Michel X.
Skutella, Martin | | Cooperative facility location games
In: Journal of Algorithms [50], 194-214 | |
| European Journal of Operational Research
- | 2004 | Henz, 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
- | 2004 | Katriel, Irit | | On the Algebraic Complexity of Set Equality and Inclusion
In: Information Processing Letters [92], 175-178 | |
| SIAM Journal on Computing
- | 2004 | Kesselman, Alexander
Lotker, Zvi
Mansour, Yishay
Patt-Shamir, Boaz
Schieber, Baruch
Sviridenko, Maxim | | Buffer Overflow Management in QoS Switches
In: SIAM Journal on Computing [33], 563-583 | |
| Theoretical Computer Science
- | 2004 | Kesselman, Alexander
Mansour, Yishay | | Harmonic Buffer Management for Shared-Memory Switches
In: Theoretical Computer Science [324], 161-182 | |
| SIAM Journal on Computing
- | 2004 | Kowalski, 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 | 2004 | Leonardi, 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 | 2004 | Moehring, Rolf H.
Skutella, Martin
Stork, Frederik | | Scheduling with AND/OR Precedence Constraints
In: SIAM Journal on Computing [33], 393-415 | |
| Information Processing Letters
- | 2004 | Pettie, Seth
Sanders, Peter | | A simpler linear time 2/3 - eps approximation for maximum weight matching
In: Information Processing Letters [91], 271-276 | |
| Discrete Applied Mathematics
- | 2004 | Smid, 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 | 2003 | Adler, Micah
Räcke, Harald
Sivadasan, Naveen
Sohler, Christian
Vöcking, Berthold | | Randomized Pursuit-Evasion in Graphs
In: Combinatorics, Probability and Computing [12], 225-244 | |
| Journal of Algorithms
0196-6774 | 2003 | Althaus, Ernst
Duchier, Denys
Koller, Alexander
Mehlhorn, Kurt
Niehren, Joachim
Thiel, Sven | | An Efficient Algorithm for the Configuration Problem of Dominance Graphs
In: Journal of Algorithms [48], 194-219 | |
| Journal of Graph Algorithms and Applications
1526-1719 | 2003 | Arge, 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
- | 2003 | Bast, Holger
Mehlhorn, Kurt
Schäfer, Guido
Tamaki, Hisao | | A Heuristic for Dijkstra's Algorithm With Many Targets and its Use in Weighted Matching Algorithms
In: Algorithmica [36], 75-88 | |
| Discrete Applied mathematics
- | 2003 | Boros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, Vladimir | | An Inequality for Polymatroid Functions and its Applications
In: Discrete Applied mathematics [131], 27 | |
| Mathematical Programming, Ser. B
- | 2003 | Boros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, Vladimir | | Extending the Balas-Yu Bounds on the Number of Maximal Independent Sets in Graphs to Hypergraphs and Lattices
In: Mathematical Programming, Ser. B [98], 14 | |
| Fundamenta Informaticae
0169-2968 | 2003 | Burkhardt, Stefan
Kärkkäinen, Juha | | Better Filtering with Gapped q-Grams
In: Fundamenta Informaticae [56], 51-70 | |
| Combinatorica
0209-9683 | 2003 | Csaba, Bela | | Proof of a conjecture of Bollobas and Eldridge for graphs of maximum degree three
In: Combinatorica [23], 35-72 | |
| Journal of Symbolic Computation
0747-7171 | 2003 | El Kahoui, M'hammed | | An elementary approach to subresultants theory
In: Journal of Symbolic Computation [35], 281-292 | |
| Information Processing Letters
0020-0190 | 2003 | Fekete, Sandor P.
Skutella, Martin
Woeginger, Gerhard J. | | The complexity of economic equilibria for house allocation markets
In: Information Processing Letters [88], 219-223 | |
| Journal of Computer and System Sciences
0022-0000 | 2003 | Henzinger, 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 | 2003 | Hoogeveen, Han
Skutella, Martin
Woeginger, Gerhard J. | | Preemptive scheduling with rejection
In: Mathematical Programming [94], 361-374 | |
| Computational Geometry - Theory and Applications
0925-7721 | 2003 | Kettner, 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 | 2003 | Kettner, 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
- | 2003 | Krick, 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
- | 2003 | Krysta, Piotr | | Approximating Minimum Size 1,2-Connected Networks
In: Discrete Applied Mathematics [125], 267-288 | |
| Information Processing Letters
- | 2003 | Kwek, St.
Mehlhorn, Kurt | | Optimal Search for Rationals
In: Information Processing Letters [86], 23-26 | |
| Algorithmica
0178-4617 | 2003 | Mehlhorn, Kurt
Sanders, Peter | | Scanning Multiple Sequences via Cache Memory
In: Algorithmica [35], 75-93 | |
| International Journal of Computational Geometry & Applications
- | 2003 | Mehlhorn, Kurt
Seel, Michael | | Infimaximal frames: A technique for making lines look like segments
In: International Journal of Computational Geometry & Applications [13], 241-255 | |
| Journal of Algorithms
0196-6774 | 2003 | Meyer, Ulrich | | Average-case complexity of single-source shortest-path algorithms: lower and upper bounds
In: Journal of Algorithms [48], 91-134 | |
| Journal of Algorithms
0196-6774 | 2003 | Meyer, Ulrich
Sanders, Peter | | $\Delta$-stepping: a parallelizable shortest path algorithm
In: Journal of Algorithms [49], 114-152 | |
| Operations Research Letters
0167-6377 | 2003 | Polzin, 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 | 2003 | Sanders, Peter | | Asynchronous Scheduling of Redundant Disk Arrays
In: IEEE Transactions on Computers [52], 1170-1184 | |
| Information Processing Letters
0020-0190 | 2003 | Sanders, 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 | 2003 | Sanders, 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 | 2002 | Albers, Susanne
Kursawe, Klaus
Schuierer, Sven | | Exploring unkown environments with obstacles
In: Algorithmica [32], 123-143 | |
| Journal of Computational Biology
1066-5277 | 2002 | Althaus, Ernst
Kohlbacher, Oliver
Lenhof, Hans-Peter
Müller, Peter | | A combinatorial approach to protein docking with flexible side chains
In: Journal of Computational Biology [9], 597-612 | |
| Algorithmica
0178-4617 | 2002 | Bachrach, 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 | 2002 | Banderier, Cyril
Bousquet-Mélou, Mireille
Denise, Alain
Flajolet, Philippe
Gardy, Danièle
Gouyou-Beauchamps, Dominique | | Generating Functions for Generating Trees
In: Discrete Mathematics [246], 29-55 | |
| Theoretical Computer Science
0304-3975 | 2002 | Banderier, Cyril
Flajolet, Philippe | | Basic analytic combinatorics of directed lattice paths
In: Theoretical Computer Science [281], 37-80 | |
| SIAM Journal on Computing
- | 2002 | Boros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, Vladimir
Makino, Kazuhisa | | Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities
In: SIAM Journal on Computing [31], 20 | |
| Journal of Symbolic Computation
0747-7171 | 2002 | Bouziane, Driss
El Kahoui, M'hammed | | Computation of the dual of a plane projective curve
In: Journal of Symbolic Computation [34], 105-117 | |
| Journal of Algorithms
0196-6774 | 2002 | Bradford, Phillip Gnassi
Golin, Mordecai J.
Larmore, Lawrence L. | | Optimal prefix-free codes for unequal letter costs: Dynamic programming with the Monge property
In: Journal of Algorithms [42], 277-303 | |
| Algorithmica
0178-4617 | 2002 | Crauser, 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 | 2002 | El Kahoui, M'hammed | | On plane polynomial vector fields and the Poincar\'e problem
In: Electronic Journal of Differential Equations [2002], 1-23 | |
| Algorithmica
0178-4617 | 2002 | Fotakis, Dimitris
Spirakis, Paul G. | | Minimum Congestion Redundant Assignments to Tolerate Random Faults
In: Algorithmica [32], 396-422 | |
| Computational Geometry - Theory and Applications
- | 2002 | Funke, Stefan
Mehlhorn, Kurt | | LOOK - A Lazy Object-Oriented Kernel for Geometric Computation
In: Computational Geometry - Theory and Applications [22], 99-118 | |
| Algorithmica
0178-4617 | 2002 | Jansen, Klaus
Porkolab, Lorant | | Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks
In: Algorithmica [32], 507-520 | |
| Information Processing Letters
- | 2002 | Mehlhorn, Kurt
Priebe, Volker
Schäfer, Guido
Sivadasan, Naveen | | All-Pairs Shortest-Paths Computation in the Presence of Negative Cycles
In: Information Processing Letters [81], 341-343 | |
| Journal of Algorithms
- | 2002 | Meyer, Ulrich
Sibeyn, Jop F. | | Oblivious Gossiping on Tori
In: Journal of Algorithms [42], 1-19 | |
| Discrete Applied Mathematics
0166-218X | 2002 | Niedermeier, Rolf
Reinhard, Klaus
Sanders, Peter | | Towards Optimal Locality in Mesh-Indexings
In: Discrete Applied Mathematics [117], 211-237 | |
| The Computer Journal
0010-4620 | 2002 | Sanders, Peter | | Randomized Receiver Initiated Load Balancing Algorithms for Tree Shaped Computations
In: The Computer Journal [45], 561-573 | |
| Parallel Computing
0167-8191 | 2002 | Sanders, Peter | | Reconciling simplicity and realism in parallel disk models
In: Parallel Computing [28], 705-723 | |
| Fundamenta Informaticae
0169-2968 | 2002 | Sanders, 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 | 2002 | Wendt, 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 | 2001 | Althaus, Ernst
Mehlhorn, Kurt | | Traveling Salesman-Based Curve Reconstruction in Polynomial Time
In: SIAM Journal on Computing [31], 27-66 | |
| Theoretical Computer Science
0304-3975 | 2001 | Arikati, 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 | 2001 | Banderier, Cyril | | Random Maps, Coalescing Saddles, Singularity Analysis, and Airy Phenomena
In: Random Structures & Algorithms [19], 194-246 | |
| Discrete Applied Mathematics
- | 2001 | Brö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 | 2001 | Burnikel, Christoph
Funke, Stefan
Seel, Michael | | Exact geometric computation using Cascading
In: International Journal of Computational Geometry & Applications [11], 245-266 | |
| Combinatorica
0209-9683 | 2001 | Cole, 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 | 2001 | Crauser, Andreas
Ferragina, Paolo
Mehlhorn, Kurt
Meyer, Ulrich
Ramos, Edgar A. | | Randomized External-Memory Algorithms for Line Segment Intersection and Other Geometric Problems
In: International Journal of Computational Geometry & Applications [11], 305-337 | |
| Electronic Notes in Discrete Mathematics
- | 2001 | Doerr, Benjamin | | Vector Balancing Games with Aging
In: Electronic Notes in Discrete Mathematics [10], xx-xx | |
| Electronic Notes in Discrete Mathematics
- | 2001 | Doerr, Benjamin
Srivastav, Anand | | Multi-Color Discrepancies
In: Electronic Notes in Discrete Mathematics [7], xx-xx | |
| Electronic Notes in Discrete Mathematics
1571-0653 | 2001 | Doerr, 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 | 2001 | El Kahoui, M'hammed | | Improved algorithms for linear complementarity problems arising from collision response
In: Mathematics and Computers in Simulation [56], 69-93 | |
| Journal of Combinatorial Optimization
1382-6905 | 2001 | Krysta, Piotr
Solis-Oba, Roberto | | Approximation Algorithms for Bounded Facility Location
In: Journal of Combinatorial Optimization [5], 233-247 | |
| Random Structures & Algorithms
- | 2001 | Kumar, V. S. Anil | | Coupling vs. conductance for the Jerrum-Sinclair chain
In: Random Structures & Algorithms [18], 1-17 | |
| International Journal of Computational Geometry & Applications
0218-1959 | 2001 | Mehlhorn, Kurt
Meiser, Stefan
Rasch, Ronald | | Furthest site abstract Voronoi diagrams
In: International Journal of Computational Geometry & Applications [11], 583-616 | |
| SIAM Journal on Optimization
1052-6234 | 2001 | Mutzel, Petra | | An alternative method to crossing minimization on hierarchical graphs
In: SIAM Journal on Optimization [11], 1065-1080 | |
| Discrete Applied Mathematics
0166-218X | 2001 | Polzin, Tobias
Vahdati Daneshmand, Siavash | | A Comparison of Steiner Tree Relaxations
In: Discrete Applied Mathematics [112], 241-261 | |
| Discrete Applied Mathematics
0166-218X | 2001 | Polzin, 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 | 2001 | Ramos, 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 | 2001 | Ramos, Edgar A. | | Solving Some Discrepancy Problems in NC
In: Algorithmica [29], 371-395 | |
| Discrete and Computational Geometry
0179-5376 | 2001 | Ramos, Edgar A.
Amato, Nancy M.
Goodrich, Michael T. | | A Randomized Algorithm for Triangulating a Simple Polygon in Linear Time
In: Discrete and Computational Geometry [26], 246-265 | |
| Journal of Algorithms
0196-6774 | 2001 | Sanders, Peter
Solis-Oba, Roberto | | How Helpers Hasten h-Relations
In: Journal of Algorithms [41], 86-98 | |
| Journal of the ACM
0004-5411 | 2000 | Albers, 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
- | 2000 | Albers, 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 | 2000 | Andersson, Arne
Hagerup, Torben
Hastad, Johan
Petersson, Ola | | Tight bounds for searching a sorted array of strings
In: SIAM Journal on Computing [30], 1552-1578 | |
| Computational Geometry
0925-7721 | 2000 | Arya, Sunil
Mount, David M. | | Approximate range searching
In: Computational Geometry [17], 135-152 | |
| Theory of Computing Systems
1432-4350 | 2000 | Bast, Hannah | | On Scheduling Parallel Tasks at Twilight
In: Theory of Computing Systems [33], 489-563 | |
| Information Processing Letters
- | 2000 | Bein, Wolfgang W.
Fleischer, Rudolf
Larmore, Lawrence L. | | Limited bookmark randomized online algorithms for the paging problem
In: Information Processing Letters [76], 155-162 | |
| Parallel Processing Letters
- | 2000 | Boros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, Vladimir | | An Efficient Incremental Algorithm for Generating All Maximal Independent Sets in Hypergraphs of Bounded Dimension
In: Parallel Processing Letters [10], 14 | |
| Algorithmica
0178-4617 | 2000 | Burnikel, Christoph
Fleischer, Rudolf
Mehlhorn, Kurt
Schirra, Stefan | | A strong and easily computable separation bound for arithmetic expressions involving radicals
In: Algorithmica [27], 87-99 | |
| Algorithmica
0178-4617 | 2000 | Chaudhuri, Shiva
Subrahmanyam, K. V.
Wagner, Frank
Zaroliagis, Christos | | Computing mimicking networks
In: Algorithmica [26], 31-49 | |
| Algorithmica
0178-4617 | 2000 | Chaudhuri, 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 | 2000 | Cole, Richard
Farach-Colton, Martin
Hariharan, Ramesh
Przytycka, Teresa
Thorup, Mikkel | | An O(n log n) algorithm for the maximum agreement subtree problem for binary trees
In: SIAM Journal on Computing [30], 1385-1404 | |
| Random Structures & Algorithms
1042-9832 | 2000 | Cooper, Colin
Frieze, Alan M.
Mehlhorn, Kurt
Priebe, Volker | | Average-Case Complexity of Shortest-Paths Problems in the Vertex-Potential Model
In: Random Structures & Algorithms [16], 33-46 | |
| Computational Geometry
0925-7721 | 2000 | Dey, Tamal K.
Mehlhorn, Kurt
Ramos, Edgar A. | | Curve reconstruction: Connecting dots with good reason
In: Computational Geometry [15], 229-244 | |
| Algorithmica
- | 2000 | Djidjev, Hristo N.
Pantziou, G. E.
Zaroliagis, Christos | | Improved algorithms for dynamic shortest paths
In: Algorithmica [28], 367-389 | |
| Journal of Symbolic Computation
0747-7171 | 2000 | El Kahoui, M'hammed | | Deciding Hopf bifurcations by quantifier elimination in a software-component architecture
In: Journal of Symbolic Computation [30], 161-179 | |
| Software - Practice and Experience
0038-0644 | 2000 | Fabri, Andreas
Giezeman, Geert-Jan
Kettner, Lutz
Schirra, Stefan
Schönherr, Sven | | On the Design of CGAL, a computational geometry algorithms library
In: Software - Practice and Experience [30], 1167-1202 | |
| Theory of Computing Systems
1432-4350 | 2000 | Fatourou, Panagiota
Spirakis, Paul G. | | Efficient Scheduling of Strict Multithreaded Computations
In: Theory of Computing Systems [33], 173-232 | |
| Journal of Algorithms
0196-6774 | 2000 | Garg, Naveen
Konjevod, Goran
Ravi, R. | | Approximation algorithm for the group Steiner tree problem
In: Journal of Algorithms [37], 66-84 | |
| Journal of the ACM
- | 2000 | Goldberg, Leslie Ann
MacKenzie, Philip D.
Paterson, Mike
Srinivasan, Aravind | | Contention resolution with constant expected delay
In: Journal of the ACM [42], 1048-1096 | |
| Algorithmica
0178-4617 | 2000 | Hagerup, Torben | | Dynamic algorithms for graphs of bounded treewidth
In: Algorithmica [27], 292-315 | |
| Information and Computation
0890-5401 | 2000 | Hagerup, Torben | | Parallel preprocessing for path queries without concurrent reading
In: Information and Computation [158], 18-28 | |
| Future Generation Computer Systems
0167-739X | 2000 | Jung, Bernd
Lenhof, Hans-Peter
Müller, Peter
Rüb, Christine | | Simulating synthetic polymer chains in parallel
In: Future Generation Computer Systems [16], 513-522 | |
| Discrete Applied Mathematics
0166-218X | 2000 | Kececioglu, John
Lenhof, Hans-Peter
Mehlhorn, Kurt
Mutzel, Petra
Reinert, Knut
Vingron, Martin | | A polyhedral approach to sequence alignment problems
In: Discrete Applied Mathematics [104], 143-186 | |
| Discrete & Computational Geometry
0179-5376 | 2000 | Khachiyan, Leonid
Porkolab, Lorant | | Integer optimization on convex semialgebraic sets
In: Discrete & Computational Geometry [23], 207-224 | |
| Bioinformatics
1367-4803 | 2000 | Kohlbacher, Oliver
Lenhof, Hans-Peter | | BALL - Rapid Software Prototyping in Computational Molecular Biology
In: Bioinformatics [16], 815-824 | |
| Theory of Computing Systems
1432-4350 | 2000 | Kontogiannis, Spyros
Pantziou, Grammati E.
Spirakis, Paul G.
Yung, Moti | | Robust Parallel Computations through Randomization
In: Theory of Computing Systems [33], 427-464 | |
| International Journal of Computational Geometry and Applications
0218-1959 | 2000 | Lee, Jae-Ha
Park, Sang-Min
Chwa, Kyung-Yong | | Searching a polygonal room with one door by a 1-searcher
In: International Journal of Computational Geometry and Applications [10], 201-220 | |
| Journal of Parallel and Distributed Computing
0743-7315 | 2000 | Lee, 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 | 2000 | Lermen, 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 | 2000 | Maggs, Bruce M.
Vöcking, Berthold | | Improved Routing and Sorting on Multibutterflies
In: Algorithmica [28], 438-464 | |
| Computational Geometry
0925-7721 | 2000 | Mehlhorn, Kurt
Sack, Jörg-Rüdiger | | Editorial
In: Computational Geometry [17], 1-2 | |
| Journal of Combinatorial Optimization
1382-6905 | 2000 | Nutov, Zeev
Penn, Michael | | On Integrality, Stability and Composition of Dicycle Packings and Covers
In: Journal of Combinatorial Optimization [4], 235 - 252 | |
| Algorithmica
0178-4617 | 2000 | Seiden, Steve S. | | Online randomized multiprocessor scheduling
In: Algorithmica [28], 173-216 | |
| IEEE Transactions on Parallel & Distributed Systems
- | 2000 | Sibeyn, Jop F. | | Solving fundamental problems on sparse-meshes
In: IEEE Transactions on Parallel & Distributed Systems [11], 1324-1332 | |
| Combinatorics, Probability and Computing
0963-5483 | 2000 | Subramanian, C. R. | | Algorithms for Colouring Random k-colourable Graphs
In: Combinatorics, Probability and Computing [9], 45-77 | |
| Journal of Algorithms
0196-6774 | 2000 | Thorup, Mikkel | | Floats, Integers, and Single Source Shortest Paths
In: Journal of Algorithms [35], 189 -201 | |
| Journal of Parallel and Distributed Computing
0743-7315 | 2000 | Trä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 | 1999 | Albers, Susanne | | Better bounds for online scheduling
In: SIAM Journal on Computing [29], 459-473 | |
| Information Processing Letters
- | 1999 | Arikati, Srinivasa Rao
Mehlhorn, Kurt | | A correctness certificate for the Stoer-Wagner min-cut algorithm
In: Information Processing Letters [70], 251-254 | |
| Combinatorics, Probability and Computing
- | 1999 | Arya, Sunil
Golin, Mordecai J.
Mehlhorn, Kurt | | On the Expected Depth of Random Circuits
In: Combinatorics, Probability and Computing [8], 209-228 | |
| Journal of Algorithms
- | 1999 | Auletta, Vincenzo
Dinitz, Yefim
Nutov, Zeev
Parente, Domenico | | A 2-approximation algorithm for finding an optimum 3-vertex-connected spanning subgraph
In: Journal of Algorithms [32], 21-30 | |
| Information Processing Letters
- | 1999 | Cheriyan, Joseph
Mehlhorn, Kurt | | An analysis of the highest-level selection rule in the preflow-push max-flow algorithm
In: Information Processing Letters [69], 239-242 | |
| Combinatorica
0209-9683 | 1999 | Dinitz, Yefim
Garg, Naveen
Goemans, Michel X. | | On the single-source unsplittable flow problem
In: Combinatorica [19], 17-41 | |
| Journal of Algorithms
- | 1999 | Dinitz, Yefim
Nutov, Zeev | | A 3-approximation algorithm for finding optimum 4,5-vertex-connected spanning subgraphs
In: Journal of Algorithms [32], 21-30 | |
| Information and computation
- | 1999 | Fleischer, Rudolf | | Decision trees: old and new results
In: Information and computation [152], 44-61 | |
| Information Processing Letters
- | 1999 | Gupta, Prosenjit
Janardan, Ravi
Smid, Michiel | | Efficient algorithms for counting and reporting pairwise intersections between convex polygons
In: Information Processing Letters [69], 7-13 | |
| IEEE Transactions on Robotics and Automation
- | 1999 | Hert, Susan
Lumelsky, Vladimir | | Motion Planning in R^3 for Multiple Tethered Robots
In: IEEE Transactions on Robotics and Automation [15], 623-639 | |
| Networks
- | 1999 | Kagaris, 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
- | 1999 | Krysta, Piotr
Pacholski, Leszek | | The STO problem is NP-complete
In: Journal of Symbolic Computation [27], 207-219 | |
| Bioinformatics
1367-4803 | 1999 | Lenhof, 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
- | 1999 | Mehlhorn, Kurt
Näher, Stefan
Seel, Michael
Seidel, Raimund
Schilz, Thomas
Schirra, Stefan
Uhrig, Christian | | Checking geometric programs or verification of geometric structures
In: Computational Geometry: Theory and Applications [12], 85-104 | |
| Computational Geometry
- | 1999 | Mehlhorn, Kurt
Sack, Jörg-Rüdiger
Urrutia, Jorg | | Editorial
In: Computational Geometry [12], 153-154 | |
| Parallel Computing
0167-8191 | 1999 | Rathe, 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 | 1999 | Sanders, Peter | | Analysis of nearest neighbor load balancing algorithms for random loads
In: Parallel Computing [25], 1013-1033 | |
| Journal of Combinatorial Optimization
1382-6905 | 1999 | Seiden, Steve S. | | Randomized online scheduling with delivery times
In: Journal of Combinatorial Optimization [3], 399-416 | |
| SIAM Journal on Computing
- | 1999 | Sibeyn, Jop F. | | Row-Major Sorting on Meshes
In: SIAM Journal on Computing [28], 847-863 | |
| Journal of Algorithms
- | 1999 | Subramanian, C. R. | | Minimum Coloring k-Colorable Graphs in Polynomial Average Time
In: Journal of Algorithms [33], 112-123 | |
| SIAM Journal on Discrete Mathematics
- | 1998 | Bodlaender, Hans L.
Deogun, Jitender S.
Jansen, Klaus
Kloks, Ton
Kratsch, Dieter
Müller, Haiko
Tuza, Zsolt | | Ranking of Graphs
In: SIAM Journal on Discrete Mathematics [11], 168-181 | |
| Journal of Algorithms
0196-6774 | 1998 | Calinescu, Gruia
Fernandes, Cristina G.
Finkler, Ulrich
Karloff, Howard | | A Better Approximation Algorithm for Finding Planar Subgraphs
In: Journal of Algorithms [27], 269-302 | |
| Cartography and Geographic Information Systems
- | 1998 | de 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
- | 1998 | Lenhof, Hans-Peter
Reinert, Knut
Vingron, Martin | | A Polyhedral Approach to RNA Sequence Structure Alignment
In: Journal of Computational Biology [5], 517-530 | |
| PARS-Mitteilungen
- | 1998 | Sanders, Peter | | Random Permutations on Distributed, External and Hierarchical Memory
In: PARS-Mitteilungen, 160-165
In: PARS-Mitteilungen [1998], 160-165 | |
| Algorithmica
- | 1997 | Albers, Susanne | | On the Influence of Lookahead in Competitive Paging Algorithms
In: Algorithmica [18], 283-305 | |
| Information and Computation
- | 1997 | Albers, Susanne
Hagerup, Torben | | Improved Parallel Integer Sorting without Concurrent Writing
In: Information and Computation [136], 25-51 | |
| Information Processing Letters
- | 1997 | Albers, Susanne
Mitzenmacher, Michael | | Revisiting the COUNTER algorithms for list update
In: Information Processing Letters [64], 155-160 | |
| Discrete Applied Mathematics
- | 1997 | Arikati, Srinivasa Rao
Maheshwari, Anil
Zaroliagis, Christos | | Efficient Computation of implicit representations of sparse graphs
In: Discrete Applied Mathematics [78], 1-16 | |
| Discrete & Computational Geometry
- | 1997 | Bradford, Phillip Gnassi
Capoyleas, Vasilis | | Weak epsilon-Nets for Points on a Hypersphere
In: Discrete & Computational Geometry [18], 83-91 | |
| Journal of Algorithms
- | 1997 | Bradford, Phillip Gnassi
Fleischer, Rudolf
Smid, Michiel | | More efficient parallel totally monotone matrix searching
In: Journal of Algorithms [23], 386-400 | |
| Informatik Spektrum
- | 1997 | Brandenburg, Franz J.
Jünger, Michael
Mutzel, Petra | | Algorithmen zum automatischen Zeichnen von Graphen
In: Informatik Spektrum [20], 199-207 | |
| Journal of Algorithms
- | 1997 | Breslauer, Dany
Jiang, Tao
Jiang, Zhigen | | Rotations of periodic strings and short superstrings
In: Journal of Algorithms [24], 340-353 | |
| Theoretical Computer Science
- | 1997 | Chaudhuri, Shiva
Dubhashi, Devdatt | | Probabilistic recurrence relations revisited
In: Theoretical Computer Science [181], 45-56 | |
| Information and Computation
- | 1997 | Chaudhuri, Shiva
Radhakrishnan, Jaikumar | | The Complexity of Parallel Prefix Problems on Small Domains
In: Information and Computation [138], 1-22 | |
| Journal of Computational Biology
- | 1997 | Christof, Thomas
Jünger, Michael
Kececioglu, John
Mutzel, Petra
Reinelt, Gerhard | | A Branch-And-Cut Approach to Physical Mapping of Chromosomes by Unique End-Probes
In: Journal of Computational Biology [4], 433-447 | |
| SIAM Journal on Computing
- | 1997 | Crochemore, Maxime
Galil, Zvi
Gasieniec, Leszek
Park, Kunsoo
Rytter, Wojciech | | Constant-time Randomized Parallel String Matching
In: SIAM Journal on Computing [26], 950-960 | |
| Algorithmica
0178-4617 | 1997 | Das, 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
- | 1997 | Deng, Xiaotie
Mahajan, Sanjeev | | The Cost of Derandomization: Computability or Competitiveness
In: SIAM Journal on Computing [26], 786-802 | |
| Journal of Algorithms
- | 1997 | Dietzfelbinger, Martin
Hagerup, Torben
Katajainen, Jyrki
Penttonen, Martti | | A reliable randomized algorithm for the closest-pair problem
In: Journal of Algorithms [25], 19-51 | |
| Discrete and Computational Geometry
- | 1997 | Edelsbrunner, 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
- | 1997 | Follert, Frank
Schömer, Elmar
Sellen, Jürgen
Smid, Michiel
Thiel, Christian | | Computing the largest empty anchored cylinder, and related problems
In: International Journal of Computational Geometry and Applications [7], 563-580 | |
| Journal of Parallel and Distributed Computing
- | 1997 | Gasieniec, 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
- | 1997 | Goodrich, Michael T.
Ramos, Edgar A. | | Bounded-independence derandomization of geometric partitioning with applications to parallel fixed-dimensional linear programming
In: Discrete and Computational Geometry [18], 397-420 | |
| Computational Complexity
- | 1997 | Gupta, 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
- | 1997 | Gupta, Prosenjit
Janardan, Ravi
Smid, Michiel
Dasgupta, Bhaskar | | The rectangle enclosure and point-dominance problems revisited
In: International Journal of Computational Geometry and Applications [7], 437-456 | |
| Journal of Parallel and Distributed Computing
- | 1997 | Hagerup, Torben | | Allocating Independent Tasks to Parallel Processors: An Experimental Study
In: Journal of Parallel and Distributed Computing [47], 185-197 | |
| Algorithmica
- | 1997 | Hagerup, Torben
Kutylowski, Miroslaw | | Fast integer merging on the EREW PRAM
In: Algorithmica [17], 55-66 | |
| Journal of Graph Algorithms and Applications
- | 1997 | Jünger, Michael
Mutzel, Petra | | 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms
In: Journal of Graph Algorithms and Applications [1], 1-25 | |
| Macromolecular Theory and Simulation
- | 1997 | Jung, Bernd
Lenhof, Hans-Peter
Müller, Peter
Rüb, Christine | | Langevin dynamics simulations of macromolecules on parallel computers
In: Macromolecular Theory and Simulation [6], 507-521 | |
| Computers and Artificial Intelligence
- | 1997 | Kaufmann, Michael
Meyer, Ulrich
Sibeyn, Jop F. | | Matrix Transpose on Meshes: Theory and Practice
In: Computers and Artificial Intelligence [16], 107-140 | |
| Algorithmica
- | 1997 | Kaufmann, Michael
Raman, Rajeev
Sibeyn, Jop F. | | Routing on Meshes with Buses
In: Algorithmica [18], 417-444 | |
| Random Structures Algorithms
- | 1997 | Mehlhorn, Kurt
Priebe, Volker | | On the All-Pairs Shortest-Path Algorithm of Moffat and Takaoka
In: Random Structures Algorithms [10], 205-220 | |
| Parallel Processing Letters
- | 1997 | Papatriantafilou, Marina
Tsigas, Philippas | | Self-Stabilizing Wait-Free Clock Synchronization
In: Parallel Processing Letters [7], 321-328 | |
| Computational Geometry Theory and Applications
0925-7721 | 1997 | Ramos, 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
- | 1997 | Rüb, Christine | | On the average running time of odd-even merge sort
In: Journal of Algorithms [22], 329-346 | |
| International Journal on the Foundations of Computer Science
- | 1997 | Sibeyn, Jop F. | | Routing on Triangles, Tori and Honeycombs
In: International Journal on the Foundations of Computer Science [8], 269-287 | |
| Algorithmica
- | 1997 | Sibeyn, Jop F.
Kaufmann, Michael | | Randomized Multipacket Routing and Sorting on Meshes
In: Algorithmica [17], 224-244 | |
| Journal of Algorithms
- | 1997 | Sibeyn, Jop F.
Kaufmann, Michael
Chlebus, Bogdan S. | | Deterministic Permutation Routing on Meshes
In: Journal of Algorithms [22], 111-141 | |
| Parallel Processing Letters
- | 1997 | Zaroliagis, Christos | | Simple and Work-Efficient Parallel Algorithms for the Minimum Spanning Tree Problem
In: Parallel Processing Letters [7], 25-37 | |
| Algorithmica
0178-4617 | 1996 | Alt, Helmut
Guibas, L.
Mehlhorn, Kurt
Karp, Richard M.
Wigderson, A. | | A Method for Obtaining Randomized Algorithms with Small Tail Probabilities
In: Algorithmica [16], 543-547 | |
| Parallel Processing Letters
- | 1996 | Breslauer, Dany
Ramesh, Hariharan | | Optimal Parallel Construction of Minimal Suffix and Factor Automata
In: Parallel Processing Letters [6], 35-44 | |
| Journal of Statistical Physics
- | 1996 | De Simone, Caterina
Diehl, Martin
Jünger, Michael
Mutzel, Petra
Reinelt, Gerhard
Rinaldi, Giovanni | | Exact Ground States of Two-Dimensional +-J Ising Spin Glasses
In: Journal of Statistical Physics [84], 1363-1371 | |
| Journal of Complexity
0885-064X | 1996 | El Kahoui, M'hammed | | An Improved Upper Complexity Bound for the Topology Computation of a Real Algebraic Plane Curve
In: Journal of Complexity [12], 527-544 | |
| J. Algorithms
- | 1996 | Fredman, 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
- | 1995 | Ben-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
- | 1995 | Datta, 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
- | 1995 | DeSimone, Caterina
Diehl, Martin
Jünger, Michael
Mutzel, Petra
Reinelt, Gerhard
Rinaldi, Giovanni | | Exact Ground States of Ising Spin Glasses: New Experimental Results With a Branch and Cut Algorithm
In: Journal of Statistical Physics [80], 487-496 | |
| Theoretical Computer Science
- | 1995 | Dubhashi, Devdatt
Pantziou, Grammati E.
Spirakis, Paul G.
Zaroliagis, Christos | | The Fourth Moment in Luby's Distribution
In: Theoretical Computer Science [148], 133-140 | |
| Nordic Journal of Computing
- | 1995 | Golin, Mordecai J.
Raman, Rajeev
Schwarz, Christian
Smid, Michiel | | Simple randomized algorithms for closest pair problems
In: Nordic Journal of Computing [2], 3-27 | |
| Parallel Processing Letters
- | 1995 | Hagerup, Torben
Keller, Jörg | | Fast Parallel Permutation Algorithms
In: Parallel Processing Letters [5], 139-148 | |
| Parallel Processing Letters
- | 1995 | Kaufmann, 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
- | 1995 | Lenhof, 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
- | 1995 | Mehlhorn, Kurt | | Guest Editor's Foreword
In: Discrete and Computational Geometry [14], 363-363 | |
| Journal of Mathematical Imaging and Vision
- | 1995 | Rieger, Joachim | | Generic Evolutions of Edges on Families of Diffused Greyvalue Surfaces
In: Journal of Mathematical Imaging and Vision [5], 207-217 | |
| Parallel Computing
- | 1995 | Träff, Jesper Larsson | | An Experimental Comparison of two Distributed Singel-Source Shortest Path Algorithm
In: Parallel Computing [21], 1505-1532 | |
| Journal of Algorithms
- | 1994 | Baumgarten, Hanna
Jung, Hermann
Mehlhorn, Kurt | | Dynamic point location in general subdivisions
In: Journal of Algorithms [3], 342-380 | |
| Information Processing Letters
- | 1994 | Bilardi, Gianfranco
Chaudhuri, Shiva
Dubhashi, Devdatt
Mehlhorn, Kurt | | A lower bound for area-universal graphs
In: Information Processing Letters [51], 101-105 | |
| SIAM Journal on Computing
- | 1994 | Dietzfelbinger, Martin
Karlin, Anna
Mehlhorn, Kurt
Meyer Auf Der Heide, Friedhelm
Rohnert, Hans
Tarjan, Robert E. | | Dynamic Perfect Hashing: Upper and Lower Bounds
In: SIAM Journal on Computing [23], 738-761 | |
| SIAM Journal on Computing
- | 1994 | Kaufmann, Michael
Mehlhorn, Kurt | | A linear-time algorithm for the homotopic routing problem in grid graphs
In: SIAM Journal on Computing [23], 227-246 | |
| RAIRO Theoretical Informatics and Applications
- | 1994 | Lenhof, 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 | 1994 | Mehlhorn, Kurt
Näher, Stefan
Nievergelt, Jurg | | Introduction
In: Journal of Symbolic Computation [17], 295-295 | |
| Computational Geometry: Theory and Applications
- | 1993 | Clarkson, Kenneth L.
Mehlhorn, Kurt
Seidel, Raimund | | Four Results on Randomized Incremental Constructions
In: Computational Geometry: Theory and Applications [3], 185-212 | |
| Computational Geometry: Theory and Applications
- | 1993 | Klein, Rolf
Mehlhorn, Kurt
Meiser, Stefan | | Randomized incremental construction of abstract Voronoi diagrams
In: Computational Geometry: Theory and Applications [3], 157-184 | |
| International Journal of Computational Geometry & Applications
- | 1993 | Lenhof, 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
- | 1993 | Mehlhorn, Kurt
Sharir, Micha
Welzl, Emo | | Tail 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
- | 1993 | Mehlhorn, Kurt
Tsakalidis, Athanasios K. | | Dynamic Interpolation Search
In: Journal of the ACM [40], 621-634 | |
| Algorithmica
- | 1992 | Alt, Helmut
Fleischer, Rudolf
Kaufmann, Michael
Mehlhorn, Kurt
Näher, Stefan
Schirra, Stefan
Uhrig, Christian | | Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
In: Algorithmica [8], 391-408 | |
| Information Processing Letters
0020-0190 | 1992 | Alt, Helmut
Geffert, Viliam
Mehlhorn, Kurt | | A lower bound for the nondeterministic space complexity of context-free recognition
In: Information Processing Letters [42], 25-27 | |
| Algorithmica
- | 1992 | Fleischer, Rudolf
Mehlhorn, Kurt
Rote, Günter
Welzl, Emo
Yap, Chee-Keng | | Simultaneous Inner and Outer Approximation of Shapes
In: Algorithmica [8], 365-389 | |
| Journal of Combinatorial Theory / Series B
- | 1992 | Kaufmann, Michael
Mehlhorn, Kurt | | On local routing of two-terminal nets
In: Journal of Combinatorial Theory / Series B [55], 33-72 | |
| Information and Computation
- | 1992 | Mehlhorn, Kurt
Paul, Wolfgang J.
Uhrig, C | | $k$ versus $k+1$ Index Registers and Modifiable versus Non-modifiable Programs
In: Information and Computation [101], 123-129 | |
| Information Processing Letters
- | 1991 | Alt, Helmut
Blum, Norbert
Mehlhorn, Kurt
Paul, Markus | | Computing a maximum cardinality matching in a bipartite graph in time $O(n^1.5 \sqrtm/\log n)$
In: Information Processing Letters [37], 237-240 | |
| Soviet Math. Dokl.
- | 1991 | Gurvich, Vladimir | | Criteria for repetition-freeness of functions in the algebra of logic
In: Soviet Math. Dokl. [43], 721-726 | |
| Discrete & Computational Geometry
- | 1991 | Mehlhorn, 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) | 1991 | Mehlhorn, 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
- | 1990 | Ahuja, Ravindra K.
Mehlhorn, Kurt
Orlin, James B.
Tarjan, Robert E. | | Faster algorithms for the shortest path problem
In: Journal of the ACM [37], 213-223 | |
| Information Processing Letters
0020-0190 | 1990 | Ching, 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 | 1990 | Mehlhorn, Kurt
Näher, Stefan | | A faster compaction algorithm with automatic jog insertion
In: IEEE Transactions on CAD of Integrated Circuits and Systems [9], 158-166 | |
| Information Processing Letters
0020-0190 | 1990 | Mehlhorn, Kurt
Näher, Stefan | | Bounded ordered dictionaries in $O(\log \log n)$ time and $O(n)$ space
In: Information Processing Letters [35], 183-189 | |
| Algorithmica
- | 1990 | Mehlhorn, Kurt
Näher, Stefan | | Dynamic Fractional Cascading
In: Algorithmica [5], 215-241 | |
| SIAM Journal on Computing
0097-5397 (print)
1095-7111 (electronic) | 1990 | Mehlhorn, Kurt
Näher, Stefan
Rauch, Monika | | On the Complexity of a Game Related to the Dictionary Problem
In: SIAM Journal on Computing [19], 902-906 | |
| Information Processing Letters
0020-0190 | 1990 | Mehlhorn, Kurt
Näher, Stefan
Uhrig, Christian | | Hidden line elimination for isooriented rectangles
In: Information Processing Letters [35], 137-143 | |
| IEEE Transactions on CAD of Integrated Circuits and Systems
0278-0070 | 1990 | Mehlhorn, Kurt
Rülling, W. | | Compaction on the torus
In: IEEE Transactions on CAD of Integrated Circuits and Systems [9], 389-397 | |
| IEEE Transactions on Computers
- | 1989 | Fürer, Martin
Mehlhorn, Kurt | | AT$^2$-Optimal Galois Field Multiplier for VLSI
In: IEEE Transactions on Computers [38], 1333-1336 | |
| Discrete and Computational Geometry
- | 1988 | Alt, Helmut
Mehlhorn, Kurt
Wagener, Hubert
Welzl, Emo | | Congruence, Similarity, and Symmetries of Geometric Objects
In: Discrete and Computational Geometry [3], 237-256 | |
| Information Processing Letters
0020-0190 | 1988 | Jung, Hermann
Mehlhorn, Kurt | | Parallel 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 | 1988 | Mehlhorn, Kurt | | A faster approximation algorithm for the Steiner problem in graphs
In: Information Processing Letters [27], 125-128 | |
| SIAM Journal on Computing
- | 1988 | Mehlhorn, Kurt
Näher, Stefan
Alt, Helmut | | A Lower Bound on the Complexity of the Union-Split-Find Problem
In: SIAM Journal on Computing [17], 1093-1102 | |
| SIAM Journal on Computing
- | 1987 | Alt, 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 | 1987 | Fries, O.
Mehlhorn, Kurt
Näher, Stefan
Tsakalidis, A. | | A $\log \log n$ data structure for three-sided range queries
In: Information Processing Letters [25], 269-273 | |
| Information and Computation
0890-5401 | 1987 | Mehlhorn, Kurt
Preparata, Franco P. | | Area-Time Optimal Division for $T=\Omega((\log n)^1+\epsilon)$
In: Information and Computation [72], 270-282 | |
| Acta Informatica
- | 1986 | Becker, Michael
Mehlhorn, Kurt | | Algorithms for Routing in Planar Graphs
In: Acta Informatica [23], 163-176 | |
| Information and Control
- | 1986 | Hoffmann, Kurt
Mehlhorn, Kurt
Rosenstiehl, Pierre
Tarjan, Robert E. | | Sorting Jordan Sequences in Linear Time Using Level-Linked Search Trees
In: Information and Control [68], 170-184 | |
| Journal of Algorithms
- | 1986 | Kaufmann, Michael
Mehlhorn, Kurt | | Routing through a Generalized Switchbox
In: Journal of Algorithms [7], 510-531 | |
| Informatik Spektrum
- | 1986 | Mehlhorn, Kurt | | Über Verdrahtungsalgorithmen
In: Informatik Spektrum [9], 227-234 | |
| Algorithmica
- | 1986 | Mehlhorn, Kurt
Preparata, Franco P.
Sarrafzadeh, Maji | | Channel Routing in Knock-Knee Mode: Simplified Algorithms and Proofs
In: Algorithmica [1], 213-221 | |
| Journal of the ACM
- | 1986 | Mehlhorn, Kurt
Preparata, F. P. | | Routing through a Rectangle
In: Journal of the ACM [33], 60-85 | |
| Discrete Applied Mathematics
- | 1986 | Mehlhorn, Kurt
Schmidt, Bernd H. | | On BF-orderable graphs
In: Discrete Applied Mathematics [15], 315-327 | |
| SIAM Journal on Computing
- | 1986 | Mehlhorn, Kurt
Tsakalidis, Athanasios K. | | An Amortized Analysis of Insertions into AVL-Trees
In: SIAM Journal on Computing [15], 22-33 | |
| SIAM Journal on Computing
- | 1985 | Alt, Helmut
Mehlhorn, Kurt | | Searching Semisorted Tables
In: SIAM Journal on Computing [14], 840-848 | |
| Information and Control
- | 1985 | Hertel, Stefan
Mehlhorn, Kurt | | Fast Triangulation of the Plane with Respect to Simple Polygons
In: Information and Control [64], 52-76 | |
| Information Processing Letters
- | 1985 | Mannila, Heikki
Mehlhorn, Kurt | | A fast algorithm for renaming a set of clauses as a Horn set
In: Information Processing Letters [21], 269-272 | |
| Information Processing Letters
- | 1984 | Alt, Helmut
Mehlhorn, Kurt
Munro, J. | | On the complexity of partial match retrieval
In: Information Processing Letters [19], 61-65 | |
| Information Processing Letters
- | 1984 | Alt, Helmut
Mehlhorn, Kurt
Munro, J. Ian | | Partial match retrieval in implicit data structures
In: Information Processing Letters [19], 61-65 | |
| Acta Informatica
0001-5903 (Print) 1432-0525 (Online) | 1984 | Hertel, Stefan
Mäntylä, Martti
Mehlhorn, Kurt
Nievergelt, Jurg | | Space Sweep Solves Intersection of Convex Polyhedra
In: Acta Informatica [21], 501-519 | |
| EATCS Bulletin
0252-9742 | 1984 | Hoffmann, K
Mehlhorn, Kurt | | Intersecting a line and a simple polygon
In: EATCS Bulletin [22], 120-121 | |
| Advances in Computing Research
- | 1984 | Lengauer, Thomas
Mehlhorn, Kurt | | Four results on the complexity of VLSI computation
In: Advances in Computing Research [2], 1-22 | |
| Integration, the VLSI Journal
- | 1984 | Mehlhorn, 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) | 1984 | Mehlhorn, 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
- | 1983 | Hong, Jia-Wei
Mehlhorn, Kurt
Rosenberg, Arnold L. | | Cost Trade-offs in Graph Embeddings, with Applications
In: Journal of the ACM [30], 709-728 | |
| Information and Control
- | 1983 | Mehlhorn, Kurt
Preparata, Franco P. | | Area-Time Optimal VLSI Integer Mutliplier with Minimum Computation Time
In: Information and Control [58], 137-156 | |
| Information & Control
- | 1983 | Mehlhorn, Kurt
Preparata, F. P. | | $AT^2$-optimal VLSI multipliers with minimum computation time
In: Information & Control [58], 137-196 | |
| Information and Control
- | 1983 | von 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 | 1982 | Becker, Michael
Degenhardt, W.
Doenhardt, J.
Hertel, S.
Kaninke, G.
Kerber, W.
Mehlhorn, Kurt
Näher, Stefan
Rohnert, H.
Winter, T. | | A Probabilistic Algorithm for Vertex Connectivity of Graphs
In: Information Processing Letters [15], 135-136 | |
| Information and Control
- | 1982 | Eisenbarth, Bernhard
Ziviani, Nivio
Gonnet, Gaston H.
Mehlhorn, Kurt
Wood, Derick | | The Theory of Fringe Analysis and Its Application to 2-3 Trees and B-Trees
In: Information and Control [55], 125-174 | |
| Acta Informatica
- | 1982 | Huddleston, Scott
Mehlhorn, Kurt | | A New Data Structure for Representing Sorted Lists
In: Acta Informatica [17], 157-184 | |
| SIAM Journal on Computing
- | 1982 | Mehlhorn, Kurt | | A Partial Analysis of Height-Balanced Trees Under Random Insertions and Deletions
In: SIAM Journal on Computing [11], 748-760 | |
| VLSI Systems and Computations
- | 1981 | Lengauer, Thomas
Mehlhorn, Kurt | | On the Complexity of VLSI-Computations
In: VLSI Systems and Computations [??], 89-99 | |
| Mathematical Systems Theory
- | 1981 | Mehlhorn, Kurt | | Lower bounds on the efficiency of transforming static data structures into dynamic structures
In: Mathematical Systems Theory [15], 1-16 | |
| Information Processing Letters
- | 1981 | Mehlhorn, Kurt
Overmars, Mark H. | | Optimal dynamization of decomposable searching problems
In: Information Processing Letters [12], 93-98 | |
| Journal of the ACM
0004-5411 | 1980 | Altenkamp, Doris
Mehlhorn, Kurt | | Codes: Unequal Probabilities, Unequal Letter Cost
In: Journal of the ACM [27], 412-427 | |
| Theoretical Computer Science
- | 1980 | Blum, Norbert
Mehlhorn, Kurt | | On the Average Number of Rebalancing Operations in Weight-Balanced Trees
In: Theoretical Computer Science [11], 303-320 | |
| Elektronische Informationsverarbeitung und Kybernetik
- | 1980 | Güttler, Reiner
Mehlhorn, Kurt
Schneider, Wolfgang | | Binary Search Trees: Average and Worst Case Behavior
In: Elektronische Informationsverarbeitung und Kybernetik [16], 41-61 | |
| IEEE Transactions on Information Theory
- | 1980 | Mehlhorn, Kurt | | An 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
- | 1979 | Alt, Helmut
Mehlhorn, Kurt | | Complexity 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
- | 1979 | Mehlhorn, Kurt | | Dynamic Binary Search
In: SIAM Journal on Computing [8], 175-198 | |
| Mathematical Centre Tracts
- | 1979 | Mehlhorn, Kurt | | Dynamic data structures
In: Mathematical Centre Tracts [108], 71-96 | |
| Information and Control
- | 1979 | Mehlhorn, Kurt | | Parsing Macro Grammars Top Down
In: Information and Control [40], 123-143 | |
| Acta Informatica
- | 1979 | Mehlhorn, Kurt | | Some Remarks on Boolean Sums
In: Acta Informatica [12], 371-375 | |
| Colloque de Lille `Les Arbres en Algebre et en Programmation'
- | 1979 | Mehlhorn, 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
- | 1978 | Mehlhorn, Kurt | | Effiziente Algorithmen: Ein Beispiel
In: Informatik Spektrum [1], 81-89 | |
| Acta Informatica
0001-5903 (Print) 1432-0525 (Online) | 1977 | Deussen, Peter
Mehlhorn, Kurt | | Van Wijngaarden Grammars and Space Complexity Class EXSPACE
In: Acta Informatica [8], 193-199 | |
| Uspekhi Mat. Nauk. (Russian Math. Surveys)
- | 1977 | Gurvich, Vladimir | | On repetition-free Boolean functions
In: Uspekhi Mat. Nauk. (Russian Math. Surveys) [32], 183-184 | |
| SIAM Journal on Computing
- | 1977 | Mehlhorn, Kurt | | A best possible bound for the weighted path length of binary search trees
In: SIAM Journal on Computing [6], 235-239 | |
| Information Processing Letters
- | 1976 | Mehlhorn, Kurt | | Bracket-languages are recognizable in logarithmic space
In: Information Processing Letters [5], 168-170 | |
| Journal of Computer and System Sciences
- | 1976 | Mehlhorn, Kurt | | Polynomial and abstract subrecursive classes
In: Journal of Computer and System Sciences [12], 147-178 | |
| Computing
0010-485X (printed version)
1436-5057 (electronic version) | 1976 | Mehlhorn, Kurt
Galil, Zvi | | Monotone Switching Circuits and Boolean Matrix Product
In: Computing [16], 99-111 | |
| SIGACT News
0163-5700 | 1975 | Alt, Helmut
Mehlhorn, Kurt | | A Language over a One Symbol Alphabet Requiring only O(log log n) Space
In: SIGACT News [7], 31-33 | |
| Acta Informatica
- | 1975 | Mehlhorn, Kurt | | Nearly Optimal Binary Search Trees
In: Acta Informatica [5], 287-295 | |
