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

MPI-INF D1 Publications

MPI-INF D1 Publications

Entries sorted by: 1. Author,Editor - 2. by Group - 3. by Names Including [Non Members]

Login to this database


 

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

#YearTitleType
2010Attachment IconInduced subgraphs in sparse random graphs with given degree sequenceUnpublished/Draft
1
Hide details for Garg [-]Garg [-]
1996A 3-approximation for the minimum tree spanning with k-vertices
In: Foundations of computer science (FOCS-96) : 37th annual symposium, 302-309
Proceedings Article
2
Hide details for Garg, Kavitha, Kumar, Mehlhorn, Mestre [Garg, Kavitha, Kumar]Garg, Kavitha, Kumar, Mehlhorn, Mestre [Garg, Kavitha, Kumar]
2010Assigning Papers to Referees
In: Algorithmica [58], 119-136
Journal Article
2008Attachment IconAssigning Papers to RefereesUnpublished/Draft
1
Hide details for Garg, Konjevod, Ravi [Konjevod, Ravi]Garg, Konjevod, Ravi [Konjevod, Ravi]
2000Approximation algorithm for the group Steiner tree problem
In: Journal of Algorithms [37], 66-84
Journal Article
1
Hide details for Garg, Papatriantafilou, Tsigas [-]Garg, Papatriantafilou, Tsigas [-]
1996Distributed List Coloring: How to Dynamically Allocate Frequencies to Mobile Base Stations
In: 8th Annual IEEE Symposium on Parallel and Distributed Processing (SPDP '96), 18-25
Proceedings Article
2
Hide details for Garg, Vazirani [Vazirani]Garg, Vazirani [Vazirani]
1996Approximate max-flow min-(multi)cut theorems and their applications
In: SIAM Journal on Computing [25], 235-251
Journal Article
1995A polyhedron with all s-t cuts as vertices, and adjacency of cuts
In: Mathematical Programming (A) [70], 17-25
Journal Article
1
Hide details for Gärtner, Hotz [Hotz, Ambos-Spies, Löwe, Merkle]Gärtner, Hotz [Hotz, Ambos-Spies, Löwe, Merkle]
2009Computability of Analytic Functions with Analytic Machines
In: Mathematical Theory and Computational Practice : 5th Conference on Computability in Europe, CiE 2009, 250-259
Proceedings Article
1
Hide details for Gasieniec, Indyk [Indyk]Gasieniec, Indyk [Indyk]
1997Efficient Parallel Computing with Memory Faults
In: Proceedings of the 11th Symposium on Fundamentals of Computation Theory (FCT-97), 188-197
Proceedings Article
1
Hide details for Gasieniec, Indyk, Krysta [-]Gasieniec, Indyk, Krysta [-]
1997External inverse pattern matching
In: Proceedings of the 8th Symposium on Combinatorial Pattern Matching (CPM-97), 90-101
Proceedings Article
1
Hide details for Gasieniec, Jansson, Lingas, Östlin [Jiang, Lee, Jansson, Lingas, Östlin]Gasieniec, Jansson, Lingas, Östlin [Jiang, Lee, Jansson, Lingas, Östlin]
1997On the complexity of computing evolutionary trees
In: Proceedings of the 3rd International Conference on Computing and Combinatorics (COCOON-97), 134-145
Proceedings Article
1
Hide details for Gasieniec, Karpinski, Plandowski, Rytter [Hirschberg, Karpinski, Myers, Plandowski, Rytter]Gasieniec, Karpinski, Plandowski, Rytter [Hirschberg, Karpinski, Myers, Plandowski, Rytter]
1996Randomized Efficient Algorithms for Compressed Strings: the Finger-Print Approach
In: Combinatorial Pattern Matching: 7th Annual Symposium (CPM'96), 39-49
Proceedings Article
1
Hide details for Gasieniec, Karpinski, Plandowski, Rytter [Karlsson, Karpinski, Lingas, Plandowski, Rytter]Gasieniec, Karpinski, Plandowski, Rytter [Karlsson, Karpinski, Lingas, Plandowski, Rytter]
1996Efficient Algorithms for Lempel-Ziv Encoding
In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, 392-403
Proceedings Article
1
Hide details for Gasieniec, Kranakis, Krizanc, Pelc [Kranakis, Krizanc, Pelc, Penczek, Szalas]Gasieniec, Kranakis, Krizanc, Pelc [Kranakis, Krizanc, Pelc, Penczek, Szalas]
1996Minimizing Congestion of Layouts for ATM Networks with Faulty Links
In: Mathematical Foundations of Computer Science 1996: 21st International Symposium (MFCS'96), 392-403
Proceedings Article
2
Hide details for Gasieniec, Pelc [Pelc]Gasieniec, Pelc [Pelc]
1997Broadcasting with a bounded fraction of faulty nodes
In: Journal of Parallel and Distributed Computing [42], 11-20
Journal Article
1996Adaptive Broadcasting with Faulty Nodes
In: Parallel Computing [22], 903-912
Journal Article
1
Hide details for Gast [-]Gast [-]
1997Das Maximum-Weight-Trace-Problem bei multiplem Sequenz-Alignment
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Gawrychowski [-]Gawrychowski [-]
2014Simple and efficient LZW-compressed multiple pattern matching
In: Journal of Discrete Algorithms [25], 34-41
Journal Article
1
Hide details for Gawrychowski [Bulatov, Shur]Gawrychowski [Bulatov, Shur]
2013Alphabetic Minimax Trees in Linear Time
In: 8th International Computer Science Symposium in Russia (CSR 2013), 36-48
Proceedings Article
1
Hide details for Gawrychowski [Calderón-Benavides, González-Caro, Chávez, Ziviani]Gawrychowski [Calderón-Benavides, González-Caro, Chávez, Ziviani]
2012Faster Algorithm for Computing the Edit Distance between SLP-Compressed Strings
In: String Processing and Information Retrieval : 19th International Symposium, SPIRE 2012, 229-236
Proceedings Article
1
Hide details for Gawrychowski [Dürr, Wilke]Gawrychowski [Dürr, Wilke]
2012Tying up the loose ends in fully LZW-compressed pattern matching
In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, 624-635
Electronic Proceedings Article
1
Hide details for Gawrychowski [Kärkkäinen, Stoye]Gawrychowski [Kärkkäinen, Stoye]
2012Simple and efficient LZW-compressed multiple pattern matching
In: Combinatorial Pattern Matching : 23rd Annual Symposium, CPM 2012, 232-242
Proceedings Article
1
Hide details for Gawrychowski, Jez, Jez [Jez]Gawrychowski, Jez, Jez [Jez]
2014Validating the Knuth-Morris-Pratt Failure Function, Fast and Online
In: Theory of Computing Systems [54], 337-372
Journal Article
1
Hide details for Gawrychowski, Kucherov, Nekrich, Starikovskaya [Kucherov, Nekrich, Starikovskaya, Kurland, Lewenstein, Porat]Gawrychowski, Kucherov, Nekrich, Starikovskaya [Kucherov, Nekrich, Starikovskaya, Kurland, Lewenstein, Porat]
2013Minimal Discriminating Words Problem Revisited
In: String Processing and Information Retrieval - 20th International Symposium (SPIRE 2013),
Proceedings Article
1
Hide details for Gawrychowski, Manea, Mercas, Nowotka, Tiseanu [Manea, Mercas, Nowotka, Tiseanu, Portier, Wilke]Gawrychowski, Manea, Mercas, Nowotka, Tiseanu [Manea, Mercas, Nowotka, Tiseanu, Portier, Wilke]
2013Finding Pseudo-repetitions
In: 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), 257-268
Proceedings Article
1
Hide details for Gawrychowski, Manea, Nowotka [Manea, Nowotka, Bonizzoni, Brattka, Lowe]Gawrychowski, Manea, Nowotka [Manea, Nowotka, Bonizzoni, Brattka, Lowe]
2013Discovering Hidden Repetitions in Words
In: 9th Conference on Computability in Europe (CiE 2013), 210-219
Proceedings Article
1
Hide details for Gawrychowski, Manea, Nowotka [Manea, Nowotka, Mayr, Portier]Gawrychowski, Manea, Nowotka [Manea, Nowotka, Mayr, Portier]
2014Testing Generalised Freeness of Words
In: 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 337-349
Proceedings Article
1
Hide details for Gawrychowski, Mozes, Weimann [Mozes, Weimann, Esparza, Fraigniaud, Husfeldt, Koutsoupias]Gawrychowski, Mozes, Weimann [Mozes, Weimann, Esparza, Fraigniaud, Husfeldt, Koutsoupias]
2014Improved Submatrix Maximum Queries in Monge Matrices
In: Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I, 525-537
Proceedings Article
1
Hide details for Gawrychowski, Straszak [Straszak, Cai, Cheng, Lam]Gawrychowski, Straszak [Straszak, Cai, Cheng, Lam]
2013Beating O(nm) in Approximate LZW-Compressed Pattern Matching
In: Algorithms and Computation - 24th International Symposium (ISAAC 2013), 78-88
Proceedings Article
1
Hide details for Gawrychowski, Uznanski [Uznanski, Kulikov, Kuznetsov, Pevzner]Gawrychowski, Uznanski [Uznanski, Kulikov, Kuznetsov, Pevzner]
2014Order-Preserving Pattern Matching with k Mismatches
In: Combinatorial Pattern Matching - 25th Annual Symposium, CPM 2014, Moscow, Russia, June 16-18, 2014. Proceedings, 130-139
Proceedings Article
2
Hide details for Geismann, Hemmer, Schömer [-]Geismann, Hemmer, Schömer [-]
2001Computing a 3-dimensional Cell in an Arrangement of Quadrics: Exactly and Actually!
In: Proceedings of the 17th Annual Symposium on Computational Geometry (SCG-01), 264-273
Proceedings Article
2001The Convex Hull of Ellipsoids (Video)
In: Proceedings of the 17th Annual Symposium on Computational Geometry (SCG-01), 321-322
Proceedings Article
1
Hide details for Georgiou, Kowalski, Shvartsman [Georgiou, Shvartsman, Fich]Georgiou, Kowalski, Shvartsman [Georgiou, Shvartsman, Fich]
2003Efficient Gossip and Robust Distributed Computation
In: Distributed Computing, 17th International Conference (DISC 2003), 224-238
Proceedings Article
1
Hide details for Georgiou, Kowalski, Shvartsman [Georgiou, Shvartsman]Georgiou, Kowalski, Shvartsman [Georgiou, Shvartsman]
2005Efficient gossip and robust distributed computation
In: Theoretical Computer Science [347], 130-166
Journal Article
1
Hide details for Gergov [-]Gergov [-]
2000Algorithms for Interval Coloring, Geometric Packing and Memory Optimization
Universität des Saarlandes
Thesis - PhD thesis
1
Hide details for Gergov [Diaz, Serna]Gergov [Diaz, Serna]
1996Approximation Algorithms for Dynamic Storage Allocation
In: Algorithms - ESA '96: 4th Annual European Symposium, 52-61
Proceedings Article
1
Hide details for Gergov, Meinel [Meinel]Gergov, Meinel [Meinel]
1996Mod-2-OBDDs - a Date Structure that generalizes EXOR-Sum-of-Products and Ordered Binary Decision Diagrams
In: Formal Methods in System Design [8], 273-282
Journal Article
1
Hide details for Giakkoupis, Sauerwald [Giakkoupis, Rabani]Giakkoupis, Sauerwald [Giakkoupis, Rabani]
2012Rumor spreading and vertex expansion
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 1623-1641
Proceedings Article
1
Hide details for Giakkoupis, Sauerwald, Sun, Woelfel [Giakkoupis, Woelfel, Dürr, Wilke]Giakkoupis, Sauerwald, Sun, Woelfel [Giakkoupis, Woelfel, Dürr, Wilke]
2012Low Randomness Rumor Spreading via Hashing
In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, 314-325
Electronic Proceedings Article
1
Hide details for Giannopoulos, Klein, Kutz, Marx [Giannopoulos, Klein, Marx]Giannopoulos, Klein, Kutz, Marx [Giannopoulos, Klein, Marx]
2010Computing geometric minimum-dilation graphs is NP-hard
In: International Journal of Computational Geometry & Applications [20], 147-173
Journal Article
1
Hide details for Giannopoulos, Knauer, Wahlström, Werner [Giannopoulos, Knauer, Werner]Giannopoulos, Knauer, Wahlström, Werner [Giannopoulos, Knauer, Werner]
2012Hardness of discrepancy computation and ε-net verification in high dimension
In: Journal of Complexity [28], 162-176
Journal Article
1
Hide details for Gidenstam, Papatriantafilou [Papatriantafilou, Tovar, Tsigas, Fouchal]Gidenstam, Papatriantafilou [Papatriantafilou, Tovar, Tsigas, Fouchal]
2007LFthreads: A Lock-Free Thread Library
In: 11th International Conference On Principles Of Distributed Systems (OPODIS), 217-231
Proceedings Article
1
Hide details for Gidenstam, Papatriantafilou, Sundell, Tsigas [Papatriantafilou, Sundell, Tsigas]Gidenstam, Papatriantafilou, Sundell, Tsigas [Papatriantafilou, Sundell, Tsigas]
2009Efficient and Reliable Lock-Free Memory Reclamation Based on Reference Counting
In: IEEE Transactions on Parallel and Distributed Systems [20], 1173-1187
Journal Article
2
Hide details for Gidenstam, Papatriantafilou, Tsigas [Papatriantafilou, Tsigas]Gidenstam, Papatriantafilou, Tsigas [Papatriantafilou, Tsigas]
2010NBmalloc: Allocating Memory in a Lock-Free Manner
In: Algorithmica [58], 304-338
Journal Article
2009NBmalloc : Allocating Memory in a Lock-Free Manner
In: Algorithmica [Online First], 1-35
Electronic Journal Article
1
Hide details for Giesen [Dey, Goswami]Giesen [Dey, Goswami]
2008Delaunay Triangulation Approximates Anchor Hull
In: Computational Geometry - Theory and Applications [36], 131-143
Journal Article
1
Hide details for Giesen [John]Giesen [John]
2008The Flow Complex: A Data Structure for Geometric Modeling
In: Computational Geometry - Theory and Applications [39], 178-190
Journal Article
1
Hide details for Giesen [Miklos, Pauly]Giesen [Miklos, Pauly]
2007Medial Axis Approximation from Inner Voronoi Balls: A Demo of the Mesecina Tool
In: 23d Annual ACM Symposium on Computational Geometry, 123-124
Proceedings Article
1
Hide details for Giesen [Mueller, Schuberth, Zolliker, wang]Giesen [Mueller, Schuberth, Zolliker, wang]
2008Conjoint Analysis for Measuring the Perceived Quality in Volume Rendering
In: IEEE Transactions on Visualization and Computer Graphics [13], 1664-1671
Journal Article
1
Hide details for Giesen [Schuberth, , , ]Giesen [Schuberth, , , ]
2007The Combinatorial Structure of Polyhedral Choice Based Conjoint Analysis
In: Conjoint Measurement: Methods and Applications, 259-271
Part of a Book
1
Hide details for Giesen, Manjunath [Giesen, Agarwal, Alt, Teillaud]Giesen, Manjunath [Giesen, Agarwal, Alt, Teillaud]
2009Minimizing Absolute Gaussian Curvature over Meshes
In: Computational Geometry, 1-16
Electronic Proceedings Article
1
Hide details for Giesen, Mitsche, Schuberth [Mitsche, Schuberth, Kao, Li]Giesen, Mitsche, Schuberth [Mitsche, Schuberth, Kao, Li]
2007Attachment IconCollaborative Ranking: an aggregation algorithm for individuals' preference estimation
In: Algorithmic Aspects in Information and Management : Third International Conference, AAIM 2007, 58-67
Proceedings Article
1
Hide details for Giesen, Schuberth, Simon, Zolliker, Zweifel [Schuberth, Simon, Zolliker, Zweifel]Giesen, Schuberth, Simon, Zolliker, Zweifel [Schuberth, Simon, Zolliker, Zweifel]
2007Image-Dependent Gamut Mapping as Optimization Problem
In: IEEE Transactions on Image Processing [16], 2401-2410
Journal Article
1
Hide details for Gnewuch, Wahlström, Winzen [Gnewuch]Gnewuch, Wahlström, Winzen [Gnewuch]
2012A New Randomized Algorithm to Approximate the Star Discrepancy Based on Threshold Accepting
In: SIAM Journal on Numerical Analysis [50], 781-807
Journal Article
1
Hide details for Goemans, Skutella [Goemans]Goemans, Skutella [Goemans]
2004Attachment IconCooperative facility location games
In: Journal of Algorithms [50], 194-214
Journal Article
1
Hide details for Goesele, Kautz, Lang, Lensch, Seidel [-]Goesele, Kautz, Lang, Lensch, Seidel [-]
20027th ACM Symposium on Solid Modeling and Applications; Tutorial T1: Geometric Algorithms for Planning and Simulation Tasks in Virtual PrototypingProceedings
1
Hide details for Goldberg, MacKenzie, Paterson, Srinivasan [Goldberg, MacKenzie, Paterson]Goldberg, MacKenzie, Paterson, Srinivasan [Goldberg, MacKenzie, Paterson]
2000Contention resolution with constant expected delay
In: Journal of the ACM [42], 1048-1096
Journal Article
2
Hide details for Golin, Raman, Schwarz, Smid [Golin, Raman]Golin, Raman, Schwarz, Smid [Golin, Raman]
1998Randomized Data Structures for the Dynamic Closest-Pair Problem
In: SIAM Journal on Computing [27], 1036-1072
Journal Article
1995Simple randomized algorithms for closest pair problems
In: Nordic Journal of Computing [2], 3-27
Journal Article
1
Hide details for Golumbic, Mintz, Rotics [Golumbic, Mintz, Rotics]Golumbic, Mintz, Rotics [Golumbic, Mintz, Rotics]
2006Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial k-trees
In: Discrete Applied Mathematics [154], 1465-1477
Journal Article
1
Hide details for Goodrich, Ramos [Goodrich]Goodrich, Ramos [Goodrich]
1997Bounded-independence derandomization of geometric partitioning with applications to parallel fixed-dimensional linear programming
In: Discrete and Computational Geometry [18], 397-420
Journal Article
1
Hide details for Gotsman, Kaligosi, Mehlhorn, Michail, Pyrga [Gotsman]Gotsman, Kaligosi, Mehlhorn, Michail, Pyrga [Gotsman]
2007Attachment IconCycle Bases of Graphs and Sampled Manifolds
In: Computer Aided Geometric Design [24], 464
Journal Article
1
Hide details for Gotthilf, Hermelin, Landau, Lewenstein [Gotthilf, Hermelin, Landau, Lewenstein]Gotthilf, Hermelin, Landau, Lewenstein [Gotthilf, Hermelin, Landau, Lewenstein]
2010Restricted LCS
In: 17th International Symposium on String Processing and Information Retrieval, 250-257
Proceedings Article
1
Hide details for Govindarajan, Dietze, Agarwal, Clark [Dietze, Agarwal, Clark]Govindarajan, Dietze, Agarwal, Clark [Dietze, Agarwal, Clark]
2008Attachment IconA scalable algorithm for dispersing population
In: Journal of Intellingent Information Systems [29], 39-61
Journal Article
1
Hide details for Granados, Hachenberger, Hert, Kettner, Mehlhorn, Seel [-]Granados, Hachenberger, Hert, Kettner, Mehlhorn, Seel [-]
2003Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and ImplementationReport
1
Hide details for Granados, Hachenberger, Hert, Kettner, Mehlhorn, Seel [Di Battista, Zwick]Granados, Hachenberger, Hert, Kettner, Mehlhorn, Seel [Di Battista, Zwick]
2003Attachment IconBoolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation
In: Algorithms - ESA 2003: 11th Annual European Symposium, 654-666
Proceedings Article
1
Hide details for Grigoriev, van Loon, Sitters, Uetz [Grigoriev, van Loon, Uetz, Fomin]Grigoriev, van Loon, Sitters, Uetz [Grigoriev, van Loon, Uetz, Fomin]
2006How to Sell a Graph: Guidelines for Graph Retailers
In: Graph-Theoretic Concepts in Computer Science : 32nd International Workshop, WG 2006, 125-136
Proceedings Article
1
Hide details for Grove [-]Grove [-]
1995On-line Bin Packing with Lookahead
In: 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA95), 430-436
Proceedings Article
1
Hide details for Grove, Kao, Krishnan, Vitter [Akl, Dehne, Kao, Krishnan, Sack, Santoro, Vitter]Grove, Kao, Krishnan, Vitter [Akl, Dehne, Kao, Krishnan, Sack, Santoro, Vitter]
1995Online Perfect Matching and Mobile Computing
In: Algorithms and Data Structures: 4th International Workshop (WADS95), 194-205
Proceedings Article
1
Hide details for Gugelmann, Spöhel [Gugelmann, Nešetřil, Győri, Sali]Gugelmann, Spöhel [Gugelmann, Nešetřil, Győri, Sali]
2011On balanced coloring games in random graphs
In: The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, 425-430
Electronic Proceedings Article
1
Hide details for Guibas, Milosavljevic, Motskin [Motskin, Guibas]Guibas, Milosavljevic, Motskin [Motskin, Guibas]
2010Attachment IconConnected Dominating Sets on Dynamic Geometric Graphs
In: Proceedings of the 22nd Canadian Conference on Computational Geometry (CCCG2010), 27-30
Proceedings Article
1
Hide details for Guillaume [-]Guillaume [-]
1997Praktisches Paralleles Paralleles List Ranking
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Gunopulos, Mannila, Saluja [Manila]Gunopulos, Mannila, Saluja [Manila]
1997Discovering all most specific sentences by randomized algorithms
In: Proceedings of the 6th International Conference on Database Theory (ICDT-97), 215-229
Proceedings Article
1
Hide details for Günther, König, Megow [Günther, König, Bampis, Jansen]Günther, König, Megow [Günther, König, Bampis, Jansen]
2010Scheduling and Packing Malleable Tasks with Precedence Constraints of Bounded Width
In: Approximation and Online Algorithms : 7th International Workshop, WAOA 2009, 170-181
Proceedings Article
1
Hide details for Günther, Maurer, Megow, Wiese [Günther, Maurer]Günther, Maurer, Megow, Wiese [Günther, Maurer]
2013A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio
In: 24st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013),
Proceedings Article
1
Hide details for Guo, Sun, Zhu [Guo, Zhu]Guo, Sun, Zhu [Guo, Zhu]
2011Greedy Construction of 2-Approximate Minimum Manhattan Networks
In: International Journal of Computational Geometry and Applications [21], 331-350
Journal Article
6
Hide details for Gupta, Janardan, Smid [Janardan]Gupta, Janardan, Smid [Janardan]
1999Efficient algorithms for counting and reporting pairwise intersections between convex polygons
In: Information Processing Letters [69], 7-13
Journal Article
1996Algorithms for generalized halfspace range searching and other intersection searching problems
In: Computational Geometry [5], 321-340
Journal Article
1996Algorithms for generalized halfspace range searching and other intersection searching problems
In: Computational Geometry [6], 1-19
Journal Article
1996Fast algorithms for collision and proximity problems involving moving geometric objects
In: Computational Geometry [6], 371-391
Journal Article
1995Further results on generalized intersection searching problems:
counting, reporting, and dynamization
In: Journal of Algorithms [19], 282-317
Journal Article
1995The rectangle enclosure and point-dominance problems revisited
In: 11th Annual !CM Symposium on Computational Geometry, 162-171
Proceedings Article
2
Hide details for Gupta, Janardan, Smid, Dasgupta [Janardan, Dasgupta]Gupta, Janardan, Smid, Dasgupta [Janardan, Dasgupta]
1997The rectangle enclosure and point-dominance problems revisited
In: International Journal of Computational Geometry and Applications [7], 437-456
Journal Article
1995The rectangle enclosure and point-dominance problems revisited
In: 11th Annual ACM Symposium on Computing Geometry, 162-171
Proceedings Article
1
Hide details for Gupta, Kaller, Mahajan, Shermer [Gupta, Kaller, Shermer, Karlsson, Lingas, Karlsson, Lingas, Gupta, Kaller, MaGupta, Kaller, Mahajan, Shermer [Gupta, Kaller, Shermer, Karlsson, Lingas, Karlsson, Lingas, Gupta, Kaller, Mahajan, Shermer]
1996Vertex partitioning problems on partial k-trees
In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, 161-172
Proceedings Article
1
Hide details for Gupta, Mahajan [Mahajan]Gupta, Mahajan [Mahajan]
1997Using amplification to compute majority with small majority gates
In: Computational Complexity [6], 46-63
Journal Article
2
Hide details for Gurvich [Gurvich]Gurvich [Gurvich]
1991Criteria for repetition-freeness of functions in the algebra of logic
In: Soviet Math. Dokl. [43], 721-726
Journal Article
1977On repetition-free Boolean functions
In: Uspekhi Mat. Nauk. (Russian Math. Surveys) [32], 183-184
Journal Article
2
Hide details for Güttler, Mehlhorn, Schneider [-]Güttler, Mehlhorn, Schneider [-]
1980Attachment IconBinary Search Trees: Average and Worst Case Behavior
In: Elektronische Informationsverarbeitung und Kybernetik [16], 41-61
Journal Article
1976Binary Search Trees: Average and Worst Case BehaviorReport
1
Hide details for Güttler, Mehlhorn, Schneider, Wernet [-]Güttler, Mehlhorn, Schneider, Wernet [-]
1976Binary Search Trees: Average and Worst Case Behavior
In: GI - 6. Jahrestagung, 301-313
Proceedings Article
1
Hide details for Gutwenger [-]Gutwenger [-]
1999Design und Implementierung einer Algorithmen-Bibliothek zum Zeichnen von Graphen
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Gutwenger, Mutzel [Whitesides]Gutwenger, Mutzel [Whitesides]
1998Planar Polyline Drawings with Good Angular Resolution
In: Proceedings of the 6th International Symposium on Graph Drawing (GD-98), 167-182
Proceedings Article
2
Hide details for Hachenberger [-]Hachenberger [-]
2006Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms Optimized Implementation, Experiments and Applications
Universität des Saarlandes
Thesis - PhD thesis
1999Dynamic shortest Path Algorithms for Planar and Outerplanar Graphs
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Hachenberger, Kettner [Kobbelt, Shapiro]Hachenberger, Kettner [Kobbelt, Shapiro]
2005Boolean Operations on 3D Selective Nef Complexes: Optimized Implementation and Experiments
In: ACM Symposium on Solid and Physical Modeling (SPM 2005), 163-174
Proceedings Article
1
Hide details for Hachenberger, Kettner, Mehlhorn [-]Hachenberger, Kettner, Mehlhorn [-]
2007Attachment IconBoolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, Optimized Implementation and Experiments
In: Computational Geometry: Theory and Applications [38], 64-99
Journal Article
1
Hide details for Hagedoorn [Calvanese, Lenzerini, Motwani, Calvanese, Lenzerini, Motwani]Hagedoorn [Calvanese, Lenzerini, Motwani, Calvanese, Lenzerini, Motwani]
2003Nearest Neighbors Can Be Found Efficiently If the Dimension Is Small Relative to the Input Size
In: Database Theory - ICDT 2003 : 9th International Conference, 440-454
Proceedings Article
1
Hide details for Hagedoorn, Overmars, Veltkamp [Borgefors, Nystrom, Sanniti di Baja]Hagedoorn, Overmars, Veltkamp [Borgefors, Nystrom, Sanniti di Baja]
2000A New Visibility Partition for Affine Pattern Matching
In: Discrete Geometry for Computer Imagery, Proceedings of the 9th International Conference (DGCI-00), 358-370
Proceedings Article
6
Hide details for Hagerup [-]Hagerup [-]
2000Dynamic algorithms for graphs of bounded treewidth
In: Algorithmica [27], 292-315
Journal Article
2000Parallel preprocessing for path queries without concurrent reading
In: Information and Computation [158], 18-28
Journal Article
1997Allocating Independent Tasks to Parallel Processors: An Experimental Study
In: Journal of Parallel and Distributed Computing [47], 185-197
Journal Article
1995A Lower Bound for the Emulation of PRAM Memories on Processor Networks
In: Information and Computation [119], 124-128
Journal Article
1995Fast Deterministic Processor Allocation
In: Journal of Algorithms [18], 629-649
Journal Article
1995The Parallel Complexity of Integer Prefix Summation
In: Information Processing Letters [56], 59-64
Journal Article
1
Hide details for Hagerup [Degano, Gorrieri, Marchetti-Spaccamela]Hagerup [Degano, Gorrieri, Marchetti-Spaccamela]
1997Dynamic algorithms for graphs of bounded treewidth
In: Proceedings of the 24th International Colloquium on Automata, Languages, and Programming (ICALP-97), 292-302
Proceedings Article
1
Hide details for Hagerup [Ferreira, Rolim, Yang]Hagerup [Ferreira, Rolim, Yang]
1996Allocating Independent Tasks to Parallel Processors: An Experimental Study
In: Parallel Algorithms for Irregularly Structured Problems: 3rd International Workshop (IRREGULAR'96), 1-33
Proceedings Article
1
Hide details for Hagerup [Larsen, Skyum]Hagerup [Larsen, Skyum]
1998Simpler and Faster Dictionaries on the AC° RAM
In: Proceedings of the 25th International Colloquium on Automata, Languages and Programming (ICALP-98), 79-90
Proceedings Article
1
Hide details for Hagerup [Morvan, Meinel, Krob]Hagerup [Morvan, Meinel, Krob]
1998Sorting and Searching on the Word RAM
In: Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science (STACS-98), 366-398
Proceedings Article
1
Hide details for Hagerup, Katajainen, Nishimura, Ragde [Katajainen, Nishimura, Ragde]Hagerup, Katajainen, Nishimura, Ragde [Katajainen, Nishimura, Ragde]
1995Characterizations of k-Terminal Flow Networks and Computing Network Flows in
Partial k-Trees
In: 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA95), 641-649
Proceedings Article
1
Hide details for Hagerup, Keller [Keller]Hagerup, Keller [Keller]
1995Fast Parallel Permutation Algorithms
In: Parallel Processing Letters [5], 139-148
Journal Article
1
Hide details for Hagerup, Kutylowski [Kutylowski]Hagerup, Kutylowski [Kutylowski]
1997Fast integer merging on the EREW PRAM
In: Algorithmica [17], 55-66
Journal Article
1
Hide details for Hagerup, Mehlhorn, Munro [, ]Hagerup, Mehlhorn, Munro [, ]
1993Attachment IconMaintaining Discrete Probability Distributions Optimally
In: Automata, languages and programming (ICALP-93) : 20th international colloquium, 253-264
Proceedings Article
1
Hide details for Hagerup, Sanders, Träff [Träff]Hagerup, Sanders, Träff [Träff]
1998An Implementation of the Binary Blocking Flow Algorithm
In: Proceedings of the 2nd Workshop on Algorithm Engineering (WAE-98), 143-154
Proceedings Article
1
Hide details for Hajiaghayi, Khandekar, Kortsarz, Mestre [Hajiaghayi, Khandekar, Kortsarz, Serna, Shaltiel, Jansen, Rolim]Hajiaghayi, Khandekar, Kortsarz, Mestre [Hajiaghayi, Khandekar, Kortsarz, Serna, Shaltiel, Jansen, Rolim]
2010The Checkpoint Problem
In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 13th International Workshop, APPROX 2010 and 14th International Workshop, RANDOM 2010, 219-231
Proceedings Article
1
Hide details for Hall, Hippler, Skutella [Hall, Hippler, Baeten, Lenstra, Parrow, Woeginger]Hall, Hippler, Skutella [Hall, Hippler, Baeten, Lenstra, Parrow, Woeginger]
2003Attachment IconMulticommodity Flows Over Time: Efficient Algorithms and Complexity
In: Automata, languages and programming : 30th International Colloquium, ICALP 2003, 397-409
Proceedings Article
1
Hide details for Hall, Langkau, Skutella [Hall, Langkau, Arora, Jansen, Rolim, Sahai]Hall, Langkau, Skutella [Hall, Langkau, Arora, Jansen, Rolim, Sahai]
2003An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times
In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, 71-82
Proceedings Article
1
Hide details for Hammerschmidt [-]Hammerschmidt [-]
1999Konzeption und Entwicklung des streng strukturierten und erweiterbaren Datentyps html_page für LEDA
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Han, Kelsen, Ramachandran, Tarjan [Han, Ramachandran, Tarjan]Han, Kelsen, Ramachandran, Tarjan [Han, Ramachandran, Tarjan]
1995Computing minimal spanning subgraphs in linear time
In: SIAM Journal on Computing [24], 1332-1358
Journal Article
1
Hide details for Han, Lam, Lee, To, Wong [Han, Lam, To, Wong]Han, Lam, Lee, To, Wong [Han, Lam, To, Wong]
2010Deadline scheduling and power management for speed bounded processors
In: Theoretical Computer Science [411], 3587-3600
Journal Article
1
Hide details for Happ [-]Happ [-]
2009Analyses of Evolutionary Algorithms
Universität des Saarlandes
Thesis - PhD thesis
1
Hide details for Happ, Johannsen, Klein, Neumann [Ryan, Keijzer]Happ, Johannsen, Klein, Neumann [Ryan, Keijzer]
2008Attachment IconRigorous Analyses of Fitness-Proportional Selection for Optimizing Linear Functions
In: Genetic and Evolutionary Computation Conference 2008, 953-960
Proceedings Article
1
Hide details for Hariharan, Kapoor [Kapoor]Hariharan, Kapoor [Kapoor]
1995Algorithms for Enumerating all Spanning Trees of an Undirected Graph
In: SIAM Journal on Computing [24], 247-265
Journal Article
1
Hide details for Hariharan, Kelsen, Mahajan [Karlsson, Lingas]Hariharan, Kelsen, Mahajan [Karlsson, Lingas]
1996Coloring 2-colorable hypergraphs with a sublinear number of colors
In: Scandinavian Workshop on Algorithm Theory (SWAT96), 41-52
Proceedings Article
1
Hide details for Hariharan, Mahajan [-]Hariharan, Mahajan [-]
1995Derandomizing semidefinite programming based approximation algorithms
In: 36th IEEE Symposium on Foundations of Computer Science, 162-16
Proceedings Article
1
Hide details for Hariharan, Muthukrishnan [Muthukrishnan]Hariharan, Muthukrishnan [Muthukrishnan]
1995String Matching over a General Matching Relation
In: Information and Computation [122], 140-148
Journal Article
1
Hide details for Hariharan, Telikepalli, Mehlhorn [Hariharan, Telikepalli, Bugliesi, Preneel, Sassone, Wegener]Hariharan, Telikepalli, Mehlhorn [Hariharan, Telikepalli, Bugliesi, Preneel, Sassone, Wegener]
2006Attachment IconA Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs
In: Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Part I, 250-261
Proceedings Article
1
Hide details for Harks, Hoefer, Klimm, Skopalik [Harks, Klimm, Skopalik]Harks, Hoefer, Klimm, Skopalik [Harks, Klimm, Skopalik]
2013Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games
In: Mathematical Programming [141], 193-215
Journal Article
4
Hide details for Harren [-]Harren [-]
2010Two-dimensional packing problems
Universität des Saarlandes
Thesis - PhD thesis
2009Attachment IconApproximation Algorithms for Orthogonal Packing Problems for Hypercubes
In: Theoretical Computer Science [410], 4504-4532
Journal Article
2007Mehrdimensionale Packungsprobleme - Approximation geometrischer Verallgemeinerungen klassischer PackungsproblemeBook
2006Approximation mehrdimensionaler Packungsprobleme
Universität Dortmund
Thesis - other
1
Hide details for Harren [Bugliesi, Preneel, Sassone, Wegener]Harren [Bugliesi, Preneel, Sassone, Wegener]
2006Attachment IconApproximating the Orthogonal Knapsack Problem for Hypercubes
In: Automata, Languages and Programming, 238-249
Proceedings Article
1
Hide details for Harren, Jansen, Prädel, van Stee [Jansen, Prädel, Dehne, Iacono, Sack]Harren, Jansen, Prädel, van Stee [Jansen, Prädel, Dehne, Iacono, Sack]
2011Attachment IconA (5/3 + ε)-Approximation for Strip Packing
In: Algorithms and Data Structures : 12th International Symposium, WADS 2011, 475-487
Proceedings Article
1
Hide details for Harren, Kern [Kern, Solis-Oba, Persiano]Harren, Kern [Kern, Solis-Oba, Persiano]
2012Improved Lower Bound for Online Strip Packing
In: Approximation and Online Algorithms : 9th International Workshop ,WAOA 2011, 211-218
Proceedings Article
1
Hide details for Harren, van Stee [-]Harren, van Stee [-]
2012Absolute Approximation Ratios for Packing Rectangles into Bins
In: Journal of Scheduling [15], 63-75
Journal Article
1
Hide details for Harren, van Stee [Dinur, Jansen, Naor, Rolim]Harren, van Stee [Dinur, Jansen, Naor, Rolim]
2009Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems
In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 12th International Workshop, APPROX 2009 and 13th International Workshop, RANDOM 2009, 177-189
Proceedings Article
1
Hide details for Harren, van Stee [Gudmundsson]Harren, van Stee [Gudmundsson]
2008Attachment IconPacking Rectangles into 2 OPT Bins using Rotations
In: 11th Scandinavian Workshop on Algorithm Theory, 306-318
Proceedings Article
1
Hide details for Hazboun [-]Hazboun [-]
1999Molekül-Docking-Reaktionen
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Hebbinghaus [-]Hebbinghaus [-]
2007Attachment IconDiscrepancy of Sums of two Arithmetic ProgressionsReport
1
Hide details for Heinz, Kasprzik, Kötzing [Heinz, Kasprzik]Heinz, Kasprzik, Kötzing [Heinz, Kasprzik]
2012Learning in the limit with lattice-structured hypothesis spaces
In: Theoretical Computer Science [457], 111 - 127
Journal Article
1
Hide details for Helwig, Neumann, Wanka [Helwig, Wanka, Bouchachia, Nedjah, de Macedo Mourelle, Pedrycz]Helwig, Neumann, Wanka [Helwig, Wanka, Bouchachia, Nedjah, de Macedo Mourelle, Pedrycz]
2009Particle Swarm Optimization with Velocity Adaptation
In: 2009 International Conference on Adaptive and Intelligent Systems ICAIS 2009 : proceedings, 146-151
Proceedings Article
8
Hide details for Hemmer [-]Hemmer [-]
2009Modular Arithmetic, CGAL - Computational Geometry Algorithms Library, release 3.4Manual
2009Polynomials, CGAL - Computational Geometry Algorithms Library, release 3.4Manual
2008CGAL package for modular arithmetic operationsReport
2008CGAL package: Algebraic FoundationsReport
2008Evaluation of different approaches in 3D curved kernel for arrangements of quadricsReport
2008Attachment IconExact Computation of the Adjacency Graph of an Arrangement of Quadrics
Johannes Gutenberg-Universität Mainz
Thesis - PhD thesis
2007Algebraic Foundations, CGAL - Computational Geometry Algorithms Library, release 3.3Manual
2002Reliable computation of planar and spatial arrangements of quadrics
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Hemmer, Dupont, Petitjean, Schömer [Dupont, Petitjean, Schömer]Hemmer, Dupont, Petitjean, Schömer [Dupont, Petitjean, Schömer]
2008Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangment of QuadricsReport
1
Hide details for Hemmer, Dupon, Petitjean, Schomer [Dupon, Petitjean, Schomer]Hemmer, Dupon, Petitjean, Schomer [Dupon, Petitjean, Schomer]
2011A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics
In: Journal of Symbolic Computation [46], 467-494
Journal Article
1
Hide details for Hemmer, Hert, Kettner, Pion, Schirra [Hert, Kettner, Pion, Schirra]Hemmer, Hert, Kettner, Pion, Schirra [Hert, Kettner, Pion, Schirra]
2007Number Types, CGAL - Computational Geometry Algorithms Library, release 3.3Manual
2
Hide details for Hemmer, Hülse [Hülse]Hemmer, Hülse [Hülse]
2009Attachment IconGeneric implementation of a modular GCD over Algebraic Extension Fields
In: EuroCG'09 : 25th European Workshop on Computational Geometry, 321-324
Proceedings Article
2007Traits classes for polynomial gcd computation over algebraic extensionsReport
1
Hide details for Hemmer, Kettner, Schömer [Hemmer, Schömer]Hemmer, Kettner, Schömer [Hemmer, Schömer]
2004Effects of a Modular Filter on Geometric ApplicationsReport
2
Hide details for Hemmer, Limbach [Limbach]Hemmer, Limbach [Limbach]
2008Arrangements of quadrics in 3D: continued work on experimental implementationReport
2007Benchmarks on a generic univariate algebraic kernelReport
1
Hide details for Hemmer, Limbach, Schömer [Schömer]Hemmer, Limbach, Schömer [Schömer]
2009Attachment IconContinued Work on the Computation of an Exact Arrangement of Quadrics
In: EuroCG'09 : 25th European Workshop on Computational Geometry, 313-316
Proceedings Article
1
Hide details for Hemmer, Tsigaridas, Zafeirakopoulos, Emiris, Karavelas, Mourrain [Tsigaridas, Zafeirakopoulos, Emiris, KaravelHemmer, Tsigaridas, Zafeirakopoulos, Emiris, Karavelas, Mourrain [Tsigaridas, Zafeirakopoulos, Emiris, Karavelas, Mourrain]
2009Experimental evaluation and cross-benchmarking of univariate real solvers
In: Symbolic Numeric Computation 2009 (SNC 2009), 45-54
Proceedings Article
1
Hide details for Henzinger, Leonardi [Henzinger]Henzinger, Leonardi [Henzinger]
2003Scheduling multicasts on unit-capacity trees and meshes
In: Journal of Computer and System Sciences [66], 567-611
Journal Article
1
Hide details for Henz, Müller, Thiel [Henz, Müller]Henz, Müller, Thiel [Henz, Müller]
2004Global constraints for round robin tournament scheduling
In: European Journal of Operational Research [153], 92-101
Journal Article
1
Hide details for Hermelin, Huang, Kratsch, Wahlström [Huang, Kratsch, Kolman, Kratochvíl]Hermelin, Huang, Kratsch, Wahlström [Huang, Kratsch, Kolman, Kratochvíl]
2011Parameterized Two-Player Nash Equilibrium
In: Graph-Theoretic Concepts in Computer Science : 37th International Workshop, WG 2011, 215-226
Proceedings Article
1
Hide details for Hermelin, Levy, Weimann, Yuster [Levy, Weimann, Yuster, Aceto, Henzinger, Sgall]Hermelin, Levy, Weimann, Yuster [Levy, Weimann, Yuster, Aceto, Henzinger, Sgall]
2011Distance Oracles for Vertex-Labeled Graphs
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 490-501
Proceedings Article
1
Hide details for Hermelin, Mestre, Rawitz [Mestre, Rawitz, Golumbic, Stern, Levy, Morgenstern]Hermelin, Mestre, Rawitz [Mestre, Rawitz, Golumbic, Stern, Levy, Morgenstern]
2012Optimization Problems in Dotted Interval Graphs
In: Graph-Theoretic Concepts in Computer Science : 38th InternationalWorkshop, WG 2012, 46-56
Proceedings Article
1
Hide details for Hermelin, Mnich, van Leeuwen [Mnich, van Leeuwen, Epstein, Ferragina]Hermelin, Mnich, van Leeuwen [Mnich, van Leeuwen, Epstein, Ferragina]
2012Parameterized complexity of induced H-matching on claw-free graphs
In: Algorithms - ESA 2012 : 20th Annual European Symposium, 624-635
Proceedings Article
1
Hide details for Hermelin, Mnich, van Leeuwen, Woeginger [Mnich, van Leeuwen, Woeginger, Aceto, Henzinger, Sgall]Hermelin, Mnich, van Leeuwen, Woeginger [Mnich, van Leeuwen, Woeginger, Aceto, Henzinger, Sgall]
2011Domination When the Stars Are Out
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 462-473
Proceedings Article
1
Hide details for Hermelin, Rawitz [Rawitz]Hermelin, Rawitz [Rawitz]
2011Optimization problems in multiple subtree graphs
In: Discrete Applied Mathematics [159], 588-594
Journal Article
1
Hide details for Hermelin, Rizzi, Vialette [Rizzi, Vialette, Chao, Hsu, Lee]Hermelin, Rizzi, Vialette [Rizzi, Vialette, Chao, Hsu, Lee]
2012Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph
In: Algorithms and Computation : 23rd International Symposium, ISAAC 2012, 465-474
Proceedings Article
1
Hide details for Hermelin, Wu [Wu, Rabani]Hermelin, Wu [Wu, Rabani]
2012Weak compositions and their applications to polynomial lower bounds for kernelization
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 104-113
Proceedings Article
1
Hide details for Hert [-]Hert [-]
2001Attachment IconConnected Area Partitioning
In: Proceedings of the 17th European Workshop on Computational Geometry (CG-01), 35-38
Proceedings Article
1
Hide details for Hertel, Mäntylä, Mehlhorn, Nievergelt [-]Hertel, Mäntylä, Mehlhorn, Nievergelt [-]
1984Attachment IconSpace Sweep Solves Intersection of Convex Polyhedra
In: Acta Informatica [21], 501-519
Journal Article
2
Hide details for Hertel, Mehlhorn [-]Hertel, Mehlhorn [-]
1985Attachment IconFast Triangulation of the Plane with Respect to Simple Polygons
In: Information and Control [64], 52-76
Journal Article
1983Fast Triangulation of Simple Polygons
In: Fundamentals of Computation Theory, Proceedings of the 1983 International FCT-Conference (FCT 1983), 207-218
Proceedings Article
1
Hide details for Hertel, Mehlhorn, Mäntylä, Nievergelt [Hertel, Mehlhorn, Mäntylä, Nievergelt]Hertel, Mehlhorn, Mäntylä, Nievergelt [Hertel, Mehlhorn, Mäntylä, Nievergelt]
1984Attachment IconSpace sweep solves intersection of two convex polyhedra elegantlyReport
1
Hide details for Hert, Hoffmann, Kettner, Pion, Seel [Hert, Hoffmann, Pion, Seel]Hert, Hoffmann, Kettner, Pion, Seel [Hert, Hoffmann, Pion, Seel]
2007An adaptable and extensible geometry kernel
In: Computational Geometry: Theory and Applications [38], 16-36
Journal Article
1
Hide details for Hert, Hoffmann, Kettner, Pion, Seel [Hoffmann, Kettner, Pion, Brodal, Frigioni, Marchetti-Spaccamela]Hert, Hoffmann, Kettner, Pion, Seel [Hoffmann, Kettner, Pion, Brodal, Frigioni, Marchetti-Spaccamela]
2001An Adaptable and Extensible Geometry Kernel
In: Proceedings of the 5th International Workshop on Algorithm Engineering (WAE-01), 79-90
Proceedings Article
1
Hide details for Hert, Lumelsky [-]Hert, Lumelsky [-]
1999Motion Planning in R^3 for Multiple Tethered Robots
In: IEEE Transactions on Robotics and Automation [15], 623-639
Journal Article
1
Hide details for Hert, Richards [Richards, Christensen, Hager]Hert, Richards [Richards, Christensen, Hager]
2002Multiple Robot Motion Planning = Parallel Processing + Geometry
In: Sensor Based Intelligent Robots, 183-205
Proceedings Article
1
Hide details for Heydrich [-]Heydrich [-]
2012Dividing connected chores fairly
Universität des Saarlandes
Thesis - Bachelor thesis
1
Hide details for Heydrich, van Stee [Heydrich, Voecking]Heydrich, van Stee [Heydrich, Voecking]
2013Attachment IconDividing connected chores fairly
In: 6th International Symposium on Algorithmic Game Theory, 420-433
Proceedings Article
1
Hide details for Heydrich, van Stee [van Stee]Heydrich, van Stee [van Stee]
2015Dividing Connected Chores Fairly
In: Theoretical Computer Science [593], 51-61
Journal Article
2
Hide details for Heydthausen, Mehlhorn [-]Heydthausen, Mehlhorn [-]
1976Top Down Parsing of Macro Grammars
In: GI - 6. Jahrestagung, 95-108
Proceedings Article
1976Top down parsing of macro grammars (preliminary report)Report
1
Hide details for Hilpert [-]Hilpert [-]
1996Heuristiken fur das euklidische Travelling Salesman Problem
Universitat des Saarlandes
Thesis - Masters thesis
2
Hide details for Hoefer [-]Hoefer [-]
2013Local Matching Dynamics in Social Networks
In: Information & Computation [222], 20-35
Journal Article
2013Strategic Cooperation in Cost Sharing Games
In: International Journal of Game Theory [42], 29-53
Journal Article
1
Hide details for Hoefer [Jansen, Margraf, Mastrolli, Rolim]Hoefer [Jansen, Margraf, Mastrolli, Rolim]
2003Experimental comparison of heuristic and approximation algorithms for uncapacitated facility location
In: 2nd International Workshop on Experimental and Efficient Algorithms (WEA-03), 165-178
Proceedings Article
1
Hide details for Hoefer, Kesselheim [Kesselheim]Hoefer, Kesselheim [Kesselheim]
2013Brief Announcement: Universally Truthful Secondary Spectrum Auctions
In: 25th Symposium on Parallelism in Algorithms and Architectures (SPAA-13), 99-101
Proceedings Article
1
Hide details for Hoefer, Kesselheim, Vöcking [Kesselheim, Vöcking]Hoefer, Kesselheim, Vöcking [Kesselheim, Vöcking]
2013Truthfulness and Stochastic Dominance with Monetary Transfers.
In: 14th Conf. Electronic Commerce (EC-13), 567-582
Proceedings Article
1
Hide details for Hoefer, Sauerwald [-]Hoefer, Sauerwald [-]
2013Brief Announcement: Threshold Load Balancing in Networks
In: 32nd Symposium on Principles of Distributed Computing (PODC-13), 54-56
Proceedings Article
2
Hide details for Hoefer, Skopalik [Skopalik]Hoefer, Skopalik [Skopalik]
2013Altruism in Atomic Congestion Games
In: ACM Transactions on Economics and Computation [1], 21
Journal Article
2013On the Complexity of Pareto-optimal Nash and Strong Equilibria
In: Theory of Computing Systems [53], 441-453
Journal Article
1
Hide details for Hoefer, Wagner [Wagner, Chen, Immorlica]Hoefer, Wagner [Wagner, Chen, Immorlica]
2013Designing Profit Shares in Matching and Coalition Formation Games
In: 9th Conference on Web and Internet Economics (WINE-13), 249-262
Proceedings Article
1
Hide details for Hoefer, Wagner [Wagner, Fomin, Freivalds, Kwiatkowska, Peleg]Hoefer, Wagner [Wagner, Fomin, Freivalds, Kwiatkowska, Peleg]
2013Locally Stable Marriage with Strict Preferences
In: 40th International Colloquium on Automata, Languages and Programming (ICALP-13), 620-631
Proceedings Article
1
Hide details for Hoepman, Papatriantafilou, Tsigas [Hélary, Hoepman, Raynal]Hoepman, Papatriantafilou, Tsigas [Hélary, Hoepman, Raynal]
1995Self-Stabilization in Wait-Free Shared Memory Objects
In: Distributed Algorithms: 9th International Workshop (WDAG95), 273-287
Proceedings Article
1
Hide details for Hoffmann, Mehlhorn [-]Hoffmann, Mehlhorn [-]
1984Intersecting a line and a simple polygon
In: EATCS Bulletin [22], 120-121
Journal Article
3
Hide details for Hoffmann, Mehlhorn, Rosenstiehl, Tarjan [-]Hoffmann, Mehlhorn, Rosenstiehl, Tarjan [-]
1986Attachment IconSorting Jordan Sequences in Linear Time Using Level-Linked Search Trees
In: Information and Control [68], 170-184
Journal Article
1985Sorting Jordan sequences in linear time
In: Computational geometry (SCG-85) : 1st symposium, 196-203
Proceedings Article
1984Sorting Jordan sequences in linear timeReport
1
Hide details for Höhn, Jacobs, Megow [Höhn, Jacobs]Höhn, Jacobs, Megow [Höhn, Jacobs]
2012On Eulerian extensions and their application to no-wait flowshop scheduling
In: Journal of Scheduling [15], 295-309
Journal Article
1
Hide details for Hong, Mehlhorn [-]Hong, Mehlhorn [-]
1982Cost tradeoffs in graph embeddings, with applicationsReport
2
Hide details for Hong, Mehlhorn, Rosenberg [-]Hong, Mehlhorn, Rosenberg [-]
1983Attachment IconCost Trade-offs in Graph Embeddings, with Applications
In: Journal of the ACM [30], 709-728
Journal Article
1981Cost Tradeoffs in Graph Embeddings, with Applications (Preliminary Version)
In: Automata, languages and programming (ICALP-81) : 8th international colloquium, 41-55
Proceedings Article
1
Hide details for Hoogeveen, Skutella, Woeginger [Hoogeveen, Woeginger]Hoogeveen, Skutella, Woeginger [Hoogeveen, Woeginger]
2003Attachment IconPreemptive scheduling with rejection
In: Mathematical Programming [94], 361-374
Journal Article
1
Hide details for Horoba, Neumann [Horoba, Ryan, Keijzer]Horoba, Neumann [Horoba, Ryan, Keijzer]
2008Benefits and Drawbacks for the Use of epsilon-Dominance in Evolutionary Multi-Objective Optimization
In: Genetic and Evolutionary Computation Conference 2008, 641-680
Proceedings Article
1
Hide details for Horoba, Neumann [Horoba]Horoba, Neumann [Horoba]
2009Additive Approximations of Pareto-Optimal Sets by Evolutionary Multi-Objective Algorithms
In: FOGA'09 : Revised Selected Papers from ACM SIGEVO Foundations of Genetic Algorithms X, 79-86
Proceedings Article
2
Hide details for Huang [-]Huang [-]
2010Circular stable matching and 3-way kidney transplant
In: Algorithmica [58], 137-150
Journal Article
2010Classified stable matching
In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1235-1253
Proceedings Article
1
Hide details for Huang [, Fomin, Kaski]Huang [, Fomin, Kaski]
2012Non-preemptive Speed Scaling
In: Algorithm Theory - SWAT 2012 : 13th Scandinavian Symposium and Workshops, 249-260
Proceedings Article
2
Hide details for Huang, Kavitha [Kavitha]Huang, Kavitha [Kavitha]
2011Near-popular matchings in the Roommates problem
In: 19th European Symposium on Algorithms (ESA),
Proceedings Article
2011Popular Matchings in the Stable Marriage Problem
In: 38th International Colloquium on Automata, Languages and Programming (ICALP),
Proceedings Article
1
Hide details for Huang, Kavitha, Michael, Nasr [Kavitha, Michael, Nasr]Huang, Kavitha, Michael, Nasr [Kavitha, Michael, Nasr]
2011Bounded Unpopularity Matchings
In: Algorithmica [61], 738-757
Journal Article
1
Hide details for Huang, Kavitha, Michail, Nasre [Huang, Michail, Nasre]Huang, Kavitha, Michail, Nasre [Huang, Michail, Nasre]
2008Bounded Unpopularity Matchings
In: 11th Scandinavian Workshop on Algorithm Theory (SWAT), 127-137
Proceedings Article
1
Hide details for Huber [-]Huber [-]
2010Randomized rounding and rumor spreading with stochastic dependencies
Universität des Saarlandes
Thesis - PhD thesis
2
Hide details for Huddleston, Mehlhorn [-]Huddleston, Mehlhorn [-]
1982A New Data Structure for Representing Sorted Lists
In: Acta Informatica [17], 157-184
Journal Article
1981Attachment IconRobust balancing in B-trees
In: Theoretical computer science : 5th GI-conference, 234-244
Proceedings Article
1
Hide details for Humble [-]Humble [-]
1997Die Berechnung maximaler Flüsse in Netzwerken
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Hundack, Mutzel, Pouchkarev, Thome [Pouchkarev, Thome]Hundack, Mutzel, Pouchkarev, Thome [Pouchkarev, Thome]
1997ArchE: A Graph Drawing System for Archaeology
In: Proceedings of the 5th Symposium on Graph Drawing (GD-97), 297-302
Proceedings Article
1
Hide details for Hundack, Prömel, Steger []Hundack, Prömel, Steger []
1997Extremal Graph Problems for Graphs with a Color-Critical Vertex
In: Combinatorics, Geometry and Probability, 421-433
Part of a Book
3
Hide details for Hutchinson, Sanders, Vitter [Hutchinson, Vitter]Hutchinson, Sanders, Vitter [Hutchinson, Vitter]
2005Duality Between Prefetching and Queued Writing with Parallel Disks
In: SIAM Journal on Computing [34], 1443-1463
Journal Article
2001Duality Between Prefetching and Queued Writing with Parallel Disks
In: Proceedings of the 9th Annual European Symposium on Algorithms (ESA-01), 62-73
Proceedings Article
2001The Power of Duality for Prefetching and Sorting with Parallel Disks
In: Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-01), 334-335
Proceedings Article
1
Hide details for Iacono, Ramezani, Soranzo, Altafani [Iacono, Soranzo, Altafani]Iacono, Ramezani, Soranzo, Altafani [Iacono, Soranzo, Altafani]
2010Determining the distance to monotonicity of a biological network: a graph-theoretical approach
In: IET Systems Biology [4], 223-235
Journal Article
1
Hide details for Immich [-]Immich [-]
2001Berechnung der Momente von quadratischen Komplexen
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Ingalalli [-]Ingalalli [-]
2011Evolutionary algorithms to compute lower bounds for the star discrepancy
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Irving, Telikepalli, Mehlhorn, Michail, Paluch [Irving, Telikepalli, Paluch]Irving, Telikepalli, Mehlhorn, Michail, Paluch [Irving, Telikepalli, Paluch]
2006Attachment IconRank-Maximal Matchings
In: ACM Transactions on Algorithms [2], 602-610
Journal Article
1
Hide details for Issac [Bhattacharya, Jaiswal, Kumar, Xu, Du, Du]Issac [Bhattacharya, Jaiswal, Kumar, Xu, Du, Du]
2015Sampling in Space Restricted Settings
In: Computing and Combinatorics 2015,
Proceedings Article
1
Hide details for Jain, Kötzing, Stephan [Jain, Stephan, Bshouty, Stoltz, Vayatis, Zeugmann]Jain, Kötzing, Stephan [Jain, Stephan, Bshouty, Stoltz, Vayatis, Zeugmann]
2012Enlarging Learnable Classes
In: Algorithmic Learning Theory : 23rd International Conference, ALT 2012, 36-50
Proceedings Article
1
Hide details for Janardan, Smid [Janardan]Janardan, Smid [Janardan]
1995On the width and roundness of a set of points in the plane
In: 7th Canadian Conference on Computational Geometry, 193-198
Proceedings Article
1
Hide details for Jansen [Lucchesi, Moura]Jansen [Lucchesi, Moura]
1998A New Characterization for Parity Graphs and a Coloring Problem with Costs
In: Proceedings of the 3rd Latin American Symposium on Theoretical Informatics (Latin-98), 249-260
Proceedings Article
1
Hide details for Jansen [Morvan, Meinel, Krob]Jansen [Morvan, Meinel, Krob]
1998The Mutual Exclusion Scheduling Problem for Permutation and Comparability Graphs
In: Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science (STACS-98), 287-297
Proceedings Article
1
Hide details for Jansen, Kratsch, Marx, Schlotter [Jansen, Marx, Schlotter, Kaplan]Jansen, Kratsch, Marx, Schlotter [Jansen, Marx, Schlotter, Kaplan]
2010Bin Packing with Fixed Number of Bins Revisited
In: Algorithm Theory - SWAT 2010 : 12th Scandinavian Symposium and Workshops
on Algorithm Theory, 260-272
Proceedings Article
1
Hide details for Jansen, Neumann [Jansen]Jansen, Neumann [Jansen]
2010Editorial for the Special Issue on Theoretical Aspects of Evolutionary Multi-Objective Optimization
In: Evolutionary Computation [18], 333-334
Journal Article
1
Hide details for Jansen, Porkolab [Jansen]Jansen, Porkolab [Jansen]
2002Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks
In: Algorithmica [32], 507-520
Journal Article
1
Hide details for Jansen, Solis-Oba, Sviridenko [Jansen, Sviridenko, Pardalos]Jansen, Solis-Oba, Sviridenko [Jansen, Sviridenko, Pardalos]
2000Linear time approximation schemes for shop scheduling problems
In: Approximation and complexity in numerical optimization, 338-346
Part of a Book
1
Hide details for Jez [-]Jez [-]
2014The Complexity of Compressed Membership Problems for Finite Automata
In: Theory of Computing Systems [55], 685-718
Journal Article
1
Hide details for Jez [Beal, Carton]Jez [Beal, Carton]
2013Attachment IconRecompression: Word Equations and Beyond
In: 17th International Conference on Developments in Language Theory (DLT 2013), 12-26
Proceedings Article
1
Hide details for Jez [Esparza, Fraigniaud, Husfeldt, Koutsoupia]Jez [Esparza, Fraigniaud, Husfeldt, Koutsoupia]
2014Context Unification is in PSPACE
In: 41st International Colloquium on Automata, Languages, and Programming (ICALP 2014), 244-255
Proceedings Article
1
Hide details for Jez [Fischer, Sanders]Jez [Fischer, Sanders]
2013Attachment IconApproximation of Grammar-Based Compression via Recompression
In: 24th Annual Symposium on Combinatorial Pattern Matching (CPM 2013), 165-176
Proceedings Article
1
Hide details for Jez [Fomin, Freivalds, Kwiatkowska, Peleg]Jez [Fomin, Freivalds, Kwiatkowska, Peleg]
2013Attachment IconOne-Variable Word Equations in Linear Time
In: 40th International Colloquium on Automata, Languages, and Programming (ICALP 2013), 324-335
Proceedings Article
1
Hide details for Jez [Kulikov, Kuznetsov, Pevzner]Jez [Kulikov, Kuznetsov, Pevzner]
2014A really Simple Approximation of Smallest Grammar
In: 25th Annual Symposium on Combinatorial Pattern Matching (CPM 2014), 182-191
Proceedings Article
1
Hide details for Jez [Portier, Wilke]Jez [Portier, Wilke]
2013Attachment IconRecompression: a simple and powerful technique for word equations
In: 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), 233-244
Proceedings Article
1
Hide details for Jez, Lohrey [Lohrey, Mayr, Portier]Jez, Lohrey [Lohrey, Mayr, Portier]
2014Attachment IconApproximation of smallest linear tree grammar
In: 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 445-457
Proceedings Article
1
Hide details for Jez, Maletti [Maletti]Jez, Maletti [Maletti]
2013Hyper-minimization for deterministic tree automata
In: International Journal of Foundations of Computer Science [24], 815-830
Journal Article
1
Hide details for Jez, Okhotin [Okhotin, Beal, Carton]Jez, Okhotin [Okhotin, Beal, Carton]
2013Unambiguous Conjunctive Grammars over a One-Letter Alphabet
In: 17th International Conference on Developments in Language Theory (DLT 2013), 277-288
Proceedings Article
1
Hide details for Jez, Okhotin [Okhotin]Jez, Okhotin [Okhotin]
2014Computational completeness of equations over sets of natural numbers
In: Information and Computation [237], 56-94
Journal Article
2
Hide details for Johannsen [-]Johannsen [-]
2010Attachment IconRandom combinatorial structures and randomized search heuristics
Universität des Saarlandes
Thesis - PhD thesis
2006Attachment IconSampling Rooted 3-Connected Planar Graphs in Deterministic Polynomial Time
Humboldt-Universität zu Berlin
Thesis - Masters thesis
1
Hide details for Johannsen, Lengler [Kurur, Pelikan, Branke]Johannsen, Lengler [Kurur, Pelikan, Branke]
2010Attachment IconCan Quantum Search Accelerate Evolutionary Algorithms?
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 1433-1440
Proceedings Article
1
Hide details for Johannsen, Panagiotou [Charikar]Johannsen, Panagiotou [Charikar]
2010Attachment IconVertices of Degree k in Random Maps
In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1436-1447
Proceedings Article
1
Hide details for Johannsen, Razgon, Wahlström [Razgon, Kullmann]Johannsen, Razgon, Wahlström [Razgon, Kullmann]
2009Attachment IconSolving SAT for CNF formulas with a one-sided variable occurrence restriction
In: Theory and Applications of Satisfiability Testing, SAT 2009 : 12th International Conference, SAT 2009, 80-85
Proceedings Article
1
Hide details for Jung [-]Jung [-]
1996Die hierarchische Darstellung konvexer Polyeder und einige Anwendungen
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Jünger, Lee, Mutzel, Odenthal [Jünger, Odenthal]Jünger, Lee, Mutzel, Odenthal [Jünger, Odenthal]
1997A Polyhedral Approach to the Multi-Layer Crossing Minimization Problem
In: Proceedings of the 5th Symposium on Graph Drawing (GD-97), 13-24
Proceedings Article
1
Hide details for Jünger, Leipert, Mutzel [Juenger, Leipert]Jünger, Leipert, Mutzel [Juenger, Leipert]
1998A Note on Computing a Maximal Planar Subgraph using PQ-Trees
In: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems [17], 609-612
Journal Article
1
Hide details for Jünger, Leipert, Mutzel [Jünger, Leipert, Whitesides]Jünger, Leipert, Mutzel [Jünger, Leipert, Whitesides]
1998Level Planarity Testing in Linear Time
In: Proceedings of the 6th International Symposium on Graph Drawing (GD-98), 224-237
Proceedings Article
1
Hide details for Jünger, Leipert, Mutzel [Leipert, Jünger]Jünger, Leipert, Mutzel [Leipert, Jünger]
1997Pitfalls of using PQ-Trees in Automatic graph Drawing
In: Proceedings of the 5th Symposium on Graph Drawing (GD-97), 193-204
Proceedings Article
1
Hide details for Jünger, Mutzel [Brandenburg, Jünger]Jünger, Mutzel [Brandenburg, Jünger]
1996Exact and heuristic algorithms for 2-layer straightline crossing minimization
In: Graph Drawing (GD95), -
Proceedings Article
2
Hide details for Jünger, Mutzel [Jünger]Jünger, Mutzel [Jünger]
19972-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms
In: Journal of Graph Algorithms and Applications [1], 1-25
Journal Article
1996Maximum planar subgraphs and nice embeddings: Practical layout tools
In: Algorithmica [16], 33-59
Journal Article
1
Hide details for Jünger, Mutzel [Tamassia, Tollis, Jünger]Jünger, Mutzel [Tamassia, Tollis, Jünger]
1995The Polyhedral Approach to the Maximum Planar Subgraph Problem:
New Chances for Related Problems
In: Graph Drawing: DIMACS International Workshop (GD94), 119-130
Proceedings Article
1
Hide details for Jünger, Mutzel, Odenthal, Scharbrodt [Jünger, Odenthal, Scharbrodt]Jünger, Mutzel, Odenthal, Scharbrodt [Jünger, Odenthal, Scharbrodt]
1998The thickness of a minor-excluded class of graphs
In: Discrete Mathematics [182], 169-176
Journal Article
1
Hide details for Jung, Lenhof, Müller, Rüb [Jung, Sloot, Bubak, Hoekstra, Hertzberger]Jung, Lenhof, Müller, Rüb [Jung, Sloot, Bubak, Hoekstra, Hertzberger]
1999Simulating synthetic polymer chains in parallel
In: Proceedings of the 7th International Conference on High-Performance Computing and Networking Europe (HPCN Europe-99), 13-22
Proceedings Article
3
Hide details for Jung, Lenhof, Müller, Rüb [Jung]Jung, Lenhof, Müller, Rüb [Jung]
2000Simulating synthetic polymer chains in parallel
In: Future Generation Computer Systems [16], 513-522
Journal Article
1997Langevin dynamics simulations of macromolecules on parallel computers
In: Macromolecular Theory and Simulation [6], 507-521
Journal Article
1997Parallel MD-simulations of synthetic polymers
In: Parallel processing for scientific computing (PPSC-97) : 8th SIAM conference, CD-ROM
Proceedings Article
1
Hide details for Jung, Mehlhorn [-]Jung, Mehlhorn [-]
1987Parallel algorithms for computing maximal independent sets in trees and for updating minimum spanning treesReport
1
Hide details for Jung, Mehlhorn []Jung, Mehlhorn []
1988Attachment IconParallel algorithms for computing maximal independent sets in trees and for updating minimum spanning trees
In: Information Processing Letters [27], 227-236
Journal Article
2
Hide details for Jurkiewicz [-]Jurkiewicz [-]
2013Attachment IconToward Better Computation Models for Modern Machines
Universität des Saarlandes
Thesis - PhD thesis
2009Cycle Bases in Graphs
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Jurkiewicz, Danilewski [-]Jurkiewicz, Danilewski [-]
2011Efficient Quicksort and 2D Convex Hull for CUDA, and MSIMD as a Realistic Model of Massively Parallel Computations.Unpublished/Draft
1
Hide details for Jurkiewicz, Mehlhorn [-]Jurkiewicz, Mehlhorn [-]
2013The cost of address translation
In: Proceedings of the Meeting on Algorithm Engineering & Experiments,
Proceedings Article
1
Hide details for Juurlink, Mutzel [Juurlink]Juurlink, Mutzel [Juurlink]
1995?
In: Conference on High-Performance Computing, 125-130
Proceedings Article
1
Hide details for Juurlink, Sibeyn [Juurlink]Juurlink, Sibeyn [Juurlink]
1995Fast Routing on Weak Hypercubes: Making the Valiant-Brebner Algorithm More Practical
In: Conference on High-Performance Computing, 755-760
Proceedings Article
1
Hide details for Juurlink, Sibeyn, Rao [Bougé, Fraigniaud, Juurlink, Mignotte, Rao, Robert]Juurlink, Sibeyn, Rao [Bougé, Fraigniaud, Juurlink, Mignotte, Rao, Robert]
1996Worm-Hole Gossiping on Meshes and Tori
In: 2nd Euro-Par Conference, 361-369
Proceedings Article
1
Hide details for Kagaris, Pantziou, Tragoudas, Zaroliagis [Akl, Dehne, Kagaris, Pantziou, Sack, Santoro, Tragoudas]Kagaris, Pantziou, Tragoudas, Zaroliagis [Akl, Dehne, Kagaris, Pantziou, Sack, Santoro, Tragoudas]
1995On the Computation of Fast Data Transmissions in Networks
In: Algorithms and Data Structures: 4th International Workshop (WADS95), 291-302
Proceedings Article
1
Hide details for Kagaris, Pantziou, Tragoudas, Zaroliagis [El-Rewini, Kagaris, Pantziou, Shriver, Tragoudas]Kagaris, Pantziou, Tragoudas, Zaroliagis [El-Rewini, Kagaris, Pantziou, Shriver, Tragoudas]
1995Quickest Paths: Parallelization and Dynamization
In: 28th Annual Hawaii International Conference on System Sciences (HICSS-28), 39-44
Proceedings Article
1
Hide details for Kagaris, Pantziou, Tragoudas, Zaroliagis [Kagaris, Pantziou, Tragoudas]Kagaris, Pantziou, Tragoudas, Zaroliagis [Kagaris, Pantziou, Tragoudas]
1999Transmissions in a network with capacities and delays
In: Networks [33
], 167-174
Journal Article
1
Hide details for Kaligosi [-]Kaligosi [-]
2003Length bounded network flows
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Kaligosi, Mehlhorn, Munro, Sanders [Munro, Sanders]Kaligosi, Mehlhorn, Munro, Sanders [Munro, Sanders]
2005Attachment IconTowards Optimal Multiple Selection
In: Automata, languages and programming : 32nd International Colloquim, ICALP 2005, 103-114
Proceedings Article
1
Hide details for Kaligosi, Sanders [Sanders, Azar, Erlebach]Kaligosi, Sanders [Sanders, Azar, Erlebach]
2006How Branch Mispredictions Affect Quicksort
In: Algorithms - ESA 2006, 14th Annual European Symposium, 780-791
Proceedings Article
1
Hide details for Kamran Azam [-]Kamran Azam [-]
2005Branch-and-Cut Techniques for Generalized Asymmetric Traveling Salesman Problem
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Kane, Mehlhorn, Sauerwald, Sun [Kane, Czumaj, Pitts, Wattenhofer]Kane, Mehlhorn, Sauerwald, Sun [Kane, Czumaj, Pitts, Wattenhofer]
2012Counting Arbitrary Subgraphs in Data Streams
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 598-609
Proceedings Article
1
Hide details for Kao, Leung, Sun, Zhang [Kao, Leung, Zhang, Kratchovil, Li, Fiala, Kolman]Kao, Leung, Sun, Zhang [Kao, Leung, Zhang, Kratchovil, Li, Fiala, Kolman]
2010Deterministic Polynomial-Time Algorithms for Designing Short DNA Words
In: Theory and Applications of Models of Computation : 7th Annual Conference, TAMC 2010, 308-319
Proceedings Article
1
Hide details for Kapoor [-]Kapoor [-]
1996On minimum 3-cuts and approximating k-cuts using cut trees
In: Integer Programming and Combinatorial Optimization : International Conference (IPCO-5), 132-146
Proceedings Article
1
Hide details for Kapoor, Smid [-]Kapoor, Smid [-]
1996New techniques for exact and approximate dynamic closest-point problems
In: SIAM Journal on Computing [25], 775-796
Journal Article
1
Hide details for Kappel [-]Kappel [-]
1998Eine Methode zur Berechnung von Vorzeichen ganzzahliger Determinanten
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Kärkkäinen [Penttonen, Meineche Schmidt]Kärkkäinen [Penttonen, Meineche Schmidt]
2002Computing the threshold for q-gram filters
In: Algorithm theory, SWAT 2002 : 8th Scandinavian Workshop on Algorithm Theory, 348-357
Proceedings Article
1
Hide details for Kärkkäinen, Rao [Sibeyn, Rao]Kärkkäinen, Rao [Sibeyn, Rao]
2003Full-Text Indexes in External Memory
In: Algorithms for Memory Hierarchies, 149-170
Part of a Book
1
Hide details for Kärkkäinen, Sanders [Baeten, Lenstra, Parrow, Woeginger]Kärkkäinen, Sanders [Baeten, Lenstra, Parrow, Woeginger]
2003Simple Linear Work Suffix Array Construction
In: Automata, languages and programming : 30th International Colloquium, ICALP 2003, 943-955
Proceedings Article
1
Hide details for Karp, Schindelhauer, Shenker, Vöcking [Karp, Schindelhauer, Shenker]Karp, Schindelhauer, Shenker, Vöcking [Karp, Schindelhauer, Shenker]
2000Randomized Rumor Spreading
In: 41th Annual Symposium on Foundations of Computer Science (FOCS-00), 565-574
Proceedings Article
2
Hide details for Karrenbauer [-]Karrenbauer [-]
2007Attachment IconEngineering combinatorial optimization algorithms to improve the lifetime of OLED displays
Universität des Saarlandes
Thesis - PhD thesis
2004Packing Boxes with Arbitrary Rotations
Universität des Saarlandes
Thesis - other
1
Hide details for Kasan [-]Kasan [-]
1995Die Beschreibung der Design Features fr die rechnerunterstützte Konstruktion und ihre formale Repräsentation
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Kasprzik, Kötzing [Kasprzik, Martin-Vide, Fernau, Dediu]Kasprzik, Kötzing [Kasprzik, Martin-Vide, Fernau, Dediu]
2010String Extension Learning Using Lattices
In: Language and Automata Theory and Applications : 4th International Conference, LATA 2010, 380-391
Proceedings Article
1
Hide details for Katajainen, Träff [Bongiovanni, Bovet, Di Battista, Katajainen]Katajainen, Träff [Bongiovanni, Bovet, Di Battista, Katajainen]
1997A meticulous analysis of mergesort programs
In: Proceedings of the 3rd Italian Conference on Algorithms and Complexity (CIAC-97), 217-228
Proceedings Article
3
Hide details for Katriel [-]Katriel [-]
2004Constraints and Changes
Universität des Saarlandes
Thesis - PhD thesis
2004Attachment IconOn Algorithms for Online Topological Ordering and SortingReport
2004On the Algebraic Complexity of Set Equality and Inclusion
In: Information Processing Letters [92], 175-178
Journal Article
1
Hide details for Katriel [Régin, Rueher]Katriel [Régin, Rueher]
2004Dynamic Heaviest Paths in DAGs with Arbitrary Edge Weights
In: Integration of AI and OR techniques in constraint programming for combinatorial optimization problems : First International Conference, CPAIOR 2004, 190-199
Proceedings Article
1
Hide details for Katriel, Bodlaender [Bodlaender]Katriel, Bodlaender [Bodlaender]
2005Online Topological Ordering
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 443-450
Proceedings Article
1
Hide details for Katriel, Meyer [-]Katriel, Meyer [-]
2003Elementary Graph Algorithms in External Memory
In: Algorithms for Memory Hierarchies, 62-84
Part of a Book
1
Hide details for Katriel, Michel, Van Hentenryck [Michel, Van Hentenryck]Katriel, Michel, Van Hentenryck [Michel, Van Hentenryck]
2005Maintaining Longest Paths Incrementally
In: Constraints [10], 159-183
Journal Article
1
Hide details for Katriel, Sanders, Träff [Träff, Di Battista, Zwick]Katriel, Sanders, Träff [Träff, Di Battista, Zwick]
2003A Practical Minimum Spanning Tree Algorithm Using the Cycle Property
In: Algorithms - ESA 2003: 11th Annual European Symposium, 679-690
Proceedings Article
1
Hide details for Katriel, Thiel [-]Katriel, Thiel [-]
2005Complete Bound Consistency for the Global Cardinality Constraint
In: Constraints [10], 191-217
Journal Article
1
Hide details for Katriel, Thiel [Rossi]Katriel, Thiel [Rossi]
2003Fast Bound-Consistency for the Global Cardinality Constraint
In: Principles and Practice of Constraint Programming - CP 2003 : 9th International Conference, CP 2003, 437-451
Proceedings Article
7
Hide details for Kaufmann, Mehlhorn [-]Kaufmann, Mehlhorn [-]
1992Attachment IconOn local routing of two-terminal nets
In: Journal of Combinatorial Theory / Series B [55], 33-72
Journal Article
1989Routing Problems in Grid GraphsReport
1989Routing problems in grid graphsReport
1988A Linear-Time Algorithm for the Homotopic Routing Problem in Grid GraphsReport
1986On Local Routing of Two-Terminal NetsReport
1986Attachment IconRouting through a Generalized Switchbox
In: Journal of Algorithms [7], 510-531
Journal Article
1984Attachment IconRouting through a generalized switchboxReport
1
Hide details for Kaufmann, Mehlhorn [Brandenburg, Vidal-Naquet, Wirsing]Kaufmann, Mehlhorn [Brandenburg, Vidal-Naquet, Wirsing]
1987On Local Routing of Two-Terminal Nets
In: STACS '87 : 4th Annual Symposium on Theoretical Aspects of Computer Science, 40-52
Proceedings Article
1
Hide details for Kaufmann, Mehlhorn [Kaufmann, Mehlhorn]Kaufmann, Mehlhorn [Kaufmann, Mehlhorn]
1984Attachment IconLocal routing of two-terminal nets is easyReport
2
Hide details for Kaufmann, Mehlhorn []Kaufmann, Mehlhorn []
1994Attachment IconA linear-time algorithm for the homotopic routing problem in grid graphs
In: SIAM Journal on Computing [23], 227-246
Journal Article
1990Routing problems in grid graphs
In: Paths, Flows, and VLSI-Layout, 165–184
Part of a Book
3
Hide details for Kaufmann, Meyer, Sibeyn [Kaufmann]Kaufmann, Meyer, Sibeyn [Kaufmann]
1997Matrix Transpose on Meshes: Theory and Practice
In: Computers and Artificial Intelligence [16], 107-140
Journal Article
1997Matrix Transpose on Meshes: Theory and Practice
In: Proceedings of the 11th International Parallel Processing Symposium (IPPS-97), 315-319
Proceedings Article
1994Towards Practical Permutation Routing on Meshes
In: Proceedings of the 6th IEEE Symposium on Parallel and Distributed Processing, 656-663
Proceedings Article
1
Hide details for Kaufmann, Raman, Sibeyn [Kaufmann, Raman]Kaufmann, Raman, Sibeyn [Kaufmann, Raman]
1997Routing on Meshes with Buses
In: Algorithmica [18], 417-444
Journal Article
1
Hide details for Kaufmann, Schröder, Sibeyn [Kaufmann, Schröder]Kaufmann, Schröder, Sibeyn [Kaufmann, Schröder]
1995Asymptotically Optimal and Practical Routing on the Reconfigurable Mesh
In: Parallel Processing Letters [5], 81-95
Journal Article
1
Hide details for Kaufmann, Sibeyn [Hájek, Kaufmann, Wiedermann]Kaufmann, Sibeyn [Hájek, Kaufmann, Wiedermann]
1995Solving Cheap Graph Problems on Meshes
In: Mathematical Foundations of Computer Science 1995: 20th International Symposium (MFCS95), 412-422
Proceedings Article
1
Hide details for Kaufmann, Sibeyn [Kaufmann]Kaufmann, Sibeyn [Kaufmann]
1997Randomized Multipacket Routing and Sorting on Meshes
In: Algorithmica [17], 224-244
Journal Article
1
Hide details for Kaufmann, Sibeyn, Suel [Kaufmann, Spirakis, Suel]Kaufmann, Sibeyn, Suel [Kaufmann, Spirakis, Suel]
1995Beyond the Worst-Case Bisection Bound:
Fast Ranking and Counting on Meshes
In: Algorithms - ESA'95: 3rd Annual European Symposium, 75-88
Proceedings Article
1
Hide details for Kavitha [-]Kavitha [-]
2008On a Special Co-cycle Basis of Graphs
In: 11th Scandinavian Workshop on Algorithm Theory (SWAT), 343-354
Proceedings Article
1
Hide details for Kavitha, Liebchen, Mehlhorn, Michail, Rizzi, Ueckerdt, Zweig [Kavitha, Liebchen, Rizzi, Ueckerdt, Zweig]Kavitha, Liebchen, Mehlhorn, Michail, Rizzi, Ueckerdt, Zweig [Kavitha, Liebchen, Rizzi, Ueckerdt, Zweig]
2009Attachment IconCycle Bases in Graphs: Characterization, Algorithms, Complexity, and Applications
In: Computer Science Review [3], 199-243
Journal Article
1
Hide details for Kavitha, Mehlhorn [-]Kavitha, Mehlhorn [-]
2007Attachment IconAlgorithms to compute minimum cycle basis in directed graphs
In: Theory of Computing Systems [40], 485-505
Journal Article
1
Hide details for Kavitha, Mehlhorn [Diekert, Durand]Kavitha, Mehlhorn [Diekert, Durand]
2005Attachment IconA Polynomial Time Algorithm for Minimum Cycle Basis in Directed Graphs
In: STACS 2005 : 22nd Annual Symposium on Theoretical Aspects of Computer Science, 654-665
Proceedings Article
1
Hide details for Kavitha, Mehlhorn, Michail [Kavitha, Thomas, Weil]Kavitha, Mehlhorn, Michail [Kavitha, Thomas, Weil]
2007Attachment IconNew Approximation Algorithms for Minimum Cycle Bases of Graphs
In: STACS 2007 : 24th Annual Symposium on Theoretical Aspects of Computer Science, 512-523
Proceedings Article
1
Hide details for Kavitha, Mehlhorn, Michail [Kavitha]Kavitha, Mehlhorn, Michail [Kavitha]
2011New Approximation Algorithms for Minimum Cycle Bases of Graphs
In: Algorithmica [59], 471-488
Journal Article
1
Hide details for Kavitha, Mehlhorn, Michail, Paluch [Kavitha, Paluch]Kavitha, Mehlhorn, Michail, Paluch [Kavitha, Paluch]
2007Attachment IconStrongly stable matchings in time O(nm) and extension to the hospitals-residents problem
In: ACM Transactions on Algorithms [3], 15.1-15.18
Journal Article
1
Hide details for Kavitha, Mehlhorn, Michail, Paluch [Paluch, Diaz, Karhumäki, Lepistö, Sannella]Kavitha, Mehlhorn, Michail, Paluch [Paluch, Diaz, Karhumäki, Lepistö, Sannella]
2004Attachment IconA Faster Algorithm for Minimum Cycle Basis of Graphs
In: Automata, languages and programming : 31st International Colloquium, ICALP 2004, 846-857
Proceedings Article
1
Hide details for Kavitha, Mehlhorn, Michail, Paluch [Paluch, Diekert, Habib]Kavitha, Mehlhorn, Michail, Paluch [Paluch, Diekert, Habib]
2004Attachment IconStrongly Stable Matchings in Time O(nm) and Extension to the Hospitals-Residents Problem
In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), 222-233
Proceedings Article
1
Hide details for Kavitha, Mestre [Kavitha, Dong, Du, Ibarra]Kavitha, Mestre [Kavitha, Dong, Du, Ibarra]
2009Max-coloring paths: Tight bounds and extensions
In: Algorithms and Computation : 20th International Symposium, ISAAC 2009, 87-96
Proceedings Article
1
Hide details for Kavitha, Mestre [Kavitha]Kavitha, Mestre [Kavitha]
2010Max-coloring paths: Tight bounds and extensions
In: Journal of Combinatorial Optimization [Online First], 1 - 14
Electronic Journal Article
1
Hide details for Kavitha, Mestre [Mestre]Kavitha, Mestre [Mestre]
2012Max-coloring paths: tight bounds and extensions
In: Journal of Combinatiorial Optimization [24], 1-14
Journal Article
1
Hide details for Kavitha, Mestre, Nasre [Kavitha, Nasre, Albers, Marchetti-Spaccamela, Matias, Nikoletseas, Thomas]Kavitha, Mestre, Nasre [Kavitha, Nasre, Albers, Marchetti-Spaccamela, Matias, Nikoletseas, Thomas]
2009Popular Mixed Matchings
In: Automata, Languages and Programming : 36th International Colloquium, ICALP 2009, 574-584
Proceedings Article
1
Hide details for Kavitha, Mestre, Nasre [Kavitha, Nasre]Kavitha, Mestre, Nasre [Kavitha, Nasre]
2011Popular mixed matchings
In: Theoretical Computer Science [412], 2679-2690
Journal Article
1
Hide details for Kavitha, Nasre [Nasre]Kavitha, Nasre [Nasre]
2008Optimal Popular MatchingsMiscellaneous
1
Hide details for Kavvadias, Pantziou, Spirakis, Zaroliagis [Kavvadias, Pantziou, Spirakis]Kavvadias, Pantziou, Spirakis, Zaroliagis [Kavvadias, Pantziou, Spirakis]
1996Hammock-on-ears decomposition : a technique for the efficient parallel solution of shortest paths and other problems
In: Theoretical Computer Science [168], 121-154
Journal Article
2
Hide details for Kayal, Saha [Kayal]Kayal, Saha [Kayal]
2012Attachment IconOn the Sum of Square Roots of Polynomials and Related Problems
In: The ACM Transactions on Computation Theory [4], 9:1-9:15
Journal Article
2011Attachment IconOn the Sum of Square Roots of Polynomials and Related Problems
In: 26th IEEE Conference on Computational Complexity (CCC), 292-299
Proceedings Article
1
Hide details for Kececioglu, Lenhof, Mehlhorn, Mutzel, Reinert, Vingron [Kececioglu, Vingron]Kececioglu, Lenhof, Mehlhorn, Mutzel, Reinert, Vingron [Kececioglu, Vingron]
2000Attachment IconA polyhedral approach to sequence alignment problems
In: Discrete Applied Mathematics [104], 143-186
Journal Article
1
Hide details for Keizer, Antoniol, Congdon, Deb, Doerr, Hansen, Holmes, Hornby, Howard, Kennedy, Kumar, Lobo, Miller, Moore, NeKeizer, Antoniol, Congdon, Deb, Doerr, Hansen, Holmes, Hornby, Howard, Kennedy, Kumar, Lobo, Miller, Moore, Neumann, Pelikan, Pollack, Sastry, Stanley, Stoica, Talbi, Wegener (ed.) [Keizer, Antoniol, Congdon, Deb, Hansen, Holmes, Hornby, Howard, Kennedy, Kumar, Lobo, Miller, Moore, Pelikan, Pollack, Sastry, Stanley, Stoica, Talbi, Wegener]
2008GECCO 2008: Proceedings of the 10th Annual Conference on Genetic and Evolutionary ComputationProceedings
1
Hide details for Kelsen [-]Kelsen [-]
1996Neighborhood graphs and distributed "^" + 1-coloring
In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, 223-233
Proceedings Article
1
Hide details for Kelsen, Mahajan, Ramesh [Mahajan, Ramesh]Kelsen, Mahajan, Ramesh [Mahajan, Ramesh]
1996Approximate hypergraph coloring
In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, 41-52
Proceedings Article
4
Hide details for Kerber [-]Kerber [-]
2009Division-Free Computation of Subresultants Using Bezout Matrices
In: International Journal of Computer Mathematics [86], 2186-2200
Journal Article
2009Geometric Algorithms for Algebraic Curves and Surfaces
Universität des Saarlandes
Thesis - PhD thesis
2008Attachment IconOn filter methods in CGAL's 2D curved kernelReport
2006Attachment IconAnalysis of Real Algebraic Plane Curves
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Kerber [Gerdt, Mayr, Vorozhtsov]Kerber [Gerdt, Mayr, Vorozhtsov]
2009Attachment IconOn the Complexity of Reliable Root Approximation
In: Computer Algebra in Scientific Computing : 11th International Workshop, CASC 2009, 155-167
Proceedings Article
1
Hide details for Kerber, Sagraloff [Kerber, Leykin]Kerber, Sagraloff [Kerber, Leykin]
2011Efficient Real Root Approximation
In: ISSAC 2011 : Proceedings of the 36th International Symposium on Symbolic and Algebraic Computation, 209-216
Proceedings Article
2
Hide details for Kerber, Sagraloff [Kerber]Kerber, Sagraloff [Kerber]
2012A worst-case bound for topology computation of algebraic curves
In: Journal of Symbolic Computation [47], 239-258
Journal Article
2011A Note on the Complexity of Real Algebraic Hypersurfaces
In: Graphs and Combinatorics [27], 419-430
Journal Article
1
Hide details for Kerzmann [-]Kerzmann [-]
2000Zwangsbasierte Dynamiksimulationen im R2 unter Verwendung von Kreiskanten
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Kesselman, Guez, Rosen [Guez, Rosen]Kesselman, Guez, Rosen [Guez, Rosen]
2004Packet-Mode Policies for Input-Queued Switches
In: Sixteenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-04), 93-102
Proceedings Article
1
Hide details for Kesselman, Kogan [Kogan]Kesselman, Kogan [Kogan]
2005Non-Preemptive Scheduling of Optical Switches
In: 2004 IEEE Global Telecommunications Conference workshops (GLOBECOM'04), 1840-1844
Proceedings Article
1
Hide details for Kesselman, Kowalski [-]Kesselman, Kowalski [-]
2005Fast Distributed Algorithm for Convergecast in Ad Hoc Geometric Radio Networks
In: Second Annual Conference on Wireless On-demand Network Systems and Services (WONS'05), 119-124
Proceedings Article
1
Hide details for Kesselman, Kowalski, Segal [Segal]Kesselman, Kowalski, Segal [Segal]
2005Attachment IconEnergy efficient communication in ad hoc networks from user's and designer's perspective
In: Proceedings of the n?th Conference on, 15-26
In: ACM SIGMOBILE Mobile Computing and Communications Review [9], 15-26
Journal Article
1
Hide details for Kesselman, Lotker, Mansour, Patt-Shamir, Schieber, Sviridenko [Lotker, Mansour, Patt-Shamir, Schieber, SvirideKesselman, Lotker, Mansour, Patt-Shamir, Schieber, Sviridenko [Lotker, Mansour, Patt-Shamir, Schieber, Sviridenko]
2004Buffer Overflow Management in QoS Switches
In: SIAM Journal on Computing [33], 563-583
Journal Article
1
Hide details for Kesselman, Mansour [Mansour]Kesselman, Mansour [Mansour]
2004Harmonic Buffer Management for Shared-Memory Switches
In: Theoretical Computer Science [324], 161-182
Journal Article
1
Hide details for Kessler [-]Kessler [-]
2002Robust Computation of Visibility Maps
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Keßler, Träff [Keßler, Kessler]Keßler, Träff [Keßler, Kessler]
1997Language and library support for practical PRAM programming
In: Proceedings of the 5th Euromicro Workshop on Parallel and Distributed Processing (PDP-97), 216-221
Proceedings Article
1
Hide details for Keßler, Träff [Keßler, Keßler]Keßler, Träff [Keßler, Keßler]
1996A Library of basic PRAM Algorithms and its Implementation in FORK
In: 8th Annual ACM Symposium on Parallel Algorithms and Architechtures (SPAA'96), 193-195
Proceedings Article
1
Hide details for Kettner [-]Kettner [-]
1998Eine Implementation von k-Server-Algorithmen
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Kettner [Lumsdaine, Schupp]Kettner [Lumsdaine, Schupp]
2005Reference Counting in Library Design---Optionally and with Union-Find Optimization
In: Library-Centric Software Design (LCSD'05), 1-10
Electronic Proceedings Article
1
Hide details for Kettner [Musser, Siek]Kettner [Musser, Siek]
2006Reference Counting in Library Design---Optionally and with Union-Find Optimization
In: Proceedings of the First International Workshop on Library-Centric Software Design, LCSD'05, 34-43
Proceedings Article
1
Hide details for Kettner, Kirkpatrick, Mantler, Snoeyink, Speckmann, Takeuchi [Kirkpatrick, Mantler, Snoeyink, Speckmann, TakeuKettner, Kirkpatrick, Mantler, Snoeyink, Speckmann, Takeuchi [Kirkpatrick, Mantler, Snoeyink, Speckmann, Takeuchi]
2003Tight Degree Bounds for Pseudo-triangulations of Points
In: Computational Geometry - Theory and Applications [25], 3-12
Journal Article
1
Hide details for Kettner, Mehlhorn, Pion, Schirra, Yap [Pion, Schirra, Yap, Albers, Radzik]Kettner, Mehlhorn, Pion, Schirra, Yap [Pion, Schirra, Yap, Albers, Radzik]
2004Attachment IconClassroom Examples of Robustness Problems in Geometric Computations
In: ESA 2004: 12th Annual European Symposium on Algorithms, 702-713
Proceedings Article
1
Hide details for Kettner, Mehlhorn, Pion, Schirra, Yap [Pion, Schirra, Yap, Gavrilova, Gervasi, Kumar, Tan, Taniar, Laganà, MunKettner, Mehlhorn, Pion, Schirra, Yap [Pion, Schirra, Yap, Gavrilova, Gervasi, Kumar, Tan, Taniar, Laganà, Mun, Choo]
2006Reply to "Backward Error Analysis ..."
In: Computational Science and Its Applications - ICCSA 2006, I, 60-60
Proceedings Article
1
Hide details for Kettner, Mehlhorn, Pion, Schirra, Yap [Pion, Schirra, Yap]Kettner, Mehlhorn, Pion, Schirra, Yap [Pion, Schirra, Yap]
2008Attachment IconClassroom Examples of Robustness Problems in Geometric Computations
In: Computational Geometry: Theory and Applications [40], 61-78
Journal Article
1
Hide details for Kettner, Mehlhorn, Pion, Schirra, Yap [Schirra, Yap]Kettner, Mehlhorn, Pion, Schirra, Yap [Schirra, Yap]
2004Classroom Examples of Robustness Problems in Geometric ComputationsReport
1
Hide details for Kettner, Näher [Näher, Goodman, O'Rourke]Kettner, Näher [Näher, Goodman, O'Rourke]
2004Two Computational Geometry Libraries: LEDA and CGAL
In: Handbook of Discrete and Computational Geometry, 1435-1463
Part of a Book
1
Hide details for Kettner, Rossignac, Snoeyink [Rossignac, Snoeyink]Kettner, Rossignac, Snoeyink [Rossignac, Snoeyink]
2003The Safari Interface for Visualizing Time-dependent Volume Data Using Iso-surfaces and Contour Spectra
In: Computational Geometry - Theory and Applications [25], 97-116
Journal Article
1
Hide details for Khachiyan, Boros, Borys, Elbassioni, Gurvich [Khachiyan, Boros, Borys, Gurvich, Deng, Du]Khachiyan, Boros, Borys, Elbassioni, Gurvich [Khachiyan, Boros, Borys, Gurvich, Deng, Du]
2005Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs
In: Algorithms and computation : 16th International Symposium, ISAAC 2005, 156-165
Proceedings Article
2
Hide details for Khachiyan, Boros, Borys, Elbassioni, Gurvich [Khachiyan, Boros, Borys, Gurvich]Khachiyan, Boros, Borys, Elbassioni, Gurvich [Khachiyan, Boros, Borys, Gurvich]
2008Generating All Vertices of a Polyhedron Is Hard
In: Discrete & Computational Geometry [39], 174-190
Journal Article
2006Generating All Vertices of a Polyhedron is Hard
In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'06, 758-765
Proceedings Article
1
Hide details for Khachiyan, Boros, Borys, Elbassioni, Gurvich, Makino [Khachiyan, Boros, Borys, Gurvich, Makino, Azar, ErlebachKhachiyan, Boros, Borys, Elbassioni, Gurvich, Makino [Khachiyan, Boros, Borys, Gurvich, Makino, Azar, Erlebach]
2006Enumerating Spanning and Connected Subsets in Graphs and Matroids
In: Algorithms - ESA 2006, 14th Annual European Symposium, 444-455
Proceedings Article
1
Hide details for Khachiyan, Boros, Borys, Elbassioni, Gurvich, Makino [Khachiyan, Boros, Borys, Gurvich, Makino]Khachiyan, Boros, Borys, Elbassioni, Gurvich, Makino [Khachiyan, Boros, Borys, Gurvich, Makino]
2008Generating Cut Conjunctions in Graphs and Related Problems
In: Algorithmica [51], 239-263
Journal Article
1
Hide details for Khachiyan, Boros, Borys, Elbassioni, Gurvich, Rudolf, Zhao [Khachiyan, Boros, Borys, Gurvich, Rudolf, Zhao]Khachiyan, Boros, Borys, Elbassioni, Gurvich, Rudolf, Zhao [Khachiyan, Boros, Borys, Gurvich, Rudolf, Zhao]
2008On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction
In: Theory Comput. Syst. [43], 204-233
Journal Article
1
Hide details for Khachiyan, Boros, Elbassioni, Gurvich [Khachiyan, Boros, Gurvich, Jedrzejowicz, Szepietowski]Khachiyan, Boros, Elbassioni, Gurvich [Khachiyan, Boros, Gurvich, Jedrzejowicz, Szepietowski]
2005Generating All Minimal Integral Solutions to Monotone $\wedge,\vee$-Systems of Linear, Transversal and Polymatroid Inequalities
In: Mathematical Foundations of Computer Science 2005 : 30th International Symposium, MFCS 2005, 556-567
Proceedings Article
1
Hide details for Khachiyan, Boros, Elbassioni, Gurvich [Khachiyan, Boros, Gurvich, Wang]Khachiyan, Boros, Elbassioni, Gurvich [Khachiyan, Boros, Gurvich, Wang]
2005A New Algorithm for the Hypergraph Transversal Problem
In: Computing and combinatorics : 11th Annual International Conference, COCOON 2005, 767-776
Proceedings Article
4
Hide details for Khachiyan, Boros, Elbassioni, Gurvich [Khachiyan, Boros, Gurvich]Khachiyan, Boros, Elbassioni, Gurvich [Khachiyan, Boros, Gurvich]
2008Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions
In: Discrete Applied Mathematics [156], 2020-2034
Journal Article
2008On Enumerating Minimal Dicuts and Strongly Connected Subgraphs
In: Algorithmica [50], 159-172
Journal Article
2007A global parallel algorithm for the hypergraph transversal problem
In: Information Processing Letters [101], 148-155
Journal Article
2007On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs
In: Theoretical Computer Science [382], 139-150
Journal Article
3
Hide details for Khachiyan, Boros, Elbassioni, Gurvich, Makino [Khachiyan, Boros, Gurvich, Makino]Khachiyan, Boros, Elbassioni, Gurvich, Makino [Khachiyan, Boros, Gurvich, Makino]
2007Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data
In: Theoretical Computer Science [379], 361-376
Journal Article
2007Enumerating disjunctions and conjunctions of paths and cuts in reliability theory
In: Discrete Applied Mathematics [155], 137-149
Journal Article
2005On the Complexity of Some Enumeration Problems for Matroids
In: SIAM Journal on Discrete Mathematics [19], 966-984
Journal Article
1
Hide details for Khachiyan, Porkolab [Khachiyan]Khachiyan, Porkolab [Khachiyan]
2000Integer optimization on convex semialgebraic sets
In: Discrete & Computational Geometry [23], 207-224
Journal Article
1
Hide details for Khosla [Bodlaender, Italiano]Khosla [Bodlaender, Italiano]
2013Balls into Bins Made Faster
In: Algorithms - ESA 2013,
Proceedings Article
1
Hide details for Khuller, Malekian, Mestre [Khuller, Malekian, Arge, Hoffmann, Welzl]Khuller, Malekian, Mestre [Khuller, Malekian, Arge, Hoffmann, Welzl]
2007To Fill or Not to Fill: The Gas Station Problem
In: 15th Annual European Symposium on Algorithms, 534-545
Proceedings Article
1
Hide details for Khuller, Mestre [Khuller]Khuller, Mestre [Khuller]
2008An Optimal Incremental Algorithm for Minimizing Lateness with Rejection
In: 16th Annual European Symposium on Algorithms (ESA), 601-610
Proceedings Article
1
Hide details for Kim, Paul, Philip [Kim, Paul, Fomin, Kaski]Kim, Paul, Philip [Kim, Paul, Fomin, Kaski]
2012Attachment IconA Single-exponential FPT Algorithm for the K4-Minor Cover Problem
In: Algorithm Theory - SWAT 2012 : 13th Scandinavian Symposium and Workshops, 119-130
Proceedings Article
1
Hide details for Kirousis, Spirakis, Tsigas [Kirousis, Spirakis]Kirousis, Spirakis, Tsigas [Kirousis, Spirakis]
1996Simple Atomic Snapshots: A Linear Complexity Solution with Unbounded Time-Stamps
In: Information Processing Letters [58], 47-53
Journal Article
1
Hide details for Klär [-]Klär [-]
1994Verdrahtungsproblem auf planaren Graphen
Universität des Saarlandes
Thesis - Masters thesis
3
Hide details for Klau [-]Klau [-]
2002A Combinatorial Approach to Orthogonal Placement Problems
Universität des Saarlandes
Thesis - PhD thesis
1998Attachment IconVisuelle Zeitenwende: Bilder - Technik - Reflexionen. Quasi-orthogonales ZeichnenMiscellaneous
1997Attachment IconQuasi-orthogonales Zeichnen planarer Graphen mit wenigen Knicken
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Klauk [-]Klauk [-]
2004Ein Algorithmus zur Konstruktion des Voronoidiagramms von Kreisbögen
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Klau, Klein, Mutzel [Marks, Klau, Mutzel]Klau, Klein, Mutzel [Marks, Klau, Mutzel]
2001An Experimental Comparison of Orthogonal Compaction Algorithms
In: Proceedings of the 8th International Symposium on Graph Drawing (GD-00), 37-51
Proceedings Article
1
Hide details for Klau, Mutzel [Cornuéjols, Burkard, Woeginger]Klau, Mutzel [Cornuéjols, Burkard, Woeginger]
1999Optimal Compaction of Orthogonal Grid Drawings
In: Proceedings of the 7th International Conference on Integer Programming and Combinatorial Optimization (IPCO-99), 304-319
Proceedings Article
1
Hide details for Klau, Mutzel [Du, Eades, Estivill-Castro, Lin, Sharma]Klau, Mutzel [Du, Eades, Estivill-Castro, Lin, Sharma]
2000Optimal Labelling of Point Features in the Slider Model
In: Computing and Combinatorics, Proceedings of the 6th Annual International Conference (COCOON-00), 340-350
Proceedings Article
1
Hide details for Klau, Mutzel [Jäger, Krebs]Klau, Mutzel [Jäger, Krebs]
2003Automatic Layout and Labelling of State Diagrams
In: Mathematics: Key Technology for the Future : Joint Projects Between Universities and Industry, 584-608
Part of a Book
1
Hide details for Klau, Mutzel [Kratochvíl]Klau, Mutzel [Kratochvíl]
1999Combining Graph Labeling and Compaction
In: Proceedings of the 7th International Symposium on Graph Drawing (GD-99), 27-37
Proceedings Article
3
Hide details for Klein [-]Klein [-]
2004Attachment IconA Fast Root Checking AlgorithmReport
2004Attachment IconControlled Perturbation for Voronoi Diagrams
Universität des Saarlandes
Thesis - Masters thesis
2000Flußbasierte orthogonale Zeichenverfahren für Graphen mit variablen Knotengrößen
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Klein, Kutz [Klein, Kaufmann, Wagner]Klein, Kutz [Klein, Kaufmann, Wagner]
2007Attachment IconComputing Geometric Minimum-Dilation Graphs Is NP-Hard
In: Graph Drawing : 14th International Symposium, GD 2006, 196-207
Proceedings Article
1
Hide details for Klein, Kutz [Klein]Klein, Kutz [Klein]
2006Attachment IconThe Density of Iterated Crossing Points and a Gap Result for Triangulations of Finite Point Sets
In: Proceedings of the 22nd Annual Symposium on Computational Geometry, SCG'06, 264-272
Proceedings Article
1
Hide details for Klein, Mehlhorn, Meiser [Klein, Meiser]Klein, Mehlhorn, Meiser [Klein, Meiser]
1989Attachment IconOn the construction of abstract Voronoi diagrams, II.Report
2
Hide details for Klein, Mehlhorn, Meiser [, ]Klein, Mehlhorn, Meiser [, ]
1992Randomized incremental construction of abstract Voronoi diagrams
In: Informatik---Festschrift zum 60.~Geburtstag von Günter Hotz, 283-308
Part of a Book
1990On the Construction of Abstract Voronoi Diagrams, II
In: Algorithms (ISA-90) : 1st international symposium (SIGAL-90), 138-154
Proceedings Article
1
Hide details for Klein, Mehlhorn, Meiser []Klein, Mehlhorn, Meiser []
1993Attachment IconRandomized incremental construction of abstract Voronoi diagrams
In: Computational Geometry: Theory and Applications [3], 157-184
Journal Article
1
Hide details for Knauer, Schlipf, Schmidt, Tiwary [Knauer, Schlipf, Tiwary]Knauer, Schlipf, Schmidt, Tiwary [Knauer, Schlipf, Tiwary]
2012Largest Inscribed Rectangles in Convex Polygons
In: Journal of Discrete Algorithms [13], 78-85
Journal Article
2
Hide details for Kobel [-]Kobel [-]
2011Certified numerical root finding
Universität des Saarlandes
Thesis - Masters thesis
2008Automated Generation of Kempe Linkages for Algebraic Curves in a Dynamic Geometry System
Universität des Saarlandes
Thesis - Bachelor thesis
1
Hide details for Kobel, Sagraloff [-]Kobel, Sagraloff [-]
2013Fast Approximate Polynomial Multipoint Evaluation and Applications
In: arXiv [abs/1304.8069], 17
Electronic Journal Article
2
Hide details for Kohlbacher, Lenhof [-]Kohlbacher, Lenhof [-]
2000BALL - Rapid Software Prototyping in Computational Molecular Biology
In: Bioinformatics [16], 815-824
Journal Article
1999Rapid Software Prototyping in Computational Molecular Biology
In: Proceedings of the German Conference on Bioinformatics (GCB'99), 81-92
Proceedings Article
1
Hide details for Koldehofe [-]Koldehofe [-]
1999Animation and Analysis of Distributed Algorithms
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Koller, Mehlhorn, Niehren [Koller]Koller, Mehlhorn, Niehren [Koller]
2000Attachment IconA Polynomial-Time Fragment of Dominance Constraints
In: Proceedings of the 38th Annual Meeting of the Association of Computational Linguistics (ACL-00), 368-375
Proceedings Article
1
Hide details for Kollias [-]Kollias [-]
2013Nonpreemptive Coordination Mechanisms for Identical Machines
In: Theory of Computing Systems [53], 424-440
Electronic Journal Article
1
Hide details for Könemann [-]Könemann [-]
1997Fast combinatorial algorithms for packing and covering problems
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Konidaris, Mehlhorn, Shell []Konidaris, Mehlhorn, Shell []
2004Attachment IconAn optimal algorithm for finding edge segment adjacencies in configurations of convex polygonsUnpublished/Draft
1
Hide details for Kontogiannis [-]Kontogiannis [-]
2002Lower Bounds & Competitive Algorithms for Online Scheduling of Unit-Size Tasks to Related Machines
In: Proceedings of the 34th ACM Symposium on Theory of Computing (STOC-02), 124-133
Proceedings Article
1
Hide details for Kontogiannis, Pantziou, Spirakis, Yung [Pantziou, Spirakis, Yung]Kontogiannis, Pantziou, Spirakis, Yung [Pantziou, Spirakis, Yung]
2000Attachment IconRobust Parallel Computations through Randomization
In: Theory of Computing Systems [33], 427-464
Journal Article
1
Hide details for Konwar, Kowalski, Shvartsman [Konwar, Shvartsman]Konwar, Kowalski, Shvartsman [Konwar, Shvartsman]
2004The Join problem in dynamic network algorithms
In: 2004 International Conference on Dependable Systems and Networks (DSN 2004), 315-324
Proceedings Article
1
Hide details for Kötzing [Kivinen, Szepesvári, Ukkonen, Zeugmann]Kötzing [Kivinen, Szepesvári, Ukkonen, Zeugmann]
2011Iterative Learning from Positive Data and Counters
In: Algorithmic Learning Theory : 22nd International Conference, ALT 2011, 40-54
Proceedings Article
1
Hide details for Kötzing, Lehre, Neumann, Oliveto [Lehre, Oliveto, Pelikan, Branke]Kötzing, Lehre, Neumann, Oliveto [Lehre, Oliveto, Pelikan, Branke]
2010Ant Colony Optimization and the Minimum Cut Problem
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 1393-1400
Proceedings Article
1
Hide details for Kötzing, Molter [Molter, Coello Coello, Cutello, Deb, Forrest, Nicosia, Pavone]Kötzing, Molter [Molter, Coello Coello, Cutello, Deb, Forrest, Nicosia, Pavone]
2012ACO beats EA on a dynamic pseudo-Boolean function
In: Parallel Problem Solving from Nature - PPSN XII : 12th International Conference, 113-122
Proceedings Article
1
Hide details for Kötzing, Neumann, Röglin, Witt [Neumann, Röglin, Witt]Kötzing, Neumann, Röglin, Witt [Neumann, Röglin, Witt]
2012Theoretical analysis of two ACO approaches for the traveling salesman problem
In: Swarm Intelligence [6], 1-21
Journal Article
1
Hide details for Kötzing, Neumann, Röglin, Witt [Röglin, Witt, Dorigo, Birattari, Di Caro, Doursat, Engelbrecht, Floreano, GambKötzing, Neumann, Röglin, Witt [Röglin, Witt, Dorigo, Birattari, Di Caro, Doursat, Engelbrecht, Floreano, Gambardella, Groß, Sahin, Sayama, Stützle]
2010Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem
In: Swarm Intelligence : 7th International Conference, ANTS 2010, 324-335
Proceedings Article
1
Hide details for Kötzing, Neumann, Spöhel [Neumann, Krasnogor, Lanzi]Kötzing, Neumann, Spöhel [Neumann, Krasnogor, Lanzi]
2011PAC learning and genetic programming
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 2091-2096
Proceedings Article
1
Hide details for Kötzing, Neumann, Sudholt, Wagner [Neumann, Sudholt, Wagner, Beyer, Langdon]Kötzing, Neumann, Sudholt, Wagner [Neumann, Sudholt, Wagner, Beyer, Langdon]
2011Simple max-min ant systems and the optimization of linear pseudo-Boolean functions
In: FOGA'11 : Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, 209-218
Proceedings Article
1
Hide details for Kötzing, Sudholt, Theile [Sudholt, Theile, Krasnogor, Lanzi]Kötzing, Sudholt, Theile [Sudholt, Theile, Krasnogor, Lanzi]
2011How crossover helps in pseudo-Boolean optimization
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 989-996
Proceedings Article
1
Hide details for Kötzing, Sutton, Neumann, O'Reilly [Sutton, Neumann, O'Reilly, Soule, Moore]Kötzing, Sutton, Neumann, O'Reilly [Sutton, Neumann, O'Reilly, Soule, Moore]
2012The max problem revisited: the importance of mutation in genetic programming
In: GECCO’12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation, 1333-1340
Proceedings Article
1
Hide details for Kovács [-]Kovács [-]
2007Fast Algorithms for Two Scheduling Problems
Universität des Saarlandes
Thesis - PhD thesis
1
Hide details for Kovács [Brodal, Leonardi]Kovács [Brodal, Leonardi]
2005Fast monotone 3-approximation algorithm for scheduling related machines
In: Algorithms - ESA 2005: 13th Annual European Symposium, 616-627
Proceedings Article
1
Hide details for Kovács [Caires, Italiano, Monteiro, Palamidessi, Yung]Kovács [Caires, Italiano, Monteiro, Palamidessi, Yung]
2005Polynomial Time Preemptive Sum-Multicoloring on Paths
In: Automata, languages and programming : 32nd International Colloquim, ICALP 2005, 840-852
Proceedings Article
1
Hide details for Kovács [Calamoneri, Finocchi, Italiano]Kovács [Calamoneri, Finocchi, Italiano]
2006Tighter Approximation Bounds for LPT Scheduling in Two Special Cases
In: Algorithms and Complexity : 6th Italian Conference, CIAC 2006, 187-198
Proceedings Article
1
Hide details for Kovács [Diekert, Habib]Kovács [Diekert, Habib]
2004Sum-Multicoloring on Paths
In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), 68-80
Proceedings Article
2
Hide details for Kowalik [-]Kowalik [-]
2009Improved edge-coloring with three colors
In: Theoretical Computer Science [410], 3733-3742
Journal Article
2007Adjacency Queries in Dynamic Sparse Graphs
In: Inf. Proc. Lett. [-], -
Journal Article
1
Hide details for Kowalik [Asano]Kowalik [Asano]
2006Approximation Scheme for Lowest Outdegree Orientation and Graph Density Measures
In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 557-566
Proceedings Article
1
Hide details for Kowalik [Fomin]Kowalik [Fomin]
2006Improved Edge Coloring with Three Colors
In: Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, WG 2006, 90-101
Proceedings Article
1
Hide details for Kowalski, Musial, Shvartsman [Musial, Shvartsman]Kowalski, Musial, Shvartsman [Musial, Shvartsman]
2005Explicit combinatorial structures for cooperative distributed algorithms
In: 25th IEEE International Conference on Distributed Computing Systems (ICDCS'05), 49-58
Proceedings Article
1
Hide details for Kowalski, Pelc [Pelc, Fleischer, Trippen]Kowalski, Pelc [Pelc, Fleischer, Trippen]
2004Polynomial deterministic rendezvous in arbitrary graphs
In: Algorithms and Computation: 15th International Symposium, ISAAC 2004, 644-656
Proceedings Article
1
Hide details for Kowalski, Pelc [Pelc, Jansen, Khanna, Rolim, Ron]Kowalski, Pelc [Pelc, Jansen, Khanna, Rolim, Ron]
2004Centralized deterministic broadcasting in undirected multi-hop radio networks
In: Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques. 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004, and 8th International Workshop on Randomization and Computation, RANDOM 2004, 171-182
Proceedings Article
3
Hide details for Kowalski, Pelc [Pelc]Kowalski, Pelc [Pelc]
2005Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism
In: Theoretical Computer Science [333], 355-371
Journal Article
2004Time of deterministic broadcasting in radio networks with local knowledge
In: SIAM Journal on Computing [33], 870-891
Journal Article
2003Time of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism
In: Proceedings of the 10th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2003), 195-210
Proceedings Article
1
Hide details for Kowalski, Shvartsman [Shvartsman]Kowalski, Shvartsman [Shvartsman]
2004Writing-All deterministically and optimally using a non-trivial number of asynchronous processors
In: Sixteenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-04), 311-320
Proceedings Article
2
Hide details for Krandick, Mehlhorn [Krandick]Krandick, Mehlhorn [Krandick]
2006Attachment IconNew bounds for the Descartes method
In: Journal of Symbolic Computation [41], 49-66
Journal Article
2004New Bounds for the Descartes MethodReport
1
Hide details for Kratsch [-]Kratsch [-]
2010Kernelization of generic problems : upper and lower bounds
Universität des Saarlandes
Thesis - PhD thesis
1
Hide details for Kratsch [Albers, Marion]Kratsch [Albers, Marion]
2009Polynomial Kernelizations For MIN F+Pi1 And MAX NP
In: Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS), 601-612
Electronic Proceedings Article
1
Hide details for Kratsch, Lehre, Neumann, Oliveto [Lehre, Neumann, Oliveto, Schaefer, Cotta, Kolodziej, Rudolph]Kratsch, Lehre, Neumann, Oliveto [Lehre, Neumann, Oliveto, Schaefer, Cotta, Kolodziej, Rudolph]
2010Fixed Parameter Evolutionary Algorithms and Maximum Leaf Spanning Trees: A Matter of Mutation
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 204-213
Proceedings Article
1
Hide details for Kratsch, Marx, Wahlström [Marx, Hlinený, Kucera]Kratsch, Marx, Wahlström [Marx, Hlinený, Kucera]
2010Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems
In: Mathematical Foundations of Computer Science 2010 : 35th International Symposium, MFCS 2010, 489-500
Proceedings Article
1
Hide details for Kratsch, McConnell, Mehlhorn, Spinrad [Kratsch, McConnell, Spinrad]Kratsch, McConnell, Mehlhorn, Spinrad [Kratsch, McConnell, Spinrad]
2006Attachment IconCertifying Algorithms for Recognizing Interval Graphs and Permutation Graphs
In: Siam Journal on Computing, 326-353
In: SIAM Journal on Computing [36], 326-353
Journal Article
1
Hide details for Kratsch, McConnell, Mehlhorn, Spinrad []Kratsch, McConnell, Mehlhorn, Spinrad []
2003Attachment IconCertifying Algorithms for Recognizing Interval Graphs and Permutation Graphs
In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), 158-167
Proceedings Article
1
Hide details for Kratsch, Neumann [Raidl, Rothlauf]Kratsch, Neumann [Raidl, Rothlauf]
2009Fixed-Parameter Evolutionary Algorithms and the Vertex Cover Problem
In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 293-300
Proceedings Article
1
Hide details for Kratsch, Pilipczuk, Pilipczuk, Wahlström [Kratsch, Pilipczuk, Pilipczuk, Czumaj, Pitts, Wattenhofer]Kratsch, Pilipczuk, Pilipczuk, Wahlström [Kratsch, Pilipczuk, Pilipczuk, Czumaj, Pitts, Wattenhofer]
2012Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs
In: Automata, Languages, and Programming ; 39th International Colloquium, ICALP 2012, 581-593
Proceedings Article
1
Hide details for Kratsch, Schweitzer [Kaplan]Kratsch, Schweitzer [Kaplan]
2010Isomorphism for Graphs of Bounded Feedback Vertex Set Number
In: Algorithm Theory - SWAT 2010 : 12th Scandinavian Symposium and Workshops
on Algorithm Theory, 81-92
Proceedings Article
1
Hide details for Kratsch, Wahlström [Abramsky, Gavoille, Kirchner, Meyer auf der Heide, Spirakis]Kratsch, Wahlström [Abramsky, Gavoille, Kirchner, Meyer auf der Heide, Spirakis]
2010Preprocessing of Min Ones Problems: A Dichotomy
In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010, 653-665
Proceedings Article
1
Hide details for Kratsch, Wahlström [Chen, Fomin]Kratsch, Wahlström [Chen, Fomin]
2009Two Edge Modification Problems without Polynomial Kernels
In: Parameterized and Exact Computation : 4th International Workshop, IWPEC 2009, 264-275
Proceedings Article
1
Hide details for Kratsch, Wahlström [Kratsch, Rabani]Kratsch, Wahlström [Kratsch, Rabani]
2012Compression via matroids: a randomized polynomial kernel for odd cycle transversal
In: Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 94-103
Proceedings Article
1
Hide details for Kratsch, Wahlström [Kratsch, Roughgarden]Kratsch, Wahlström [Kratsch, Roughgarden]
2012Representative Sets and Irrelevant Vertices: New Tools for Kernelization
In: IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS-12), 450-459
Proceedings Article
1
Hide details for Krick, Meyer auf der Heide, Räcke, Vöcking, Westermann [Krick, Meyer auf der Heide, Räcke, Westermann]Krick, Meyer auf der Heide, Räcke, Vöcking, Westermann [Krick, Meyer auf der Heide, Räcke, Westermann]
2003Data Management in Networks: Experimental Evaluation of a Provably Good Strategy
In: Theory of Computing Systems [35], 217-245
Journal Article
1
Hide details for Krithivasan, Rema, Schirra, Vijaykumar [Fiala, Kranakis, Krithivasan, Rema, Sack, Vijaykumar]Krithivasan, Rema, Schirra, Vijaykumar [Fiala, Kranakis, Krithivasan, Rema, Sack, Vijaykumar]
1996Velocity planning for a robot moving along the shortest straight line path among moving obstacles
In: Canadian Conference on Computational Geometry (CCCG '96), 149-154
Proceedings Article
1
Hide details for Krivelevich, Spöhel [Krivelevich]Krivelevich, Spöhel [Krivelevich]
2012Creating small subgraphs in Achlioptas processes with growing parameter
In: SIAM Journal on Discrete Mathematics [26], 670-686
Journal Article
1
Hide details for Kroeske, Ghandar, Michalewicz, Neumann [Kroeske, Ghandar, Michalewicz, Rudolph, Jansen, Lucas, Poloni, Beume]Kroeske, Ghandar, Michalewicz, Neumann [Kroeske, Ghandar, Michalewicz, Rudolph, Jansen, Lucas, Poloni, Beume]
2008Learning Fuzzy Rules with Evolutionary Algorithms - An Analytic Approach
In: Parallel Problem Solving from Nature (PPSN X), 1051-1060
Proceedings Article
1
Hide details for Krohmer [-]Krohmer [-]
2012Finding cliques in scale-free networks
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Krumke, Schwahn, van Stee, Westphal [Krumke, Schwahn, Westphal]Krumke, Schwahn, van Stee, Westphal [Krumke, Schwahn, Westphal]
2008Attachment IconA monotone approximation algorithm for scheduling with precedence constraints
In: Operations Research Letters [36], 247-249
Journal Article
1
Hide details for Krumke, van Stee, Westphal [Krumke, Westphal, Ravi, Shukla]Krumke, van Stee, Westphal [Krumke, Westphal, Ravi, Shukla]
2009Attachment IconOnline job admissions
In: Fundamental Problems in Computing : Essays in Honor of Professor Daniel J. Rosenkrantz, 435-454
Part of a Book
2
Hide details for Krysta [-]Krysta [-]
2003Approximating Minimum Size 1,2-Connected Networks
In: Discrete Applied Mathematics [125], 267-288
Journal Article
2001Approximation Algorithms for Combinatorial Optimization Problems in Graph Coloring and Network Design
Universität des Saarlandes
Thesis - PhD thesis
1
Hide details for Krysta, Kumar [Ferreira, Reichel]Krysta, Kumar [Ferreira, Reichel]
2001Approximation Algorithms for Minimum Size 2-connectivity Problems
In: Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science (STACS-01), 431-442
Proceedings Article
1
Hide details for Krysta, Lorys [Lorys, Nesetril, Lorys]Krysta, Lorys [Lorys, Nesetril, Lorys]
1999Efficient approximation algorithms for the achromatic number
In: Proceedings of the 7th Annual European Symposium on Algorithms (ESA-99), 402-413
Proceedings Article
1
Hide details for Krysta, Pacholski [Pacholski]Krysta, Pacholski [Pacholski]
1999The STO problem is NP-complete
In: Journal of Symbolic Computation [27], 207-219
Journal Article
1
Hide details for Krysta, Sanders, Vöcking [Rovan, Vojtáš]Krysta, Sanders, Vöcking [Rovan, Vojtáš]
2003Scheduling and Traffic Allocation for Tasks with Bounded Splittability
In: Mathematical foundations of computer science 2003 : 28th International Symposium, MFCS 2003, 500-510
Proceedings Article
1
Hide details for Krysta, Solis-Oba [-]Krysta, Solis-Oba [-]
2001Approximation Algorithms for Bounded Facility Location
In: Journal of Combinatorial Optimization [5], 233-247
Journal Article
1
Hide details for Krysta, Solis-Oba [Asano, Imai, Lee, Nakano, Tokuyama]Krysta, Solis-Oba [Asano, Imai, Lee, Nakano, Tokuyama]
1999Approximation algorithms for bounded facility location
In: Proceedings of the 5th Annual International Conference on Computing and Combinatorics (COCOON-99), 241-250
Proceedings Article
1
Hide details for Ksinsik [-]Ksinsik [-]
1996Approximative Bewegungsplanung für einen rechteckigen Roboter mit Hilfe von Voronoidiagrammen
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Kucera, Mehlhorn, Preis, Schwarzenecker []Kucera, Mehlhorn, Preis, Schwarzenecker []
1993Attachment IconExact Algorithms for a Geometric Packing Problem (Extended Abstract)
In: Theoretical aspects of computer science (STACS-93) : 10th annual symposium, 317-322
Proceedings Article
1
Hide details for Kuhn, Panagiotou, Spencer, Steger [Kuhn, Spencer, Steger, Charikar]Kuhn, Panagiotou, Spencer, Steger [Kuhn, Spencer, Steger, Charikar]
2010Synchrony and Asynchrony in Neural Networks
In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 949-964
Proceedings Article
1
Hide details for Kumar [Ramesh]Kumar [Ramesh]
2001Coupling vs. conductance for the Jerrum-Sinclair chain
In: Random Structures & Algorithms [18], 1-17
Journal Article
1
Hide details for Kumar, Arya, Ramesh [Arya, Ramesh, Montanari, Rolim, Welzl]Kumar, Arya, Ramesh [Arya, Ramesh, Montanari, Rolim, Welzl]
2000Hardness of Set Cover with Intersection 1
In: Automata, Languages and Programming, Proceedings of the 27th International Colloquium (ICALP-00), 624-635
Proceedings Article
2
Hide details for Kumar, Ramesh [Ramesh]Kumar, Ramesh [Ramesh]
1999Covering Rectilinear Polygons with Axis-Parallel Rectangles
In: Proceedings of the 31st Annual ACM Symposium on Theory of Computing (STOC-99), 445-454
Proceedings Article
1999Markovian Coupling vs. Conductance for the Jerrum-Sinclair Chain
In: Proceedings of the 40th Annual Symposium on Foundations of Computer Science (FOCS-99), 241-251
Proceedings Article
1
Hide details for Kursawe [-]Kursawe [-]
1998Exploration von geometrischen Umgebungen mit Hindernissen
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Kutz [-]Kutz [-]
2005Conway's Angel in three dimensions
In: Theoretical Computer Science [349], 443-451
Journal Article
1
Hide details for Kutz [Amenta, Cheong]Kutz [Amenta, Cheong]
2006Computing Shortest Non-Trivial Cycles on Orientable Surfaces of Bounded Genus in Almost Linear Time.
In: Proceedings of the 22nd Annual Symposium on Computational Geometry, SCG'06, 430-437
Proceedings Article
1
Hide details for Kutz [Felsner]Kutz [Felsner]
2005Weak Positional Games on Hypergraphs of Rank Three
In: 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 31-36
Proceedings Article
1
Hide details for Kutz, Elbassioni, Katriel, Mahajan [Kutz, Katriel, Mahajan]Kutz, Elbassioni, Katriel, Mahajan [Kutz, Katriel, Mahajan]
2008Simultaneous matchings: Hardness and approximation
In: J. Comput. Syst. Sci. [74], 884-897
Journal Article
1
Hide details for Kutz, Pór [Pór, Wang]Kutz, Pór [Pór, Wang]
2005Attachment IconAngel, Devil, and King
In: Computing and Combinatorics : 11th Annual International Conference, COCOON 2005, 925-934
Proceedings Article
1
Hide details for Kutz, Schweitzer [-]Kutz, Schweitzer [-]
2007ScrewBox: a Randomized Certifying Graph Non-Isomorphism Algorithm
In: 9th Workshop on Algorithm Engineering and Experiments (ALENEX'07), 150-157
Proceedings Article
1
Hide details for Kwappik [-]Kwappik [-]
1998Exact Linear Programming
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Kwek, Mehlhorn [Kwek]Kwek, Mehlhorn [Kwek]
2003Attachment IconOptimal Search for Rationals
In: Information Processing Letters [86], 23-26
Journal Article
2
Hide details for Lambert [-]Lambert [-]
2001Ein Parametric Search Toolkit
Universität des Saarlandes
Thesis - Masters thesis
2000Parallele und externe Implementierung eines Zusammenhangskomponentenalgorithmus
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Lambert, Sibeyn [Zheng]Lambert, Sibeyn [Zheng]
1999Parallel and External List Ranking and Connected Components on a Cluster of Workstations
In: Proceedings of the 11th International Conference on Parallel and Distributed Computing and Systems (PDCS-99), 454-460
Proceedings Article
1
Hide details for Lang [-]Lang [-]
1994Hidden Line Elimination für iso-orientierte Rechtecke
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Larsson, Gidenstam, Ha, Papatriantafilou, Tsigas [Larsson, Ha, Papatriantafilou, Tsigas]Larsson, Gidenstam, Ha, Papatriantafilou, Tsigas [Larsson, Ha, Papatriantafilou, Tsigas]
2009Multiword Atomic Read/Write Registers on Multiprocessor Systems
In: Journal of experimental algorithmics [13], 7:1-7:30
Electronic Journal Article
1
Hide details for Lars, Bender, Demaine, Leiserson, Mehlhorn (ed.) []Lars, Bender, Demaine, Leiserson, Mehlhorn (ed.) []
2005Cache-Oblivious and Cache-Aware AlgorithmsReport
1
Hide details for Lauer [-]Lauer [-]
1998Design und Implementierung eines Testmanagers für LiDIA
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Laura, Leonardi, Millozzi, Meyer, Sibeyn [Laura, Leonardi, Millozzi, Sibeyn, Di Battista, Zwick]Laura, Leonardi, Millozzi, Meyer, Sibeyn [Laura, Leonardi, Millozzi, Sibeyn, Di Battista, Zwick]
2003Algorithms and Experiments for the Webgraph
In: Algorithms - ESA 2003: 11th Annual European Symposium, 703-714
Proceedings Article
1
Hide details for Lee, Cheong, Kwon, Shin, Chwa [Cheong, Kwon, Shin, Chwa, Paterson]Lee, Cheong, Kwon, Shin, Chwa [Cheong, Kwon, Shin, Chwa, Paterson]
2000Approximation of Curvature-constrained Shortest Paths through a Sequence of Points
In: Algorithms - ESA 2000, Proceedings of the 8th Annual European Symposium (ESA-00), 314-325
Proceedings Article
1
Hide details for Lee, Park, Chwa [Park, Chwa]Lee, Park, Chwa [Park, Chwa]
2000Searching a polygonal room with one door by a 1-searcher
In: International Journal of Computational Geometry and Applications [10], 201-220
Journal Article
1
Hide details for Lee, Shin, Chwa [Shin, Chwa]Lee, Shin, Chwa [Shin, Chwa]
2000Optimal Embedding of Multiple Directed Hamiltonian Rings into d-dimensional Meshes
In: Journal of Parallel and Distributed Computing [60], 775-783
Journal Article
1
Hide details for Lehnert, Schweitzer [Lehnert]Lehnert, Schweitzer [Lehnert]
2007The Co-Word Problem for the Higman-Thompson Group is context-free
In: Bulletin of the London Mathematical Society [39], 235-241
Journal Article
1
Hide details for Leinenbach [-]Leinenbach [-]
1997Eine effiziente Implementierung des Datentyps Polyeder
Universität des Saarlandes
Thesis - Masters thesis
7
Hide details for Lengauer, Mehlhorn [-]Lengauer, Mehlhorn [-]
1986Attachment IconVLSI complexity, efficient VLSI algorithms and the HILL design system
In: Algorithmics for VLSI, 33-89
Part of a Book
1984Attachment IconFour results on the complexity of VLSI computation
In: Advances in Computing Research [2], 1-22
Journal Article
1984Attachment IconThe HILL system: A design environment for the hierarchical spezification, compaction, and simulation of integrated circuit layouts
In: Proceedings, Conference on Advanced Research in VLSI, 139-149
Proceedings Article
1983Four results on the complexity of VLSI computationsReport
1983Attachment IconThe HILL System: A Design Environment for the Hierarchical Specification, Compaction, and Simulation of Integrated Circuit LayoutsReport
1983VLSI Complexity, Efficient VLSI Algorithms and the HILL Design SystemReport
1981On the Complexity of VLSI-Computations
In: VLSI Systems and Computations [??], 89-99
Journal Article
2
Hide details for Lenhof [-]Lenhof [-]
1999Bioinformatik
Universität des Saarlandes
Thesis - Habilitation thesis
1997New contact measures for the protein docking problem
In: Proceedings of the 1st Annual International Conference on Computational Molecular Biology (RECOMB-97), 182-191
Proceedings Article
1
Hide details for Lenhof [Plesser, Wittenberg]Lenhof [Plesser, Wittenberg]
1997Parallel Protein Puzzle: A New Suite of Protein Docking Tools
In: Forschung und wissenschaftliches Rechnen: Beiträge zum Heinz-Billing-Preis 1996, 31-48
Part of a Book
1
Hide details for Lenhof [Schomburg, Lessel]Lenhof [Schomburg, Lessel]
1995An Algorithm for the Protein Docking Problem
In: Bioinformatics: From Nucleic Acids and Proteins to Cell Metabolism, 125-139
Part of a Book
1
Hide details for Lenhof, Morgenstern, Reinert [Morgenstern]Lenhof, Morgenstern, Reinert [Morgenstern]
1999An exact solution for the segment-to-segment multiple sequence alignment problem
In: Bioinformatics [15], 203-210
Journal Article
1
Hide details for Lenhof, Reinert, Vingron [Vingron, Istrail, Pevzner, Waterman]Lenhof, Reinert, Vingron [Vingron, Istrail, Pevzner, Waterman]
1998A polyhedral approach to RNA sequence structure alignment
In: Proceedings of the 2nd Annual International Conference on Computational Molecular Biology (RECOMB-98), 153-162
Proceedings Article
1
Hide details for Lenhof, Reinert, Vingron [Vingron]Lenhof, Reinert, Vingron [Vingron]
1998A Polyhedral Approach to RNA Sequence Structure Alignment
In: Journal of Computational Biology [5], 517-530
Journal Article
6
Hide details for Lenhof, Smid [-]Lenhof, Smid [-]
1995Maintaining the visibility map of spheres while moving the viewpoint
In: Algorithmica [13], 301-312
Journal Article
1995Sequential and parallel algorithms for the k closest pairs problem
In: International Journal of Computational Geometry & Applications [5], 273-288
Journal Article
1994An animation of a fixed-radius all-nearest neighbors algorithm
In: Proceedings of the 10th Symposium on Computational Geometry (SCG94), 387
Proceedings Article
1994Using persistent data structures for adding range restrictions to searching problems
In: RAIRO Theoretical Informatics and Applications [28], 25-49
Journal Article
1993An optimal construction method for generalized convex layers
In: International Journal of Computational Geometry & Applications [3], 245-267
Journal Article
1992Enumerating the k closest pairs optimally
In: 33rd Annual Symposium on Foundations of Computer Science (FOCS92), 380-386
Proceedings Article
1
Hide details for Lenhof, Smid [Hsu, Lee]Lenhof, Smid [Hsu, Lee]
1991An optimal construction method for generalized convex layers
In: ISA'91 Algorithms: 2nd International Symposium on Algorithms, 349-363
Proceedings Article
1
Hide details for Lenhof, Smid [Nurmi, Ukkonen]Lenhof, Smid [Nurmi, Ukkonen]
1992Maintaining the visibility map of speres while moving the viewpoint on a circle at infinity
In: Algorithms Theory - SWAT'92: Third Scandinavian Workshop on Algorithm Theory, 388-398
Proceedings Article
1
Hide details for Lennerz [-]Lennerz [-]
2005Distance Computation for Extended Quadratic Complexes
Universität des Saarlandes
Thesis - PhD thesis
1
Hide details for Lennerz, Schömer [Hiromasa, Ralph]Lennerz, Schömer [Hiromasa, Ralph]
2002Efficient Distance Computation for Quadratic Curves and Surfaces
In: Proceedings of the 2nd Conference on Geometric Modeling and Processing, 60-69
Proceedings Article
2
Hide details for Leonardi, Schäfer [Leonardi]Leonardi, Schäfer [Leonardi]
2004Cross-monotonic cost sharing methods for connected facility location games
In: EC'04 : proceedings of the 5th ACM Conference on Electronic Commerce ; New York, New York, USA, May 17-20, 2004, 242-243
Proceedings Article
2004Cross-monotonic cost sharing methods for connected facility location games
In: Theoretical Computer Science [326], 431-442
Journal Article
1
Hide details for Lermen [-]Lermen [-]
1997Multiple Sequence Alignment
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Lermen, Reinert [Lermen]Lermen, Reinert [Lermen]
2000The practical use of the A* algorithm for exact multiple sequence alignment
In: Journal of Computational Biology [7], 665-671
Journal Article
1
Hide details for Limbach [-]Limbach [-]
2008Attachment IconContinued Work on the Computation of an Exact Arrangement of Quadrics
Universität des Saarlandes
Thesis - Masters thesis
2
Hide details for Loeckx, Mehlhorn, Wilhelm [-]Loeckx, Mehlhorn, Wilhelm [-]
1989Foundations of Programming LanguagesBook
1986Grundlagen der ProgrammiersprachenBook
1
Hide details for Lokshtanov, Saurabh, Wahlström [Lokshtanov, Saurabh, D'Souza, Kavitha, Radhakrishna]Lokshtanov, Saurabh, Wahlström [Lokshtanov, Saurabh, D'Souza, Kavitha, Radhakrishna]
2012Subexponential Parameterized Odd Cycle Transversal on Planar Graphs
In: 32nd International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012), 424-434
Electronic Proceedings Article
1
Hide details for Loock, Schömer [Loock]Loock, Schömer [Loock]
2001A Virtual Environment for Interactive Assembly Simulation: From Rigid Bodies to Deformable Cables
In: Proceedings of the 5th World Multiconference on Systemics, Cybernetics and Informatics (SCI-01): Emergent computing and virtual engineering, 325-332
Proceedings Article
1
Hide details for Lotker, Majumdar, Narayanaswamy, Weber [Lotker, Narayanaswamy, Chen, Lee]Lotker, Majumdar, Narayanaswamy, Weber [Lotker, Narayanaswamy, Chen, Lee]
2006Sequences Characterizing k-Trees
In: Computing and Combinatorics, 12th Annual International Conference, COCOON 2006, 216-225
Proceedings Article
1
Hide details for Lutter [-]Lutter [-]
1996Ein Bewegungsplanungsalgorithmus für zwei Rechtecke mit einem gemeinsamen Eckpunkt
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Lüttke-Hüttmann [-]Lüttke-Hüttmann [-]
2000Knickminimales Zeichnen 4-planarer Clustergraphen
Universität des Saarlandes
Thesis - Masters thesis
1
Show details for Maggs, Vöcking [Maggs]Maggs, Vöcking [Maggs]

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