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: 4. BibTeX Citation Keys

Login to this database


 

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

BibTeX cite keyAuthor/EditorYearTitleType
EadesMutzel1998Eades, Peter
Mutzel, Petra
1998Graph Drawing Algorithms
In: Algorithms and Theory of Computation Handbook, 9-26
Part of a Book
EadesMutzel1999Mutzel, Petra
Eades, Peter
1999Graph Drawing Algorithms
In: Algorithms & Theory of Computation Handbook, 9-1-9-26
Part of a Book
EadMarksMutzelNorth1998Eades, Peter
Marks, Joe
Mutzel, Petra
North, Stephen
1998Graph Drawing Contest Report
In: Proceedings of the 6th International Symposium on Graph Drawing (GD-98), 423-435
Proceedings Article
EBS_09Emeliyanenko, Pavel
Berberich, Eric
Sagraloff, Michael
2009Attachment IconVisualizing Arcs of Implicit Algebraic Curves, Exactly and Fast
In: Advances in Visual Computing : 5th International Symposium, ISVC 2009, 608-619
Proceedings Article
ecg:beh-eeeac-04Berberich, Eric
Eigenwillig, Arno
Hemmer, Michael
Hert, Susan
Kettner, Lutz
Mehlhorn, Kurt
Reichel, Joachim
Schmitt, Susanne
Schömer, Elmar
Weber, Dennis
Wolpert, Nicola
2004EXACUS: Efficient and Exact Algorithms for Curves and SurfacesReport
ecg:fhw-stcca-03Berberich, Eric
Eigenwillig, Arno
Fogel, Efi
Halperin, Dan
Hert, Susan
Kettner, Lutz
Teillaud, Monique
Wein, Ron
2003Specification of the traits classes for CGAL arrangements of curvesReport
ecg:ghh-boscd-03Granados, Miguel
Hachenberger, Peter
Hert, Susan
Kettner, Lutz
Mehlhorn, Kurt
Seel, Michael
2003Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and ImplementationReport
ecg:hks-emfga-04Hemmer, Michael
Kettner, Lutz
Schömer, Elmar
2004Effects of a Modular Filter on Geometric ApplicationsReport
ecg:kmp-cerpg-03Kettner, Lutz
Mehlhorn, Kurt
Pion, Sylvain
Schirra, Stefan
Yap, Chee
2004Classroom Examples of Robustness Problems in Geometric ComputationsReport
EdelkampMeyer2001Edelkamp, Stefan
Meyer, Ulrich
2001Theory and Practice of Time-Space Trade-Offs in Memory Limited Search
In: Proceedings of the Joint German/Austrian Conference on AI: Advances in Artificial Intelligence (KI-01), 169-184
Proceedings Article
Edelsbrunner-Ramos97Edelsbrunner, Herbert
Ramos, Edgar A.
1997Inclusion-exclusion complexes for pseudo-disk collections
In: Discrete and Computational Geometry [17], 287-306
Journal Article
efgk2003Eisenbrand, Friedrich
Funke, Stefan
Garg, Naveen
Könemann, Jochen
2003A Combinatorial Algorithm for Computing a Maximum Independent Set in a t-perfect Graph
In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), 517-522
Proceedings Article
EFK00Eiglsperger, Markus
Fekete, Sandor P.
Klau, Gunnar W.
2001Orthogonal Graph Drawing
In: Drawing Graphs: Methods and Models, 121-171
Part of a Book
EFKM2005Eisenbrand, Friedrich
Funke, Stefan
Karrenbauer, Andreas
Matijevic, Domagoj
2005Attachment IconEnergy-Aware Stage Illumination
In: Proceedings of the 21st Annual Symposium on Computational Geometry : (SCG05), 336-346
Proceedings Article
EFKM2008Eisenbrand, Friedrich
Funke, Stefan
Karrenbauer, Andreas
Matijevic, Domagoj
2008Energy-Aware Stage Illumination
In: International Journal of Computational Geometry and Applications [18], 107-129
Journal Article
eigenwillig-phd-08Eigenwillig, Arno2008Real Root Isolation for Exact and Approximate Polynomials Using Descartes' Rule of Signs
Universität des Saarlandes
Thesis - PhD thesis
Eigenwillig2004aEigenwillig, Arno
Kettner, Lutz
Schömer, Elmar
Wolpert, Nicola
2004Complete, Exact and Efficient Computations with Cubic Curves
In: Proceedings of the Twentieth Annual Symposium on Computational Geometry : (SCG'04), 409-418
Proceedings Article
Eigenwillig2005Eigenwillig, Arno
Kettner, Lutz
Krandick, Werner
Mehlhorn, Kurt
Schmitt, Susanne
Wolpert, Nicola
2005Attachment IconA Descartes algorithm for polynomials with bit-stream coefficients
In: Computer Algebra in Scientific Computing : 8th International Workshop, CASC 2005, 138-149
Proceedings Article
Eigenwillig2006aEigenwillig, Arno
Sharma, Vikram
Yap, Chee K.
2006Attachment IconAlmost Tight Recursion Tree Bounds for the Descartes Method
In: ISSAC '06: Proceedings of the 2006 international symposium on Symbolic and algebraic computation, 71-78
Electronic Proceedings Article
Eigenwillig2007aEigenwillig, Arno2007Attachment IconOn Multiple Roots in Descartes' Rule and Their Distance to Roots of Higher Derivatives
In: Journal of Computational and Applied Mathematics [200], 226-230
Journal Article
Eigenwillig2007bEigenwillig, Arno
Kettner, Lutz
Wolpert, Nicola
2007Attachment IconSnap rounding of Bézier curves
In: Proceedings of the Twenty-Third Annual Symposium on Computational Geometry (SCG'07), 158-167
Proceedings Article
EisenbrandIJCGA2007Eisenbrand, Friedrich
Funke, Stefan
Karrenbauer, Andreas
Reichel, Joachim
Schömer, Elmar
2007Packing a truck - Now with a twist!
In: International Journal of Computational Geometry & Applications [17], 505-527
Journal Article
ek-eae2aoaac-08Eigenwillig, Arno
Kerber, Michael
2008Attachment IconExact and Efficient 2D-Arrangements of Arbitrary Algebraic Curves
In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA08), 122-131
Proceedings Article
ek-vaepaa-08Emeliyanenko, Pavel
Kerber, Michael
2008Attachment IconVisualizing and Exploring Planar Algebraic Arrangements -- a Web Application
In: Proceedings of the 24th ACM Symposium on Computational Geometry, 224-225
Proceedings Article
eksw-eecaccc-06Eigenwillig, Arno
Kettner, Lutz
Schömer, Elmar
Wolpert, Nicola
2006Attachment IconExact, Efficient and Complete Arrangement Computation for Cubic Curves
In: Computational Geometry [35], 36-73
Journal Article
EKSX2006Eisenbrand, Friedrich
Karrenbauer, Andreas
Skutella, Martin
Xu, Chihao
2006Multiline Addressing by Network Flow
In: Algorithms - ESA 2006 : 14th Annual European Symposium, 744-755
Proceedings Article
EKSX2008Eisenbrand, Friedrich
Karrenbauer, Andreas
Skutella, Martin
Xu, Chihao
2009Multiline Addressing by Network Flow
In: Algorithmica [53], 583-596
Journal Article
ekw-fast-2007Eigenwillig, Arno
Kerber, Michael
Wolpert, Nicola
2007Attachment IconFast and Exact Geometric Analysis of Real Algebraic Plane Curves
In: Proceedings of the 2007 International Symposium on Symbolic and Algebraic Computation, 151-158
Proceedings Article
EKX2007Eisenbrand, Friedrich
Karrenbauer, Andreas
Xu, Chihao
2007Algorithms for longer OLED Lifetime
In: WEA 2007, 338-351
Proceedings Article
Elbassioni2000Boros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, Vladimir
2000Attachment IconAn Efficient Incremental Algorithm for Generating All Maximal Independent Sets in Hypergraphs of Bounded Dimension
In: Parallel Processing Letters [10], 14
Journal Article
Elbassioni2001Boros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, Vladimir
Makino, Kazuhisa
2001Attachment IconOn Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities
In: Automata, Languages and Programming, 28th International Colloquium, ICALP 2001, 92-103
Proceedings Article
Elbassioni2002aBoros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, Vladimir
Makino, Kazuhisa
2002Attachment IconDual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities
In: SIAM Journal on Computing [31], 20
Journal Article
Elbassioni2002bBoros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, Vladimir
2002Attachment IconMatroid Intersections, Polymatroid Inequalities, and Related Problems
In: Mathematical Foundations of Computer Science 2002, 27th International Symposium, MFCS 2002, 143-154
Proceedings Article
Elbassioni2002bzBoros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, Vladimir
2002Attachment IconGenerating Dual-Bounded Hypergraphs
In: Optimization Methods and Software [17], 33
Electronic Journal Article
[Replication or Save Conflict]
Elbassioni2002dElbassioni, Khaled M.2002Attachment IconAn Algorithm for Dualization in Products of Lattices and Its Applications
In: Algorithms - ESA 2002, 10th Annual European Symposium, 424-435
Proceedings Article
Elbassioni2003aBoros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, Vladimir
2003Attachment IconAn Inequality for Polymatroid Functions and its Applications
In: Discrete Applied mathematics [131], 27
Journal Article
Elbassioni2003bBoros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, Vladimir
2003Attachment IconExtending the Balas-Yu Bounds on the Number of Maximal Independent Sets in Graphs to Hypergraphs and Lattices
In: Mathematical Programming, Ser. B [98], 14
Journal Article
Elbassioni2003cBoros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir
Khachiyan, Leonid
2003Attachment IconAlgorithms for Enumerating Circuits in Matroids.
In: Algorithms and Computation, 14th International Symposium, ISAAC 2003, 485-494
Proceedings Article
Elbassioni2003dBoros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir
Khachiyan, Leonid
Makino, Kazuhisa
2003Attachment IconAn Intersection Inequality for Discrete Distributions and Related Generation Problems
In: Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, 543-555
Proceedings Article
Elbassioni2003dzElbassioni, Khaled M.
Elmasry, Amr
Kamel, Ibrahim
2003Attachment IconAn Efficient Indexing Scheme for Multi-dimensional Moving Objects
In: Database Theory - ICDT 2003, 9th International Conference, 425-439
Proceedings Article
Elbassioni2003eBoros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, Vladimir
2003Attachment IconAn Efficient Implementation of a Quasi-polynomial Algorithm for Generating Hypergraph Transversals
In: Algorithms - ESA 2003, 11th Annual European Symposium, 556-567
Proceedings Article
Elbassioni2004Elbassioni, Khaled M.2002Attachment IconOn Dualization in Products of Forests.
In: STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, 142-153
Proceedings Article
Elbassioni2004aBoros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir
Khachiyan, Leonid
2004Attachment IconAn Efficient Implementation of a Joint Generation Algorithm
In: Experimental and efficient algorithms : Third International Workshop, WEA 2004, 114-128
Proceedings Article
Elbassioni2004bBoros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir
Khachiyan, Leonid
Makino, Kazuhisa
2004Attachment IconGenerating Paths and Cuts in Multi-pole (Di)graphs
In: Mathematical foundations of computer science 2004 : 29th International Symposium, MFCS 2004, 298-309
Proceedings Article
Elbassioni2004dBoros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir
Khachiyan, Leonid
2004Attachment IconGenerating Maximal Independent Sets for Hypergraphs with Bounded Edge-Intersections
In: LATIN 2004: Theoretical Informatics, 6th Latin American Symposium, 488-498
Proceedings Article
Elbassioni2004eBoros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir
Khachiyan, Leonid
2004Attachment IconEnumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems
In: Integer programming and combinatorial optimization : 10th International IPCO Conference, 152-162
Proceedings Article
Elbassioni2004fMokbel, Mohamed F.
Aref, Walid G.
Elbassioni, Khaled M.
Kamel, Ibrahim
2004Attachment IconScalable Multimedia Disk Scheduling
In: 20th International Conference on Data Engineering, ICDE 2004, 498-509
Proceedings Article
Elbassioni2004gBoros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir
2004Attachment IconAlgorithms for Generating Minimal Blockers of Perfect Matchings in Bipartite Graphs and Related Problems
In: Algorithms – ESA 2004: 12th Annual European Symposium, 122-133
Proceedings Article
Elbassioni2005aElbassioni, Khaled M.
Mustafa, Nabil H.
2005Attachment IconConflict-Free Colorings of Rectangle Ranges for Wireless NetworksUnpublished/Draft
Elbassioni2005dKhachiyan, Leonid
Boros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir
2005A New Algorithm for the Hypergraph Transversal Problem
In: Computing and combinatorics : 11th Annual International Conference, COCOON 2005, 767-776
Proceedings Article
Elbassioni2005eKhachiyan, Leonid
Boros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir
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
Elbassioni2005fKhachiyan, Leonid
Boros, Endre
Borys, Konrad
Elbassioni, Khaled M.
Gurvich, Vladimir
2005Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs
In: Algorithms and computation : 16th International Symposium, ISAAC 2005, 156-165
Proceedings Article
Elbassioni2005gElbassioni, Khaled M.
Katriel, Irit
Kutz, Martin
Mahajan, Meena
2005Simultaneous Matchings
In: Algorithms and computation : 16th International Symposium, ISAAC 2005, 106-115
Proceedings Article
Elbassioni2005jaElbassioni, Khaled M.
Elmasry, Amr
Kamel, Ibrahim
2005An Indexing Method for Answering Queries on Moving Objects
In: Distributed and Parallel Databases [17], 215-249
Journal Article
Elbassioni2005jbKhachiyan, Leonid
Boros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir
Makino, Kazuhisa
2005On the Complexity of Some Enumeration Problems for Matroids
In: SIAM Journal on Discrete Mathematics [19], 966-984
Journal Article
Elbassioni2006Elbassioni, Khaled M.2006On the Complexity of Monotone Boolean Duality TestingReport
Elbassioni2006aKhachiyan, Leonid
Boros, Endre
Borys, Konrad
Elbassioni, Khaled M.
Gurvich, Vladimir
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
Elbassioni2006bElbassioni, Khaled M.
Mustafa, Nabil H.
2006Conflict-Free Colorings of Rectangle Ranges
In: STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, 254-263
Proceedings Article
Elbassioni2006cElbassioni, Khaled M.2006Finding All Minimal Infrequent Multi-dimensional Intervals
In: LATIN 2006: Theoretical Informatics, 7th Latin American Symposium, 423-434
Proceedings Article
Elbassioni2006dElbassioni, Khaled M.2006On the Complexity of the Multiplication Method for Monotone CNF/DNF Dualization
In: Algorithms - ESA 2006, 14th Annual European Symposium, 340-351
Proceedings Article
Elbassioni2006eElbassioni, Khaled M.
Lotker, Zvi
Seidel, Raimund
2006Upper bound on the number of vertices of polyhedra with 0, 1-constraint matrices
In: Information Processing Letters [100], 69 - 71
Journal Article
Elbassioni2006fKhachiyan, Leonid
Boros, Endre
Borys, Konrad
Elbassioni, Khaled M.
Gurvich, Vladimir
Makino, Kazuhisa
2006Enumerating Spanning and Connected Subsets in Graphs and Matroids
In: Algorithms - ESA 2006, 14th Annual European Symposium, 444-455
Proceedings Article
Elbassioni2006gElbassioni, Khaled M.
Fishkin, Aleksei V.
Sitters, Rene
2006On Approximating the TSP with Intersecting Neighborhoods
In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 213-222
Proceedings Article
Elbassioni2007aAjwani, Deepak
Elbassioni, Khaled M.
Govindarajan, Sathish
Ray, Saurabh
2007Conflict-Free Coloring for Rectangle Ranges Using $\tildeO(n^.382+\epsilon)$ Colors
In: 19th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 07), (to-appear)
Proceedings Article
Elbassioni2007bElbassioni, Khaled M.
Sitters, Rene
Zhang, Yan
2007Attachment IconA Quasi-PTAS for Envy-free Pricing on Line GraphsUnpublished/Draft
Elbassioni2007cBoros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir
Makino, Kazuhisa
2007Generating Vertices of Polyhedra and Related Monotone Generation ProblemsUnpublished/Draft
Elbassioni2007dElbassioni, Khaled
Sitters, Rene
Zhang, Yan
2007A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs
In: Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings, 451-462
Proceedings Article
Elbassioni2007eBoros, Endre
Borys, Konrad
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa
Rudolf, Gabor
2007Generating Minimal k-Vertex Connected Spanning Subgraphs
In: Computing and Combinatorics, 13th Annual International Conference, COCOON 2007, Proceedings, 222-231
Proceedings Article
Elbassioni2007fAjwani, Deepak
Elbassioni, Khaled
Govindarajan, Sathish
Ray, Saurabh
2007Conflict-free coloring for rectangle ranges using $n^.382$ colors
In: SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallel Algorithms and Architectures, 181-187
Proceedings Article
Elbassioni2007gKhachiyan, Leonid
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa
2007Enumerating disjunctions and conjunctions of paths and cuts in reliability theory
In: Discrete Applied Mathematics [155], 137-149
Journal Article
Elbassioni2007hKhachiyan, Leonid
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
2007A global parallel algorithm for the hypergraph transversal problem
In: Information Processing Letters [101], 148-155
Journal Article
Elbassioni2007iKhachiyan, Leonid
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa
2007Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data
In: Theoretical Computer Science [379], 361-376
Journal Article
Elbassioni2007jKhachiyan, Leonid
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
2007On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs
In: Theoretical Computer Science [382], 139-150
Journal Article
Elbassioni2008Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Tiwary, Hans Raj
2008Characterization of the vertices and extreme directions of the negative cycle polyhedron and hardness of generating vertices of 0/1-polyhedra
In: CoRR [abs/0801.3790], x-x
Journal Article
Elbassioni2008aTiwary, Hans Raj
Elbassioni, Khaled
2008On the complexity of checking self-duality of polytopes and its relations to vertex enumeration and graph isomorphism
In: Symposium on Computational Geometry 2008, 192-198
Proceedings Article
Elbassioni2008bElbassioni, Khaled
Hagen, Matthias
Rauf, Imran
2008Some Fixed-Parameter Tractable Classes of Hypergraph Duality and Related Problems
In: Parameterized and Exact Computation, Third International Workshop, IWPEC 2008, 91-102
Proceedings Article
Elbassioni2008cBoros, Endre
Elbassioni, Khaled
Makino, Kazuhisa
2008On Berge Multiplication for Monotone Boolean Dualization
In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, 48-59
Proceedings Article
Elbassioni2008dBoros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa
Oudalov, Vladimir
2008A Complete Characterization of Nash-Solvability of Bimatrix Games in Terms of the Exclusion of Certain 2x2 subgames
In: Computer Science - Theory and Applications, Third International Computer Science Symposium in Russia, CSR 2008, 99-109
Proceedings Article
Elbassioni2008eElbassioni, Khaled
Tiwary, Hans Raj
2008On a Cone Covering Problem
In: Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 171-174
Proceedings Article
Elbassioni2008fKhachiyan, Leonid
Boros, Endre
Borys, Konrad
Elbassioni, Khaled
Gurvich, Vladimir
Rudolf, Gabor
Zhao, Jihui
2008On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction
In: Theory Comput. Syst. [43], 204-233
Journal Article
Elbassioni2008gKutz, Martin
Elbassioni, Khaled
Katriel, Irit
Mahajan, Meena
2008Simultaneous matchings: Hardness and approximation
In: J. Comput. Syst. Sci. [74], 884-897
Journal Article
Elbassioni2008hElbassioni, Khaled2008A note on systems with max-min and max-product constraints
In: Fuzzy Sets and Systems [159], 2272-2277
Journal Article
Elbassioni2008iElbassioni, Khaled2008On the complexity of monotone dualization and generating minimal hypergraph transversals
In: Discrete Applied Mathematics [156], 2109-2123
Journal Article
Elbassioni2008jKhachiyan, Leonid
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
2008Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions
In: Discrete Applied Mathematics [156], 2020-2034
Journal Article
Elbassioni2008kKhachiyan, Leonid
Boros, Endre
Borys, Konrad
Elbassioni, Khaled
Gurvich, Vladimir
2008Generating All Vertices of a Polyhedron Is Hard
In: Discrete & Computational Geometry [39], 174-190
Journal Article
Elbassioni2008lElbassioni, Khaled
Tiwary, Hans Raj
2008On Computing the Vertex Centroid of a Polyhedron
In: CoRR [abs/0806.3456], x-x
Journal Article
Elbassioni2008mKhachiyan, Leonid
Boros, Endre
Borys, Konrad
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa
2008Generating Cut Conjunctions in Graphs and Related Problems
In: Algorithmica [51], 239-263
Journal Article
Elbassioni2008nKhachiyan, Leonid
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
2008On Enumerating Minimal Dicuts and Strongly Connected Subgraphs
In: Algorithmica [50], 159-172
Journal Article
Elbassioni2008oElbassioni, Khaled
Elmasry, Amr
Kamel, Ibrahim
2008Indexing Schemes for Multi-dimensional Moving Objects
In: Encyclopedia of GIS, 523-529
Part of a Book
Elbassioni2008pElbassioni, Khaled2009Algorithms for Dualization over Products of Partially Ordered Sets
In: SIAM Journal on Discrete Mathematics [23], 487-510
Journal Article
Elbassioni2009aElbassioni, Khaled
Raman, Rajiv
Ray, Saurabh
Sitters, Rene
2009On the approximability of the maximum feasible subsystem problem with 0/1-coefficients
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 1210-1219
Proceedings Article
Elbassioni2009dBoros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa
2010A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information
In: Integer Programming and Combinatorial Optimization : 14th International Conference, IPCO 2010, 341-354
Proceedings Article
Elbassioni2009ISAACElbassioni, Khaled
Tiwary, Hans Raj
2009Complexity of Approximating the Vertex Centroid of a Polyhedron
In: Algorithms and Computation, 20th International Symposium (ISAAC), 413-422
Proceedings Article
Elbassioni2009xElbassioni, Khaled
Fishkin, Aleksei V.
Sitters, René
2009Approximation algorithms for the Euclidean traveling salesman problem with discrete and continuous neighborhoods
In: International Journal of Computational Geometry & Applications [19], 173-193
Journal Article
Elbassioni2010Canzar, Stefan
Elbassioni, Khaled
Elmasry, Amr
Raman, Rajiv
2010On the Approximability of the Maximum Interval Constrained Coloring Problem
In: Algorithms and Computation : 21st International Symposium, ISAAC 2010. - Pt. II, 168-179
Proceedings Article
Elbassioni2010aElbassioni, Khaled
Chan, Hubert
2010A QPTAS for TSP with Fat Weakly Disjoint Neighborhoods in Doubling Metrics
In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 256-267
Proceedings Article
Elbassioni2010bElbassioni, Khaled
Matijevic, Domagoj
Severdija, Domagoj
2010Guarding 1.5-Dimensional with Demands
In: 26th European Workshop on Computational Geometry (EuroCG 2010), 133-136
Proceedings Article
Elbassioni2010gElbassioni, Khaled
Fouz, Mahmoud
Swamy, Chaitanya
2010Approximation Algorithms for Non-single-minded Profit-Maximization Problems with Limited Supply
In: Internet and Network Economics : 6th International Workshop, WINE 2010, 462-472
Proceedings Article
Elbassioni2010hBoros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa
2010On Nash Equilibria and Improvement Cycles in Pure Positional Strategies for Chess-like and Backgammon-like $n$-person GamesUnpublished/Draft
Elbassioni2010iChristodoulou, George
Elbassioni, Khaled
Fouz, Mahmoud
2010Truthful Mechanisms for Exhibitions
In: Internet and Network Economics : 6th International Workshop, WINE 2010, 170-181
Proceedings Article
Elbassioni2011aElbassioni, Khaled
Tiwary, Hans Raj
2011On a cone covering problem
In: Computational Geometry [44], 129-134
Journal Article
Elbassioni2011dBoros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa
2011A lower bound for discounting algorithms solving two-person zero-sum limit average payoff stochastic gamesUnpublished/Draft
Elbassioni2011eBoros, Endre
Elbassioni, Khaled
Fouz, Mahmoud
Gurvich, Vladimir
Makino, Kazuhisa
Manthey, Bodo
2011Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 147-158
Proceedings Article
Elbassioni2011fCanzar,Stefan
Elbassioni, Khaled
Klau, Gunnar W.
Mestre, Julian
2011On Tree-Constrained Matchings and Generalizations
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 98-109
Proceedings Article
Elbassioni2011gElbassioni, Khaled
Rauf, Imran
Ray, Saurabh
2011Enumerating Minimal Transversals of Geometric Hypergraphs
In: 23rd Canadian Conference on Computational Geometry (CCCG 2011), 437-442
Electronic Proceedings Article
Elbassioni2011hBoros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa
2012Every Stochastic Game with Perfect Information Admits a Canonical Form
In: 2nd International ICST Conference on Game Theory for Networks (GameNets 2011),
Unpublished/Draft
Elbassioni2011iElbassioni, Khaled
Elmasry, Amr
Makino, Kazuhisa
2011Finding Simplices containing the Origin in Two and Three Dimensions
In: International Journal of Computational Geometry & Applications [21], 495-506
Journal Article
Elbassioni2011jChan, T.-H. Hubert
Elbassioni, Khaled
2011A QPTAS for TSP with Fat Weakly Disjoint Neighborhoods in Doubling Metrics
In: Discrete & Computational Geometry [46], 704-723
Journal Article
Elbassioni2011kBoros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Tiwary, Hans Raj
2011The negative cycles polyhedron and hardness of checking some polyhedral properties
In: Annals of Operations Research [188], 63-76
Journal Article
Elbassioni2011lAlthaus, Ernst
Canzar, Stefan
Elbassioni, Khaled
Karrenbauer, Andreas
Mestre, Julian
2011Approximation Algorithms for the Interval Constrained Coloring Problem
In: Algorithmica [61], 342-361
Journal Article
Elbassioni2011mElbassioni, Khaled
Krohn, Erik
Matijevic, Domagoj
Mestre, Julian
Severdija, Domagoj
2011Improved Approximations for Guarding 1.5-Dimensional Terrains
In: Algorithmica [60], 451-463
Journal Article
Elbassioni2011nBoros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa
2012On Nash equilibria and improvement cycles in pure positional strategies for Chess-like and Backgammon-like n-person games
In: Discrete Mathematics [312], 772-788
Journal Article
Elbassioni2012aElbassioni, Khaled
Paluch, Katarzyna
van Zuylen, Anke
2012Simpler Approximation of the Maximum Asymmetric Traveling Salesman Problem
In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, 501-506
Electronic Proceedings Article
Elbassioni2012bElbassioni, Khaled
Tiwary, Hans Raj
2012Complexity of Approximating the Vertex Centroid of a Polyhedron
In: Theoretical Computer Science [421], 56-61
Journal Article
Elbassioni2012cCanzar, Stefan
El-Kebir, Mohammed
Pool, Rene
Elbassioni, Khaled
Malde, Alpeshkumar K.
Mark, Alan E.
Geerke, Daan P.
Stougie, Leen
Klau, Gunnar W.
2012Charge Group Partitioning in Biomolecular Simulation
In: Research in Computational Molecular Biology : 16th Annual International Conference, RECOMB 2012, 29-43
Proceedings Article
Elbassioni2012dElbassioni, Khaled
Rauf, Imran
Ray, Saurabh
??On Enumerating Minimal Transversals of Geometric HypergraphsUnpublished/Draft
Elbassioni2012eElbassioni, Khaled2012A QPTAS for ε-Envy-Free Profit-Maximizing Pricing on Line Graphs
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 513-524
Proceedings Article
Elbassioni2012fElbassioni, Khaled
Fouad, Mohamed
Bertino, Elisa
2012Modeling the Risk & Utility of Information Sharing in Social Networks
In: 2012 ASE/IEEE International Conference on Privacy, Security, Risk and Trust and
2012 ASE/IEEE International Conference on Social Computing : SocialCom/PASSAT 2012, 441-450
Proceedings Article
Elbassioni2012gElbassioni, Khaled
Garg, Naveen
Gupta, Divya
Kumar, Amit
Narula, Vishal
Pal, Arindam
2012Approximation Algorithms for the Unsplittable Flow Problem on Paths and Trees
In: 32nd International Conference on Foundations of Software Technology and Theoretical Computer Science : FSTTCS 2012, 267-275
Electronic Proceedings Article
Elbassioni2012hElbassioni, Khaled
Raman, Rajiv
Ray, Saurabh
Sitters, René
2012On the complexity of the highway problem
In: Theoretical Computer Science [460], 70-77
Journal Article
Elbassioni2012iElbassioni, Khaled
Jeli´c, Slobodan
Matijevi`c, Domagoj
2012The relation of Connected Set Cover and Group Steiner Tree
In: Theoretical Computer Science [438], 96-101
Journal Article
Elbassioni2012jCanzar, Stefan
Elbassioni, Khaled
Klau, Gunnar W.
Mestre, Julian
2011On Tree-Constrained Matchings and GeneralizationsUnpublished/Draft
Elbassioni2012zElbassioni, Khaled
Matijevic, Domagoj
Severdija, Domagoj
2012Guarding 1.5D terrains with demands
In: International Journal of Computer Mathematics [89], 2143-2151
Journal Article
Elbassioni2013aElbassioni, Khaled
Chalermsook, Parinya
Nanongkai, Danupon
Sun, He
2013Multi-Attribute Profit-Maximizing PricingUnpublished/Draft
ElbassioniKatriel2004Elbassioni, Khaled M.
Katriel, Irit
2005Multiconsistency and Robustness with Global Constraints
In: Integration of AI and OR techniques in constraint programming for combinatorial optimization problems : Second International Conference, CPAIOR 2005, 168-182
Proceedings Article
ElbassioniKatriel2006Elbassioni, Khaled M.2006Multiconsistency and Robustness with Global Constraints
In: Constraints [11], 335-352
Journal Article
ElbassioniMestre2009aElbassioni, Khaled M.
Krohn, Erik
Matijevic, Domagoj
Mestre, Julián
Severdija, Domagoj
2009Improved Approximations for Guarding 1.5-Dimensional Terrains
In: Algorithmica [Online First], 1-13
Electronic Journal Article
ElbassioniRauf2010Elbassioni, Khaled
Rauf, Imran
2010Polynomial-time dualization of r-exact hypergraphs with applications in geometry
In: Discrete Mathematics [310], 2356-2363
Journal Article
ElbRau09aElbassioni, Khaled
Rauf, Imran
2010Polynomial-time Dualization of $r$-Exact Hypergraphs with Applications in GeometryUnpublished/Draft
ElKahoui1996El Kahoui, M'hammed1996Attachment IconAn Improved Upper Complexity Bound for the Topology Computation of a Real Algebraic Plane Curve
In: Journal of Complexity [12], 527-544
Journal Article
ElKahoui2000El Kahoui, M'hammed2000Attachment IconDeciding Hopf bifurcations by quantifier elimination in a software-component architecture
In: Journal of Symbolic Computation [30], 161-179
Journal Article
ElKahoui2001El Kahoui, M'hammed2001Attachment IconImproved algorithms for linear complementarity problems arising from collision response
In: Mathematics and Computers in Simulation [56], 69-93
Journal Article
ElKahoui2002aBouziane, Driss
El Kahoui, M'hammed
2002Attachment IconComputation of the dual of a plane projective curve
In: Journal of Symbolic Computation [34], 105-117
Journal Article
ElKahoui2002bEl Kahoui, M'hammed2002Attachment IconOn plane polynomial vector fields and the Poincar\'e problem
In: Electronic Journal of Differential Equations [2002], 1-23
Journal Article
ElKahoui2003El Kahoui, M'hammed2003Attachment IconAn elementary approach to subresultants theory
In: Journal of Symbolic Computation [35], 281-292
Journal Article
ElKahoui2004aEl Kahoui, M'hammed2004Attachment IconContants of derivations in polynomial rings over unique factorization domains
In: Proceedings of the Amercian Mathematical Society [132], 2537-2541
Journal Article
ElKahoui2004bEl Kahoui, M'hammed2004Attachment IconSubresultants and locally nilpotent derivations
In: Linear Algebra and its Applications [380], 253-261
Journal Article
ElKahoui2004cEl Kahoui, M'hammed2004Attachment IconAlgorithms for recognizing coordinates in two variables over UFD's
In: Proceedings of the 2004 International Symposium Symbolic and Algebraic Computation (ISSAC-04), 135-140
Proceedings Article
ElKahoui2005aEl Kahoui, M'hammed2005Attachment IconBirational properties of the gap subresultant varieties
In: Journal of Symbolic Computation [39], 61-71
Journal Article
ElKahoui2005bEl Kahoui, M'hammed2005Attachment Icon$D$-resultant and subresultants
In: Proceedings of the Amercian Mathematical Society [133], 2193-2199
Journal Article
ElKahoui2005cEl Kahoui, M'hammed2005Attachment IconUFDs with commuting linearly independent locally nilpotent derivations
In: Journal of Algebra [289], 446-452
Journal Article
ElKahoui2005dBrown, Christopher
El Kahoui, M'hammed
Novotni, Dominik
Weber, Andreas
2006Attachment IconAlgorithmic methods for investigating equilibria in epidemic modeling
In: Journal of Symbolic Computation [41], 1157-1173
Journal Article
ElKahoui2005eEl Kahoui, M'hammed2008Attachment IconComputing with algebraic curves in generic positionMiscellaneous
ElKahoui2005fEl Kahoui, M'hammed2008Attachment IconPolynomial parametrization of nonsingular algebraic curvesMiscellaneous
ElKahoui2005gEl Kahoui, M'hammed
Rakrak, Said
2007Attachment IconStructure of Groebner bases with respect to block orders
In: Mathematics of Computation [76], 2181-2187
Journal Article
Elmasry2008aElmasry, Amr
Hammad, Abdelrahman
2008Attachment IconInversion-Sensitive Sorting Algorithms in Practice
In: ACM Journal of Experimental Algorithmics [13], 1-18
Journal Article
Elmasry2008bElmasry, Amr
Jensen, Claus
Katajainen, Jyrki
2008Attachment IconMultipartite Priority Queues
In: ACM Transactions on Algorithms [5], 1-19
Journal Article
Elmasry2008cElmasry, Amr
Jensen, Claus
Katajainen, Jyrki
2008Attachment IconTwo New Methods for Constructing Double-Ended Priority Queues from Priority Queues
In: Computing [83], 193-204
Journal Article
Elmasry2008dElmasry, Amr2008Attachment IconViolation Heaps: A Better Substitute for Fibonacci HeapsReport
Elmasry2009Elmasry, Amr2009Attachment IconPairing Heaps with O(log log n) decrease Cost
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 471-476
Proceedings Article
Elmasry2009xElmasry, Amr2009Computing the subset partial order for dense families of sets
In: Information Processing Letters [109], 1082-1086
Journal Article
Elmasry2010Elmasry, Amr2010Pairing heaps, scrambled pairing and square-root trees
In: International Journal of Computer Mathematics [87], 3096-3110
Journal Article
Elmasry2010aElmasry, Amr2010The longest almost-increasing subsequence
In: Information Processing Letters [110], 655-658
Journal Article
Elmasry2010bElmasry, Amr
Jensen, Claus
Katajainen, Jyrki
2010Strictly-regular number system and data structures
In: Algorithm Theory - SWAT 2010 : 12th Scandinavian Symposium and Workshops
on Algorithm Theory, 26-37
Proceedings Article
Elmasry2010cElmasry, Amr
Jensen, Claus
Katajainen, Jyrki
2010The Magic of a Number System
In: Fun with Algorithms : 5th International Conference, FUN 2010, 156-165
Proceedings Article
Elmasry2012Elmasry, Amr
Mehlhorn, Kurt
Schmidt, Jens M.
2012An O(n+m) Certifying Triconnnectivity Algorithm for Hamiltonian Graphs
In: Algorithmica [62], 754-766
Journal Article
Elmasry2013Elmasry, Amr
Mehlhorn, Kurt
Schmidt, Jens M.
2013Every DFS tree of a 3-connected graph contains a contractible edge
In: Journal of Graph Theory [72], 112-121
Journal Article
ElmasryMehlhornSchmidt2010Elmasry, Amr
Mehlhorn, Kurt
Schmidt, Jens M.
2010An $O(m+n)$ Certifying Triconnectivity Algorithm for Hamiltonian Graphs
In: Algorithmica [Online First], 1-13
Electronic Journal Article
ElsaesserS2011Elsaesser, Robert
Sauerwald, Thomas
2011Tight bounds for the cover time of multiple random walks
In: Theoretical Computer Science [412], 2623-2641
Journal Article
emel-gcd-11Emeliyanenko, Pavel2011Attachment IconHigh-performance polynomial GCD computations on graphics processors
In: Proceedings of the 2011 International Conference on High Performance Computing & Simulation (HPCS 2011), 215-224
Proceedings Article
Emel-gtc-10Emeliyanenko, Pavel2010Accelerating Symbolic Computations on NVIDIA Fermi
In: Poster presentation at GTC'10 (NVIDIA research summit), -
Poster
emel-res-2012Emeliyanenko, Pavel2012Attachment IconComputing resultants on Graphics Processing Units: Towards GPU-accelerated computer algebra
In: Journal of Parallel and Distributed Computing [In press], 1-14
Electronic Journal Article
Emel2007Emeliyanenko, Pavel2007Attachment IconVisualization of Points and Segments of Real Algebraic Plane Curves
Universität des Saarlandes
Thesis - Masters thesis
emel_gpgpu_09Emeliyanenko, Pavel2009Attachment IconEfficient Multiplication of Polynomials on Graphics Hardware
In: Advanced Parallel Processing Technologies : 8th International Symposium, APPT 2009, 134-149
Proceedings Article
emel_gpures_2010Emeliyanenko, Pavel2010Attachment IconModular Resultant Algorithm for Graphics Processors
In: Algorithms and Architectures for Parallel Processing : 10th International Conference, ICA3PP 2010. - Pt. 1, 427-440
Proceedings Article
Emminghaus95Emminghaus, Frank1995Effiziente Sortieralgorithmen für den d-dimensionalen Hypercube
Universität des Saarlandes
Thesis - Masters thesis
EMR09Elbassioni, Khaled
Makino, Kazuhisa
Rauf, Imran
2009Attachment IconOn the Readability of Monotone Boolean Formulae
In: Computing and Combinatorics :15th Annual International Conference, COCOON 2009, 496-505
Proceedings Article
EpJeSS12Epstein, Leah
Jez, Lukasz
Sgall, Jiri
van Stee, Rob
2012Attachment IconOnline Scheduling of Jobs with Fixed Start Times on Related Machines
In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 15th International Workshop, APPROX 2012 and 16th International Workshop, RANDOM 2012, 134-145
Proceedings Article
EpKlSt2009Epstein, Leah
Kleiman, Elena
van Stee, Rob
2009Maximizing the Minimum Load: The Cost of Selfishness
In: Internet and Network Economics : 5th International Workshop, WINE 2009, 232-243
Proceedings Article
EpLeSt10Epstein, Leah
Levin, Asaf
van Stee, Rob
2010Attachment IconMax-min online allocations with a reordering buffer
In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010, 336-347
Proceedings Article
EpLeSt11aEpstein, Leah
Levin, Asaf
van Stee, Rob
2011Attachment IconMax-min online allocations with a reordering buffer
In: SIAM Journal on Discrete Mathematics [25], 1230-1250
Journal Article
EpLeSt12Epstein, Leah
Levin, Asaf
van Stee, Rob
2012Attachment IconApproximation Schemes for Packing Splittable Items with Cardinality Constraints
In: Algorithmica [62], 102-129
Journal Article
EpLeSt13Epstein, Leah
Levin, Asaf
van Stee, Rob
2013Attachment IconA unified approach to truthful scheduling on related machines
In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, 1243-1252
Proceedings Article
EpsSte11Epstein, Leah
van Stee, Rob
2011Attachment IconImproved results for a memory allocation problem
In: Theory of Computing Systems [48], 79-92
Journal Article
EpsSte12Epstein, Leah
van Stee, Rob
2012Attachment IconThe price of anarchy on uniformly related machines revisited
In: Information and Computation [212], 37-54
Journal Article
EpsSte2009Epstein, Leah
van Stee, Rob
2010Maximizing the minimum load for selfish agents
In: Theoretical Computer Science [411], 44-57
Journal Article
Epstein2006Epstein, Leah
Kesselman, Alexander
2006On the remote server problem or more about TCP acknowledgments
In: Theoretical Computer Science [369], 285
Journal Article
EpsteinAMMMSS2010Epstein, Leah
Levin, Asaf
Marchetti-Spaccamela, Alberto
Megow, Nicole
Mestre, Julian
Skutella, Martin
Stougie, Leen
2010Universal sequencing on a single machine
In: Integer Programming and Combinatorial Optimization : 14th International Conference, IPCO 2010, 230-243
Proceedings Article
EpStTa2009Epstein, Leah
van Stee, Rob
Tamir, Tami
2009Attachment IconPaging with request sets
In: Theory of Computing Systems [44], 67-81
Journal Article
ES-complexity-12Emeliyanenko, Pavel
Sagraloff, Michael
2012On the Complexity of Solving a Bivariate Polynomial System
In: ISSAC 2012 : Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation, 154-161
Proceedings Article
ESA:EMR09Elbassioni, Khaled
Makino, Kazuhisa
Rauf, Imran
2009Attachment IconOutput-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs
In: Algorithms - ESA 2009 : 17th Annual European Symposium, 143-154
Proceedings Article
esw-sacsee-02Eigenwillig, Arno
Schömer, Elmar
Wolpert, Nicola
2002Sweeping Arrangements of Cubic Segments Exactly and EfficientlyReport
EulerECJ07Doerr, Benjamin
Hebbinghaus, Nils
Neumann, Frank
2007Speeding up Evolutionary Algorithms Through Asymmetric Mutation Operators
In: Evolutionary Computation [15], 401-410
Journal Article
FanghaenelGHV2013Fanghänel, Alexander
Geulen, Sascha
Hoefer, Martin
Vöcking, Berthold
2013Online Capacity Maximization in Wireless Networks
In: Journal of Scheduling [16], 81-91
Journal Article
Farzan2010Farzan, Arash
Gagie, Travis
Navarro, Gonzalo
2010Entropy-Bounded Representation of Point Grids
In: Algorithms and Computation : 21st International Symposium, ISAAC 2010. - Pt. II, 327-338
Proceedings Article
Farzan2010aBlelloch, Guy E.
Farzan, Arash
2010Succinct Representations of Separable Graphs
In: Combinatorial Pattern Matching : 21st Annual Symposium, CPM 2010, 138-150
Proceedings Article
FarzanDynamic2011Farzan, Arash
Munro, J. Ian
2011Succinct representation of dynamic trees
In: Theoretical Computer Science [412], 2668-2678
Journal Article
Fatourou2000Fatourou, Panagiota
Spirakis, Paul G.
2000Attachment IconEfficient Scheduling of Strict Multithreaded Computations
In: Theory of Computing Systems [33], 173-232
Journal Article
FBVI2011Friedrich, Tobias
Bringmann, Karl
Voss, Thomas
Igel, Christian
2011The Logarithmic Hypervolume Indicator
In: FOGA'11 : Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, 81-92
Proceedings Article
Feld98Feld, Thomas1998Analyse und Implementierung von Algorithmen zum Minimum Cost Circulation Problem
Universität des Saarlandes
Thesis - Masters thesis
FeldmannBachelor2012Feldmann, Matthias2012Stochastic optimization with fitness proportional ant systems

Universität des Saarlandes
Thesis - Bachelor thesis
Fellows2012Fellows, Michael R.
Hermelin, Danny
Rosamond, Fraces A.
2012Well Quasi Orders in Subclasses of Bounded Treewidth Graphs and Their Algorithmic Applications
In: Algorithmica [64], 3-18
Journal Article
FellowsFertinHermelinVialette2011Fellows, Michael R.
Fertin, Guillaume
Hermelin, Danny
Vialette, Stephane
2011Upper and lower bounds for finding connected motifs in vertex-colored graphs
In: Journal of Computer and System Sciences [77], 799-811
Journal Article
FellowsFriedrichHermelinEtAL2011Fellows, Michael R.
Friedrich, Tobias
Hermelin, Danny
Narodytska, Nina
Rosamond, Frances A.
2011Constraint Satisfaction Problems: Convexity Makes All Different Constraints Tractable
In: Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (IJCAI 2011), 522-527
Proceedings Article
FellowsHatrmanHermelinEtAl2011Fellows, Michael R.
Hartman, Tzvika
Hermelin, Danny
Landau, Gad M.
Rosamond, Frances A.
Rozenberg, Liat
2011Haplotype Inference Constrained by Plausible Haplotype Data
In: IEEE/ACM Transactions on Computational Biology and Bioinformatics [8], 1692-1699
Journal Article
FernauFominLokshtanovMnichPhilipSaurabh2010Fernau, Henning
Fomin, Fedor V.
Lokshtanov, Daniel
Mnich, Matthias
Philip, Geevarghese
Saurabh, Saket
2011Attachment IconRanking and Drawing in Subexponential Time
In: Combinatorial Algorithms - 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers,
Proceedings Article
FernauFominPhilipSaurabh2010Fernau, Henning
Fomin, Fedor V.
Philip, Geevarghese
Saurabh, Saket
2010Attachment IconThe Curse of Connectivity: $t$-Total Vertex (Edge) Cover
In: Computing and Combinatorics, 16th Annual International Conference, COCOON 2010, Nha Trang, Vietnam, July 19-21, 2010. Proceedings, 34-43
Proceedings Article
FerraginaGrossSIAMJCOMPUT1998Ferragina, Paolo
Gross, Roberto
1998Optimal On-Line Search and Sublinear Time Update in String Matching
In: SIAM Journal on Computing [27], 713-736
Journal Article
fffmo-eropmoffsi-14Fekete, Sándor P.
Fiethe, Björn
Friedrichs, Stephan
Michalik, Harald
Orlis, Christos
2014Efficient reconfiguration of processing modules on FPGAs for space instruments
In: Adaptive Hardware and Systems (AHS), 2014 NASA/ESA Conference on, 15-22
Proceedings Article
ffks-ffagp-13Fekete, Sándor P.
Friedrichs, Stephan
Kröller, Alexander
Schmidt, Christiane
2013Facets for Art Gallery Problems
In: Computing and Combinatorics, 208-220
Proceedings Article
FH08Friedrich, Tobias
Hebbinghaus, Nils
2008Average Update Times for Fully-Dynamic All-Pairs Shortest Paths.
In: Proceedings of the 19th International Symposium on Algorithms and Computation (ISAAC 2008), 693-704
Proceedings Article
FHHNW10Friedrich, Tobias
He, Jun
Hebbinghaus, Nils
Neumann, Frank
Witt, Carsten
2010Approximating Covering Problems by Randomized Search Heuristics using Multi-Objective Models
In: Evolutionary Computation [18], 617 - 633
Journal Article
FHN10Friedrich, Tobias
Hebbinhaus, Nils
Neumann, Frank
2010Plateaus Can Be Harder in Multi-Objective Optimization
In: Theoretical Computer Science [411], 854-864
Journal Article
FHP2009Fountoulakis, Nikolaos
Huber, Anna
Panagiotou, Konstantinos
2009Brief Announcement: The Speed of Broadcasting in Random Networks - Density Does Not Matter
In: Distributed Computing : 23rd International Symposium, DISC 2009, 529-530
Proceedings Article
FHPInfocom10Fountoulakis, Nikolaos
Huber, Anna
Panagiotou, Konstantinos
2010Reliable broadcasting in random networks and the effect of density
In: 2010 Proceedings IEEE INFOCOM, 2552-2560
Proceedings Article
Fialko97Fialko, Sergej1997Das planare Augmentierungsproblem
Universität des Saarlandes
Thesis - Masters thesis
FinkDipl01Fink, Christian2001Oberflächenrekonstruktion von planaren Konturen
Universität des Saarlandes
Thesis - Masters thesis
Finkler-Diss97Finkler, Ulrich1997Design of Efficient and Correct Algorithms: Theoretical Results and Runtime Prediction of Implementations in Practice
Universität des Saarlandes
Thesis - PhD thesis
Finkler-et-al96Calinescu, Gruia
Fernandes, Cristina G.
Finkler, Ulrich
Karloff, Howard
1996A better approximation algorithm for finding planar subgraphs
In: 7th ACM-SIAM Symposium on Discrete Algorithms (SODA96), 16-25
Proceedings Article
Finkler-et-al97Calinescu, Gruia
Fernandes, Cristina G.
Finkler, Ulrich
Karloff, Howard
1998A Better Approximation Algorithm for Finding Planar Subgraphs
In: Journal of Algorithms [27], 269-302
Journal Article
Finkler-Mehlhorn97Finkler, Ulrich
Mehlhorn, Kurt
1997Runtime Prediction of Real Programs on Real Machines
In: Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-97), 380-389
Proceedings Article
FK2006Funke, Stefan
Klein, Christian
2006Attachment IconHole Detection or: "How Much Geometry Hides in Connectivity?"
In: Proceedings of the 22nd Annual Symposium on Computational Geometry, SCG'06, 377-385
Proceedings Article
FKesselmanMeyerS2006Funke, Stefan
Kesselman, Alexander
Meyer, Ulrich
Segal, Michael
2006A Simple Improved Distributed Algorithm for Minimum CDS in Unit Disk Graphs
In: ACM Transactions on Sensor Networks [2], 444-453
Journal Article
FKKLS07Funke, Stefan
Kesselman, Alexander
Kuhn, Fabian
Lotker, Zvi
Segal, Michael
2007Attachment IconImproved approximation algorithms for connected sensor cover
In: Wireless Networks [13], 153-164
Journal Article
FKKMS02Fotakis, Dimitris
Kontogiannis, Spyros
Koutsoupias, Elias
Mavronicolas, Marios
Spirakis, Paul G.
2002Attachment IconThe Structure and Complexity of Nash Equilibria for a Selfish Routing Game
In: Automata, Languages and Programming : 29th International Colloquium, ICALP 2002, 123-134
Proceedings Article
FKLS2004Funke, Stefan
Kesselman, Alexander
Lotker, Zvi
Segal, Michael
2004Improved Approximation Algorithms for Connected Sensor Cover
In: Ad-hoc, mobil and wireless networks : Third International Conference, ADHOC-NOW 2004, 56-69
Proceedings Article
FKMcEJC2010Fountoulakis, Nikolaos
Kang, Ross
McDiarmid, Colin
2010The t-stability number of a random graph
In: The Electronic Journal of Combinatorics [17], R59,1-R59,29
Electronic Journal Article
FKMS2005Funke, Stefan
Klein, Christian
Mehlhorn, Kurt
Schmitt, Susanne
2005Attachment IconControlled Perturbation for Delaunay Triangulations
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 1047-1056
Proceedings Article
FKMS2005bFunke, Stefan
Kesselman, Alexander
Meyer, Ulrich
Segal, Michael
2005A Simple Improved Distributed Algorithm for Minimum CDS in Unit Disk Graphs
In: 1st IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob 2005), 220-223
Proceedings Article
fkw-eevsopcowsn-14Friedrichs, Stephan
Kulau, Ulf
Wolf, Lars
2014Energy-efficient voltage scheduling of peripheral components on wireless sensor nodes
In: Communications Workshops (ICC), 2014 IEEE International Conference on, 860-865
Proceedings Article
FL2007Funke, Stefan
Laue, Sören
2007Attachment IconBounded-Hop Energy-Efficient Broadcast in Low-Dimensional Metrics Via Coresets
In: STACS 2007 : 24th Annual Symposium on Theoretical Aspects of Computer Science, 272-283
Proceedings Article
Flash-WEA-2008Ajwani, Deepak
Malinger, Itay
Meyer, Ulrich
Toledo, Sivan
2008Characterizing the Performance of Flash Memory Storage Devices and Its Impact on Algorithm Design
In: Proc. 7th Intern. Workshop on Experimental Algorithms (WEA), 208-219
Proceedings Article
Fleischer-FUN-1999Fleischer, Rudolf1999FUN with implementing algorithms
In: Proceedings of the International Conference on FUN with Algorithms (FUN-98), 88-98
Proceedings Article
Fleischer-Jung-Mehlhorn95Fleischer, Rudolf
Jung, Hermann
Mehlhorn, Kurt
1995A communication-randomness tradeoff for two-processor systems
In: Information and Computation [116], 155-161
Journal Article
Fleischer1998bahncardFleischer, Rudolf1998On the Bahncard problem
In: Proceedings of the 4th International Conference on Computing and Combinatorics (COCOON-98), 65-74
Proceedings Article
Fleischer1999Fleischer, Rudolf1999Effiziente und Online-Algorithmen
Universität des Saarlandes
Thesis - Habilitation thesis
Fleischer96Fleischer, Rudolf1996A simple balanced search tree with $O(1)$ worst-case update time
In: International Journal of Foundations of Computer Science [7], 137-149
Journal Article
FleischerSkutella2003Fleischer, Lisa
Skutella, Martin
2003Attachment IconMinimum Cost Flows Over Time without Intermediate Storage
In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), 66-75
Proceedings Article
Fleischer_dectrees_1999Fleischer, Rudolf1999Decision trees: old and new results
In: Information and computation [152], 44-61
Journal Article
FLN2007Funke, Stefan
Laue, Sören
Naujoks, Rouven
2007Minimum Energy Broadcast with Few Senders
In: Distributed Computing in Sensor Systems : Third IEEE International Conference, DCOSS 2007, 404-416
Proceedings Article
FLNL2008Funke, Stefan
Laue, Sören
Naujoks, Rouven
Lotker, Zvi
2008Power Assignment Problems in Wireless Communication: Covering Points by Disks, Reaching few Receivers Quickly, and Energy-Efficient Travelling Salesman Tours
In: Distributed Computing in Sensor Systems, 4th IEEE International Conference, DCOSS 2008, 282-295
Proceedings Article
fm-lalokfgc-00Funke, Stefan
Mehlhorn, Kurt
2000Attachment IconLOOK - a Lazy Object-Oriented Kernel for Geometric Computation
In: Proceedings of the 16th Annual Symposium on Computational Geometry (SCG-00), 156-165
Proceedings Article
fm-look-2002Funke, Stefan
Mehlhorn, Kurt
2002LOOK - A Lazy Object-Oriented Kernel for Geometric Computation
In: Computational Geometry - Theory and Applications [22], 99-118
Journal Article
FM2007Funke, Stefan
Milosavljevic, Nikola
2007Network Sketching or: "How much Geometry hides in Connectivity? - Part II"
In: Proceedings of the eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-07), 958-967
Proceedings Article
FM2007bFunke, Stefan
Milosavljevic, Nikola
2007Guaranteed-delivery Geographic Routing under Uncertain Node Locations
In: IEEE INFOCOM 2007 : 26th IEEE International Conference on Computer Communications, 1244-1252
Proceedings Article
FM97Fialko, Sergej
Mutzel, Petra
1998A new approximation algorithm for the planar augmentation problem
In: Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-98), 260-269
Proceedings Article
FMMW2006Funke, Stefan
Malamatos, Theocharis
Matijevic, Domagoj
Wolpert, Nicola
2006Attachment Icon(Approximate) Conic Nearest Neighbors and the induced Voronoi Diagram
In: 18th Canadian Conference on Computational Geometry, 23-26
Proceedings Article
FMN1999Funke, Stefan
Mehlhorn, Kurt
Näher, Stefan
1999Attachment IconStructural Filtering: a Paradigm for Efficient and Exact Geometric Programs
In: Abstracts for the 11th Canadian Conference on Computational Geometry (CCCG-99), 39-42
Proceedings Article
FMR2004Funke, Stefan
Malamatos, Theocharis
Ray, Rahul
2004Finding Planar Regions in a Terrain: In Practice and with a Guarantee
In: Proceedings of the Twentieth Annual Symposium on Computational Geometry : (SCG'04), 96-105
Proceedings Article
FMR2004bFunke, Stefan
Malamatos, Theocharis
Ray, Rahul
2004Finding Planar Regions in a Terrain
In: 20th European Workshop on Computational Geometry (EWCG), 1-4
Proceedings Article
FMS2003Funke, Stefan
Matijevic, Domagoj
Sanders, Peter
2003Attachment IconApproximating Energy Efficient Paths in Wireless Multi-hop Networks
In: Algorithms - ESA 2003: 11th Annual European Symposium, 230-241
Proceedings Article
FMS2004Funke, Stefan
Matijevic, Domagoj
Sanders, Peter
2004Attachment IconConstant Time Queries for Energy Efficient Paths in Multi-Hop Wireless Networks
In: First International Workshop on Algorithms for Wireless and Mobile Networks, 97-111
Proceedings Article
FNPS02Fotakis, Dimitris
Nikoletseas, Sotiris
Papadopoulou, Vicky
Spirakis, Paul G.
2002Attachment IconRadiocolorings in Periodic Planar Graphs: PSPACE-Completeness and Efficient Approximations for the Optimal Range of Frequencies
In: Graph-Theoretic Concepts in Computer Science : 28th International Workshop, WG 2002, 223-234
Proceedings Article
FOCS::DietzfelbingerKMHRT1988Dietzfelbinger, Martin
Karlin, Anna
Mehlhorn, Kurt
Meyer auf der Heide, Friedhelm
Rohnert, Hans
Tarjan, Robert E.
1988Dynamic Perfect Hashing: Upper and Lower Bounds
In: 29th Annual Symposium on Foundations of Computer Science (FOCS 1988), 524-531
Proceedings Article
FOCS::MehlhornNR1989Mehlhorn, Kurt
Näher, Stefan
Rauch, Monika
1989On the Complexity of a Game Related to the Dictionary Problem
In: 30th Annual Symposium on Foundations of Computer Science (FOCS 1989), 546-548
Proceedings Article
FollertSchoemerSellenSmidThiel97Follert, Frank
Schömer, Elmar
Sellen, Jürgen
Smid, Michiel
Thiel, Christian
1997Computing the largest empty anchored cylinder, and related problems
In: International Journal of Computational Geometry and Applications [7], 563-580
Journal Article
FominLokshtanovMisraPhilipSaurabh2011Fomin, Fedor V.
Lokshtanov, Daniel
Misra, Neeldhara
Philip, Geevarghese
Saurabh, Saket
2011Attachment IconHitting forbidden minors: Approximation and Kernelization
In: 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany, 189-200
Proceedings Article
FominPhilipVillanger2011Fomin, Fedor V.
Philip, Geevarghese
Villanger, Yngve
2011Attachment IconMinimum Fill-in of Sparse Graphs: Kernelization and Approximation
In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India, 164-175
Proceedings Article
FormalVerificationofCertifyingComputationsAlkassar, Eyad
Böhme, Sascha
Mehlhorn, Kurt
Rizkallah, Christine
2011Verification of Certifying Computations
In: Computer Aided Verification : 23rd International Conference, CAV 2011, 67-82
Proceedings Article
FOSW08Friedrich, Tobias
Oliveto, Pietro
Sudholt, Dirk
Witt, Carsten
2008Theoretical Analysis of Diversity Mechanisms for Global Exploration
In: Proceedings of the 10th annual conference on Genetic and evolutionary computation (GECCO 2008), 945-952
Proceedings Article
Fot03Fotakis, Dimitris2003Attachment IconOn the Competitive Ratio for Online Facility Location
In: Automata, languages and programming : 30th International Colloquium, ICALP 2003, 637-652
Proceedings Article
Fotakis2004aFotakis, Dimitris2004Attachment IconIncremental Algorithms for Facility Location and k-Median
In: Algorithms – ESA 2004: 12th Annual European Symposium, 347-358
Proceedings Article
Fountoulakis2007Fountoulakis, Nikolaos
Reed, Bruce
2007Faster Mixing and Small Bottlenecks
In: Probability Theory and Related Fields [137], 475-486
Journal Article
Fountoulakis2008Fountoulakis, Nikolaos
Reed, Bruce
2008The evolution of the mixing rate of a simple random walk on the giant component of a random graph
In: Random Structures and Algorithms [33], 68-86
Journal Article
Fountoulakis2008aCooley, Oliver
Fountoulakis, Nikolaos
Kühn, Daniela
Osthus, Deryk
20083-Uniform hypergraphs of bounded degree have linear Ramsey numbers
In: Journal of Combinatorial Theory B [98], 484-505
Journal Article
Fountoulakis2008bFountoulakis, Nikolaos
Kühn, Daniela
Osthus, Deryk
2008The order of the largest complete minor in a random graph
In: Random Structures and Algorithms [33], 127-141
Journal Article
Fountoulakis2009Cooley, Oliver
Fountoulakis, Nikolaos
Kühn, Daniela
Osthus, Deryk
2009Embeddings and Ramsey numbers of sparse k-uniform hypergraphs
In: Combinatorica [29], 263-297
Journal Article
Fountoulakis2009aFountoulakis, Nikolaos2007Percolation on sparse random graphs with given degree sequence
In: Internet Mathematics [4], 329-356
Journal Article
Fountoulakis2009bFountoulakis, Nikolaos
Kühn, Daniela
Osthus, Deryk
2009Minors in random regular graphs
In: Random Structures and Algorithms [35], 444-463
Journal Article
Fountoulakis2011Fountoulakis, Nikolaos
Panagiotou, Konstantinos
20113-Connected Cores In Random Planar Graphs
In: Combinatorics, Probability & Computing [20], 381-412
Journal Article
FountoulakisHuberPanagiotouBrief2010Fountoulakis, Nikolaos
Huber, Anna
Panagiotou, Konstantinos
2009The Speed of Broadcasting in Random Networks: Density Does Not Matter
In: 23rd International Symposium on Distributed Computing (DISC '09), 529-530
Proceedings Article
FountoulakisKhoslaPanagiotou2010Fountoulakis, Nikolaos
Khosla, Megha
Panagiotou, Konstantinos
2011The Multiple-orientability Thresholds for Random Hypergraphs
In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), 1222-1236
Proceedings Article
FountoulakisPS12Fountoulakis, Nikolaos
Panagiotou, Konstantinos
Sauerwald, Thomas
2012Ultra-fast rumor spreading in social networks
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 1642-1660
Proceedings Article
FouzDiss2012Fouz, Mahmoud2012Randomized Rumor Spreading in Social Networks & Complete Graphs
Universität des Saarlandes
Thesis - PhD thesis
FP12RSAFountoulakis, Nikolaos
Panagiotou, Konstantinos
2012Tight Load Thresholds for Cuckoo Hashing
In: Random Structures and Algorithms [41], 306-333
Journal Article
FPIcalp2010Fountoulakis, Nikolaos
Panagiotou, Konstantinos
2010Orientability of random hypergraphs and the power of multiple choices
In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010. - Pt. 1, 348-359
Proceedings Article
FPRandom10Fountoulakis, Nikolaos
Panagiotou, Konstantinos
2010Rumor spreading on random regular graphs and expanders
In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 13th Internationa lWorkshop, APPROX 2010 and 14th International Workshop, RANDOM 2010, 560-573
Proceedings Article
FPSS03Fotakis, Dimitris
Pagh, Rasmus
Sanders, Peter
Spirakis, Paul G.
2003Attachment IconSpace Efficient Hash Tables with Worst Case Constant Access Time
In: Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2003), 271-282
Proceedings Article
FPSSICOMP2013Fountoulakis, Nikolaos
Panagiotou, Konstantinos
2013On the Insertion Time of Cuckoo Hashing
In: SIAM Journal on Computing [?], ?-?
Journal Article
fr-rcwcae-01Funke, Stefan
Ramos, Edgar A.
2001Reconstructing a Collection of Curves with Corners and Endpoints
In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-01), 344-353
Proceedings Article
fr-ssrinlt-02Funke, Stefan
Ramos, Edgar A.
2002Smooth-Surface Reconstruction in Near-Linear Time
In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-02), 781-790
Proceedings Article
FredericksonSolis-Oba98Frederickson, Greg N.
Solis-Oba, Roberto
1998Algorithms for Measuring Perturbability in Matroid Optimization
In: Combinatorica [18], 503-518
Journal Article
FredmanKhachiyan96Fredman, Michael
Khachiyan, Leonid
1996On the Complexity of Dualization of Monotone Disjunctive Normal Forms
In: J. Algorithms [21], 618-628
Journal Article
Friedrich2005Friedrich, Tobias2005Attachment IconDeterministic Random Walks on Infinite Grids
Friedrich-Schiller-Universität Jena
Thesis - Masters thesis
Friedrich2009Friedrich, Tobias
Gairing, Martin
Sauerwald, Thomas
2010Quasirandom Load Balancing
In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1620-1629
Proceedings Article
FriedrichDAM2011Friedrich, Tobias
Hebbinghaus, Nils
2011Average update times for fully-dynamic all-pairs shortest paths
In: Discrete Applied Mathematics [159], 1751-1758
Journal Article
FriedrichGS2012Friedrich, Tobias
Gairing, Martin
Sauerwald, Thomas
2012Quasirandom Load Balancing
In: SIAM Journal on Computing [41], 747-771
Journal Article
FriedrichKN2011Friedrich, Tobias
Kroeger, Trent
Neumann, Frank
2012Weighted preferences in evolutionary multi-objective optimization
In: International Journal of Machine Learning and Cybernetics [Online First], 1-10
Electronic Journal Article
FriedrichOSW2009Friedrich, Tobias
Oliveto, Pietro
Sudholt, Dirk
Witt, Carsten
2009Analysis of Diversity-Preserving Mechanisms for Global Exploration
In: Evolutionary Computation [17], 455-476
Journal Article
FriedrichPhD2007Friedrich, Tobias2007Use and Avoidance of Randomness
Universität des Saarlandes
Thesis - PhD thesis
FriedrichRGG2010Bradonjić, Milan
Elsässer, Robert
Friedrich, Tobias
Sauerwald, Thomas
Stauffer, Alexandre
2010Efficient Broadcast on Random Geometric Graphs
In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1412-1421
Proceedings Article
FriedrichRSA2011Friedrich, Tobias
Sauerwald, Thomas
Vilenchik, Dan
2011Smoothed analysis of balancing networks
In: Random Structures & Algorithms [39], 115-138
Journal Article
FriedrichSauerwald2010Friedrich, Tobias
Sauerwald, Thomas
2010The Cover Time of Deterministic Random Walks
In: Computing and Combinatorics : 16th Annual International Conference, COCOON 2010, 130-139
Proceedings Article
FriedrichSauerwald2010EJCFriedrich, Tobias
Sauerwald, Thomas
2010The Cover Time of Deterministic Random Walks
In: The Electronic Journal of Combinatorics [17], R167,1-R167,30
Electronic Journal Article
FriedrichSauerwaldVilenchik09Friedrich, Tobias
Sauerwald, Thomas
Vilenchik, Dan
2009Smoothed Analysis of Balancing Networks
In: Automata, Languages and Programming : 36th International Colloquium, ICALP 2009, 472-483
Proceedings Article
FriedrichSS11Friedrich, Tobias
Sauerwald, Thomas
Stauffer, Alexandre
2011Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary Dimensions
In: 22nd International Symposium on Algorithms and Computation (ISAAC-11), 190-199
Proceedings Article
FriedrichTCS2011Friedrich, Tobias
Horoba, Christian
Neumann, Frank
2011Illustration of fairness in evolutionary multi-objective optimization
In: Theoretical Computer Science [412], 1546-1556
Journal Article
Fries2000Fries, Markus2000Implementation of a Dynamic Convex Hull Algorithm in Arbitrary Dimension
Universität des Saarlandes
Thesis - Masters thesis
FriesDipl01Fries, Markus2001Implementation of a Dynamic Convex Hall Algorithm in Arbitrary Dimension
Universität des Saarlandes
Thesis - Masters thesis
FrietalECJ2009Friedrich, Tobias
He, Jun
Hebbinghaus, Nils
Neumann, Frank
Witt, Carsten
2009Analyses of Simple Hybrid Algorithms for the Vertex Cover Problem
In: Evolutionary Computation, [17], 3-19
Journal Article
Frigioni-et-al-98Frigioni, Daniele
Miller, Tobias
Nanni, Umberto
Pasqualone, Giulio
Schäfer, Guido
Zaroliagis, Christos
1998An experimental study of dynamic algorithms for directed graphs
In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), 368-380
Proceedings Article
FriHebNeuTCS2009Friedrich, Tobias
Hebbinghaus, Nils
Neumann, Frank
2009Comparison of Simple Diversity Mechanisms on Plateau Functions
In: Theoretical Computer Science [410], 2455-2462
Journal Article
FriHorNeuGECCO2009Friedrich, Tobias
Horoba, Christian
Neumann, Frank
2009Multiplicative Approximations and the Hypervolume Indicator
In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 571-578
Proceedings Article
FriHorNeuPPSN2008Friedrich, Tobias
Horoba, Christian
Neumann, Frank
2008Runtime Analyses for Using Fairness in Evolutionary Multi-Objective Optimization
In: Parallel Problem Solving from Nature (PPSN X), 671-680
Proceedings Article
FriNeuCEC2008Friedrich, Tobias
Neumann, Frank
2008When to Use Bit-wise Neutrality
In: IEEE Congress on Evolutionary Computation 2008, 997-1003
Proceedings Article
FriNeuNat2009Friedrich, Tobias
Neumann, Frank
2010When to Use Bit-Wise Neutrality
In: Natural Computing [9], 283 - 294
Journal Article
FroylandKMDW08Froyland, Gary
Koch, Thorsten
Megow, Nicole
Duane, Emily
Wren, Howard
2008Optimizing the Landside Operation of a Container Terminal
In: OR Spectrum [30], 53-75
Journal Article
fs-rsm-01Fuhrmann, Artur
Schömer, Elmar
2001A General Method for Computing the Reachable Space of Mechanisms
In: Proceedings of the 2001 ASME Design Engineering Technical Conferences and Computers and Information in Engineering Conference. - Vol. 2, 27th Design Automation Conference (DETC'01), DAC-21057
Proceedings Article
FS09Friedrich, Tobias
Sauerwald, Thomas
2009Near-Perfect Load Balancing by Randomized Rounding
In: STOC09 : Proceedings of the 2009 ACM International Symposium on Theory of Computing, 121-130
Proceedings Article
FS2002aFotakis, Dimitris
Spirakis, Paul G.
2002Attachment IconMinimum Congestion Redundant Assignments to Tolerate Random Faults
In: Algorithmica [32], 396-422
Journal Article
FuGui2006Funke, Stefan
Guibas, Leonidas
Nguyen, An
Wang, Yusu
2006Distance-Sensitive Information Brokerage in Sensor Networks
In: Distributed Computing in Sensor Systems, Second IEEE International Conference, DCOSS 2006, 234-251
Proceedings Article
Funke1998Burnikel, Christoph
Funke, Stefan
Seel, Michael
1998Exact Geometric Predicates using Cascaded Computation
In: Proceedings of the 14th International Annual ACM Symposium on Computational Geometry (SCG-98), 175-183
Proceedings Article
Funke2007Aronov, Boris
Asano, Tetsuo
Funke, Stefan
2007Optimal Triangulation with Steiner Points
In: Algorithms and Computation : 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007. Proceedings, 681-691
Proceedings Article
Funke97Funke, Stefan1997Exact Arithmetic using Cascaded Computation
Universität des Saarlandes
Thesis - Masters thesis
FunkeDiss2001Funke, Stefan2001Combinatorial Curve Reconstruction and the Efficient Exact Implementation of Geometric Algorithms
Universität des Saarlandes
Thesis - PhD thesis
FunkeHD2005Funke, Stefan2005Topological Hole Detection in Wireless Sensor Networks and its Applications
In: 3rd ACM/SIGMOBILE International Workshop on foundations of Mobile Computing (DIAL-M-POMC), 44-53
Proceedings Article
FunkeIE2005Funke, Stefan
Milosavljevic, Nikola
2005Infrastructure-Establishment from Scratch in Wireless Sensor Networks
In: Distributed computing in sensor systems : First IEEE International Conference, DCOSS 2005, 354-367
Proceedings Article
FunkeLaueLotkerNaujoks2006Funke, Stefan
Laue, Sören
Naujoks, Rouven
Lotker, Zvi
2006Power Assignment Problems in Wireless Communication
In: ??? [?], 1-14
Miscellaneous
FunkeRauf07Funke, Stefan
Rauf, Imran
2007Information Brokerage Via Location-Free Double Rulings
In: Ad-Hoc, Mobile, and Wireless Networks : 6th International Conference, ADHOC-NOW 2007, Morelia, Mexico, September 24-26, 2007, Proceedings, 87-100
Proceedings Article
F.Sibeyn-ActaInformatica38-1998Sibeyn, Jop F.1998List Ranking on Meshes
In: Acta Informatica [35], 543-566
Journal Article
F.Sibeyn-HabilThesis-1999Sibeyn, Jop F.1999Effiziente parallele Algorithmen
Universität des Saarlandes
Thesis - Habilitation thesis
F.Sibeyn-HiPC-1999Sibeyn, Jop F.1999Ultimate Parallel List Ranking?
In: Proceedings of the 6th International Conference on High Performance Computing (HiPC-99), 197-201
Proceedings Article
F.Sibeyn-IEEETransParaDistri-1998Sibeyn, Jop F.
Juurlink, Ben
Rao, P. Srinivasa
1998Gossiping on Meshes and Tori
In: IEEE Transactions on Parallel and Distributed Systems [9], 513-525
Journal Article
F.Sibeyn-IPPS-1999Sibeyn, Jop F.1999Better Deterministic Routing on Meshes
In: Proceedings of the 13th International Parallel Processing Symposium, and 10th Symposium on Parallel and Distributed Processing (IPPS/SPDP-99), 420-425
Proceedings Article
F.Sibeyn-JParallelDistributedComp-1998Sibeyn, Jop F.
Grammatikakis, M.D.
Hsu, D.F.
Kraetzl, M.
1998Packet Routing in Fixed-Connection Networks: A Survey
In: Journal of Parallel and Distributed Computing [54], 77-132
Journal Article
F.Sibeyn-PDCS-1999Lambert, Oliver
Sibeyn, Jop F.
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
F.Sibeyn-SIAM-1999Sibeyn, Jop F.1999Row-Major Sorting on Meshes
In: SIAM Journal on Computing [28], 847-863
Journal Article
F.Sibeyn-SIROCCO-1999Sibeyn, Jop F.1999Power and Limitations of Optical Reconfigurable Arrays
In: Proceedings of the 6th International Colloquium on Structural Information and Communication Complexity (SIROCCO 6), 249-263
Proceedings Article
F.Sibeyn-STACS-1999Sibeyn, Jop F.1999External Selection
In: Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science (STACS-99), 291-301
Proceedings Article
F.SibeynSWAT1998Sibeyn, Jop F.1998Solving Fundamental Problems on Sparse-Meshes
In: Proceedings of the 6th Scandinavian Workshop on Algorithm Theory (SWAT-98), 288-299
Proceedings Article
G4P. Gao2012Distributions of sparse spanning subgraphs in random graphsUnpublished/Draft
G6P. Gao2012Distribution of the number of spanning regular subgraphs in random graphsUnpublished/Draft
G7P. Gao2012Uniform generation of d-factors in dense host graphsUnpublished/Draft
GaertnerHotzr2009Gärtner, Tobias
Hotz, Günter
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
GameAging2001Doerr, Benjamin2001Vector Balancing Games with Aging
In: Electronic Notes in Discrete Mathematics [10], xx-xx
Journal Article
Gao2010DegSubGao, Pu (Jane)
Wormald, Nicholas
Su, Yi
2010Attachment IconInduced subgraphs in sparse random graphs with given degree sequenceUnpublished/Draft
Gao2012dFactorGao, Pu (Jane)2011Distribution of spanning regular subgraphs in random graphsUnpublished/Draft
Garg-et-al96Garg, Naveen
Papatriantafilou, Marina
Tsigas, Philippas
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
Garg-Vazirani-95Garg, Naveen
Vazirani, Vijay V.
1995A polyhedron with all s-t cuts as vertices, and adjacency of cuts
In: Mathematical Programming (A) [70], 17-25
Journal Article
Garg-Vazirani96Garg, Naveen
Vazirani, Vijay V.
1996Approximate max-flow min-(multi)cut theorems and their applications
In: SIAM Journal on Computing [25], 235-251
Journal Article
GargKonjevodRavi2000Garg, Naveen
Konjevod, Goran
Ravi, R.
2000Approximation algorithm for the group Steiner tree problem
In: Journal of Algorithms [37], 66-84
Journal Article
GasienicJanssonLingasOestlin1997Gasieniec, Leszek
Jansson, Jesper
Lingas, Andrzej
Östlin, Anna
1997On the complexity of computing evolutionary trees
In: Proceedings of the 3rd International Conference on Computing and Combinatorics (COCOON-97), 134-145
Proceedings Article
Gasieniec-Indyk-Krysta97Gasieniec, Leszek
Indyk, Piotr
Krysta, Piotr
1997External inverse pattern matching
In: Proceedings of the 8th Symposium on Combinatorial Pattern Matching (CPM-97), 90-101
Proceedings Article
Gasieniec1-96Gasieniec, Leszek
Karpinski, Marek
Plandowski, Wojciech
Rytter, Wojciech
1996Efficient Algorithms for Lempel-Ziv Encoding
In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, 392-403
Proceedings Article
Gasieniec2-96Brodal, Gerth Stølting
Gasieniec, Leszek
1996Approximate Dictionary Queries
In: Combinatorial Pattern Matching: 7th Annual Symposium (CPM'96), 65-74
Proceedings Article
Gasieniec3-96Gasieniec, Leszek
Kranakis, Evangelos
Krizanc, Danny
Pelc, Andrzej
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
Gasieniec4-96Chlebus, Bogdan S.
Czumaj, Artur
Gasieniec, Leszek
Kowaluk, Miroslaw
Plandowski, Wojciech
1996Parallel Alternating-Direction Access Machine
In: Mathematical Foundations of Computer Science 1996: 21st International Symposium (MFCS'96), 255-266
Proceedings Article
Gasieniec5-96Gasieniec, Leszek
Karpinski, Marek
Plandowski, Wojciech
Rytter, Wojciech
1996Randomized Efficient Algorithms for Compressed Strings: the Finger-Print Approach
In: Combinatorial Pattern Matching: 7th Annual Symposium (CPM'96), 39-49
Proceedings Article
Gasieniec6-96Gasieniec, Leszek
Pelc, Andrzej
1996Adaptive Broadcasting with Faulty Nodes
In: Parallel Computing [22], 903-912
Journal Article
GasieniecIndyk97Gasieniec, Leszek
Indyk, Piotr
1997Efficient Parallel Computing with Memory Faults
In: Proceedings of the 11th Symposium on Fundamentals of Computation Theory (FCT-97), 188-197
Proceedings Article
GasieniecPelc97Gasieniec, Leszek
Pelc, Andrzej
1997Broadcasting with a bounded fraction of faulty nodes
In: Journal of Parallel and Distributed Computing [42], 11-20
Journal Article
Gast97Gast, Christoph1997Das Maximum-Weight-Trace-Problem bei multiplem Sequenz-Alignment
Universität des Saarlandes
Thesis - Masters thesis
Gawrychowski2012aGawrychowski, Pawel2012Tying 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
Gawrychowski2012bGawrychowski, Pawel2012Simple and efficient LZW-compressed multiple pattern matching
In: Combinatorial Pattern Matching : 23rd Annual Symposium, CPM 2012, 232-242
Proceedings Article
Gawrychowski2012cGawrychowski, Pawel2012Faster 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
Gawrychowski2013Gawrychowski, Pawel
Manea, Florin
Mercas, Robert
Nowotka, Dirk
Tiseanu, Catalin
2013Finding Pseudo-repetitions
In: 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), 257-268
Proceedings Article
Gawrychowski2013alphabeticGawrychowski, Pawel2013Alphabetic Minimax Trees in Linear Time
In: 8th International Computer Science Symposium in Russia (CSR 2013), 36-48
Proceedings Article
Gawrychowski2013ancestorsGagie, Travis
Gawrychowski, Pawel
Nekrich, Yakov
2013Heaviest Induced Ancestors and Longest Common Substrings
In: 25th Canadian Conference on Computational Geometry (CCCG 13), 145-150
Proceedings Article
Gawrychowski2013beatingGawrychowski, Pawel
Straszak, Damian
2013Beating O(nm) in Approximate LZW-Compressed Pattern Matching
In: Algorithms and Computation - 24th International Symposium (ISAAC 2013), 78-88
Proceedings Article
Gawrychowski2013convertingBannai, Hideo
Gawrychowski, Pawel
Inenaga, Shunsuke
Takeda, Masayuki
2013Converting SLP to LZ78 in almost Linear Time
In: Combinatorial Pattern Matching, 24th Annual Symposium (CPM 2013), 38-49
Proceedings Article
Gawrychowski2013discoveringGawrychowski, Pawel
Manea, Florin
Nowotka, Dirk
2013Discovering Hidden Repetitions in Words
In: 9th Conference on Computability in Europe (CiE 2013), 210-219
Proceedings Article
Gawrychowski2013discriminatingGawrychowski, Pawel
Kucherov, Gregory
Nekrich, Yakov
Starikovskaya, Tatiana
2013Minimal Discriminating Words Problem Revisited
In: String Processing and Information Retrieval - 20th International Symposium (SPIRE 2013),
Proceedings Article
Gawrychowski2014Gawrychowski, Pawel
Manea, Florin
Nowotka, Dirk
2014Testing Generalised Freeness of Words
In: 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 337-349
Proceedings Article
Gawrychowski2014aGagie, Travis
Gawrychowski, Pawel
Kärkkäinen, Juha
Nekrich, Yakov
Puglisi, Simon J.
2014LZ77-Based Self-indexing with Faster Pattern Matching
In: LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31 - April 4, 2014. Proceedings, 731-742
Proceedings Article
Gawrychowski2014bGawrychowski, Pawel
Mozes, Shay
Weimann, Oren
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
Gawrychowski2014cGawrychowski, Pawel
Uznanski, Przemyslaw
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
Gawrychowski2014dBabenko, Maxim A.
Gawrychowski, Pawel
Kociumaka, Tomasz
Starikovskaya, Tatiana A.
2014Computing Minimal and Maximal Suffixes of a Substring Revisited
In: Combinatorial Pattern Matching - 25th Annual Symposium, CPM 2014, Moscow, Russia, June 16-18, 2014. Proceedings, 30-39
Proceedings Article
Gawrychowski2014eGawrychowski, Pawel2014Simple and efficient LZW-compressed multiple pattern matching
In: Journal of Discrete Algorithms [25], 34-41
Journal Article
GawrychowskiJez2014Gawrychowski, Pawel
Jez, Artur
Jez, Lukasz
2014Validating the Knuth-Morris-Pratt Failure Function, Fast and Online
In: Theory of Computing Systems [54], 337-372
Journal Article
GDCompRep1999Brandenburg, Franz J.
Schreiber, Falk
Jünger, Michael
Marks, Joe
Mutzel, Petra
1999Graph Drawing Contest Report
In: Proceedings of the 7th International Symposium on Graph Drawing (GD-99), 400-409
Proceedings Article
gecco2009Raidl, Alba, Bacardit, Beyer, Birattari, Blum, Bosman, Congdon, Corne, Cotta, Di Penta, Doerr, Drechsle, Ebner, Grahl, Jansen, Knowles, Lenaerts, Middendorf, Miller, O'Neill, Poli, Squillero, Stanley, Stützle, van Hemert (ed.)2009GECCO 2009: Proceedings of the 11th Annual conference on Genetic and evolutionary computation.Proceedings
Gergov-et-al96Gergov, Jordan1996Approximation Algorithms for Dynamic Storage Allocation
In: Algorithms - ESA '96: 4th Annual European Symposium, 52-61
Proceedings Article
Gergov-Meinel96Gergov, Jordan
Meinel, Christoph
1996Mod-2-OBDDs - a Date Structure that generalizes EXOR-Sum-of-Products and Ordered Binary Decision Diagrams
In: Formal Methods in System Design [8], 273-282
Journal Article
GergovDiss00Gergov, Jordan2000Algorithms for Interval Coloring, Geometric Packing and Memory Optimization
Universität des Saarlandes
Thesis - PhD thesis
ghhkms-bo3ds-03Granados, Miguel
Hachenberger, Peter
Hert, Susan
Kettner, Lutz
Mehlhorn, Kurt
Seel, Michael
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
ghs-che-01Geismann, Nicola
Hemmer, Michael
Schömer, Elmar
2001The Convex Hull of Ellipsoids (Video)
In: Proceedings of the 17th Annual Symposium on Computational Geometry (SCG-01), 321-322
Proceedings Article
ghs-qsi-01Geismann, Nicola
Hemmer, Michael
Schömer, Elmar
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
GiakkoupisS12Giakkoupis, George
Sauerwald, Thomas
2012Rumor spreading and vertex expansion
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 1623-1641
Proceedings Article
Giannopoulos2010Giannopoulos, Panos
Klein, Rolf
Kutz, Martin
Marx, Daniel
2010Computing geometric minimum-dilation graphs is NP-hard
In: International Journal of Computational Geometry & Applications [20], 147-173
Journal Article
Gidenstam2007aGidenstam, Anders
Papatriantafilou, Marina
2007LFthreads: A Lock-Free Thread Library
In: 11th International Conference On Principles Of Distributed Systems (OPODIS), 217-231
Proceedings Article
Gidenstam200901Larsson, Andreas
Gidenstam, Anders
Ha, Phuong H.
Papatriantafilou, Marina
Tsigas, Philippas
2009Multiword Atomic Read/Write Registers on Multiprocessor Systems
In: Journal of experimental algorithmics [13], 7:1-7:30
Electronic Journal Article
Gidenstam200902Gidenstam, Anders
Papatriantafilou, Marina
Sundell, Håkan
Tsigas, Philippas
2009Efficient and Reliable Lock-Free Memory Reclamation Based on Reference Counting
In: IEEE Transactions on Parallel and Distributed Systems [20], 1173-1187
Journal Article
Gidenstam200903Gidenstam, Anders
Papatriantafilou, Marina
Tsigas, Phillipas
2009NBmalloc : Allocating Memory in a Lock-Free Manner
In: Algorithmica [Online First], 1-35
Electronic Journal Article
Gidenstam2010Gidenstam, Anders
Papatriantafilou, Marina
Tsigas, Philippas
2010NBmalloc: Allocating Memory in a Lock-Free Manner
In: Algorithmica [58], 304-338
Journal Article
Giesen2007Giesen, Joachim
Schuberth, Eva
Simon, Klaus
Zolliker, Peter
Zweifel, Oliver
2007Image-Dependent Gamut Mapping as Optimization Problem
In: IEEE Transactions on Image Processing [16], 2401-2410
Journal Article
Giesen2007bGiesen, Joachim2008Delaunay Triangulation Approximates Anchor Hull
In: Computational Geometry - Theory and Applications [36], 131-143
Journal Article
Giesen2007cGiesen, Joachim2008Conjoint Analysis for Measuring the Perceived Quality in Volume Rendering
In: IEEE Transactions on Visualization and Computer Graphics [13], 1664-1671
Journal Article
Giesen2007colGiesen, Joachim
Mitsche, Dieter
Schuberth, Eva
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
Giesen2007conjGiesen, Joachim2007The Combinatorial Structure of Polyhedral Choice Based Conjoint Analysis
In: Conjoint Measurement: Methods and Applications, 259-271
Part of a Book
Giesen2007eGiesen, Joachim2007Medial Axis Approximation from Inner Voronoi Balls: A Demo of the Mesecina Tool
In: 23d Annual ACM Symposium on Computational Geometry, 123-124
Proceedings Article
Giesen2008zGiesen, Joachim2008The Flow Complex: A Data Structure for Geometric Modeling
In: Computational Geometry - Theory and Applications [39], 178-190
Journal Article
GKMMP06Gotsman, Craig
Kaligosi, Kanela
Mehlhorn, Kurt
Michail, Dimitrios
Pyrga, Evangelia
2007Attachment IconCycle Bases of Graphs and Sampled Manifolds
In: Computer Aided Geometric Design [24], 464
Journal Article
GKSGeorgiou, Chryssis
Kowalski, Dariusz
Shvartsman, Alexander
2005Efficient gossip and robust distributed computation
In: Theoretical Computer Science [347], 130-166
Journal Article
GKS-DISC2003Georgiou, Chryssis
Kowalski, Dariusz
Shvartsman, Alexander
2003Efficient Gossip and Robust Distributed Computation
In: Distributed Computing, 17th International Conference (DISC 2003), 224-238
Proceedings Article
GKWahlstroemW2012Giannopoulos, Panos
Knauer, Christian
Wahlström, Magnus
Werner, Daniel
2012Hardness of discrepancy computation and ε-net verification in high dimension
In: Journal of Complexity [28], 162-176
Journal Article
GnewuchWW12Gnewuch, Michael
Wahlström, Magnus
Winzen, Carola
2012A New Randomized Algorithm to Approximate the Star Discrepancy Based on Threshold Accepting
In: SIAM Journal on Numerical Analysis [50], 781-807
Journal Article
GnewuchWW13Doerr, Carola
Gnewuch, Michael
Wahlström, Magnus
2013Calculation of Discrepancy Measures and Applications
In: A Panorama of Discrepancy Theory, 1-55
Part of a Book
GoemansSkutella2004Goemans, Michel X.
Skutella, Martin
2004Attachment IconCooperative facility location games
In: Journal of Algorithms [50], 194-214
Journal Article
GoeseleEtal2003Goesele, Michael
Kautz, Jan
Lang, Jochen
Lensch, Hendrik P. A.
Seidel, Hans-Peter
20027th ACM Symposium on Solid Modeling and Applications; Tutorial T1: Geometric Algorithms for Planning and Simulation Tasks in Virtual PrototypingProceedings
GoldbergMacKenziePhilipPatersonSrinivasan2000Goldberg, Leslie Ann
MacKenzie, Philip D.
Paterson, Mike
Srinivasan, Aravind
2000Contention resolution with constant expected delay
In: Journal of the ACM [42], 1048-1096
Journal Article
GolinRamanSchwarzSmidSIAMJCOMPUT1998Golin, Mordecai J.
Raman, Rajeev
Schwarz, Christian
Smid, Michiel
1998Randomized Data Structures for the Dynamic Closest-Pair Problem
In: SIAM Journal on Computing [27], 1036-1072
Journal Article
GolumbicMR06Golumbic, Martin Charles
Mintz, Aviad
Rotics, Udi
2006Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial k-trees
In: Discrete Applied Mathematics [154], 1465-1477
Journal Article
Goodrich-Ramos97Goodrich, Michael T.
Ramos, Edgar A.
1997Bounded-independence derandomization of geometric partitioning with applications to parallel fixed-dimensional linear programming
In: Discrete and Computational Geometry [18], 397-420
Journal Article
Govindarajan2007Govindarajan, Sathish
Dietze, Michael C.
Agarwal, Pankaj K.
Clark, James S.
2008Attachment IconA scalable algorithm for dispersing population
In: Journal of Intellingent Information Systems [29], 39-61
Journal Article
GPFOGA11Durrett, Greg
Neumann, Frank
O'Reilly, Una-May
2011Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics
In: FOGA'11 : Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, 69-80
Proceedings Article
GraphletsShervashidze, Nino
Vishwanathan, S .V. N.
Petri, Tobias H.
Mehlhorn, Kurt
Borgwardt, Karsten M.
2009Attachment IconEfficient Graphlet Kernels for Large Graph Comparison
In: Proceedings of the Twelfth International Conference on Artificial Intelligence and Statistics (AISTATS), 488-495
Electronic Proceedings Article
Grove-et-al-1-95aAwerbuch, Baruch
Azar, Yossi
Grove, Edward
Kao, Ming-Yang
Krishnan, P.
Vitter, Jeffrey Scott
1995Load Balancing in the Euclidean Norm
In: 36th Annual Symposium on Foundations of Computer Science, 383-391
Proceedings Article
Grove-et-al-1-95bChian, Yi-Feng
Goodrich, Michael T.
Grove, Edward
Tamassia, Roberto
Vengroff, Darren Erik
Vitter, Jeffrey Scott
1995External-Memory Graph Algorithms
In: 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA95), 139-149
Proceedings Article
Grove-et-al-2-95Barve, Rakesh D.
Grove, Edward
Vitter, Jeffrey Scott
1995An Application-Controlled Paging Algorithm for a Shared Cache
In: 36th Annual Symposium on Foundations of Computer Science, 204-213
Proceedings Article
Grove-et-al95Grove, Edward
Kao, Ming-Yang
Krishnan, P.
Vitter, Jeffrey Scott
1995Online Perfect Matching and Mobile Computing
In: Algorithms and Data Structures: 4th International Workshop (WADS95), 194-205
Proceedings Article
Grove95Grove, Edward1995On-line Bin Packing with Lookahead
In: 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA95), 430-436
Proceedings Article
GSVGarg, Naveen1996A 3-approximation for the minimum tree spanning with k-vertices
In: Foundations of computer science (FOCS-96) : 37th annual symposium, 302-309
Proceedings Article
GuentherKM2010Günther, Elisabeth
König, Felix
Megow, Nicole
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
Guillaume97Guillaume, Frank1997Praktisches Paralleles Paralleles List Ranking
Universität des Saarlandes
Thesis - Masters thesis
Gunopulos-et-al97Gunopulos, Dimitrios
Mannila, Heikki
Saluja, Sanjeev
1997Discovering all most specific sentences by randomized algorithms
In: Proceedings of the 6th International Conference on Database Theory (ICDT-97), 215-229
Proceedings Article
Gupta-et-al95Gupta, Prosenjit
Janardan, Ravi
Smid, Michiel
Dasgupta, Bhaskar
1995The rectangle enclosure and point-dominance problems revisited
In: 11th Annual ACM Symposium on Computing Geometry, 162-171
Proceedings Article
Gupta-Janardan-Smid-1-95Gupta, Prosenjit
Janardan, Ravi
Smid, Michiel
1995Further results on generalized intersection searching problems:
counting, reporting, and dynamization
In: Journal of Algorithms [19], 282-317
Journal Article
Gupta-Janardan-Smid-2-95Gupta, Prosenjit
Janardan, Ravi
Smid, Michiel
1995The rectangle enclosure and point-dominance problems revisited
In: 11th Annual !CM Symposium on Computational Geometry, 162-171
Proceedings Article
GuptaJanardanSmid96a-1Gupta, Prosenjit
Janardan, Ravi
Smid, Michiel
1996Algorithms for generalized halfspace range searching and other intersection searching problems
In: Computational Geometry [5], 321-340
Journal Article
GuptaJanardanSmid96a-2Gupta, Prosenjit
Janardan, Ravi
Smid, Michiel
1996Algorithms for generalized halfspace range searching and other intersection searching problems
In: Computational Geometry [6], 1-19
Journal Article
GuptaJanardanSmid96bGupta, Prosenjit
Janardan, Ravi
Smid, Michiel
1996Fast algorithms for collision and proximity problems involving moving geometric objects
In: Computational Geometry [6], 371-391
Journal Article
GuptaJanardanSmid99Gupta, Prosenjit
Janardan, Ravi
Smid, Michiel
1999Efficient algorithms for counting and reporting pairwise intersections between convex polygons
In: Information Processing Letters [69], 7-13
Journal Article
GuptaJanardanSmidDasgupta1997Gupta, Prosenjit
Janardan, Ravi
Smid, Michiel
Dasgupta, Bhaskar
1997The rectangle enclosure and point-dominance problems revisited
In: International Journal of Computational Geometry and Applications [7], 437-456
Journal Article
GuptaKallerMahajanShermer96Gupta, Arvind
Kaller, Damon
Mahajan, Sanjeev
Shermer, Thomas C.
1996Vertex partitioning problems on partial k-trees
In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, 161-172
Proceedings Article
GuptaMahajan1997Gupta, Arvind
Mahajan, Sanjeev
1997Using amplification to compute majority with small majority gates
In: Computational Complexity [6], 46-63
Journal Article
Gurvich77Gurvich, Vladimir1977On repetition-free Boolean functions
In: Uspekhi Mat. Nauk. (Russian Math. Surveys) [32], 183-184
Journal Article
Gurvich91Gurvich, Vladimir1991Criteria for repetition-freeness of functions in the algebra of logic
In: Soviet Math. Dokl. [43], 721-726
Journal Article
Gutwenger1999Gutwenger, Carsten1999Design und Implementierung einer Algorithmen-Bibliothek zum Zeichnen von Graphen
Universität des Saarlandes
Thesis - Masters thesis
GutwengerMutzel1998Gutwenger, Carsten
Mutzel, Petra
1998Planar Polyline Drawings with Good Angular Resolution
In: Proceedings of the 6th International Symposium on Graph Drawing (GD-98), 167-182
Proceedings Article
h-cap-01Hert, Susan2001Attachment IconConnected Area Partitioning
In: Proceedings of the 17th European Workshop on Computational Geometry (CG-01), 35-38
Proceedings Article
Hachenberger1999Hachenberger, Peter1999Dynamic shortest Path Algorithms for Planar and Outerplanar Graphs
Universität des Saarlandes
Thesis - Masters thesis
HachenbergerKettner2005NefHachenberger, Peter
Kettner, Lutz
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
Hagedoorn2000:nvpapmHagedoorn, Michiel
Overmars, Mark H.
Veltkamp, Remco
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
Hagedoorn2003:nncbfeHagedoorn, Michiel2003Nearest 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
Hagerup-1-95Hagerup, Torben1995A Lower Bound for the Emulation of PRAM Memories on Processor Networks
In: Information and Computation [119], 124-128
Journal Article
Hagerup-2-95Hagerup, Torben1995Fast Deterministic Processor Allocation
In: Journal of Algorithms [18], 629-649
Journal Article
Hagerup-3-95Hagerup, Torben1995The Parallel Complexity of Integer Prefix Summation
In: Information Processing Letters [56], 59-64
Journal Article
Hagerup-97bHagerup, Torben1997Allocating Independent Tasks to Parallel Processors: An Experimental Study
In: Journal of Parallel and Distributed Computing [47], 185-197
Journal Article
Hagerup-et-al-1-95Andersson, Arne
Hagerup, Torben
Nilsson, Stefan
Raman, Rajeev
1995Sorting in Linear Time?
In: 27th Annual ACM Symposium on Theory of Computing (STOC95), 427-436
Proceedings Article
Hagerup-et-al-1-96Hagerup, Torben1996Allocating Independent Tasks to Parallel Processors: An Experimental Study
In: Parallel Algorithms for Irregularly Structured Problems: 3rd International Workshop (IRREGULAR'96), 1-33
Proceedings Article
Hagerup-et-al-2-95Hagerup, Torben
Katajainen, Jyrki
Nishimura, Naomi
Ragde, Prabhakar
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
Hagerup-et-al95Berthomé, P.
Duboux, T.
Hagerup, Torben
Newman, I.
Schuster, Assaf
1995Self-Simulation for the Passive Optical Star Model
In: Algorithms-ESA'95: 3rd Annual European Symposium, 268-380
Proceedings Article
Hagerup-et-al97Dietzfelbinger, Martin
Hagerup, Torben
Katajainen, Jyrki
Penttonen, Martti
1997A reliable randomized algorithm for the closest-pair problem
In: Journal of Algorithms [25], 19-51
Journal Article
Hagerup-Keller95Hagerup, Torben
Keller, Jörg
1995Fast Parallel Permutation Algorithms
In: Parallel Processing Letters [5], 139-148
Journal Article
Hagerup-Kutylowski97Hagerup, Torben
Kutylowski, Miroslaw
1997Fast integer merging on the EREW PRAM
In: Algorithmica [17], 55-66
Journal Article
Hagerup00Hagerup, Torben2000Parallel preprocessing for path queries without concurrent reading
In: Information and Computation [158], 18-28
Journal Article
Hagerup2000aHagerup, Torben2000Dynamic algorithms for graphs of bounded treewidth
In: Algorithmica [27], 292-315
Journal Article
Hagerup97aHagerup, Torben1997Dynamic algorithms for graphs of bounded treewidth
In: Proceedings of the 24th International Colloquium on Automata, Languages, and Programming (ICALP-97), 292-302
Proceedings Article
Hagerup98Hagerup, Torben1998Sorting 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
HagerupICAL98Hagerup, Torben1998Simpler 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
HagSanTra98Hagerup, Torben
Sanders, Peter
Träff, Jesper Larsson
1998An Implementation of the Binary Blocking Flow Algorithm
In: Proceedings of the 2nd Workshop on Algorithm Engineering (WAE-98), 143-154
Proceedings Article
HaJaPS11Harren, Rolf
Jansen, Klaus
Prädel, Lars
van Stee, Rob
2011Attachment IconA (5/3 + ε)-Approximation for Strip Packing
In: Algorithms and Data Structures : 12th International Symposium, WADS 2011, 475-487
Proceedings Article
HallHipplerSkutella2003Hall, Alex
Hippler, Steffen
Skutella, Martin
2003Attachment IconMulticommodity Flows Over Time: Efficient Algorithms and Complexity
In: Automata, languages and programming : 30th International Colloquium, ICALP 2003, 397-409
Proceedings Article
HallLangkauSkutella2003Hall, Alex
Langkau, Katharina
Skutella, Martin
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
Hammerschmidt1999Hammerschmidt, Frank1999Konzeption und Entwicklung des streng strukturierten und erweiterbaren Datentyps html_page für LEDA
Universität des Saarlandes
Thesis - Masters thesis
Happ2008Doerr, Benjamin
Happ, Edda
Klein, Christian
2008Crossover Can Provably be Useful in Evolutionary Computation
In: Genetic and Evolutionary Computation Conference 2008, 539-546
Proceedings Article
HappJohannsenKleinNeumann2008aHapp, Edda
Johannsen, Daniel
Klein, Christian
Neumann, Frank
2008Attachment IconRigorous Analyses of Fitness-Proportional Selection for Optimizing Linear Functions
In: Genetic and Evolutionary Computation Conference 2008, 953-960
Proceedings Article
HappPhD2009Happ, Edda2009Analyses of Evolutionary Algorithms
Universität des Saarlandes
Thesis - PhD thesis
Hariharan-et-al95Cole, Richard
Hariharan, Ramesh
Paterson, Mike
Zwick, Uri
1995Tighter Lower Bounds on the Exact Complexity of String Matching
In: SIAM Journal on Computing [24], 30-45
Journal Article
Hariharan-Kapoor95Hariharan, Ramesh
Kapoor, Sanjiv
1995Algorithms for Enumerating all Spanning Trees of an Undirected Graph
In: SIAM Journal on Computing [24], 247-265
Journal Article
Hariharan-Kelsen-Mahajan96Hariharan, Ramesh
Kelsen, Pierre
Mahajan, Sanjeev
1996Coloring 2-colorable hypergraphs with a sublinear number of colors
In: Scandinavian Workshop on Algorithm Theory (SWAT96), 41-52
Proceedings Article
Hariharan-Mahajan95Hariharan, Ramesh
Mahajan, Sanjeev
1995Derandomizing semidefinite programming based approximation algorithms
In: 36th IEEE Symposium on Foundations of Computer Science, 162-16
Proceedings Article
Hariharan-Muthukrishnan95Hariharan, Ramesh
Muthukrishnan, S.
1995String Matching over a General Matching Relation
In: Information and Computation [122], 140-148
Journal Article
HarKer11Harren, Rolf
Kern, Walter
2012Improved Lower Bound for Online Strip Packing
In: Approximation and Online Algorithms : 9th International Workshop ,WAOA 2011, 211-218
Proceedings Article
HarksHKS2013Harks, Tobias
Hoefer, Martin
Klimm, Max
Skopalik, Alexander
2013Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games
In: Mathematical Programming [141], 193-215
Journal Article
Harren2006aHarren, Rolf2006Attachment IconApproximating the Orthogonal Knapsack Problem for Hypercubes
In: Automata, Languages and Programming, 238-249
Proceedings Article
Harren2006bHarren, Rolf2006Approximation mehrdimensionaler Packungsprobleme
Universität Dortmund
Thesis - other
Harren2007Diedrich, Florian
Harren, Rolf
Jansen, Klaus
Thöle, Ralf
Thomas, Henning
2007Attachment IconApproximation Algorithms for 3D Orthogonal Knapsack
In: Theory and Applications of Models of Computation, 34-45
Proceedings Article
Harren2007bHarren, Rolf2007Mehrdimensionale Packungsprobleme - Approximation geometrischer Verallgemeinerungen klassischer PackungsproblemeBook
Harren2009aHarren, Rolf2009Attachment IconApproximation Algorithms for Orthogonal Packing Problems for Hypercubes
In: Theoretical Computer Science [410], 4504-4532
Journal Article
HarrenPhD2010Harren, Rolf2010Two-dimensional packing problems
Universität des Saarlandes
Thesis - PhD thesis
HarrenvanStee2008Harren, Rolf
van Stee, Rob
2008Attachment IconPacking Rectangles into 2 OPT Bins using Rotations
In: 11th Scandinavian Workshop on Algorithm Theory, 306-318
Proceedings Article
HarrenvanStee2009bHarren, Rolf
van Stee, Rob
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
HarSte12Harren, Rolf
van Stee, Rob
2012Absolute Approximation Ratios for Packing Rectangles into Bins
In: Journal of Scheduling [15], 63-75
Journal Article
Hazboun1999Hazboun, Jack1999Molekül-Docking-Reaktionen
Universität des Saarlandes
Thesis - Masters thesis
Hebbinghaus2005Doerr, Benjamin
Hebbinghaus, Nils
2005Discrepancy of Products of Hypergraphs
In: 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 323-328
Proceedings Article
Hebbinghaus2006Doerr, Benjamin
Hebbinghaus, Nils
Neumann, Frank
2006Attachment IconSpeeding Up Evolutionary Algorithms Through Restricted Mutation Operators
In: Parallel Problem Solving from Nature - PPSN IX, 9th International Conference, 978-987
Proceedings Article
Hebbinghaus2006aBundy, David
Hebbinghaus, Nils
Stellmacher, Bernd
2006Attachment IconThe Local C(G,T) Theorem
In: Journal of Algebra [300], 741-789
Journal Article
Hebbinghaus2007Hebbinghaus, Nils2007Attachment IconDiscrepancy of Sums of two Arithmetic ProgressionsReport
HeidrichBachelor2012Heydrich, Sandy2012Dividing connected chores fairly
Universität des Saarlandes
Thesis - Bachelor thesis
HeinyKasprzikKoetzing2012Heinz, Jeffrey
Kasprzik, Anna
Kötzing, Timo
2012Learning in the limit with lattice-structured hypothesis spaces
In: Theoretical Computer Science [457], 111 - 127
Journal Article
HelNeuWan2009Helwig, Sabine
Neumann, Frank
Wanka, Rolf
2009Particle Swarm Optimization with Velocity Adaptation
In: 2009 International Conference on Adaptive and Intelligent Systems ICAIS 2009 : proceedings, 146-151
Proceedings Article
Hemmer2002Hemmer, Michael2002Reliable computation of planar and spatial arrangements of quadrics
Universität des Saarlandes
Thesis - Masters thesis
Hemmer2007Dupont, Laurent
Hemmer, Michael
Petitjean, Sylvain
Schömer, Elmar
2007Attachment IconComplete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics
In: 15th Annual European Symposium on Algorithms, 633-644
Proceedings Article
Hemmer2008Hemmer, Michael2008Attachment IconExact Computation of the Adjacency Graph of an Arrangement of Quadrics
Johannes Gutenberg-Universität Mainz
Thesis - PhD thesis
Hemmer2011Hemmer, Michael
Dupon, Laurent
Petitjean, Sylvain
Schomer, Elmar
2011A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics
In: Journal of Symbolic Computation [46], 467-494
Journal Article
Hermelin2010Bar-Yehuda, Reuven
Hermelin, Danny
Rawitz, Dror
2010Minimum Vertex Cover in Rectangle Graphs
In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. I, 255-266
Proceedings Article
Hermelin2010bButman, Ayelet
Hermelin, Danny
Lewenstein, Moshe
Rawitz, Dror
2010Optimization problems in multiple-interval graphs
In: ACM Transactions on Algorithms [6], 40,1-40,18
Journal Article
Hermelin2012Hermelin, Danny
Rizzi, Romeo
Vialette, Stephane
2012Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph
In: Algorithms and Computation : 23rd International Symposium, ISAAC 2012, 465-474
Proceedings Article
HermelinCulex2010Nor, Igor
Hermelin, Danny
Charlat, Sylvain
Engelstadter, Jan
Reuter, Max
Duron, Olivier Sagot, Marie-France
2010Mod/Resc Parsimony Inference
In: Combinatorial Pattern Matching : 21st Annual Symposium, CPM 2010, 202-213
Proceedings Article
HermelinHuangKratschWahlstrom2011Hermelin, Danny
Huang, Chien-Chung
Kratsch, Stefan
Wahlström, Magnus
2011Parameterized Two-Player Nash Equilibrium
In: Graph-Theoretic Concepts in Computer Science : 37th International Workshop, WG 2011, 215-226
Proceedings Article
HermelinLCS2010Gotthilf, Zvi
Hermelin, Danny
Landau, Gad M.
Lewenstein, Moshe
2010Restricted LCS
In: 17th International Symposium on String Processing and Information Retrieval, 250-257
Proceedings Article
HermelinLevyWeimanYuster2011Hermelin, Danny
Levy, Avivit
Weimann, Oren
Yuster, Raphael
2011Distance Oracles for Vertex-Labeled Graphs
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 490-501
Proceedings Article
HermelinMestreRawitz2012Hermelin, Danny
Mestre, Julian
Rawitz, Dror
2012Optimization Problems in Dotted Interval Graphs
In: Graph-Theoretic Concepts in Computer Science : 38th InternationalWorkshop, WG 2012, 46-56
Proceedings Article
HermelinMnichvanLeeuwen2012Hermelin, Danny
Mnich, Matthias
van Leeuwen, Erik Jan
2012Parameterized complexity of induced H-matching on claw-free graphs
In: Algorithms - ESA 2012 : 20th Annual European Symposium, 624-635
Proceedings Article
HermelinMnichVanLeeuwenWoeginger2011Hermelin, Danny
Mnich, Matthias
van Leeuwen, Erik Jan
Woeginger, Gerhard J.
2011Domination When the Stars Are Out
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 462-473
Proceedings Article
HermelinRawitz2011Hermelin, Danny
Rawitz, Dror
2011Optimization problems in multiple subtree graphs
In: Discrete Applied Mathematics [159], 588-594
Journal Article
HermelinWu2012Hermelin, Danny
Wu, Xi
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
Hert1999Hert, Susan
Lumelsky, Vladimir
1999Motion Planning in R^3 for Multiple Tethered Robots
In: IEEE Transactions on Robotics and Automation [15], 623-639
Journal Article
Hertel84/02Hertel, Stefan
Mehlhorn, Kurt
Mäntylä, Martti
Nievergelt, Jurg
1984Attachment IconSpace sweep solves intersection of two convex polyhedra elegantlyReport
Heydrich2015Heydrich, Sandy
van Stee, Rob
2015Dividing Connected Chores Fairly
In: Theoretical Computer Science [593], 51-61
Journal Article
HeySte13Heydrich, Sandy
van Stee, Rob
2013Attachment IconDividing connected chores fairly
In: 6th International Symposium on Algorithmic Game Theory, 420-433
Proceedings Article
HF2009Fountoulakis, Nikolaos
Huber, Anna
2009Quasirandom rumor spreading on the complete graph is as fast as randomized rumor spreading
In: SIAM Journal on Discrete Mathematics [23], 1964-1991
Journal Article
hh-mgcd-2009Hemmer, Michael
Hülse, Dominik
2009Attachment IconGeneric implementation of a modular GCD over Algebraic Extension Fields
In: EuroCG'09 : 25th European Workshop on Computational Geometry, 321-324
Proceedings Article
hhkps-aegk-01Hert, Susan
Hoffmann, Michael
Kettner, Lutz
Pion, Sylvain
Seel, Michael
2001An Adaptable and Extensible Geometry Kernel
In: Proceedings of the 5th International Workshop on Algorithm Engineering (WAE-01), 79-90
Proceedings Article
Hilpert96Hilpert, Peter1996Heuristiken fur das euklidische Travelling Salesman Problem
Universitat des Saarlandes
Thesis - Masters thesis
HKMN08Huang, Chien-Chung
Kavitha, Telikepalli
Michail, Dimitrios
Nasre, Meghana
2008Bounded Unpopularity Matchings
In: 11th Scandinavian Workshop on Algorithm Theory (SWAT), 127-137
Proceedings Article
hls-qarr-2009Hemmer, Michael
Limbach, Sebastian
Schömer, Elmar
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
HMPT97Hundack, Christoph
Mutzel, Petra
Pouchkarev, Igor
Thome, Stefan
1997ArchE: A Graph Drawing System for Archaeology
In: Proceedings of the 5th Symposium on Graph Drawing (GD-97), 297-302
Proceedings Article
HMT04:round-robinHenz, Martin
Müller, Tobias
Thiel, Sven
2004Global constraints for round robin tournament scheduling
In: European Journal of Operational Research [153], 92-101
Journal Article
Hoefer-IJGT-2013Hoefer, Martin2013Strategic Cooperation in Cost Sharing Games
In: International Journal of Game Theory [42], 29-53
Journal Article
Hoefer03Hoefer, Martin2003Experimental 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
Hoefer2013Hoefer, Martin2013Local Matching Dynamics in Social Networks
In: Information & Computation [222], 20-35
Journal Article
HoeferK2013Hoefer, Martin
Kesselheim, Thomas
2013Brief Announcement: Universally Truthful Secondary Spectrum Auctions
In: 25th Symposium on Parallelism in Algorithms and Architectures (SPAA-13), 99-101
Proceedings Article
HoeferKV2013Hoefer, Martin
Kesselheim, Thomas
Vöcking, Berthold
2013Truthfulness and Stochastic Dominance with Monetary Transfers.
In: 14th Conf. Electronic Commerce (EC-13), 567-582
Proceedings Article
HoeferS-TEAC-2013Hoefer, Martin
Skopalik, Alexander
2013Altruism in Atomic Congestion Games
In: ACM Transactions on Economics and Computation [1], 21
Journal Article
HoeferS-TOCS-2013Hoefer, Martin
Skopalik, Alexander
2013On the Complexity of Pareto-optimal Nash and Strong Equilibria
In: Theory of Computing Systems [53], 441-453
Journal Article
HoeferS2013Hoefer, Martin
Sauerwald, Thomas
2013Brief Announcement: Threshold Load Balancing in Networks
In: 32nd Symposium on Principles of Distributed Computing (PODC-13), 54-56
Proceedings Article
HoeferW-WINE-2013Hoefer, Martin
Wagner, Lisa
2013Designing Profit Shares in Matching and Coalition Formation Games
In: 9th Conference on Web and Internet Economics (WINE-13), 249-262
Proceedings Article
HoeferW2013Hoefer, Martin
Wagner, Lisa
2013Locally Stable Marriage with Strict Preferences
In: 40th International Colloquium on Automata, Languages and Programming (ICALP-13), 620-631
Proceedings Article
Hoepman-Papatr-Tsigas95Hoepman, Jaap-Henk
Papatriantafilou, Marina
Tsigas, Philippas
1995Self-Stabilization in Wait-Free Shared Memory Objects
In: Distributed Algorithms: 9th International Workshop (WDAG95), 273-287
Proceedings Article
HoogeveenSkutellaWoeginger2003Hoogeveen, Han
Skutella, Martin
Woeginger, Gerhard J.
2003Attachment IconPreemptive scheduling with rejection
In: Mathematical Programming [94], 361-374
Journal Article
HorNeuFOGA2009Horoba, Chrisitian
Neumann, Frank
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
HorNeuGECCO2008Horoba, Christian
Neumann, Frank
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
hr-mrmpipppg-01Hert, Susan
Richards, Brad
2002Multiple Robot Motion Planning = Parallel Processing + Geometry
In: Sensor Based Intelligent Robots, 183-205
Proceedings Article
HTM06aHariharan, Ramesh
Telikepalli, Kavitha
Mehlhorn, Kurt
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
HTZ-AKCROSS-2009Hemmer, Michael
Tsigaridas, Elias P.
Zafeirakopoulos, Zafeirakis
Emiris, Ioannis Z.
Karavelas, Menelaos I.
Mourrain, Bernard
2009Experimental evaluation and cross-benchmarking of univariate real solvers
In: Symbolic Numeric Computation 2009 (SNC 2009), 45-54
Proceedings Article
Huang2008Bhaskar, Umang
Fleischer, Lisa
Hoy, Darrell
Huang, Chien-Chung
2009Attachment IconEquilibria of Atomic Flow Games are not Unique
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 748-757
Proceedings Article
Huang2010Huang, Chien-Chung2010Classified stable matching
In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1235-1253
Proceedings Article
Huang2010aHuang, Chien-Chung2010Circular stable matching and 3-way kidney transplant
In: Algorithmica [58], 137-150
Journal Article
Huang2011Huang, Chien-Chung
Kavitha, Telikepalli
Michael, Dimitrios
Nasr, Meghana
2011Bounded Unpopularity Matchings
In: Algorithmica [61], 738-757
Journal Article
Huang2011aHuang, Chien-Chung
Kavitha, Telikepalli
2011Popular Matchings in the Stable Marriage Problem
In: 38th International Colloquium on Automata, Languages and Programming (ICALP),
Proceedings Article
Huang2011bHuang, Chien-Chung
Kavitha, Telikepalli
2011Near-popular matchings in the Roommates problem
In: 19th European Symposium on Algorithms (ESA),
Proceedings Article
Huang2012aHuang, Chien-Chung2012Non-preemptive Speed Scaling
In: Algorithm Theory - SWAT 2012 : 13th Scandinavian Symposium and Workshops, 249-260
Proceedings Article
HuberPhD2010Huber, Anna2010Randomized rounding and rumor spreading with stochastic dependencies
Universität des Saarlandes
Thesis - PhD thesis
Humble97Humble, Monika1997Die Berechnung maximaler Flüsse in Netzwerken
Universität des Saarlandes
Thesis - Masters thesis
HundackPrömelSteger97Hundack, Christoph
Prömel, Hans Jürgen
Steger, Angelika
1997Extremal Graph Problems for Graphs with a Color-Critical Vertex
In: Combinatorics, Geometry and Probability, 421-433
Part of a Book
HutSanVit2001Hutchinson, David A.
Sanders, Peter
Vitter, Jeffrey Scott
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
HutSanVit2001aHutchinson, David A.
Sanders, Peter
Vitter, Jeffrey Scott
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
HybridVC07Friedrich, Tobias
He, Jun
Hebbinghaus, Nils
Neumann, Frank
Witt, Carsten
2007On Improving Approximate Solutions by Evolutionary Algorithms
In: IEEE Congress on Evolutionary Computation 2007, 2614-2621
Proceedings Article
ICALP::MehlhornP1989Mehlhorn, Kurt
Paul, Wolfgang J.
1989Two Versus One Index Register and Modifiable Versus Non-modifiable Programs
In: Automata, languages and programming (ICALP-89) : 16th international colloquium, 603-609
Proceedings Article
ICALP::MehlhornY1988Mehlhorn, Kurt
Yap, Chee-Keng
1988Constructive Hopf's Theorem: Or How to Untangle Closed Planar Curves
In: Automata, languages and programming (ICALP-88) : 15th international colloquium, 410-423
Proceedings Article
IC::HoffmanMRT1986Hoffmann, Kurt
Mehlhorn, Kurt
Rosenstiehl, Pierre
Tarjan, Robert E.
1986Attachment IconSorting Jordan Sequences in Linear Time Using Level-Linked Search Trees
In: Information and Control [68], 170-184
Journal Article
IC::MehlhornP1987Mehlhorn, Kurt
Preparata, Franco P.
1987Attachment IconArea-Time Optimal Division for $T=\Omega((\log n)^1+\epsilon)$
In: Information and Computation [72], 270-282
Journal Article
ImmichDipl01Immich, Stefan2001Berechnung der Momente von quadratischen Komplexen
Universität des Saarlandes
Thesis - Masters thesis
ImpBoun2006Doerr, Benjamin
Hebbinghaus, Nils
Werth, Sören
2006Attachment IconImproved Bounds and Schemes for the Declustering Problem
In: Theoretical Computer Science [359], 123-132
Journal Article
Imreh2001Epstein, Leah
Imreh, Csanád
van Stee, Rob
2002More on weighted servers or FIFO is better than LRU
In: Mathematical Foundations of Computer Science 2002 : 27th International Symposium, MFCS 2002, 257-268
Proceedings Article
IngalalliMaster2011Ingalalli, Vijay2011Evolutionary algorithms to compute lower bounds for the star discrepancy
Universität des Saarlandes
Thesis - Masters thesis
INRIA-00340887:1Emiris, Ioannis Z.
Hemmer, Michael
Karavelas, Menelaos
Mourrain, Bernard
Tsigaridas, Elias P.
Zafeirakopoulos, Zafeirakis
2008Attachment IconExperimental evaluation and cross-benchmarking of univariate real solversReport
inserpoints2006Teramoto, Sachio
Asano, Tetsuo
Katoh, Naoki
Doerr, Benjamin
2006Inserting Points Uniformly at Every Instance
In: IEICE - Transactions on Information and Systems [E89-D], 2348-2356
Journal Article
IntLiar2006Doerr, Benjamin
Lengler, Johannes
Steurer, Daniel
2006Attachment IconThe Interval Liar Game
In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 318-327
Proceedings Article
IPL::FriesMNT1987Fries, O.
Mehlhorn, Kurt
Näher, Stefan
Tsakalidis, A.
1987A $\log \log n$ data structure for three-sided range queries
In: Information Processing Letters [25], 269-273
Journal Article
IPL::JungM1988Jung, Hermann
Mehlhorn, Kurt
1988Attachment IconParallel algorithms for computing maximal independent sets in trees and for updating minimum spanning trees
In: Information Processing Letters [27], 227-236
Journal Article
IPL::Mehlhorn1988Mehlhorn, Kurt1988Attachment IconA faster approximation algorithm for the Steiner problem in graphs
In: Information Processing Letters [27], 125-128
Journal Article
Issac2015SamplingIssac, Davis2015Sampling in Space Restricted Settings
In: Computing and Combinatorics 2015,
Proceedings Article
ITMMP2006Irving, Robert W.
Telikepalli, Kavitha
Mehlhorn, Kurt
Michail, Dimitrios
Paluch, Katarzyna
2006Attachment IconRank-Maximal Matchings
In: ACM Transactions on Algorithms [2], 602-610
Journal Article
JACM::MehlhornP1986Mehlhorn, Kurt
Preparata, F. P.
1986Attachment IconRouting through a Rectangle
In: Journal of the ACM [33], 60-85
Journal Article
JainKoetzingStephan2011Jain, Sanjay
Kötzing, Timo
Stephan, Frank
2012Enlarging Learnable Classes
In: Algorithmic Learning Theory : 23rd International Conference, ALT 2012, 36-50
Proceedings Article
JALGO::KaufmannM1986Kaufmann, Michael
Mehlhorn, Kurt
1986Attachment IconRouting through a Generalized Switchbox
In: Journal of Algorithms [7], 510-531
Journal Article
Janardan-Smid95Janardan, Ravi
Smid, Michiel
1995On the width and roundness of a set of points in the plane
In: 7th Canadian Conference on Computational Geometry, 193-198
Proceedings Article
Jansen-Latin-98Jansen, Klaus1998A 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
Jansen-STACS-98Jansen, Klaus1998The 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
JansenKMS2010Jansen, Klaus
Kratsch, Stefan
Marx, Dániel
Schlotter, Ildikó
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
JansenNeumann2010Jansen, Thomas
Neumann, Frank
2010Editorial for the Special Issue on Theoretical Aspects of Evolutionary Multi-Objective Optimization
In: Evolutionary Computation [18], 333-334
Journal Article
JansenPorkolab2002Jansen, Klaus
Porkolab, Lorant
2002Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks
In: Algorithmica [32], 507-520
Journal Article
JansenSolisObaSviridenko2000Jansen, Klaus
Solis-Oba, Roberto
Sviridenko, Maxim
2000Linear time approximation schemes for shop scheduling problems
In: Approximation and complexity in numerical optimization, 338-346
Part of a Book
Jez2008ICALPJez, Artur
Okhotin, Alexander
2014Computational completeness of equations over sets of natural numbers
In: Information and Computation [237], 56-94
Journal Article
Jez2012STACSJez, Artur2014The Complexity of Compressed Membership Problems for Finite Automata
In: Theory of Computing Systems [55], 685-718
Journal Article
Jez2013CPMJez, Artur2013Attachment IconApproximation of Grammar-Based Compression via Recompression
In: 24th Annual Symposium on Combinatorial Pattern Matching (CPM 2013), 165-176
Proceedings Article
Jez2013DLTJez, Artur
Okhotin, Alexander
2013Unambiguous Conjunctive Grammars over a One-Letter Alphabet
In: 17th International Conference on Developments in Language Theory (DLT 2013), 277-288
Proceedings Article
Jez2013DLTIIJez, Artur2013Attachment IconRecompression: Word Equations and Beyond
In: 17th International Conference on Developments in Language Theory (DLT 2013), 12-26
Proceedings Article
Jez2013ICALPJez, Artur2013Attachment IconOne-Variable Word Equations in Linear Time
In: 40th International Colloquium on Automata, Languages, and Programming (ICALP 2013), 324-335
Proceedings Article
Jez2013STACSJez, Artur2013Attachment 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
Jez2014CPMJez, Artur2014A really Simple Approximation of Smallest Grammar
In: 25th Annual Symposium on Combinatorial Pattern Matching (CPM 2014), 182-191
Proceedings Article
Jez2014CSRDiekert, Volker
Jez, Artur
Plandowski, Wojciech
2014Finding All Solutions of Equations in Free Groups and Monoids with Involution
In: 9th International Computer Science Symposium in Russia (CSR 2014), 1-15
Proceedings Article
Jez2014ICALPJez, Artur2014Context Unification is in PSPACE
In: 41st International Colloquium on Automata, Languages, and Programming (ICALP 2014), 244-255
Proceedings Article
Jez2014STACSJez, Artur
Lohrey, Markus
2014Attachment IconApproximation of smallest linear tree grammar
In: 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 445-457
Proceedings Article
JezMaletti2013Jez, Artur
Maletti, Andreas
2013Hyper-minimization for deterministic tree automata
In: International Journal of Foundations of Computer Science [24], 815-830
Journal Article
JLM1998Jünger, Michael
Leipert, Sebastian
Mutzel, Petra
1998Level Planarity Testing in Linear Time
In: Proceedings of the 6th International Symposium on Graph Drawing (GD-98), 224-237
Proceedings Article
JLM98Jünger, Michael
Leipert, Sebastian
Mutzel, Petra
1998A Note on Computing a Maximal Planar Subgraph using PQ-Trees
In: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems [17], 609-612
Journal Article
JMO97Jünger, Michael
Lee, E. K.
Mutzel, Petra
Odenthal, Thomas
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
JOCO:EMR10Elbassioni, Khaled
Makino, Kazuhisa
Rauf, Imran
2011On the readability of monotone Boolean formulae
In: Journal of Combinatorial Optimization [22], 293-304
Journal Article
joe97Könemann, Jochen1997Fast combinatorial algorithms for packing and covering problems
Universität des Saarlandes
Thesis - Masters thesis
Johannsen2006aJohannsen, Daniel2006Attachment IconSampling Rooted 3-Connected Planar Graphs in Deterministic Polynomial Time
Humboldt-Universität zu Berlin
Thesis - Masters thesis
JohannsenLK2010Johannsen, Daniel
Lengler, Johannes
2010Attachment IconCan Quantum Search Accelerate Evolutionary Algorithms?
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 1433-1440
Proceedings Article
JohannsenPanagiotou2010Johannsen, Daniel
Panagiotou, Konstantinos
2010Attachment IconVertices of Degree k in Random Maps
In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1436-1447
Proceedings Article
JohannsenPhD2010Johannsen, Daniel2010Attachment IconRandom combinatorial structures and randomized search heuristics
Universität des Saarlandes
Thesis - PhD thesis
JohannsenRazgonWahlstroem2008Johannsen, Daniel
Razgon, Igor
Wahlström, Magnus
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
jounal/ploscb/ZotenkoMOP2008Zotenko, Elena
Mestre, Julián
O'Leary, Dianne
Przytyzka, Teresa
2008Essential Complex Biological Modules Explain the Centrality-Lethality Rule
In: PLoS Computational Biology [x], x-x
Journal Article
journals/dcg/AltMWW88Alt, Helmut
Mehlhorn, Kurt
Wagener, Hubert
Welzl, Emo
1988Attachment IconCongruence, Similarity, and Symmetries of Geometric Objects
In: Discrete and Computational Geometry [3], 237-256
Journal Article
journals/tc/FurerM89Fürer, Martin
Mehlhorn, Kurt
1989Attachment IconAT$^2$-Optimal Galois Field Multiplier for VLSI
In: IEEE Transactions on Computers [38], 1333-1336
Journal Article
journal/algo/GandhiM2007Gandhi, Rajiv
Mestre, Julián
2009Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
In: Algorithmica [54], 54-71
Journal Article
Juenger-Mutzel-1-97Jünger, Michael
Mutzel, Petra
19972-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms
In: Journal of Graph Algorithms and Applications [1], 1-25
Journal Article
Juenger-Mutzel-2-96Jünger, Michael
Mutzel, Petra
1996Exact and heuristic algorithms for 2-layer straightline crossing minimization
In: Graph Drawing (GD95), -
Proceedings Article
Juenger-Mutzel95Jünger, Michael
Mutzel, Petra
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
Juenger-Mutzel96Jünger, Michael
Mutzel, Petra
1996Maximum planar subgraphs and nice embeddings: Practical layout tools
In: Algorithmica [16], 33-59
Journal Article
Jung96Jung, Karin1996Die hierarchische Darstellung konvexer Polyeder und einige Anwendungen
Universität des Saarlandes
Thesis - Masters thesis
JungLenhofMüllerRüb1999Jung, Bernd
Lenhof, Hans-Peter
Müller, Peter
Rüb, Christine
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
JungLenhofMuellerRueb2000Jung, Bernd
Lenhof, Hans-Peter
Müller, Peter
Rüb, Christine
2000Simulating synthetic polymer chains in parallel
In: Future Generation Computer Systems [16], 513-522
Journal Article
jurkiewicz2009Jurkiewicz, Tomasz2009Cycle Bases in Graphs
Universität des Saarlandes
Thesis - Masters thesis
Jurkiewicz2013Jurkiewicz, Tomasz2013Attachment IconToward Better Computation Models for Modern Machines
Universität des Saarlandes
Thesis - PhD thesis
JurkiewiczDanilewski2011Jurkiewicz, Tomasz
Danilewski, Piotr
2011Efficient Quicksort and 2D Convex Hull for CUDA, and MSIMD as a Realistic Model of Massively Parallel Computations.Unpublished/Draft
Juurlink-Mutzel95Juurlink, Ben
Mutzel, Petra
1995?
In: Conference on High-Performance Computing, 125-130
Proceedings Article
Juurlink-Sibeyn95Juurlink, Ben
Sibeyn, Jop F.
1995Fast Routing on Weak Hypercubes: Making the Valiant-Brebner Algorithm More Practical
In: Conference on High-Performance Computing, 755-760
Proceedings Article
Kaligosi2006aKaligosi, Kanela
Sanders, Peter
2006How Branch Mispredictions Affect Quicksort
In: Algorithms - ESA 2006, 14th Annual European Symposium, 780-791
Proceedings Article
Kaligosi2006bBrodal, Gerth Stølting
Kaligosi, Kanela
Katriel, Irit
Kutz, Martin
2006Faster Algorithms for Computing Longest Common Increasing Subsequences
In: Combinatorial Pattern Matching, 17th Annual Symposium, CPM 2006, 330-341
Proceedings Article
Kaligosi/Master03Kaligosi, Kanela2003Length bounded network flows
Universität des Saarlandes
Thesis - Masters thesis
KamranDipl05Kamran Azam, Muhammad2005Branch-and-Cut Techniques for Generalized Asymmetric Traveling Salesman Problem
Universität des Saarlandes
Thesis - Masters thesis
Kapoor96Kapoor, Sanjiv1996On minimum 3-cuts and approximating k-cuts using cut trees
In: Integer Programming and Combinatorial Optimization : International Conference (IPCO-5), 132-146
Proceedings Article
KapoorSmid96Kapoor, Sanjiv
Smid, Michiel
1996New techniques for exact and approximate dynamic closest-point problems
In: SIAM Journal on Computing [25], 775-796
Journal Article
Kappel98Kappel, Holger1998Eine Methode zur Berechnung von Vorzeichen ganzzahliger Determinanten
Universität des Saarlandes
Thesis - Masters thesis
Karkkainen2002Kärkkäinen, Juha2002Computing the threshold for q-gram filters
In: Algorithm theory, SWAT 2002 : 8th Scandinavian Workshop on Algorithm Theory, 348-357
Proceedings Article
Karkkainen2003aKärkkäinen, Juha
Rao, S. Srinivasa
2003Full-Text Indexes in External Memory
In: Algorithms for Memory Hierarchies, 149-170
Part of a Book
KarkkainenSanders2003Kärkkäinen, Juha
Sanders, Peter
2003Simple Linear Work Suffix Array Construction
In: Automata, languages and programming : 30th International Colloquium, ICALP 2003, 943-955
Proceedings Article
Karrenbauer2004Karrenbauer, Andreas2004Packing Boxes with Arbitrary Rotations
Universität des Saarlandes
Thesis - other
KarrenbauerPhDKarrenbauer, Andreas2007Attachment IconEngineering combinatorial optimization algorithms to improve the lifetime of OLED displays
Universität des Saarlandes
Thesis - PhD thesis
Kasan95Kasan, Binaman1995Die Beschreibung der Design Features fr die rechnerunterstützte Konstruktion und ihre formale Repräsentation
Universität des Saarlandes
Thesis - Masters thesis
Katajainen-Traeff97Katajainen, Jyrki
Träff, Jesper Larsson
1997A meticulous analysis of mergesort programs
In: Proceedings of the 3rd Italian Conference on Algorithms and Complexity (CIAC-97), 217-228
Proceedings Article
KatMey03Katriel, Irit
Meyer, Ulrich
2003Elementary Graph Algorithms in External Memory
In: Algorithms for Memory Hierarchies, 62-84
Part of a Book
Katriel2004Katriel, Irit2004Attachment IconOn Algorithms for Online Topological Ordering and SortingReport
Katriel2004aKatriel, Irit2004Dynamic 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
Katriel2004bKatriel, Irit2004On the Algebraic Complexity of Set Equality and Inclusion
In: Information Processing Letters [92], 175-178
Journal Article
KatrielSWC2004Beldiceanu, Nicolas
Katriel, Irit
Thiel, Sven
2005GCC-like Restrictions on the Same constraint
In: Constraint Satisfaction and Constraint Logic Programming : ERCIM/CoLogNet International Workshop, CSCLP 2004, 1-11
In: Recent Advances in Constraints [3419], 1-11
Proceedings Article
KatrielThesis2004Katriel, Irit2004Constraints and Changes
Universität des Saarlandes
Thesis - PhD thesis
KatrielThielGCCKatriel, Irit
Thiel, Sven
2005Complete Bound Consistency for the Global Cardinality Constraint
In: Constraints [10], 191-217
Journal Article
KatSanTra03Katriel, Irit
Sanders, Peter
Träff, Jesper Larsson
2003A Practical Minimum Spanning Tree Algorithm Using the Cycle Property
In: Algorithms - ESA 2003: 11th Annual European Symposium, 679-690
Proceedings Article
Kaufmann-Meyer-Sibeyn94Kaufmann, Michael
Meyer, Ulrich
Sibeyn, Jop F.
1994Towards Practical Permutation Routing on Meshes
In: Proceedings of the 6th IEEE Symposium on Parallel and Distributed Processing, 656-663
Proceedings Article
Kaufmann-Meyer-Sibeyn97aKaufmann, Michael
Meyer, Ulrich
Sibeyn, Jop F.
1997Matrix Transpose on Meshes: Theory and Practice
In: Computers and Artificial Intelligence [16], 107-140
Journal Article
Kaufmann-Meyer-Sibeyn97bKaufmann, Michael
Meyer, Ulrich
Sibeyn, Jop F.
1997Matrix Transpose on Meshes: Theory and Practice
In: Proceedings of the 11th International Parallel Processing Symposium (IPPS-97), 315-319
Proceedings Article
Kaufmann-Raman-Sibeyn97Kaufmann, Michael
Raman, Rajeev
Sibeyn, Jop F.
1997Routing on Meshes with Buses
In: Algorithmica [18], 417-444
Journal Article
Kaufmann-Schroeder-Sibeyn95Kaufmann, Michael
Schröder, Heiko
Sibeyn, Jop F.
1995Asymptotically Optimal and Practical Routing on the Reconfigurable Mesh
In: Parallel Processing Letters [5], 81-95
Journal Article
Kaufmann-Sibeyn-1-95Kaufmann, Michael
Sibeyn, Jop F.
1995Solving Cheap Graph Problems on Meshes
In: Mathematical Foundations of Computer Science 1995: 20th International Symposium (MFCS95), 412-422
Proceedings Article
Kaufmann-Sibeyn-Suel95Kaufmann, Michael
Sibeyn, Jop F.
Suel, Torsten
1995Beyond the Worst-Case Bisection Bound:
Fast Ranking and Counting on Meshes
In: Algorithms - ESA'95: 3rd Annual European Symposium, 75-88
Proceedings Article
Kaufmann84/12Kaufmann, Michael
Mehlhorn, Kurt
1984Attachment IconLocal routing of two-terminal nets is easyReport
Kav08Kavitha, Telikepalli2008On a Special Co-cycle Basis of Graphs
In: 11th Scandinavian Workshop on Algorithm Theory (SWAT), 343-354
Proceedings Article
Kavitha2007TCSKavitha, Telikepalli
Mehlhorn, Kurt
2007Attachment IconAlgorithms to compute minimum cycle basis in directed graphs
In: Theory of Computing Systems [40], 485-505
Journal Article
Kavitha2012Kavitha, Telikepalli
Mestre, Julián
2012Max-coloring paths: tight bounds and extensions
In: Journal of Combinatiorial Optimization [24], 1-14
Journal Article
KavithaALG2011Kavitha, Telikepalli
Mehlhorn, Kurt
Michail, Dimitrios
2011New Approximation Algorithms for Minimum Cycle Bases of Graphs
In: Algorithmica [59], 471-488
Journal Article
KavithaMestre2008Kavitha, Telikepalli
Mestre, Julian
2009Max-coloring paths: Tight bounds and extensions
In: Algorithms and Computation : 20th International Symposium, ISAAC 2009, 87-96
Proceedings Article
KavithaMestre2010Kavitha, Telikepalli
Mestre, Julian
2010Max-coloring paths: Tight bounds and extensions
In: Journal of Combinatorial Optimization [Online First], 1 - 14
Electronic Journal Article
KavithaTCS2011Kavitha, Telikepalli
Mestre, Julian
Nasre, Meghana
2011Popular mixed matchings
In: Theoretical Computer Science [412], 2679-2690
Journal Article
KavvadiasPantziouSpirakisZaroliagis96Kavvadias, Dimitris J.
Pantziou, Grammati E.
Spirakis, Paul G.
Zaroliagis, Christos
1996Hammock-on-ears decomposition : a technique for the efficient parallel solution of shortest paths and other problems
In: Theoretical Computer Science [168], 121-154
Journal Article
Kelsen-et-al95Han, Xiaofeng
Kelsen, Pierre
Ramachandran, Vijaya
Tarjan, Robert E.
1995Computing minimal spanning subgraphs in linear time
In: SIAM Journal on Computing [24], 1332-1358
Journal Article
Kelsen96Kelsen, Pierre1996Neighborhood graphs and distributed "^" + 1-coloring
In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, 223-233
Proceedings Article
KelsenMahajanRamesh96Kelsen, Pierre
Mahajan, Sanjeev
Ramesh, Hariharan
1996Approximate hypergraph coloring
In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, 41-52
Proceedings Article
kerber-ijcm-2009Kerber, Michael2009Division-Free Computation of Subresultants Using Bezout Matrices
In: International Journal of Computer Mathematics [86], 2186-2200
Journal Article
Kerber2006Kerber, Michael2006Attachment IconAnalysis of Real Algebraic Plane Curves
Universität des Saarlandes
Thesis - Masters thesis
KerberPhD2009Kerber, Michael2009Geometric Algorithms for Algebraic Curves and Surfaces
Universität des Saarlandes
Thesis - PhD thesis
KerberSagraloff:RootApprox:2011Kerber, Michael
Sagraloff, Michael
2011Efficient Real Root Approximation
In: ISSAC 2011 : Proceedings of the 36th International Symposium on Symbolic and Algebraic Computation, 209-216
Proceedings Article
KerberSagraloff_JSC_2012Kerber, Michael
Sagraloff, Michael
2012A worst-case bound for topology computation of algebraic curves
In: Journal of Symbolic Computation [47], 239-258
Journal Article
Kerber_CASC_2009Kerber, Michael2009Attachment IconOn the Complexity of Reliable Root Approximation
In: Computer Algebra in Scientific Computing : 11th International Workshop, CASC 2009, 155-167
Proceedings Article
Kerzmann2000Kerzmann, Andreas2000Zwangsbasierte Dynamiksimulationen im R2 unter Verwendung von Kreiskanten
Universität des Saarlandes
Thesis - Masters thesis
Kesselmann2004aKesselman, Alexander
Kogan, Kirill
2005Non-Preemptive Scheduling of Optical Switches
In: 2004 IEEE Global Telecommunications Conference workshops (GLOBECOM'04), 1840-1844
Proceedings Article
Kesselmann2004bKesselman, Alexander
Guez, Dan
Rosen, Adi
2004Packet-Mode Policies for Input-Queued Switches
In: Sixteenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-04), 93-102
Proceedings Article
Kesselmann2004cKesselman, Alexander
Lotker, Zvi
Mansour, Yishay
Patt-Shamir, Boaz
Schieber, Baruch
Sviridenko, Maxim
2004Buffer Overflow Management in QoS Switches
In: SIAM Journal on Computing [33], 563-583
Journal Article
Kesselmann2004dKesselman, Alexander
Mansour, Yishay
2004Harmonic Buffer Management for Shared-Memory Switches
In: Theoretical Computer Science [324], 161-182
Journal Article
Kesselmann2005wonsKesselman, Alexander
Kowalski, Dariusz
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
Kessler-Traeff97Keßler, Christoph W.
Träff, Jesper Larsson
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
KesslerDipl02Kessler, Harald2002Robust Computation of Visibility Maps
Universität des Saarlandes
Thesis - Masters thesis
Kettner2003DegreeBoundKettner, Lutz
Kirkpatrick, David
Mantler, Andrea
Snoeyink, Jack
Speckmann, Bettina
Takeuchi, Fumihiko
2003Tight Degree Bounds for Pseudo-triangulations of Points
In: Computational Geometry - Theory and Applications [25], 3-12
Journal Article
Kettner2003SafariKettner, Lutz
Rossignac, Jarek
Snoeyink, Jack
2003The Safari Interface for Visualizing Time-dependent Volume Data Using Iso-surfaces and Contour Spectra
In: Computational Geometry - Theory and Applications [25], 97-116
Journal Article
Kettner2004ClassroomKettner, Lutz
Mehlhorn, Kurt
Pion, Sylvain
Schirra, Stefan
Yap, Chee
2004Attachment IconClassroom Examples of Robustness Problems in Geometric Computations
In: ESA 2004: 12th Annual European Symposium on Algorithms, 702-713
Proceedings Article
Kettner2004HandbookKettner, Lutz
Näher, Stefan
2004Two Computational Geometry Libraries: LEDA and CGAL
In: Handbook of Discrete and Computational Geometry, 1435-1463
Part of a Book
Kettner2005HandleKettner, Lutz2005Reference Counting in Library Design---Optionally and with Union-Find Optimization
In: Library-Centric Software Design (LCSD'05), 1-10
Electronic Proceedings Article
Kettner2005PseudoTriangEnumBrönnimann, Hervé
Kettner, Lutz
Pocchiola, Michel
Snoeyink, Jack
2005Counting and enumerating pointed pseudo-triangulations with the greedy flip algorithm
In: Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics
(ALENEX/ANALCO 2005), 98-110
Proceedings Article
Kettner2005SocgVideoProceedingsMitchell, Rote, Kettner (ed.)200521st Annual Symposium on Computational Geometry (SCG'05)Proceedings
Kettner2005StxxlDementiev, Roman
Kettner, Lutz
Sanders, Peter
2005STXXL: Standard Template Library for XXL Data Sets
In: Algorithms - ESA 2005 : 13th Annual European Symposium (ESA 2005), 640-651
Proceedings Article
Kettner2005StxxlReportDementiev, Roman
Kettner, Lutz
Sanders, Peter
2005STXXL: Standard Template Library for XXL Data SetsReport
Kettner2006HandleKettner, Lutz2006Reference 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
Kettner2006PseudoTEnumBrönnimann, Hervé
Kettner, Lutz
Pocchiola, Michel
Snoeyink, Jack
2006Attachment IconCounting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm
In: SIAM Journal on Computing [36], 721-739
Journal Article
Kettner2007CGALKernelHert, Susan
Hoffmann, Michael
Kettner, Lutz
Pion, Sylvain
Seel, Michael
2007An adaptable and extensible geometry kernel
In: Computational Geometry: Theory and Applications [38], 16-36
Journal Article
Kettner2007ClassroomKettner, Lutz
Mehlhorn, Kurt
Pion, Sylvain
Schirra, Stefan
Yap, Chee
2008Attachment IconClassroom Examples of Robustness Problems in Geometric Computations
In: Computational Geometry: Theory and Applications [40], 61-78
Journal Article
Kettner2007ECGBookMourrain, Bernard
Pion, Sylvain
Schmitt, Susanne
Técourt, Jean-Pierre
Tsigaridas, Elias
Wolpert, Nicola
2007Algebraic Issues in Computational Geometry
In: Effective Computational Geometry for Curves and Surfaces, 117-155
Part of a Book
Kettner2007ECGBookzFogel, Efi
Halperin, Dan
Kettner, Lutz
Teillaud, Monique
Wein, Ron
Wolpert, Nicola
2007Attachment IconArrangements
In: Effective Computational Geometry for Curves and Surfaces, 1-66
Part of a Book
Kettner2007Nef3Hachenberger, Peter
Kettner, Lutz
Mehlhorn, Kurt
2007Attachment IconBoolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, Optimized Implementation and Experiments
In: Computational Geometry: Theory and Applications [38], 64-99
Journal Article
Kettner98Kettner, Björn1998Eine Implementation von k-Server-Algorithmen
Universität des Saarlandes
Thesis - Masters thesis
KhachiyanPorkolab2000Khachiyan, Leonid
Porkolab, Lorant
2000Integer optimization on convex semialgebraic sets
In: Discrete & Computational Geometry [23], 207-224
Journal Article
Khosla2013Khosla, Megha2013Balls into Bins Made Faster
In: Algorithms - ESA 2013,
Proceedings Article
KimPaulPhilip2012Kim, Eun Jung
Paul, Christophe
Philip, Geevarghese
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
KKM01Klau, Gunnar W.
Klein, Karsten
Mutzel, Petra
2001An Experimental Comparison of Orthogonal Compaction Algorithms
In: Proceedings of the 8th International Symposium on Graph Drawing (GD-00), 37-51
Proceedings Article
KKSKesselman, Alexander
Kowalski, Dariusz
Segal, Michael
2005Attachment IconEnergy efficient communication in ad hoc networks from user's and designer's perspective
In: Proceedings of the n?th Conference on, 15-26
In: ACM SIGMOBILE Mobile Computing and Communications Review [9], 15-26
Journal Article
KKS-DSNKonwar, Kishori
Kowalski, Dariusz
Shvartsman, Alexander
2004The Join problem in dynamic network algorithms
In: 2004 International Conference on Dependable Systems and Networks (DSN 2004), 315-324
Proceedings Article
Klaer94Klär, Gerhard1994Verdrahtungsproblem auf planaren Graphen
Universität des Saarlandes
Thesis - Masters thesis
Klau1997bKlau, Gunnar W.1998Attachment IconVisuelle Zeitenwende: Bilder - Technik - Reflexionen. Quasi-orthogonales ZeichnenMiscellaneous
Klau97aKlau, Gunnar W.1997Attachment IconQuasi-orthogonales Zeichnen planarer Graphen mit wenigen Knicken
Universität des Saarlandes
Thesis - Masters thesis
KlauDiss01Klau, Gunnar W.2002A Combinatorial Approach to Orthogonal Placement Problems
Universität des Saarlandes
Thesis - PhD thesis
Klauk/Diplom04Klauk, Mathias2004Ein Algorithmus zur Konstruktion des Voronoidiagramms von Kreisbögen
Universität des Saarlandes
Thesis - Masters thesis
KlauMutzel1999Klau, Gunnar W.
Mutzel, Petra
1999Combining Graph Labeling and Compaction
In: Proceedings of the 7th International Symposium on Graph Drawing (GD-99), 27-37
Proceedings Article
KlauMutzel1999aKlau, Gunnar W.
Mutzel, Petra
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
Klein03/89Klein, R.
Mehlhorn, Kurt
Meiser, Stefan
1989Attachment IconOn the construction of abstract Voronoi diagrams, II.Report
Klein2000Klein, Karsten2000Flußbasierte orthogonale Zeichenverfahren für Graphen mit variablen Knotengrößen
Universität des Saarlandes
Thesis - Masters thesis
Klein2004Klein, Christian2004Attachment IconControlled Perturbation for Voronoi Diagrams
Universität des Saarlandes
Thesis - Masters thesis
Klein2004bKlein, Christian2004Attachment IconA Fast Root Checking AlgorithmReport
KleMehMei90Klein, R.
Mehlhorn, Kurt
Meiser, Stefan
1990On the Construction of Abstract Voronoi Diagrams, II
In: Algorithms (ISA-90) : 1st international symposium (SIGAL-90), 138-154
Proceedings Article
KlKu2006aKlein, Rolf
Kutz, Martin
2007Attachment IconComputing Geometric Minimum-Dilation Graphs Is NP-Hard
In: Graph Drawing : 14th International Symposium, GD 2006, 196-207
Proceedings Article
KlKu2006bKlein, Rolf
Kutz, Martin
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
KLM+2000Kececioglu, John
Lenhof, Hans-Peter
Mehlhorn, Kurt
Mutzel, Petra
Reinert, Knut
Vingron, Martin
2000Attachment IconA polyhedral approach to sequence alignment problems
In: Discrete Applied Mathematics [104], 143-186
Journal Article
KM00aKlau, Gunnar W.
Mutzel, Petra
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
KM03aKlau, Gunnar W.
Mutzel, Petra
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
KM03bMehlhorn, Kurt2003Attachment IconThe reliable algorithmic software challenge RASC : dedicated to Thomas Ottmann on the occassion of his 60th birthday
In: Computer Science in Perspective : essays dedicated to Thomas Ottmann, 255-263
Part of a Book
KM08Kavitha, Telikepalli
Nasre, Meghana
2008Optimal Popular MatchingsMiscellaneous
KM2005Kavitha, Telikepalli
Mehlhorn, Kurt
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
KMM07Kavitha, Telikepalli
Mehlhorn, Kurt
Michail, Dimitrios
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
KMMP2004cKavitha, Telikepalli
Mehlhorn, Kurt
Michail, Dimitrios
Paluch, Katarzyna
2004Attachment IconA Faster Algorithm for Minimum Cycle Basis of Graphs
In: Automata, languages and programming : 31st International Colloquium, ICALP 2004, 846-857
Proceedings Article
KMS-ICDCSKowalski, Dariusz
Musial, Peter M.
Shvartsman, Alexander
2005Explicit combinatorial structures for cooperative distributed algorithms
In: 25th IEEE International Conference on Distributed Computing Systems (ICDCS'05), 49-58
Proceedings Article
KMV2005Katriel, Irit
Michel, Laurent
Van Hentenryck, Pascal
2005Maintaining Longest Paths Incrementally
In: Constraints [10], 159-183
Journal Article
KMW2010Kratsch, Stefan
Marx, Dániel
Wahlström, Magnus
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
Knauer2012Knauer, Christian
Schlipf, Lena
Schmidt, Jens M.
Tiwary, Hans Raj
2012Largest Inscribed Rectangles in Convex Polygons
In: Journal of Discrete Algorithms [13], 78-85
Journal Article
KobelBachelor2008Kobel, Alexander2008Automated Generation of Kempe Linkages for Algebraic Curves in a Dynamic Geometry System
Universität des Saarlandes
Thesis - Bachelor thesis
KobelMaster2011Kobel, Alexander2011Certified numerical root finding
Universität des Saarlandes
Thesis - Masters thesis
Koe-Leh-Neu-Oli:c:10:AcoMinCutKötzing, Timo
Lehre, Per Kristian
Neumann, Frank
Oliveto, Pietro S.
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
Koe-Neu-Roe-Wit:c:10:ACOTSPKötzing, Timo
Neumann, Frank
Röglin, Heiko
Witt, Carsten
2010Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem
In: Swarm Intelligence : 7th International Conference, ANTS 2010, 324-335
Proceedings Article
Koe-Neu-Sud-Wag:c:Foga11AcoLinFunKötzing, Timo
Neumann, Frank
Sudholt, Dirk
Wagner, Markus
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
Koetzing2010LatticeLearningKasprzik, Anna
Kötzing, Timo
2010String Extension Learning Using Lattices
In: Language and Automata Theory and Applications : 4th International Conference, LATA 2010, 380-391
Proceedings Article
Koetzing2010NUMemLimitedCase, John
Kötzing, Timo
2010Solutions to Open Questions for Non-U-Shaped Learning with Memory Limitations
In: Algorithmic Learning Theory : 21st International Conference, ALT 2010, 285-299
Proceedings Article
Koetzing2010NUTechniquesCase, John
Kötzing, Timo
2010Strongly Non-U-Shaped Learning Results by General Techniques
In: COLT 2010 : The 23rd Conference on Learning Theory, 181-193
Proceedings Article
KoetzingALT2011Kötzing, Timo2011Iterative Learning from Positive Data and Counters
In: Algorithmic Learning Theory : 22nd International Conference, ALT 2011, 40-54
Proceedings Article
KoetzingMolter2012Kötzing, Timo
Molter, Hendrik
2012ACO beats EA on a dynamic pseudo-Boolean function
In: Parallel Problem Solving from Nature - PPSN XII : 12th International Conference, 113-122
Proceedings Article
KoetzingNRW2012Kötzing, Timo
Neumann, Frank
Röglin, Heiko
Witt, Carsten
2012Theoretical analysis of two ACO approaches for the traveling salesman problem
In: Swarm Intelligence [6], 1-21
Journal Article
KoetzingNS11GPKötzing, Timo
Neumann, Frank
Spöhel, Reto
2011PAC learning and genetic programming
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 2091-2096
Proceedings Article
KoetzingSNO2011Kötzing, Timo
Sutton, Andrew M.
Neumann, Frank
O'Reilly, Una-May
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
KoetzingST2011Kötzing, Timo
Sudholt, Dirk
Theile, Madeleine
2011How crossover helps in pseudo-Boolean optimization
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 989-996
Proceedings Article
KohlbacherLenhof1999Kohlbacher, Oliver
Lenhof, Hans-Peter
1999Rapid Software Prototyping in Computational Molecular Biology
In: Proceedings of the German Conference on Bioinformatics (GCB'99), 81-92
Proceedings Article
KohlbacherLenhof2000Kohlbacher, Oliver
Lenhof, Hans-Peter
2000BALL - Rapid Software Prototyping in Computational Molecular Biology
In: Bioinformatics [16], 815-824
Journal Article
Koldehofe1999Koldehofe, Boris1999Animation and Analysis of Distributed Algorithms
Universität des Saarlandes
Thesis - Masters thesis
Koller-et-al:dominance-constraintsKoller, Alexander
Mehlhorn, Kurt
Niehren, Joachim
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
Kollias2012Kollias, Konstantinos2013Nonpreemptive Coordination Mechanisms for Identical Machines
In: Theory of Computing Systems [53], 424-440
Electronic Journal Article
Kontogiannis2000Kontogiannis, Spyros
Pantziou, Grammati E.
Spirakis, Paul G.
Yung, Moti
2000Attachment IconRobust Parallel Computations through Randomization
In: Theory of Computing Systems [33], 427-464
Journal Article
Kontogiannis2002Kontogiannis, Spyros2002Lower 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
Kov07Kovács, Annamária2007Fast Algorithms for Two Scheduling Problems
Universität des Saarlandes
Thesis - PhD thesis
Kovacs2004Kovács, Annamária2004Sum-Multicoloring on Paths
In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), 68-80
Proceedings Article
Kovacs2005aKovács, Annamária2005Polynomial Time Preemptive Sum-Multicoloring on Paths
In: Automata, languages and programming : 32nd International Colloquim, ICALP 2005, 840-852
Proceedings Article
Kovacs2005bKovács, Annamária2005Fast monotone 3-approximation algorithm for scheduling related machines
In: Algorithms - ESA 2005: 13th Annual European Symposium, 616-627
Proceedings Article
Kovacs2006Kovács, Annamária2006Tighter Approximation Bounds for LPT Scheduling in Two Special Cases
In: Algorithms and Complexity : 6th Italian Conference, CIAC 2006, 187-198
Proceedings Article
Kowalik2005Kowalik, Lukasz2006Improved Edge Coloring with Three Colors
In: Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, WG 2006, 90-101
Proceedings Article
Kowalik2006Chrobak, Marek
Dürr, Christoph
Jawor, Wojciech
Kowalik, Lukasz
Kurowski, Maciej
2006A Note on Scheduling Equal-Length Jobs to Maximize Throughput
In: Journal of Scheduling [9], 71-73
Journal Article
Kowalik2009Kowalik, Lukasz2009Improved edge-coloring with three colors
In: Theoretical Computer Science [410], 3733-3742
Journal Article
KowalikAdjSparseGraphsKowalik, Lukasz2007Adjacency Queries in Dynamic Sparse Graphs
In: Inf. Proc. Lett. [-], -
Journal Article
KowalikEdgeColoringCole, Richard
Kowalik, Lukasz
2008New Linear-Time Algorithms for Edge-Coloring Planar Graphs
In: Algorithmica [50], 351-368
Journal Article
KowalikISAAC2006Kowalik, Lukasz2006Approximation Scheme for Lowest Outdegree Orientation and Graph Density Measures
In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 557-566
Proceedings Article
KowalikKotzigCole, Richard
Kowalik, Lukasz
Skrekovski, Riste
2007A Generalization of Kotzig's Theorem and Its Application
In: SIAM Journal on Discrete Mathematics [21], 93-106
Journal Article
Kowalski-LATIN-2004Fraigniaud, Pierre
Gasieniec, Leszek
Kowalski, Dariusz
Pelc, Andrzej
2004Collective Tree Exploration
In: LATIN 2004: Theoretical informatics, 6th Latin American Symposium, 141-151
Proceedings Article
Kowalski-SODA-2004Chrobak, Marek
Gasieniec, Leszek
Kowalski, Dariusz
2004The Wake-Up problem in multi-hop radio networks
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 985-993
Proceedings Article
Kowalski-SPAA-2004Kowalski, Dariusz
Shvartsman, Alex
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
Kowalski-STOC-2004Chlebus, Bogdan S.
Kowalski, Dariusz
Shvartsman, Alex
2004Collective asynchronous reading with polylogarithmic worst-case overhead
In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC-04), 321-330
Proceedings Article
Kowalski2003aChlebus, Bogdan S.
Kowalski, Dariusz
2004Randomization helps to perform independent tasks reliably
In: Random Structures and Algorithms [24], 11-41
Journal Article
Kowalski2003bKowalski, Dariusz
Pelc, Andrzej
2004Time of deterministic broadcasting in radio networks with local knowledge
In: SIAM Journal on Computing [33], 870-891
Journal Article
KP-APPROXKowalski, Dariusz
Pelc, Andrzej
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
KP-ISAACKowalski, Dariusz
Pelc, Andrzej
2004Polynomial deterministic rendezvous in arbitrary graphs
In: Algorithms and Computation: 15th International Symposium, ISAAC 2004, 644-656
Proceedings Article
KP-SIROCCOKowalski, Dariusz
Pelc, Andrzej
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
KP-TCSKowalski, Dariusz
Pelc, Andrzej
2005Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism
In: Theoretical Computer Science [333], 355-371
Journal Article
KPSS2010Kuhn, Fabian
Panagiotou, Konstantinos
Spencer, Joel
Steger, Angelika
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
KrandickMehlhorn2004aKrandick, Werner
Mehlhorn, Kurt
2004New Bounds for the Descartes MethodReport
KraNeuGECCO2009Kratsch, Stefan
Neumann, Frank
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
Kratsch-et-al:intervalKratsch, Dieter
McConnell, Ross
Mehlhorn, Kurt
Spinrad, Jeremy P.
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
Kratsch2008Kratsch, Stefan2009Polynomial 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
KratschLNO2010Kratsch, Stefan
Lehre, Per Kristian
Neumann, Frank
Oliveto, Pietro Simone
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
KratschPhD2010Kratsch, Stefan2010Kernelization of generic problems : upper and lower bounds
Universität des Saarlandes
Thesis - PhD thesis
KratschPilipczukPilipczukWahlstroem2012Kratsch, Stefan
Pilipczuk, Marcin
Pilipczuk, Michał
Wahlström, Magnus
2012Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs
In: Automata, Languages, and Programming ; 39th International Colloquium, ICALP 2012, 581-593
Proceedings Article
KratschS2010Kratsch, Stefan
Schweitzer, Pascal
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
KratschW2009Kratsch, Stefan
Wahlström, Magnus
2009Two Edge Modification Problems without Polynomial Kernels
In: Parameterized and Exact Computation : 4th International Workshop, IWPEC 2009, 264-275
Proceedings Article
KratschWahlstroem2012aKratsch, Stefan
Wahlström, Magnus
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
KratschWahlstroem2012bKratsch, Stefan
Wahlström, Magnus
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
KroGhaMicNeuPPSN2008Kroeske, Jense
Ghandar, Adam
Michalewicz, Zbigniew
Neumann, Frank
2008Learning Fuzzy Rules with Evolutionary Algorithms - An Analytic Approach
In: Parallel Problem Solving from Nature (PPSN X), 1051-1060
Proceedings Article
KrohmerMaster2012Krohmer, Anton2012Finding cliques in scale-free networks
Universität des Saarlandes
Thesis - Masters thesis
KrStWe2009Krumke, Sven
van Stee, Rob
Westphal, Stefan
2009Attachment IconOnline job admissions
In: Fundamental Problems in Computing : Essays in Honor of Professor Daniel J. Rosenkrantz, 435-454
Part of a Book
Krysta1999aKrysta, Piotr
Pacholski, Leszek
1999The STO problem is NP-complete
In: Journal of Symbolic Computation [27], 207-219
Journal Article
Krysta2001Krysta, Piotr
Kumar, V. S. Anil
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
Krysta2001bKrysta, Piotr2001Approximation Algorithms for Combinatorial Optimization Problems in Graph Coloring and Network Design
Universität des Saarlandes
Thesis - PhD thesis
Krysta2001cKrysta, Piotr
Solis-Oba, Roberto
2001Approximation Algorithms for Bounded Facility Location
In: Journal of Combinatorial Optimization [5], 233-247
Journal Article
Krysta2002aCsaba, Bela
Krysta, Piotr
Karpinski, Marek
2002Approximability of Dense and Sparse Instances of Minimum 2-Connectivity, TSP and Path Problems
In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-02), 74-83
Proceedings Article
Krysta2002bCzumaj, Artur
Krysta, Piotr
Vöcking, Berthold
2002Selfish Traffic Allocation for Server Farms
In: Proceedings of the 34th ACM Symposium on Theory of Computing (STOC-02), 287-296
Proceedings Article
Krysta2003bKrysta, Piotr2003Approximating Minimum Size 1,2-Connected Networks
In: Discrete Applied Mathematics [125], 267-288
Journal Article
KrystaLorys1999Krysta, Piotr
Lorys, Krzysztof
1999Efficient approximation algorithms for the achromatic number
In: Proceedings of the 7th Annual European Symposium on Algorithms (ESA-99), 402-413
Proceedings Article
ks-ncrah-10Kerber, Michael
Sagraloff, Michael
2011A Note on the Complexity of Real Algebraic Hypersurfaces
In: Graphs and Combinatorics [27], 419-430
Journal Article
KS11Kayal, Neeraj
Saha, Chandan
2011Attachment IconOn the Sum of Square Roots of Polynomials and Related Problems
In: 26th IEEE Conference on Computational Complexity (CCC), 292-299
Proceedings Article
KS12Kayal, Neeraj
Saha, Chandan
2012Attachment IconOn the Sum of Square Roots of Polynomials and Related Problems
In: The ACM Transactions on Computation Theory [4], 9:1-9:15
Journal Article
Ksinsik96Ksinsik, Patric1996Approximative Bewegungsplanung für einen rechteckigen Roboter mit Hilfe von Voronoidiagrammen
Universität des Saarlandes
Thesis - Masters thesis
KSV03Krysta, Piotr
Sanders, Peter
Vöcking, Berthold
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
KT03:gccKatriel, Irit
Thiel, Sven
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
Kumar1999aKumar, V. S. Anil
Ramesh, Hariharan
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
Kumar1999bKumar, V. S. Anil
Ramesh, Hariharan
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
Kumar2000Kumar, V. S. Anil
Arya, Sunil
Ramesh, Hariharan
2000Hardness of Set Cover with Intersection 1
In: Automata, Languages and Programming, Proceedings of the 27th International Colloquium (ICALP-00), 624-635
Proceedings Article
Kumar2001aKumar, V. S. Anil2001Coupling vs. conductance for the Jerrum-Sinclair chain
In: Random Structures & Algorithms [18], 1-17
Journal Article
Kursawe2002Albers, Susanne
Kursawe, Klaus
Schuierer, Sven
2002Exploring unkown environments with obstacles
In: Algorithmica [32], 123-143
Journal Article
Kursawe98Kursawe, Klaus1998Exploration von geometrischen Umgebungen mit Hindernissen
Universität des Saarlandes
Thesis - Masters thesis
Kutz05Kutz, Martin
Pór, Attila
2005Attachment IconAngel, Devil, and King
In: Computing and Combinatorics : 11th Annual International Conference, COCOON 2005, 925-934
Proceedings Article
Kutz2006Kutz, Martin2006Computing 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
Kutz3dAngelKutz, Martin2005Conway's Angel in three dimensions
In: Theoretical Computer Science [349], 443-451
Journal Article
KutzHGames:2004Kutz, Martin2005Weak Positional Games on Hypergraphs of Rank Three
In: 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 31-36
Proceedings Article
KutzSchw2006Kutz, Martin
Schweitzer, Pascal
2007ScrewBox: a Randomized Certifying Graph Non-Isomorphism Algorithm
In: 9th Workshop on Algorithm Engineering and Experiments (ALENEX'07), 150-157
Proceedings Article
KW2010bKratsch, Stefan
Wahlström, Magnus
2010Preprocessing of Min Ones Problems: A Dichotomy
In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010, 653-665
Proceedings Article
Kwappik98Kwappik, Carsten1998Exact Linear Programming
Universität des Saarlandes
Thesis - Masters thesis
KwekMehlhorn2003Kwek, St.
Mehlhorn, Kurt
2003Attachment IconOptimal Search for Rationals
In: Information Processing Letters [86], 23-26
Journal Article
Lambert2000


Lambert, Oliver2000Parallele und externe Implementierung eines Zusammenhangskomponentenalgorithmus
Universität des Saarlandes
Thesis - Masters thesis
LambertDipl01Lambert, Georg2001Ein Parametric Search Toolkit
Universität des Saarlandes
Thesis - Masters thesis
Lang94Lang, Hans-Hermann1994Hidden Line Elimination für iso-orientierte Rechtecke
Universität des Saarlandes
Thesis - Masters thesis
Lauer1998DiplomLauer, Thorsten1998Design und Implementierung eines Testmanagers für LiDIA
Universität des Saarlandes
Thesis - Masters thesis
Lee2010aChan, Ho-Leung
Lam, Tak-Wah
Lee, Lap-Kei
Ting, Hing-Fung
2010Continuous monitoring of distributed data streams over a time-based sliding window
In: 27th International Symposium on Theoretical Aspects of Computer Science
STACS 2010, 179-190
Electronic Proceedings Article
Lee2010bChan, Sze-Hang
Lam, Tak-Wah
Lee, Lap-Kei
2010Non-clairvoyant speed scaling for weighted flow time
In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. I, 23-35
Proceedings Article
Lee2010cHan, Xin
Lam, Tak-Wah
Lee, Lap-Kei
To, Isaac K. K.
Wong, Prudence W. H.
2010Deadline scheduling and power management for speed bounded processors
In: Theoretical Computer Science [411], 3587-3600
Journal Article
Lee2010dChan, Ho-Leung
Edmonds, Jeff
Lam, Tak-Wah
Lee, Lap-Kei
Marchetti-Spaccamela, Alberto
Pruhs, Kirk
2011Nonclairvoyant speed scaling for flow and energy
In: Algorithmica [61], 507-517
Journal Article
Lee2011bChan, Sze-Hang
Lam, Tak-Wah
Lee, Lap-Kei
2011Scheduling for weighted flow time and energy with rejection penalty
In: 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011), 392-403
Electronic Proceedings Article
Leejh2000aLee, Jae-Ha
Park, Sang-Min
Chwa, Kyung-Yong
2000Searching a polygonal room with one door by a 1-searcher
In: International Journal of Computational Geometry and Applications [10], 201-220
Journal Article
Leejh2000bLee, Jae-Ha
Shin, Chan-Su
Chwa, Kyung-Yong
2000Optimal Embedding of Multiple Directed Hamiltonian Rings into d-dimensional Meshes
In: Journal of Parallel and Distributed Computing [60], 775-783
Journal Article
Leejha2001Park, Sang-Min
Lee, Jae-Ha
Chwa, Kyung-Yong
2001Visibility-Based Pursuit-Evasion in a Polygonal Region by a Searcher
In: Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP-01), 456-468
Proceedings Article
Leejhc2000Lee, Jae-Ha
Cheong, Otfried
Kwon, Woo-Cheol
Shin, Sung-Yong
Chwa, Kyung-Yong
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
Leejhd2000Park, Sang-Min
Lee, Jae-Ha
Chwa, Kyung-Yong
2000Characterization of Rooms Searchable by Two Guards
In: Proceedings of the 11th Conference on Algorithms and Computation, 515-526
Proceedings Article
LeeLK2012Chan, Ho-Leung
Lam, Tak-Wah
Lee, Lap-Kei
Ting, Hing-Fung
2012Continuous Monitoring of Distributed Data Streams over a Time-Based Sliding Window
In: Algorithmica [62], 1088-1111
Journal Article
LehNeuOliCEC2009Oliveto, Pietro Simone
Lehre, Per Kristian
Neumann, Frank
2009Theoretical Analysis of Rank-Based Mutation - Combining Exploration and Exploitation
In: 2009 IEEE Congress on Evolutionary Computation : CEC, 1455-1462
Proceedings Article
LehnSchw2007Lehnert, Jörg
Schweitzer, Pascal
2007The Co-Word Problem for the Higman-Thompson Group is context-free
In: Bulletin of the London Mathematical Society [39], 235-241
Journal Article
Leinenbach95Leinenbach, Stefan1997Eine effiziente Implementierung des Datentyps Polyeder
Universität des Saarlandes
Thesis - Masters thesis
Lenhof-1-97Lenhof, Hans-Peter1997New 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
Lenhof-et-al-1-97Reinert, Knut
Lenhof, Hans-Peter
Mehlhorn, Kurt
Mutzel, Petra
Kececioglu, John
1997Attachment IconA Branch-And-Cut algorithm for multiple sequence alignment
In: Proceedings of the 1st Annual International Conference on Computational Molecular Biology (RECOMB-97), 241-250
Proceedings Article
Lenhof-et-al-2-97Jung, Bernd
Lenhof, Hans-Peter
Müller, Peter
Rüb, Christine
1997Langevin dynamics simulations of macromolecules on parallel computers
In: Macromolecular Theory and Simulation [6], 507-521
Journal Article
Lenhof-et-al-3-97Jung, Bernd
Lenhof, Hans-Peter
Müller, Peter
Rüb, Christine
1997Parallel MD-simulations of synthetic polymers
In: Parallel processing for scientific computing (PPSC-97) : 8th SIAM conference, CD-ROM
Proceedings Article
Lenhof-et-al95Datta, Amitava
Lenhof, Hans-Peter
Schwarz, Christian
Smid, Michiel
1995Static and dynamic algorithms for k-point clustering problems
In: Journal of Algorithms [19], 474-503
Journal Article
Lenhof-Smid-1-92Lenhof, Hans-Peter
Smid, Michiel
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
Lenhof-Smid-1-95Lenhof, Hans-Peter
Smid, Michiel
1995Maintaining the visibility map of spheres while moving the viewpoint
In: Algorithmica [13], 301-312
Journal Article
Lenhof-Smid-2-92Lenhof, Hans-Peter
Smid, Michiel
1992Enumerating the k closest pairs optimally
In: 33rd Annual Symposium on Foundations of Computer Science (FOCS92), 380-386
Proceedings Article
Lenhof-Smid-2-94Lenhof, Hans-Peter
Smid, Michiel
1994Using persistent data structures for adding range restrictions to searching problems
In: RAIRO Theoretical Informatics and Applications [28], 25-49
Journal Article
Lenhof-Smid-2-95Lenhof, Hans-Peter
Smid, Michiel
1995Sequential and parallel algorithms for the k closest pairs problem
In: International Journal of Computational Geometry & Applications [5], 273-288
Journal Article
Lenhof-Smid-91Lenhof, Hans-Peter
Smid, Michiel
1991An optimal construction method for generalized convex layers
In: ISA'91 Algorithms: 2nd International Symposium on Algorithms, 349-363
Proceedings Article
Lenhof-Smid93Lenhof, Hans-Peter
Smid, Michiel
1993An optimal construction method for generalized convex layers
In: International Journal of Computational Geometry & Applications [3], 245-267
Journal Article
Lenhof-Smid94Lenhof, Hans-Peter
Smid, Michiel
1994An animation of a fixed-radius all-nearest neighbors algorithm
In: Proceedings of the 10th Symposium on Computational Geometry (SCG94), 387
Proceedings Article
Lenhof95Lenhof, Hans-Peter1995An Algorithm for the Protein Docking Problem
In: Bioinformatics: From Nucleic Acids and Proteins to Cell Metabolism, 125-139
Part of a Book
LenhofMorgensternReinert1999Lenhof, Hans-Peter
Morgenstern, Burkhard
Reinert, Knut
1999An exact solution for the segment-to-segment multiple sequence alignment problem
In: Bioinformatics [15], 203-210
Journal Article
lenhof_habilLenhof, Hans-Peter1999Bioinformatik
Universität des Saarlandes
Thesis - Habilitation thesis
Lennerz2001Lennerz, Christian
Schömer, Elmar
2002Efficient Distance Computation for Quadratic Curves and Surfaces
In: Proceedings of the 2nd Conference on Geometric Modeling and Processing, 60-69
Proceedings Article
LennerzDiss05Lennerz, Christian2005Distance Computation for Extended Quadratic Complexes
Universität des Saarlandes
Thesis - PhD thesis
LenReiVin1998Lenhof, Hans-Peter
Reinert, Knut
Vingron, Martin
1998A Polyhedral Approach to RNA Sequence Structure Alignment
In: Journal of Computational Biology [5], 517-530
Journal Article
LenReiVin98Lenhof, Hans-Peter
Reinert, Knut
Vingron, Martin
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
Leonardi03Henzinger, Monika R.
Leonardi, Stefano
2003Scheduling multicasts on unit-capacity trees and meshes
In: Journal of Computer and System Sciences [66], 567-611
Journal Article
Leonardi04Leonardi, Stefano
Schäfer, Guido
2004Cross-monotonic cost sharing methods for connected facility location games
In: Theoretical Computer Science [326], 431-442
Journal Article
Leonardi04ECLeonardi, Stefano
Schäfer, Guido
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
Lermen97Lermen, Martin1997Multiple Sequence Alignment
Universität des Saarlandes
Thesis - Masters thesis
Limbach2008Limbach, Sebastian2008Attachment IconContinued Work on the Computation of an Exact Arrangement of Quadrics
Universität des Saarlandes
Thesis - Masters thesis
LJM97Jünger, Michael
Leipert, Sebastian
Mutzel, Petra
1997Pitfalls of using PQ-Trees in Automatic graph Drawing
In: Proceedings of the 5th Symposium on Graph Drawing (GD-97), 193-204
Proceedings Article
LLMMS2003Laura, Luigi
Leonardi, Stefano
Millozzi, Stefano
Meyer, Ulrich
Sibeyn, Jop F.
2003Algorithms and Experiments for the Webgraph
In: Algorithms - ESA 2003: 11th Annual European Symposium, 703-714
Proceedings Article
lncs319*212Mehlhorn, Kurt
Rülling, W.
1988Compaction on the Torus
In: VLSI algorithms and architectures : 3rd Aegean Workshop on Computing, AWOC 88, 212-225
Proceedings Article
lncs333*55Gao, Shaodi
Kaufmann, Michael
Mehlhorn, Kurt
Rülling, Wolfgang
Storb, Christoph
Jerrum, Mark
1988On Continuous Homotopic One Layer Routing (Extended Abstract)
In: Computational geometry and its applications (CG-88) : international workshop, 55-70
Proceedings Article
lncs379*88Mehlhorn, Kurt
Näher, S
1989A library of efficient data types and algorithms
In: Mathematical foundations of computer science (MFCS-89) : 14th international symposium, 88-106
Proceedings Article
lotkeretal06cocoonLotker, Zvi
Majumdar, Debapriyo
Narayanaswamy, N.S.
Weber, Ingmar
2006Sequences Characterizing k-Trees
In: Computing and Combinatorics, 12th Annual International Conference, COCOON 2006, 216-225
Proceedings Article
LpDisc2006Doerr, Benjamin2007Attachment IconLp Linear discrepancy of totally unimodular matrices
In: Linear Algebra and Its Applications [420], 663-666
Journal Article
LR2000Lermen, Martin
Reinert, Knut
2000The practical use of the A* algorithm for exact multiple sequence alignment
In: Journal of Computational Biology [7], 665-671
Journal Article
ls-dc-01Loock, Achim
Schömer, Elmar
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
LSWahlstroem2012Lokshtanov, Daniel
Saurabh, Saket
Wahlström, Magnus
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
LuettkeHuettmann2000ThesisLüttke-Hüttmann, Dirk2000Knickminimales Zeichnen 4-planarer Clustergraphen
Universität des Saarlandes
Thesis - Masters thesis
Lutter96Lutter, Stefan1996Ein Bewegungsplanungsalgorithmus für zwei Rechtecke mit einem gemeinsamen Eckpunkt
Universität des Saarlandes
Thesis - Masters thesis
M01Mutzel, Petra2001An alternative method to crossing minimization on hierarchical graphs
In: SIAM Journal on Optimization [11], 1065-1080
Journal Article
Mahajan-Ramos-Subrahmanyam97Mahajan, Sanjeev
Ramos, Edgar A.
Subrahmanyam, K. V.
1997Solving some discrepancy problems in NC
In: Proceedings of the 17th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS-97), 22-36
Proceedings Article
MainbergerWTJND11Mainberger, Markus
Hoffmann, Sebastian
Weickert, Joachim
Tang, Ching Hoo
Johannsen, Daniel
Neumann, Frank
Doerr, Benjamin
2011Optimising Spatial and Tonal Data for Homogeneous Diffusion Inpainting
In: Scale Space and Variational Methods in Computer Vision : Third International Conference, SSVM 2011, 26-37
Proceedings Article
Mal05Elmasry, Amr
Elbassioni, Khaled M.
2005Output-Sensitive Algorithms for Enumerating and Counting Simplices Containing a Given Point in th Plane
In: 17th Canadian Conference on Computational Geometry (CCCG'05), 248-251
Electronic Proceedings Article
Mal05zMalamatos, Theocharis2005Lower bounds for expected-case planar point location
In: 17th Canadian Conference on Computational Geometry (CCCG'05), 191-194
Electronic Proceedings Article
Malamatos2007aArya, Sunil
Malamatos, Theocharis
Mount, David M.
Wong, Ka Chun
2007Optimal expected-case planar point location
In: SIAM Journal on Computing [37], 584-610
Journal Article
Malamatos2007bArya, Sunil
Malamatos, Theocharis
Mount, David M.
2007A simple entropy-based algorithm for planar point location
In: ACM Transactions on Algorithms [3], 17
Journal Article
Malamatos2008Malamatos, Theocharis2008Lower Bounds for expected-case planar point location
In: Computational Geometry Theory and Applications [39], 91-103
Journal Article
Manjunath2008Eigensatz, Michael
Giesen, Joachim
Manjunath, Madhusudan
2008The Solution Path of the Slab Support Vector Machine
In: The 20th Canadian Conference on Computational Geometry, 211-214
Proceedings Article
Manjunath2008thManjunath, Madhusudan2008Two topics in Geometry: Minimizing absolute Gaussian Curvature over meshes and Solution Path of the Slab Support Vector Machine
Universität des Saarlandes
Thesis - Masters thesis
Manjunath2009aGiesen, Joachim
Manjunath, Madhusudan
2009Minimizing Absolute Gaussian Curvature over Meshes
In: Computational Geometry, 1-16
Electronic Proceedings Article
Manjunath2009bElmasry, Amr
Manjunath, Madhusudan
2009Enumerating Trichromatic Triangles Containing the Origin in Linear Time
In: Japanese Conference in Computational Geometry and Graphs 2009, 101-103
Proceedings Article
Manjunath2010Amini, Omid
Manjunath, Madhusudan
2010Riemann-Roch for sublattices of the root lattice $A\_n$
In: Electronic Journal of Combinatorics [17], R124,1-R124,50
Electronic Journal Article
Manjunath2011Manjunath, Madhusudan
Sharma, Vikram
2011Applications of dimensionality reduction and exponential sums to graph automorphism
In: Theoretical Computer Science [412], 3639-3649
Journal Article
Manss97Manss, Christian1997Separatoren in planaren Graphen: Implementierung einer 2-Approximation
Universität des Saarlandes
Thesis - Masters thesis
MaRaSu00Ramos, Edgar A.2001Solving Some Discrepancy Problems in NC
In: Algorithmica [29], 371-395
Journal Article
Margewitsch97Margewitsch, Erwin1997Parallele Berechnung elektrostatischer Wechselwirkungen für synthetische Polymere
Universität des Saarlandes
Thesis - Masters thesis
Martens2004Martens, Maren
Skutella, Martin
2004Flows on Few Paths: Algorithms and Lower Bounds
In: Algorithms – ESA 2004: 12th Annual European Symposium, 520-531
Proceedings Article
Master03/ParreiraParreira, Josiane2003Information Retrieval by Dimension Reduction - A Comparative Study
Universität des Saarlandes
Thesis - Masters thesis
MasterWang2012Wang, Pengming2012Certification of Curve Arrangements
Universität des Saarlandes
Thesis - Masters thesis
MastSteurer06Steurer, David2006An Asymptomic Approximation Scheme for Multigraph Edge Coloring
Universität des Saarlandes
Thesis - Masters thesis
MatijevicPhDMatijevic, Domagoj2007Attachment IconGeometric Optimization and Querying - Exact and Approximate
Universität des Saarlandes
Thesis - PhD thesis
Maue2006Maue, Jens2006Attachment IconA Goal-Directed Shortest Path Algorithm Using Precomputed Cluster Distances
Universität des Saarlandes
Thesis - Masters thesis
MaueSandersMatijevic2006Maue, Jens
Sanders, Peter
Matijevic, Domagoj
2006Goal Directed Shortest Path Queries Using Precomputed Cluster Distances
In: Experimental Algorithms, 5th International Workshop, WEA 2006, 316-327
Proceedings Article
Maurer97Maurer, Tanja1997Heuristiken für Goldbergs Preflow Push Algorithmus
Universität des Saarlandes
Thesis - Masters thesis
Mavronikolas-et-al97Mavronicolas, Marios
Papatriantafilou, Marina
Tsigas, Philippas
1997The impact of timing on linearizability in counting networks
In: Proceedings of the 11th International Parallel Processing Symposium (IPPS-97), 684-688
Proceedings Article
Mcbg2006Bárány, Imre
Doerr, Benjamin
2006Attachment IconBalanced partitions of vector sequences
In: Linear Algebra and Its Applications [414], 464-469
Journal Article
McConnell2010Mehlhorn, Kurt
Näher, Stefan
Schweitzer, Pascal
2011Certifying algorithms
In: Computer Science Review [5], 119-161
Journal Article
McConnella2010McConnella, Ross M.
Mehlhorn, Kurt
Näher, Stefan
Schweitzer, Pascal
2010Certifying algorithms
In: Computer Science Review [Article in Press], 1-43
Electronic Journal Article
Megow2011-exploreMegow, Nicole
Mehlhorn, Kurt
Schweitzer, Pascal
2011Online Graph Exploration: New Results on Old and New Algorithms
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 478-489
Proceedings Article
Megow2011-MCschedBaruah, Sanjoy
Bonifaci, Vincenzo
D'Angelo, Gianlorenzo
Li, Haohan
Marchetti-Spaccamela, Alberto
Megow, Nicole
Stougie, Leen
2012Scheduling Real-Time Mixed-Criticality Jobs
In: IEEE Transactions on Computers [61], 1140-1152
Journal Article
Megow2011-speedAnand, S.
Garg, Naveen
Megow, Nicole
2011Meeting deadlines: How much speed suffices?
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011. - Pt. I, 232-243
Proceedings Article
Megow2012-eulerianHöhn, Wiebke
Jacobs, Tobias
Megow, Nicole
2012On Eulerian extensions and their application to no-wait flowshop scheduling
In: Journal of Scheduling [15], 295-309
Journal Article
Megow2012-universalEpstein, Leah
Levin, Asaf
Marchetti-Spaccamela, Alberto
Megow, Nicole
Mestre, Julian
Skutella, Martin
Stougie, Leen
2012Universal sequencing on an unreliable machine
In: SIAM Journal on Computing [41], 565-586
Journal Article
MegowMatheonBuch2009Megow, Nicole2010Keller oder Dach zuerst
In: Besser als Mathe, 111-116
Part of a Book
MegowMehlhornSchweitzer2012Megow, Nicole
Mehlhorn, Kurt
Schweitzer, Pascal
2012Online Graph Exploration: New Results on Old and New Algorithms
In: Theoretical Computer Science [463], 62-72
Journal Article
MegowMestre2013Megow, Nicole
Mestre, Julian
2013Instance-sensitive robustness guarantees for sequencing with unknown packing and covering constraints
In: 4th Conference on Innovations in Theoretical Computer Science (ITCS 2013),
Proceedings Article
MegowMS10-turnaroundMegow, Nicole
Möhring, Rolf H.
Schulz, Jens
2011Decision Support and Optimization in Shutdown and Turnaround Scheduling
In: INFORMS Journal on Computing [23], 189 - 204
Journal Article
MegowSVW2012Megow, Nicole
Skutella, Martin
Verschae, Jose
Wiese, Andreas
2012The Power of Recourse for Online MST and TSP
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 689-700
Proceedings Article
MegowV2013Megow, Nicole
Verschae, Jose
2013Dual techniques for scheduling on a machine with varying speed
In: Proc. of the 40th International Colloquium on Automata, Languages and Programming (ICALP 2013), 745–756
Proceedings Article
MegowWiese-SODA2013Günther, Elisabeth
Maurer, Olaf
Megow, Nicole
Wiese, Andreas
2013A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio
In: 24st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013),
Proceedings Article
mehhorn80eGüttler, Reiner
Mehlhorn, Kurt
Schneider, Wolfgang
1980Attachment IconBinary Search Trees: Average and Worst Case Behavior
In: Elektronische Informationsverarbeitung und Kybernetik [16], 41-61
Journal Article
MehlhonMestre2009Garg, Naveen
Kavitha, T.
Kumar, Amit
Mehlhorn, Kurt
Mestre, Julián
2010Assigning Papers to Referees
In: Algorithmica [58], 119-136
Journal Article
mehlhornKonidaris, G.
Mehlhorn, Kurt
Shell, D.A.
2004Attachment IconAn optimal algorithm for finding edge segment adjacencies in configurations of convex polygonsUnpublished/Draft
Mehlhorn-et-al-1-96Mehlhorn, Kurt
Näher, Stefan
Schilz, Thomas
Schirra, Stefan
Seel, Michael
Seidel, Raimund
Uhrig, Christian
1996Checking Geometric Programs or Verification of Geometric Structures
In: 12th Annual ACM Symposium on Computational Geometry (SCG 96), 159-165
Proceedings Article
Mehlhorn-et-al97Mehlhorn, Kurt
Shermer, Thomas C.
Yap, Chee
1997Attachment IconA complete roundness classification procedure
In: Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), 129-138
Proceedings Article
Mehlhorn-et-al99Mehlhorn, Kurt
Näher, Stefan
Seel, Michael
Seidel, Raimund
Schilz, Thomas
Schirra, Stefan
Uhrig, Christian
1999Attachment IconChecking geometric programs or verification of geometric structures
In: Computational Geometry: Theory and Applications [12], 85-104
Journal Article
Mehlhorn-Mutzel96Mehlhorn, Kurt
Mutzel, Petra
1996Attachment IconOn the Embedding Phase of the Hopcroft and Tarjan Planarity Testing Algorithm
In: Algorithmica [16], 233-242
Journal Article
Mehlhorn-Naeher95Mehlhorn, Kurt
Näher, Stefan
1995Attachment IconLEDA: A Platform for Combinatorial and Geometric Computing
In: Communications of the ACM [38], 96-102
Journal Article
Mehlhorn-Priebe95Mehlhorn, Kurt
Priebe, Volker
1995On the All-Pairs Shortest Path Algorithm of Moffat and Takaoka
In: Algorithms - ESA'95: 3rd Annual European Symposium, 185-198
Proceedings Article
Mehlhorn-Sanders:ToolboxMehlhorn, Kurt
Sanders, Peter
2008Algorithms and Data Structures: The Basic ToolboxBook
Mehlhorn-Schaefer:WeightedMatchingsMehlhorn, Kurt
Schäfer, Guido
2000Attachment IconImplementation of $O(nm \log n)$ weighted matchings: The power of data structures
In: 4th International Workshop on Algorithm Engineering, 23-38
Proceedings Article
Mehlhorn-Uhrig95Dietz, Paul
Mehlhorn, Kurt
Raman, Rajeev
Uhrig, Christian
1995Attachment IconLower bounds for set intersection queries
In: Algorithmica [14], 154-168
Journal Article
Mehlhorn-Uhrig97Mehlhorn, Kurt
Sundar, R.
Uhrig, Christian
1997Maintaining Dynamic Sequences under Equality Tests in Polylogarithmic Time
In: Algorithmica [17], 183-198
Journal Article
mehlhorn01cMehlhorn, Kurt2001Attachment IconA Remark on the Sign Variation Method for Real Root IsolationUnpublished/Draft
mehlhorn01gMehlhorn, Kurt2001Attachment IconFrom Algorithm to Program to Software Library
In: Informatics : 10 years back, 10 years ahead, 268-273
Part of a Book
Mehlhorn02Mehlhorn, Kurt2002Exact geometric computation
In: HERCMA 2001 : proceedings of the 5th Hellenic-European Conference on Computer Mathematics and its Applications (HERCMA-01), 87-87
Proceedings Article
mehlhorn03Mehlhorn, Kurt2003Attachment IconThe Reliable Algorithmic Software Challenge RASC
In: Experimental and efficient algorithms : Second International Workshop, WEA 2003, 222-222
Proceedings Article
mehlhorn05Lars, Bender, Demaine, Leiserson, Mehlhorn (ed.)2005Cache-Oblivious and Cache-Aware AlgorithmsReport
mehlhorn05Mehlhorn, Kurt2005Minimum Cycle Bases and Surface Reconstruction
In: Graph Drawing: 13th International Symposium, GD 2005, ,, 532-532
Proceedings Article
mehlhorn05Mehlhorn, Kurt
Waldmann, Uwe
Wilhelm, Reinhard
2005Harald Ganzinger : 31.10.1950 - 3.6.2004
In: MPG-Jahrbuch, 107-108
In: Jahrbuch / Max-Planck-Gesellschaft [?], 107-108
Part of a Book
mehlhorn05oKaligosi, Kanela
Mehlhorn, Kurt
Munro, J. Ian
Sanders, Peter
2005Attachment IconTowards Optimal Multiple Selection
In: Automata, languages and programming : 32nd International Colloquim, ICALP 2005, 103-114
Proceedings Article
mehlhorn05zFunke, Stefan
Mehlhorn, Kurt
Näher, Stefan
2005Attachment IconStructural filtering: a paradigm for efficient and exact geometric programs
In: Computational Geometry [31], 179-194
Journal Article
mehlhorn06Kettner, Lutz
Mehlhorn, Kurt
Pion, Sylvain
Schirra, Stefan
Yap, Chee
2006Reply to "Backward Error Analysis ..."
In: Computational Science and Its Applications - ICCSA 2006, I, 60-60
Proceedings Article
mehlhorn06bKratsch, Dieter
McConnell, Ross
Mehlhorn, Kurt
Spinrad, Jeremy P.
2006Attachment IconCertifying Algorithms for Recognizing Interval Graphs and Permutation Graphs
In: Siam Journal on Computing, 326-353
In: SIAM Journal on Computing [36], 326-353
Journal Article
mehlhorn06eKrandick, Werner
Mehlhorn, Kurt
2006Attachment IconNew bounds for the Descartes method
In: Journal of Symbolic Computation [41], 49-66
Journal Article
mehlhorn06xMehlhorn, Kurt2006Reliable and Efficient Geometric Computing
In: Algorithms and Complexity : 6th Italian Conference, CIAC 2006, 1-2
Proceedings Article
mehlhorn06yAbraham, David J.
Cechlárová, Katarína
Manlove, David
Mehlhorn, Kurt
2005Pareto Optimality in House Allocation Problems
In: Algorithms and computation : 16th International Symposium, ISAAC 2005, 1163-1175
Proceedings Article
mehlhorn06zAronov, Boris
Asano, Tetsuo
Katoh, Naoki
Mehlhorn, Kurt
Tokuyama, Takeshi
2006Polyline Fitting of Planar Points under Min-sum Criteria
In: International Journal of Computational Geometry and Applications [16], 97-116
Journal Article
Mehlhorn157Mehlhorn, Kurt
Seel, Michael
2003Attachment IconInfimaximal frames: A technique for making lines look like segments
In: International Journal of Computational Geometry & Applications [13], 241-255
Journal Article
Mehlhorn1993hClarkson, Kenneth L.
Mehlhorn, Kurt
Seidel, Raimund
1993Attachment IconFour Results on Randomized Incremental Constructions
In: Computational Geometry: Theory and Applications [3], 185-212
Journal Article
Mehlhorn1999Mehlhorn, Kurt
Näher, Stefan
1999LEDA: a platform for combinatorial and geometric computingBook
mehlhorn2000oMehlhorn, Snelting (ed.)2000Informatik 2000 : neue Horizonte im neuen Jahrhundert, 30. Jahrestagung der Gesellschaft für InformatikProceedings
Mehlhorn2004PolylineApproxAranov, Boris
Asano, Tetsuo
Katoh, Naoki
Mehlhorn, Kurt
Tokuyama, Takeshi
2004Attachment IconPolyline Fitting of Planar Points Under Min-sum Criteria
In: Algorithms and Computation: 15th International Symposium, ISAAC 2004, 77-88
Proceedings Article
Mehlhorn2007bMehlhorn, Kurt
Michail, Dimitrios
2007Attachment IconImplementing Minimum Cycle Basis Algorithms
In: Journal of Experimental Algorithmics [11], 1-14
Electronic Journal Article
Mehlhorn2008aGarg, Naveen
Kavitha, T.
Kumar, Amit
Mehlhorn, Kurt
Mestre, Julián
2008Attachment IconAssigning Papers to RefereesUnpublished/Draft
Mehlhorn2008bMehlhorn, Kurt
Kavitha, T.
Hariharan, R.
2008Attachment IconFaster Deterministic and Randomized Algorithms for Minimum Cycle Basis in Directed Graphs
In: SIAM Journal of Computing [38], 1430-1447
Journal Article
Mehlhorn2010Mehlhorn, Kurt2010Reliable and Efficient Geometric Computing
In: Mathematical Software, ICMS 2010 : Third International Congress
on Mathematical Software, 10-11
Proceedings Article
Mehlhorn2013Mehlhorn, Kurt
Neumann, A.
Schmidt, Jens M.
2013Certifying 3-Edge-Connectivity
In: 39th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'13), 358-369
Proceedings Article
mehlhorn73Mehlhorn, Kurt1973The "almost all" theory of subrecursive degrees is decidable
In: 14th Annual Symposium on Switching & Automata Theory (SSAT-73), 25
Report
mehlhorn73aMehlhorn, Kurt1973Attachment IconOn the Size of Sets of Computable Functions
In: 14th Annual Symposium on Switching & Automata Theory (SSAT-73), 190-196
Proceedings Article
mehlhorn73bMehlhorn, Kurt1973On the Size of Sets of Computable Functions
In: 14th Annual Symposium on Switching & Automata Theory (SSAT-73), 22
Report
mehlhorn74Mehlhorn, Kurt1974Polynomial and abstract subrecursive classes
In: 14th Annual Symposium on Switching & Automata Theory (SSAT-73), 14
Report
Mehlhorn74Mehlhorn, Kurt1974Attachment IconThe 'almost all' theory of subrecursive degrees is decidable
In: Automata, languages and programming : 2nd colloquium (ICALP-74), 317-325
Proceedings Article
mehlhorn74aMehlhorn, Kurt1974Attachment IconPolynomial and Abstract Subrecursive Classes
In: Conference Record of Sixth Annual ACM Symposium on Theory of computing (STOC-74), 96-109
In: Informatik Spektrum, 96-109
Proceedings Article
mehlhorn75Alt, Helmut
Mehlhorn, Kurt
1975Untere Schranken für den Platzbedarf bei der kontext-freien AnalyseReport
mehlhorn75aMehlhorn, Kurt1975A game on graphsReport
mehlhorn75bMehlhorn, Kurt1974Attachment IconPolynomial and abstract subrecursive classes
Cornell University
Thesis - PhD thesis
mehlhorn75byMehlhorn, Kurt1975Best possible bounds for the weighted path length of optimum binary search trees
In: Automata Theory and Formal Languages, 2nd GI Conference, 31-41
Proceedings Article
mehlhorn75bz
Alt, Helmut
Mehlhorn, Kurt
1975Attachment IconA Language over a One Symbol Alphabet Requiring only O(log log n) Space
In: SIGACT News [7], 31-33
Journal Article
mehlhorn75fMehlhorn, Kurt1975Attachment IconNearly Optimal Binary Search Trees
In: Acta Informatica [5], 287-295
Journal Article
mehlhorn75yMehlhorn, Kurt
Galil, Zvi
1975Monotone Switching Circuits and Boolean Matrix Product
In: Mathematical foundations of computer science (MFCS-75) : 4th symposium, 315-319
Proceedings Article
mehlhorn75zMehlhorn, Kurt1975Bracket-Languages are Recognizable in Logarithmic SpaceReport
mehlhorn76Güttler, Reiner
Mehlhorn, Kurt
Schneider, Wolfgang
1976Binary Search Trees: Average and Worst Case BehaviorReport
mehlhorn76Mehlhorn, Kurt1976An O(n log n) lower bound for the synchronous circuit size of integer multiplicationReport
Mehlhorn76bMehlhorn, Kurt1976Attachment IconAn Improved Lower Bound on the Formula Complexity of Context-Free Recognition
In: Elektronische Informationsverarbeitung und Kybernetik [12], 523-524
Journal Article
Mehlhorn76cMehlhorn, Kurt1976Attachment IconPolynomial and abstract subrecursive classes
In: Journal of Computer and System Sciences [12], 147-178
Journal Article
mehlhorn76eAlt, Helmut
Mehlhorn, Kurt
1976Attachment IconLower Bounds for the Space Complexity of Context-Free Recognition
In: Third International Colloquium on Automata, Languages and Programming, 338-354
Proceedings Article
mehlhorn76fHeydthausen, Manfred
Mehlhorn, Kurt
1976Top Down Parsing of Macro Grammars
In: GI - 6. Jahrestagung, 95-108
Proceedings Article
mehlhorn76fMehlhorn, Kurt1976Attachment IconBracket-languages are recognizable in logarithmic space
In: Information Processing Letters [5], 168-170
Journal Article
mehlhorn76gGüttler, Reiner
Mehlhorn, Kurt
Schneider, Wolfgang
Wernet, Norbert
1976Binary Search Trees: Average and Worst Case Behavior
In: GI - 6. Jahrestagung, 301-313
Proceedings Article
Mehlhorn76jMehlhorn, Kurt
Galil, Zvi
1976Attachment IconMonotone Switching Circuits and Boolean Matrix Product
In: Computing [16], 99-111
Journal Article
mehlhorn76vMehlhorn, Kurt1976An improved lower bound on the formula complexity of context-free recognitionReport
mehlhorn76wMehlhorn, Kurt1976Dynamic Binary Search Trees : Extended AbstractsReport
mehlhorn76xMehlhorn, Kurt1976Dynamic Binary SearchReport
mehlhorn76zHeydthausen, Manfred
Mehlhorn, Kurt
1976Top down parsing of macro grammars (preliminary report)Report
mehlhorn77Mehlhorn, Kurt1977Dynamic Binary Search
In: Automata, Languages and Programming : Fourth Colloquium (ICALP-77), 323-336
Proceedings Article
Mehlhorn77aMehlhorn, Kurt1977Attachment IconA best possible bound for the weighted path length of binary search trees
In: SIAM Journal on Computing [6], 235-239
Journal Article
mehlhorn77cMehlhorn, Kurt1977Effiziente AlgorithmenBook
mehlhorn77dDeussen, Peter
Mehlhorn, Kurt
1977Attachment IconVan Wijngaarden Grammars and Space Complexity Class EXSPACE
In: Acta Informatica [8], 193-199
Journal Article
mehlhorn78Altenkamp, Doris
Mehlhorn, Kurt
1978Codes: Unequal Probabilities, Unequal Letter Cost
In: Automata, languages and programming (ICALP-78): 5th international colloquium, 15-25
Proceedings Article
mehlhorn78Mehlhorn, Kurt1978Effiziente Algorithmen: Ein BeispielReport
mehlhorn78aMehlhorn, Kurt1978Attachment IconEffiziente Algorithmen: Ein Beispiel
In: Informatik Spektrum [1], 81-89
Journal Article
mehlhorn78tBlum, Norbert
Mehlhorn, Kurt
1978On the Average Number of Rebalancing Operations in Weight-Balanced TreesReport
mehlhorn78uMehlhorn, Kurt1978Sorting Presorted FilesReport
mehlhorn78wAlt, Helmut
Mehlhorn, Kurt
1978Complexity Arguments in Algebraic Language TheoryReport
[Replication or Save Conflict]
mehlhorn78xxAltenkamp, Doris
Mehlhorn, Kurt
1978Codes: Unequal Probabilities, Unequal Letter CostReport
mehlhorn78yMehlhorn, Kurt1978An efficient algorithm for constructing nearly optimal prefix codesReport
mehlhorn78zMehlhorn, Kurt1978Arbitrary Weight Changes in Dynamic TreesReport
mehlhorn79aAlt, Helmut
Mehlhorn, Kurt
1979Attachment IconComplexity arguments in algebraic language theory
In: Revue française d'automatique, d'informatique et de recherche opérationnelle : RAIRO / Association Française pour la Cybernétique Economique et Technique [13], 217-225
Journal Article
mehlhorn79bMehlhorn, Kurt1979Attachment IconParsing Macro Grammars Top Down
In: Information and Control [40], 123-143
Journal Article
mehlhorn79bzMehlhorn, Kurt1979Attachment IconDynamic Binary Search
In: SIAM Journal on Computing [8], 175-198
Journal Article
mehlhorn79cMehlhorn, Kurt1979Attachment IconDynamic data structures
In: Mathematical Centre Tracts [108], 71-96
Journal Article
mehlhorn79dMehlhorn, Kurt1979Some Remarks on Boolean Sums
In: Mathematical foundations of computer science (MFCS-79) : 8th symposium, 375-380
Proceedings Article
mehlhorn79dzMehlhorn, Kurt1979Attachment IconSearching, Sorting and Information Theory
In: Mathematical foundations of computer science (MFCS-79) : 8th symposium, 131-145
Proceedings Article
mehlhorn79eMehlhorn, Kurt1979Attachment IconKonzepte der Komplexitätstheorie illustriert am Beispiel des Sortierens
In: GI - 9. Jahrestagung, 16-22
Proceedings Article
mehlhorn79gBlum, Norbert
Mehlhorn, Kurt
1979Attachment IconMittlere Anzahl von Rebalancierungsoperationen in gewichtsbalancierten Bäumen
In: Theoretical Computer Science, 4th GI-Conference, 67-78
Proceedings Article
mehlhorn79hMehlhorn, Kurt1979Attachment IconSorting Presorted Files
In: Theoretical Computer Science, 4th GI-Conference, 199-212
Proceedings Article
mehlhorn79iMehlhorn, Kurt
Tsagarakis, M.
1979On the isomorphism of two algorithms: Hu/Tucker and Garsia/Wachs
In: Colloque de Lille `Les Arbres en Algebre et en Programmation' [??], ??
Journal Article
mehlhorn79jMehlhorn, Kurt1979Attachment IconSome Remarks on Boolean Sums
In: Acta Informatica [12], 371-375
Journal Article
mehlhorn80Mehlhorn, Kurt
Overmars, Mark H.
1980Optimal dynamization of decomposable searching problemsReport
mehlhorn80bMehlhorn, Kurt1980Attachment IconPebbling Mountain Ranges and its Application of DCFL-Recognition
In: Automata, languages and programming (ICALP-80) : 7th annual international colloquium, 422-435
Proceedings Article
mehlhorn80cBlum, Norbert
Mehlhorn, Kurt
1980Attachment IconOn the Average Number of Rebalancing Operations in Weight-Balanced Trees
In: Theoretical Computer Science [11], 303-320
Journal Article
mehlhorn80dAltenkamp, Doris
Mehlhorn, Kurt
1980Attachment IconCodes: Unequal Probabilities, Unequal Letter Cost
In: Journal of the ACM [27], 412-427
Journal Article
mehlhorn80dzMehlhorn, Kurt1980A New Data Structure for Representing Sorted Lists
In: Graph-theoretic concepts in computer science (WG-80) : 6th international workshop, 90-112
Proceedings Article
mehlhorn80fMehlhorn, Kurt1980Attachment IconAn Efficient Algorithm for Constructing Nearly Optimal Prefix Codes
In: IEEE Transactions on Information Theory [26], 513-517
Journal Article
mehlhorn80zMehlhorn, Kurt1980Lower bounds on the efficiency of transforming static data structures into dynamic structuresReport
mehlhorn81aHong, Jia-Wei
Mehlhorn, Kurt
Rosenberg, Arnold L.
1981Cost Tradeoffs in Graph Embeddings, with Applications (Preliminary Version)
In: Automata, languages and programming (ICALP-81) : 8th international colloquium, 41-55
Proceedings Article
mehlhorn81bMehlhorn, Kurt
Overmars, Mark H.
1981Attachment IconOptimal dynamization of decomposable searching problems
In: Information Processing Letters [12], 93-98
Journal Article
mehlhorn81cHuddleston, S.
Mehlhorn, Kurt
1981Attachment IconRobust balancing in B-trees
In: Theoretical computer science : 5th GI-conference, 234-244
Proceedings Article
mehlhorn81dMehlhorn, Kurt1981Attachment IconArbitrary Weight Changes in Dynamic Trees
In: Revue française d'automatique, d'informatique et de recherche opérationnelle : RAIRO [15], 183-211
Journal Article
mehlhorn81dzMehlhorn, Kurt1981Attachment IconLower bounds on the efficiency of transforming static data structures into dynamic structures
In: Mathematical Systems Theory [15], 1-16
Journal Article
mehlhorn81eAlt, Helmut
Mehlhorn, Kurt
Munro, J. Ian
1981Partial Match Retrieval in Implicit Data Structures
In: Mathematical foundations of computer science (MFCS-81) : 10th symposium, ,, 156-161
Proceedings Article
mehlhorn81gLengauer, Thomas
Mehlhorn, Kurt
1981On the Complexity of VLSI-Computations
In: VLSI Systems and Computations [??], 89-99
Journal Article
mehlhorn82aMehlhorn, Kurt1982Attachment IconA Partial Analysis of Height-Balanced Trees Under Random Insertions and Deletions
In: SIAM Journal on Computing [11], 748-760
Journal Article
mehlhorn82cHuddleston, Scott
Mehlhorn, Kurt
1982A New Data Structure for Representing Sorted Lists
In: Acta Informatica [17], 157-184
Journal Article
mehlhorn82dMehlhorn, Kurt
Schmidt, Erik M.
1982Las Vegas Is better than Determinism in VLSI and Distributed Computing
In: Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing (STOC 1982), 330-337
Proceedings Article
mehlhorn82eBecker, Michael
Degenhardt, W.
Doenhardt, J.
Hertel, S.
Kaninke, G.
Kerber, W.
Mehlhorn, Kurt
Näher, Stefan
Rohnert, H.
Winter, T.
1982Attachment IconA Probabilistic Algorithm for Vertex Connectivity of Graphs
In: Information Processing Letters [15], 135-136
Journal Article
mehlhorn82fMehlhorn, Kurt1982Attachment IconOn the Program Size of Perfect and Universal Hash Functions
In: 23th Annual Symposium on Foundations of Computer Science (FOCS 1982), 170-175
Proceedings Article
mehlhorn82gHong, Jia-Wei
Mehlhorn, Kurt
1982Cost tradeoffs in graph embeddings, with applicationsReport
mehlhorn83Mehlhorn, Kurt
Preparata, F. P.
1983Routing through a RectangleReport
mehlhorn83aLengauer, Thomas
Mehlhorn, Kurt
1983Four results on the complexity of VLSI computationsReport
mehlhorn83bEisenbarth, Bernhard
Ziviani, Nivio
Gonnet, Gaston H.
Mehlhorn, Kurt
Wood, Derick
1982Attachment IconThe Theory of Fringe Analysis and Its Application to 2-3 Trees and B-Trees
In: Information and Control [55], 125-174
Journal Article
mehlhorn83bzLengauer, Thomas
Mehlhorn, Kurt
1983Attachment IconThe HILL System: A Design Environment for the Hierarchical Specification, Compaction, and Simulation of Integrated Circuit LayoutsReport
mehlhorn83cLengauer, Thomas
Mehlhorn, Kurt
1983VLSI Complexity, Efficient VLSI Algorithms and the HILL Design SystemReport
mehlhorn83dMehlhorn, Kurt
Vishkin, Uzi
1983Granularity of parallel memoriesReport
mehlhorn83evon Braunmühl, Burchard
Cook, Stephen
Mehlhorn, Kurt
Verbeek, Rutger
1983The Recognition of Deterministic CFL's in Small Time and Space
In: Information and Control [56], 34-51
Journal Article
mehlhorn83fHertel, Stefan
Mehlhorn, Kurt
1983Fast Triangulation of Simple Polygons
In: Fundamentals of Computation Theory, Proceedings of the 1983 International FCT-Conference (FCT 1983), 207-218
Proceedings Article
mehlhorn83fHong, Jia-Wei
Mehlhorn, Kurt
Rosenberg, Arnold L.
1983Attachment IconCost Trade-offs in Graph Embeddings, with Applications
In: Journal of the ACM [30], 709-728
Journal Article

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