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

MPI-INF D1 Publications

MPI-INF D1 Publications

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

Login to this database


 

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

#YearTitleType
1
Hide details for Doerr, Moran, Moran, Winzen [-]Doerr, Moran, Moran, Winzen [-]
2012Simple and Optimal Fault-Tolerant Rumor Spreading
In: arXiv [abs/1209.6158], 1-18
Electronic Journal Article
1
Hide details for Doerr, Neumann [-]Doerr, Neumann [-]
2010In Memoriam: Ingo Wegener
In: Algorithmica [58], 541-542
Journal Article
1
Hide details for Doerr, Neumann, Sudholt, Witt [Neumann, Sudholt, Witt]Doerr, Neumann, Sudholt, Witt [Neumann, Sudholt, Witt]
2011Runtime analysis of the 1-ANT ant colony optimizer
In: Theoretical Computer Science [412], 1629-1644
Journal Article
1
Hide details for Doerr, Neumann, Sudholt, Witt [Sudholt, Witt, Thierens]Doerr, Neumann, Sudholt, Witt [Sudholt, Witt, Thierens]
2007On the Runtime Analysis of the 1-ANT ACO algorithm
In: Genetic and Evolutionary Computation Conference 2007, 33-40
Proceedings Article
1
Hide details for Doerr, Neumann, Wegener [Wegener]Doerr, Neumann, Wegener [Wegener]
2010Editorial
In: Algorithmica [57], 119-120
Journal Article
1
Hide details for Doerr, Pohl [Soule, Moore]Doerr, Pohl [Soule, Moore]
2012Run-time analysis of the (1+1) evolutionary algorithm optimizing linear functions over a finite alphabet
In: GECCO'12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation, 1317-1324
Proceedings Article
1
Hide details for Doerr, Schmidt, Ramakrishna [-]Doerr, Schmidt, Ramakrishna [-]
2013Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time
In: 39th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'13), 225-236
Proceedings Article
2
Hide details for Doerr, Spöhel, Thomas, Winzen [Thomas]Doerr, Spöhel, Thomas, Winzen [Thomas]
2013Playing Mastermind with many colors
In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013), 695-704
Proceedings Article
2012Playing Mastermind with Many Colors
In: Proc. of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2012),
Proceedings Article
2
Hide details for Doerr, Srivastav [Srivastav]Doerr, Srivastav [Srivastav]
2001Multi-Color Discrepancies
In: Electronic Notes in Discrete Mathematics [7], xx-xx
Journal Article
2001Multi-Color Discrepancy of Arithmetic Progressions
In: Electronic Notes in Discrete Mathematics [8], 27-30
Journal Article
1
Hide details for Doerr, Sudholt, Witt [Sudholt, Witt]Doerr, Sudholt, Witt [Sudholt, Witt]
2013When Do Evolutionary Algorithms Optimize Separable Functions in Parallel?
In: ACM/SIGEVO Foundations of Genetic Algorithms (FOGA 2013), 51-63
Proceedings Article
1
Hide details for Doerr, Theile [Theile, Raidl, Rothlauf]Doerr, Theile [Theile, Raidl, Rothlauf]
2009Improved Analysis Methods for Crossover-Based Algorithms
In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 247-254
Proceedings Article
1
Hide details for Doerr, Wahlström [Finocchi, Hershberger]Doerr, Wahlström [Finocchi, Hershberger]
2009Randomized Rounding in the Presence of a Cardinality Constraint
In: 2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX), 162-174
Proceedings Article
4
Hide details for Doerr, Winzen [-]Doerr, Winzen [-]
2014Ranking-Based Black-Box Complexity
In: Algorithmica [?], ?
Journal Article
2012Memory-restricted black-box complexity of OneMax
In: Information Processing Letters [112], 32-34
Journal Article
2012Playing Mastermind with Constant-Size Memory
In: Theory of Computing Systems [Online First], 1-27
Electronic Journal Article
2011Memory-Restricted Black-Box Complexity
In: Electronic Colloquium on Computational Complexity [18], 7
Electronic Journal Article
1
Hide details for Doerr, Winzen [Dürr, Wilke]Doerr, Winzen [Dürr, Wilke]
2012Playing Mastermind with Constant-Size Memory
In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, 441-452
Electronic Proceedings Article
1
Hide details for Doerr, Winzen [Hao, Legrand, Collet, Monmarché, Lutton, Schoenauer]Doerr, Winzen [Hao, Legrand, Collet, Monmarché, Lutton, Schoenauer]
2012Black-box complexity: Breaking the O(n logn) barrier of LeadingOnes
In: Artificial Evolution 10th International Conference Evolution Artificielle, EA 2011, 205-216
Proceedings Article
1
Hide details for Doerr, Winzen [Kulikov, Vereshchagin]Doerr, Winzen [Kulikov, Vereshchagin]
2011Towards a Complexity Theory of Randomized Search Heuristics: Ranking-Based Black-Box Complexity
In: Computer Science - Theory and Applications : 6th International Computer Science Symposium in Russia (CSR 2011), 15-28
Proceedings Article
1
Hide details for Doerr, Winzen [Soule, Moore]Doerr, Winzen [Soule, Moore]
2012Reducing the arity in unbiased black-box complexity
In: GECCO'12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation, 1309-1316
Proceedings Article
1
Hide details for Donato, Laura, Leonardi, Millozzi, Meyer, Sibeyn [Donato, Laura, Leonardi, Millozzi, Sibeyn]Donato, Laura, Leonardi, Millozzi, Meyer, Sibeyn [Donato, Laura, Leonardi, Millozzi, Sibeyn]
2006Attachment IconAlgorithms and Experiments for the Webgraph
In: Journal of Graph Algorithms and Applications [10], 219-236
Electronic Journal Article
1
Hide details for Dorchain [-]Dorchain [-]
1996An Implementation of a Convex Hull Algorithm Version 2.0
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Duan [-]Duan [-]
2013Attachment IconBreaking the $O(n^2.5)$ Deterministic Time Barrier for Undirected Unit-Capacity Maximum Flow
In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013), 1171-1179
Proceedings Article
1
Hide details for Duan, Mehlhorn [-]Duan, Mehlhorn [-]
2012A Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market
In: arXiv [abs/1212.0979v1], 1-8
Electronic Journal Article
1
Hide details for Dubhashi, Pantziou, Spirakis, Zaroliagis [Dubhashi, Pantziou, Spirakis]Dubhashi, Pantziou, Spirakis, Zaroliagis [Dubhashi, Pantziou, Spirakis]
1995The Fourth Moment in Luby's Distribution
In: Theoretical Computer Science [148], 133-140
Journal Article
1
Hide details for Dubhashi, Ranjan [Dubhashi, Ranjan]Dubhashi, Ranjan [Dubhashi, Ranjan]
1998Balls and Bins: A Study in Negative Dependence
In: Random Structures & Algorithms [13], 99-124
Journal Article
1
Hide details for Dubhashi, Ranjan, Mehlhorn, Thiel []Dubhashi, Ranjan, Mehlhorn, Thiel []
1993Attachment IconSearching, Sorting and Randomised Algorithms for Central Elements and Ideal Counting in Posets
In: Foundations of software technology and theoretical computer science (FSTTCS-93) : 13th conference, 436-443
Proceedings Article
1
Hide details for Dumitriu [-]Dumitriu [-]
2007Attachment IconGraph-based Conservative Surface Reconstruction
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Dumitriu, Funke, Kutz, Milosavljevic [Dumitriu, Funke, Kutz, Milosavljevic]Dumitriu, Funke, Kutz, Milosavljevic [Dumitriu, Funke, Kutz, Milosavljevic]
2009How Much Geometry It Takes to Reconstruct a 2-Manifold in R 3
In: ACM Journal of Experimental Algorithms [14], 2.2:1-2.2:17
Electronic Journal Article
1
Hide details for Dumitriu, Funke, Kutz, Milosavljevic [Funke, Kutz, Milosavljevic, Gudmundsson]Dumitriu, Funke, Kutz, Milosavljevic [Funke, Kutz, Milosavljevic, Gudmundsson]
2008On the Locality of Extracting a 2-Manifold in $R^3$
In: 11th Scandinavian Workshop on Algorithm Theory (SWAT-2008), 270-281
Proceedings Article
1
Hide details for Dumitriu, Funke, Kutz, Milosavljevic [Funke, Kutz, Milosavljevic]Dumitriu, Funke, Kutz, Milosavljevic [Funke, Kutz, Milosavljevic]
2008How much Geometry it takes to Reconstruct a 2-Manifold in $R^3$
In: 10th Workshop on Algorithm Engineering and Experiments (ALENEX-2008), 65-74
Proceedings Article
1
Hide details for Dumitriu, Funke, Kutz, Milosavljevic [Funke, Milosavljevic, Petitjean]Dumitriu, Funke, Kutz, Milosavljevic [Funke, Milosavljevic, Petitjean]
2008On the Locality of Extracting a 2-Manifold in $R^3$
In: Collection of abstracts of the 24th European Workshop on Computational Geometry, 205-208
Proceedings Article
1
Hide details for Duncan, Goodrich, Ramos [Duncan, Goodrich]Duncan, Goodrich, Ramos [Duncan, Goodrich]
1997Efficient approximation and optimization algorithms for computational metrology
In: Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-97), 121-130
Proceedings Article
1
Hide details for Dupont, Hemmer, Petitjean, Schömer [Dupont, Petitjean, Schömer, Arge, Hoffmann, Welzl]Dupont, Hemmer, Petitjean, Schömer [Dupont, Petitjean, Schömer, Arge, Hoffmann, Welzl]
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
1
Hide details for Durrett, Neumann, O'Reilly [Durrett, Neumann, O'Reilly, Beyer, Langdon]Durrett, Neumann, O'Reilly [Durrett, Neumann, O'Reilly, Beyer, Langdon]
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
1
Hide details for Eades, Marks, Mutzel, North [Eades, Marks, North, Whitesides]Eades, Marks, Mutzel, North [Eades, Marks, North, Whitesides]
1998Graph Drawing Contest Report
In: Proceedings of the 6th International Symposium on Graph Drawing (GD-98), 423-435
Proceedings Article
1
Hide details for Eades, Mutzel [Eades, Atallah]Eades, Mutzel [Eades, Atallah]
1998Graph Drawing Algorithms
In: Algorithms and Theory of Computation Handbook, 9-26
Part of a Book
1
Hide details for Ebert [-]Ebert [-]
2005Benchmark Data Sets for Conic Arrangements
Universität des Saarlandes
Thesis - Bachelor thesis
1
Hide details for Edelkamp, Meyer [Edelkamp, Baader, Brewka, Eiter]Edelkamp, Meyer [Edelkamp, Baader, Brewka, Eiter]
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
1
Hide details for Edelsbrunner, Ramos [Edelsbrunner]Edelsbrunner, Ramos [Edelsbrunner]
1997Inclusion-exclusion complexes for pseudo-disk collections
In: Discrete and Computational Geometry [17], 287-306
Journal Article
1
Hide details for Eigensatz, Giesen, Manjunath [Giesen, Eigensatz, Morin]Eigensatz, Giesen, Manjunath [Giesen, Eigensatz, Morin]
2008The Solution Path of the Slab Support Vector Machine
In: The 20th Canadian Conference on Computational Geometry, 211-214
Proceedings Article
3
Hide details for Eigenwillig [-]Eigenwillig [-]
2008Real Root Isolation for Exact and Approximate Polynomials Using Descartes' Rule of Signs
Universität des Saarlandes
Thesis - PhD thesis
2007Attachment 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
2003Attachment IconExact Arrangement Computation for Cubic Curves
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Eigenwillig, Kerber [-]Eigenwillig, Kerber [-]
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
1
Hide details for Eigenwillig, Kerber, Wolpert [Wolpert, Brown]Eigenwillig, Kerber, Wolpert [Wolpert, Brown]
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
1
Hide details for Eigenwillig, Kettner, Krandick, Mehlhorn, Schmitt, Wolpert [Krandick]Eigenwillig, Kettner, Krandick, Mehlhorn, Schmitt, Wolpert [Krandick]
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
2
Hide details for Eigenwillig, Kettner, Schömer, Wolpert [Schömer]Eigenwillig, Kettner, Schömer, Wolpert [Schömer]
2006Attachment IconExact, Efficient and Complete Arrangement Computation for Cubic Curves
In: Computational Geometry [35], 36-73
Journal Article
2004Complete, Exact and Efficient Computations with Cubic Curves
In: Proceedings of the Twentieth Annual Symposium on Computational Geometry : (SCG'04), 409-418
Proceedings Article
2
Hide details for Eigenwillig, Kettner, Wolpert [Wolpert]Eigenwillig, Kettner, Wolpert [Wolpert]
2007Attachment IconSnap Rounding of Bézier CurvesReport
2007Attachment IconSnap rounding of Bézier curves
In: Proceedings of the Twenty-Third Annual Symposium on Computational Geometry (SCG'07), 158-167
Proceedings Article
1
Hide details for Eigenwillig, Schömer, Wolpert [Schömer]Eigenwillig, Schömer, Wolpert [Schömer]
2002Sweeping Arrangements of Cubic Segments Exactly and EfficientlyReport
1
Hide details for Eigenwillig, Sharma, Yap [Sharma, Yap, Dumas]Eigenwillig, Sharma, Yap [Sharma, Yap, Dumas]
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
1
Hide details for Eiglsperger, Fekete, Klau [Eiglsperger, Fekete, Kaufmann, Wagner]Eiglsperger, Fekete, Klau [Eiglsperger, Fekete, Kaufmann, Wagner]
2001Orthogonal Graph Drawing
In: Drawing Graphs: Methods and Models, 121-171
Part of a Book
1
Hide details for Eisenbarth, Ziviani, Gonnet, Mehlhorn, Wood [-]Eisenbarth, Ziviani, Gonnet, Mehlhorn, Wood [-]
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
1
Hide details for Eisenbrand, Funke, Garg, Könemann [Garg, Könemann]Eisenbrand, Funke, Garg, Könemann [Garg, Könemann]
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
2
Hide details for Eisenbrand, Funke, Karrenbauer, Matijevic [-]Eisenbrand, Funke, Karrenbauer, Matijevic [-]
2008Energy-Aware Stage Illumination
In: International Journal of Computational Geometry and Applications [18], 107-129
Journal Article
2005Attachment IconEnergy-Aware Stage Illumination
In: Proceedings of the 21st Annual Symposium on Computational Geometry : (SCG05), 336-346
Proceedings Article
1
Hide details for Eisenbrand, Funke, Karrenbauer, Reichel, Schömer [Funke, Schömer, Spencer]Eisenbrand, Funke, Karrenbauer, Reichel, Schömer [Funke, Schömer, Spencer]
2005Packing a Trunk - now with a Twist!
In: Proceedings SPM 2005 ACM Symposium on Solid and Physical Modeling, 197-206
Proceedings Article
1
Hide details for Eisenbrand, Funke, Karrenbauer, Reichel, Schömer [Funke, Schömer]Eisenbrand, Funke, Karrenbauer, Reichel, Schömer [Funke, Schömer]
2007Packing a truck - Now with a twist!
In: International Journal of Computational Geometry & Applications [17], 505-527
Journal Article
1
Hide details for Eisenbrand, Funke, Reichel, Schömer [Schömer, Di Battista, Zwick]Eisenbrand, Funke, Reichel, Schömer [Schömer, Di Battista, Zwick]
2003Attachment IconPacking a Trunk
In: Algorithms - ESA 2003: 11th Annual European Symposium, 618-629
Proceedings Article
1
Hide details for Eisenbrand, Karrenbauer, Skutella, Xu [Eisenbrand, Skutella, Xu, Azar, Erlebach]Eisenbrand, Karrenbauer, Skutella, Xu [Eisenbrand, Skutella, Xu, Azar, Erlebach]
2006Multiline Addressing by Network Flow
In: Algorithms - ESA 2006 : 14th Annual European Symposium, 744-755
Proceedings Article
1
Hide details for Eisenbrand, Karrenbauer, Skutella, Xu [Eisenbrand, Skutella, Xu]Eisenbrand, Karrenbauer, Skutella, Xu [Eisenbrand, Skutella, Xu]
2009Multiline Addressing by Network Flow
In: Algorithmica [53], 583-596
Journal Article
1
Hide details for Eisenbrand, Karrenbauer, Xu [Eisenbrand, Xu, ]Eisenbrand, Karrenbauer, Xu [Eisenbrand, Xu, ]
2007Algorithms for longer OLED Lifetime
In: WEA 2007, 338-351
Proceedings Article
8
Hide details for El Kahoui [-]El Kahoui [-]
2008Attachment IconComputing with algebraic curves in generic positionMiscellaneous
2005Attachment IconBirational properties of the gap subresultant varieties
In: Journal of Symbolic Computation [39], 61-71
Journal Article
2005Attachment IconUFDs with commuting linearly independent locally nilpotent derivations
In: Journal of Algebra [289], 446-452
Journal Article
2005Attachment Icon$D$-resultant and subresultants
In: Proceedings of the Amercian Mathematical Society [133], 2193-2199
Journal Article
2004Attachment IconContants of derivations in polynomial rings over unique factorization domains
In: Proceedings of the Amercian Mathematical Society [132], 2537-2541
Journal Article
2004Attachment IconSubresultants and locally nilpotent derivations
In: Linear Algebra and its Applications [380], 253-261
Journal Article
2003Attachment IconAn elementary approach to subresultants theory
In: Journal of Symbolic Computation [35], 281-292
Journal Article
2002Attachment IconOn plane polynomial vector fields and the Poincar\'e problem
In: Electronic Journal of Differential Equations [2002], 1-23
Journal Article
1
Hide details for El Kahoui [BenBouziane, El Houari]El Kahoui [BenBouziane, El Houari]
2008Attachment IconPolynomial parametrization of nonsingular algebraic curvesMiscellaneous
1
Hide details for El Kahoui [El Houari, Gutierrez]El Kahoui [El Houari, Gutierrez]
2004Attachment 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
1
Hide details for El Kahoui [Gonzalez-Vega]El Kahoui [Gonzalez-Vega]
1996Attachment IconAn Improved Upper Complexity Bound for the Topology Computation of a Real Algebraic Plane Curve
In: Journal of Complexity [12], 527-544
Journal Article
1
Hide details for El Kahoui [Weber, Eberhardt]El Kahoui [Weber, Eberhardt]
2001Attachment IconImproved algorithms for linear complementarity problems arising from collision response
In: Mathematics and Computers in Simulation [56], 69-93
Journal Article
1
Hide details for El Kahoui [Weber]El Kahoui [Weber]
2000Attachment IconDeciding Hopf bifurcations by quantifier elimination in a software-component architecture
In: Journal of Symbolic Computation [30], 161-179
Journal Article
1
Hide details for El Kahoui, Rakrak [Rakrak]El Kahoui, Rakrak [Rakrak]
2007Attachment IconStructure of Groebner bases with respect to block orders
In: Mathematics of Computation [76], 2181-2187
Journal Article
5
Hide details for Elbassioni [-]Elbassioni [-]
2009Algorithms for Dualization over Products of Partially Ordered Sets
In: SIAM Journal on Discrete Mathematics [23], 487-510
Journal Article
2008A note on systems with max-min and max-product constraints
In: Fuzzy Sets and Systems [159], 2272-2277
Journal Article
2008On the complexity of monotone dualization and generating minimal hypergraph transversals
In: Discrete Applied Mathematics [156], 2109-2123
Journal Article
2006On the Complexity of Monotone Boolean Duality TestingReport
2002Attachment IconOn Dualization in Products of Forests.
In: STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, 142-153
Proceedings Article
1
Hide details for Elbassioni [Azar, Erlebach]Elbassioni [Azar, Erlebach]
2006On the Complexity of the Multiplication Method for Monotone CNF/DNF Dualization
In: Algorithms - ESA 2006, 14th Annual European Symposium, 340-351
Proceedings Article
1
Hide details for Elbassioni [Correa, Hevia, Kiwi]Elbassioni [Correa, Hevia, Kiwi]
2006Finding All Minimal Infrequent Multi-dimensional Intervals
In: LATIN 2006: Theoretical Informatics, 7th Latin American Symposium, 423-434
Proceedings Article
1
Hide details for Elbassioni [Czumaj, Pitts, Wattenhofer]Elbassioni [Czumaj, Pitts, Wattenhofer]
2012A QPTAS for ε-Envy-Free Profit-Maximizing Pricing on Line Graphs
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 513-524
Proceedings Article
1
Hide details for Elbassioni [Katriel]Elbassioni [Katriel]
2006Multiconsistency and Robustness with Global Constraints
In: Constraints [11], 335-352
Journal Article
1
Hide details for Elbassioni [Rolf H. Möhring, ]Elbassioni [Rolf H. Möhring, ]
2002Attachment IconAn Algorithm for Dualization in Products of Lattices and Its Applications
In: Algorithms - ESA 2002, 10th Annual European Symposium, 424-435
Proceedings Article
1
Hide details for Elbassioni, Chalermsook, Nanongkai, Sun [Chalermsook, Nanongkai]Elbassioni, Chalermsook, Nanongkai, Sun [Chalermsook, Nanongkai]
2013Multi-Attribute Profit-Maximizing PricingUnpublished/Draft
1
Hide details for Elbassioni, Chan [Chan, Charikar]Elbassioni, Chan [Chan, Charikar]
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
1
Hide details for Elbassioni, Elmasry, Kamel [Elmasry, Kamel, Diego Calvanese, Maurizio Lenzerini, ]Elbassioni, Elmasry, Kamel [Elmasry, Kamel, Diego Calvanese, Maurizio Lenzerini, ]
2003Attachment IconAn Efficient Indexing Scheme for Multi-dimensional Moving Objects
In: Database Theory - ICDT 2003, 9th International Conference, 425-439
Proceedings Article
1
Hide details for Elbassioni, Elmasry, Kamel [Elmasry, Kamel]Elbassioni, Elmasry, Kamel [Elmasry, Kamel]
2005An Indexing Method for Answering Queries on Moving Objects
In: Distributed and Parallel Databases [17], 215-249
Journal Article
1
Hide details for Elbassioni, Elmasry, Kamel [Kamel]Elbassioni, Elmasry, Kamel [Kamel]
2008Indexing Schemes for Multi-dimensional Moving Objects
In: Encyclopedia of GIS, 523-529
Part of a Book
1
Hide details for Elbassioni, Elmasry, Makino [Makino]Elbassioni, Elmasry, Makino [Makino]
2011Finding Simplices containing the Origin in Two and Three Dimensions
In: International Journal of Computational Geometry & Applications [21], 495-506
Journal Article
1
Hide details for Elbassioni, Fishkin, Mustafa, Sitters [Caires, Italiano, Monteiro, Palamidessi, Yung]Elbassioni, Fishkin, Mustafa, Sitters [Caires, Italiano, Monteiro, Palamidessi, Yung]
2005Approximation algorithms for Euclidean Group TSP
In: Automata, languages and programming : 32nd International Colloquim, ICALP 2005, 1115-1126
Proceedings Article
1
Hide details for Elbassioni, Fishkin, Sitters [Fishkin, Asano]Elbassioni, Fishkin, Sitters [Fishkin, Asano]
2006On Approximating the TSP with Intersecting Neighborhoods
In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 213-222
Proceedings Article
1
Hide details for Elbassioni, Fishkin, Sitters [Fishkin, Sitters]Elbassioni, Fishkin, Sitters [Fishkin, Sitters]
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
1
Hide details for Elbassioni, Fouad, Bertino [Fouad, Bertino]Elbassioni, Fouad, Bertino [Fouad, Bertino]
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
1
Hide details for Elbassioni, Fouz, Swamy [Fouz, Swamy, Saberi]Elbassioni, Fouz, Swamy [Fouz, Swamy, Saberi]
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
1
Hide details for Elbassioni, Garg, Gupta, Kumar, Narula, Pal [Garg, Gupta, Kumar, Narula, Pal, D'Souza, Kavitha, Radhakrishnan]Elbassioni, Garg, Gupta, Kumar, Narula, Pal [Garg, Gupta, Kumar, Narula, Pal, D'Souza, Kavitha, Radhakrishnan]
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
1
Hide details for Elbassioni, Hagen, Rauf [Hagen]Elbassioni, Hagen, Rauf [Hagen]
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
1
Hide details for Elbassioni, Jeli´c, Matijevi`c [Jeli´c, Matijevi`c]Elbassioni, Jeli´c, Matijevi`c [Jeli´c, Matijevi`c]
2012The relation of Connected Set Cover and Group Steiner Tree
In: Theoretical Computer Science [438], 96-101
Journal Article
1
Hide details for Elbassioni, Katriel [Barták, Milano]Elbassioni, Katriel [Barták, Milano]
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
1
Hide details for Elbassioni, Katriel, Kutz, Mahajan [Katriel, Mahajan, Deng, Du]Elbassioni, Katriel, Kutz, Mahajan [Katriel, Mahajan, Deng, Du]
2005Simultaneous Matchings
In: Algorithms and computation : 16th International Symposium, ISAAC 2005, 106-115
Proceedings Article
1
Hide details for Elbassioni, Krohn, Matijevic, Mestre, Severdija [Krohn, Matijevic, Severdija, Albers, Marion]Elbassioni, Krohn, Matijevic, Mestre, Severdija [Krohn, Matijevic, Severdija, Albers, Marion]
2009Improved Approximation Algorithms for 1.5D Terrain Guarding
In: Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS), 361-371
Electronic Proceedings Article
2
Hide details for Elbassioni, Krohn, Matijevic, Mestre, Severdija [Krohn, Matijevic, Severdija]Elbassioni, Krohn, Matijevic, Mestre, Severdija [Krohn, Matijevic, Severdija]
2011Improved Approximations for Guarding 1.5-Dimensional Terrains
In: Algorithmica [60], 451-463
Journal Article
2009Improved Approximations for Guarding 1.5-Dimensional Terrains
In: Algorithmica [Online First], 1-13
Electronic Journal Article
1
Hide details for Elbassioni, Lotker, Seidel [Lotker, Seidel]Elbassioni, Lotker, Seidel [Lotker, Seidel]
2006Upper bound on the number of vertices of polyhedra with 0, 1-constraint matrices
In: Information Processing Letters [100], 69 - 71
Journal Article
1
Hide details for Elbassioni, Makino, Mehlhorn, Ramezani [-]Elbassioni, Makino, Mehlhorn, Ramezani [-]
2013On Randomized Fictitious Play for Approximating Saddle Points over Convex Sets
In: 19th Annual International Computing and Combinatorics Conference (COCOON-13), 65-76
Proceedings Article
1
Hide details for Elbassioni, Makino, Rauf [Makino, Fiat, Sanders]Elbassioni, Makino, Rauf [Makino, Fiat, Sanders]
2009Attachment IconOutput-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs
In: Algorithms - ESA 2009 : 17th Annual European Symposium, 143-154
Proceedings Article
1
Hide details for Elbassioni, Makino, Rauf [Makino, Ngo]Elbassioni, Makino, Rauf [Makino, Ngo]
2009Attachment IconOn the Readability of Monotone Boolean Formulae
In: Computing and Combinatorics :15th Annual International Conference, COCOON 2009, 496-505
Proceedings Article
1
Hide details for Elbassioni, Makino, Rauf [Makino]Elbassioni, Makino, Rauf [Makino]
2011On the readability of monotone Boolean formulae
In: Journal of Combinatorial Optimization [22], 293-304
Journal Article
1
Hide details for Elbassioni, Matijevic, Severdija [Matijevic, Severdija, Vahrenhold]Elbassioni, Matijevic, Severdija [Matijevic, Severdija, Vahrenhold]
2010Guarding 1.5-Dimensional with Demands
In: 26th European Workshop on Computational Geometry (EuroCG 2010), 133-136
Proceedings Article
1
Hide details for Elbassioni, Matijevic, Severdija [Matijevic, Severdija]Elbassioni, Matijevic, Severdija [Matijevic, Severdija]
2012Guarding 1.5D terrains with demands
In: International Journal of Computer Mathematics [89], 2143-2151
Journal Article
1
Hide details for Elbassioni, Mustafa [-]Elbassioni, Mustafa [-]
2005Attachment IconConflict-Free Colorings of Rectangle Ranges for Wireless NetworksUnpublished/Draft
1
Hide details for Elbassioni, Mustafa [Durand, Thomas]Elbassioni, Mustafa [Durand, Thomas]
2006Conflict-Free Colorings of Rectangle Ranges
In: STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, 254-263
Proceedings Article
1
Hide details for Elbassioni, Paluch, van Zuylen [Paluch, Dürr, Wilke]Elbassioni, Paluch, van Zuylen [Paluch, Dürr, Wilke]
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
1
Hide details for Elbassioni, Raman, Ray, Sitters [Raman, Sitters]Elbassioni, Raman, Ray, Sitters [Raman, Sitters]
2012On the complexity of the highway problem
In: Theoretical Computer Science [460], 70-77
Journal Article
1
Hide details for Elbassioni, Raman, Ray, Sitters [Ray, Sitters, Matthieu]Elbassioni, Raman, Ray, Sitters [Ray, Sitters, Matthieu]
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
1
Hide details for Elbassioni, Raman, Ray, Sitters [Sitters, Mavronicolas, Papadopoulou]Elbassioni, Raman, Ray, Sitters [Sitters, Mavronicolas, Papadopoulou]
2009Attachment IconOn Profit-Maximizing Pricing for the Highway and Tollbooth Problems
In: Algorithmic Game Theory : Second International Symposium, SAGT 2009, 275-286
In: ArXiv.org [5814], 275-286
Proceedings Article
1
Hide details for Elbassioni, Rauf [-]Elbassioni, Rauf [-]
2010Polynomial-time Dualization of $r$-Exact Hypergraphs with Applications in GeometryUnpublished/Draft
1
Hide details for Elbassioni, Rauf [Rauf]Elbassioni, Rauf [Rauf]
2010Polynomial-time dualization of r-exact hypergraphs with applications in geometry
In: Discrete Mathematics [310], 2356-2363
Journal Article
1
Hide details for Elbassioni, Rauf, Ray [Rauf, Collette]Elbassioni, Rauf, Ray [Rauf, Collette]
2011Enumerating Minimal Transversals of Geometric Hypergraphs
In: 23rd Canadian Conference on Computational Geometry (CCCG 2011), 437-442
Electronic Proceedings Article
1
Hide details for Elbassioni, Rauf, Ray [Rauf]Elbassioni, Rauf, Ray [Rauf]
??On Enumerating Minimal Transversals of Geometric HypergraphsUnpublished/Draft
1
Hide details for Elbassioni, Sitters, Zhang [Sitters, Zhang, Arge, Hoffmann, Welzl]Elbassioni, Sitters, Zhang [Sitters, Zhang, Arge, Hoffmann, Welzl]
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
1
Hide details for Elbassioni, Sitters, Zhang [Sitters, Zhang]Elbassioni, Sitters, Zhang [Sitters, Zhang]
2007Attachment IconA Quasi-PTAS for Envy-free Pricing on Line GraphsUnpublished/Draft
5
Hide details for Elbassioni, Tiwary [Tiwary]Elbassioni, Tiwary [Tiwary]
2012Complexity of Approximating the Vertex Centroid of a Polyhedron
In: Theoretical Computer Science [421], 56-61
Journal Article
2011On a cone covering problem
In: Computational Geometry [44], 129-134
Journal Article
2009Complexity of Approximating the Vertex Centroid of a Polyhedron
In: Algorithms and Computation, 20th International Symposium (ISAAC), 413-422
Proceedings Article
2008On a Cone Covering Problem
In: Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 171-174
Proceedings Article
2008On Computing the Vertex Centroid of a Polyhedron
In: CoRR [abs/0806.3456], x-x
Journal Article
4
Hide details for Elmasry [-]Elmasry [-]
2010Pairing heaps, scrambled pairing and square-root trees
In: International Journal of Computer Mathematics [87], 3096-3110
Journal Article
2010The longest almost-increasing subsequence
In: Information Processing Letters [110], 655-658
Journal Article
2009Computing the subset partial order for dense families of sets
In: Information Processing Letters [109], 1082-1086
Journal Article
2008Attachment IconViolation Heaps: A Better Substitute for Fibonacci HeapsReport
1
Hide details for Elmasry [Matthieu]Elmasry [Matthieu]
2009Attachment 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
1
Hide details for Elmasry, Elbassioni [-]Elmasry, Elbassioni [-]
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
1
Hide details for Elmasry, Hammad [Hammad]Elmasry, Hammad [Hammad]
2008Attachment IconInversion-Sensitive Sorting Algorithms in Practice
In: ACM Journal of Experimental Algorithmics [13], 1-18
Journal Article
1
Hide details for Elmasry, Jensen, Katajainen [Jensen, Katajainen, Boldi, Gargano]Elmasry, Jensen, Katajainen [Jensen, Katajainen, Boldi, Gargano]
2010The Magic of a Number System
In: Fun with Algorithms : 5th International Conference, FUN 2010, 156-165
Proceedings Article
1
Hide details for Elmasry, Jensen, Katajainen [Jensen, Katajainen, Kaplan]Elmasry, Jensen, Katajainen [Jensen, Katajainen, Kaplan]
2010Strictly-regular number system and data structures
In: Algorithm Theory - SWAT 2010 : 12th Scandinavian Symposium and Workshops
on Algorithm Theory, 26-37
Proceedings Article
2
Hide details for Elmasry, Jensen, Katajainen [Jensen, Katajainen]Elmasry, Jensen, Katajainen [Jensen, Katajainen]
2008Attachment IconMultipartite Priority Queues
In: ACM Transactions on Algorithms [5], 1-19
Journal Article
2008Attachment IconTwo New Methods for Constructing Double-Ended Priority Queues from Priority Queues
In: Computing [83], 193-204
Journal Article
1
Hide details for Elmasry, Manjunath [-]Elmasry, Manjunath [-]
2009Enumerating Trichromatic Triangles Containing the Origin in Linear Time
In: Japanese Conference in Computational Geometry and Graphs 2009, 101-103
Proceedings Article
1
Hide details for Elmasry, Mehlhorn, Schmidt [-]Elmasry, Mehlhorn, Schmidt [-]
2013Every DFS tree of a 3-connected graph contains a contractible edge
In: Journal of Graph Theory [72], 112-121
Journal Article
1
Hide details for Elmasry, Mehlhorn, Schmidt [Elmasry]Elmasry, Mehlhorn, Schmidt [Elmasry]
2012An O(n+m) Certifying Triconnnectivity Algorithm for Hamiltonian Graphs
In: Algorithmica [62], 754-766
Journal Article
1
Hide details for Elmasry, Mehlhorn, Schmidt [Schmidt]Elmasry, Mehlhorn, Schmidt [Schmidt]
2010An $O(m+n)$ Certifying Triconnectivity Algorithm for Hamiltonian Graphs
In: Algorithmica [Online First], 1-13
Electronic Journal Article
1
Hide details for Elsaesser, Sauerwald [Elsaesser]Elsaesser, Sauerwald [Elsaesser]
2011Tight bounds for the cover time of multiple random walks
In: Theoretical Computer Science [412], 2623-2641
Journal Article
4
Hide details for Emeliyanenko [-]Emeliyanenko [-]
2012Attachment 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
2012Harnessing the Power of GPUs for Problems in Real Algebraic Geometry
Universität des Saarlandes
Thesis - PhD thesis
2010Accelerating Symbolic Computations on NVIDIA Fermi
In: Poster presentation at GTC'10 (NVIDIA research summit), -
Poster
2007Attachment IconVisualization of Points and Segments of Real Algebraic Plane Curves
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Emeliyanenko [Dou, Gruber, Joller]Emeliyanenko [Dou, Gruber, Joller]
2009Attachment IconEfficient Multiplication of Polynomials on Graphics Hardware
In: Advanced Parallel Processing Technologies : 8th International Symposium, APPT 2009, 134-149
Proceedings Article
1
Hide details for Emeliyanenko [Hsu, Yang, Park, Yeo]Emeliyanenko [Hsu, Yang, Park, Yeo]
2010Attachment IconModular Resultant Algorithm for Graphics Processors
In: Algorithms and Architectures for Parallel Processing : 10th International Conference, ICA3PP 2010. - Pt. 1, 427-440
Proceedings Article
1
Hide details for Emeliyanenko [Moreno Maza, Roch]Emeliyanenko [Moreno Maza, Roch]
2010Attachment IconA complete modular resultant algorithm targeted for realization on graphics hardware
In: PASCO '10 : Proceedings of the 4th International Workshop on Parallel and Symbolic Computation, 35-43
Proceedings Article
1
Hide details for Emeliyanenko [Smari, McIntire]Emeliyanenko [Smari, McIntire]
2011Attachment 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
1
Hide details for Emeliyanenko, Berberich, Sagraloff [Bebis, Boyle, Parvin, Koracin, Kuno, Wang, Pajarola, Lindstrom, HinkenjannEmeliyanenko, Berberich, Sagraloff [Bebis, Boyle, Parvin, Koracin, Kuno, Wang, Pajarola, Lindstrom, Hinkenjann, Encarnação, Silva, Coming]
2009Attachment IconVisualizing Arcs of Implicit Algebraic Curves, Exactly and Fast
In: Advances in Visual Computing : 5th International Symposium, ISVC 2009, 608-619
Proceedings Article
2
Hide details for Emeliyanenko, Kerber [-]Emeliyanenko, Kerber [-]
2008Attachment IconAn implementation of the 2D Algebraic KernelReport
2008Attachment IconVisualizing and Exploring Planar Algebraic Arrangements - a Web ApplicationReport
1
Hide details for Emeliyanenko, Kerber [Teillaud, Welzl]Emeliyanenko, Kerber [Teillaud, Welzl]
2008Attachment IconVisualizing and Exploring Planar Algebraic Arrangements -- a Web Application
In: Proceedings of the 24th ACM Symposium on Computational Geometry, 224-225
Proceedings Article
1
Hide details for Emeliyanenko, Sagraloff [van der Hoeven, van Hoeij]Emeliyanenko, Sagraloff [van der Hoeven, van Hoeij]
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
1
Hide details for Emiris, Hemmer, Karavelas, Limbach, Mourrain, Tsigaridas, Zafeirakopoulos [Emiris, Karavelas, Limbach, MourraiEmiris, Hemmer, Karavelas, Limbach, Mourrain, Tsigaridas, Zafeirakopoulos [Emiris, Karavelas, Limbach, Mourrain, Tsigaridas, Zafeirakopoulos]
2008Cross-benchmarks of univariate algebraic kernelsReport
1
Hide details for Emiris, Hemmer, Karavelas, Mourrain, Tsigaridas, Zafeirakopoulos [Emiris, Karavelas, Mourrain, Tsigaridas, ZafEmiris, Hemmer, Karavelas, Mourrain, Tsigaridas, Zafeirakopoulos [Emiris, Karavelas, Mourrain, Tsigaridas, Zafeirakopoulos]
2008Attachment IconExperimental evaluation and cross-benchmarking of univariate real solversReport
1
Hide details for Emiris, Hemmer, Tsigaridas, Tzoumas [Emiris, Tsigaridas, Tzoumas]Emiris, Hemmer, Tsigaridas, Tzoumas [Emiris, Tsigaridas, Tzoumas]
2008Voronoi diagram of ellipses: CGAL-based implementationReport
1
Hide details for Emminghaus [-]Emminghaus [-]
1995Effiziente Sortieralgorithmen für den d-dimensionalen Hypercube
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Epstein, Imreh, van Stee [Epstein, van Stee, Diks, Rytter]Epstein, Imreh, van Stee [Epstein, van Stee, Diks, Rytter]
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
1
Hide details for Epstein, Jez, Sgall, van Stee [Epstein, Jez, Sgall, Gupta, Jansen, Rolim, Servedio]Epstein, Jez, Sgall, van Stee [Epstein, Jez, Sgall, Gupta, Jansen, Rolim, Servedio]
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
1
Hide details for Epstein, Kesselman [Epstein]Epstein, Kesselman [Epstein]
2006On the remote server problem or more about TCP acknowledgments
In: Theoretical Computer Science [369], 285
Journal Article
1
Hide details for Epstein, Kleiman, Mestre [Epstein, Kleiman, Leonardi]Epstein, Kleiman, Mestre [Epstein, Kleiman, Leonardi]
2009Parametric Packing of Selfish Items and the Subset Sum Algorithm
In: Internet and Network Economics : 5th International Workshop, WINE 2009, 67-78
Proceedings Article
1
Hide details for Epstein, Kleiman, van Stee [Epstein, Kleiman, Leonardi]Epstein, Kleiman, van Stee [Epstein, Kleiman, Leonardi]
2009Maximizing the Minimum Load: The Cost of Selfishness
In: Internet and Network Economics : 5th International Workshop, WINE 2009, 232-243
Proceedings Article
1
Hide details for Epstein, Levin, Marchetti-Spaccamela, Megow, Mestre, Skutella, Stougie [Epstein, Levin, Marchetti-Spaccamela, Epstein, Levin, Marchetti-Spaccamela, Megow, Mestre, Skutella, Stougie [Epstein, Levin, Marchetti-Spaccamela, Stougie, Eisenbrand, Shepherd]
2010Universal sequencing on a single machine
In: Integer Programming and Combinatorial Optimization : 14th International Conference, IPCO 2010, 230-243
Proceedings Article
1
Hide details for Epstein, Levin, Marchetti-Spaccamela, Megow, Mestre, Skutella, Stougie [Epstein, Levin, Marchetti-Spaccamela, Epstein, Levin, Marchetti-Spaccamela, Megow, Mestre, Skutella, Stougie [Epstein, Levin, Marchetti-Spaccamela, Stougie]
2012Universal sequencing on an unreliable machine
In: SIAM Journal on Computing [41], 565-586
Journal Article
1
Hide details for Epstein, Levin, Mestre, Segev [Epstein, Levin, Segev, Marion, Schwentick]Epstein, Levin, Mestre, Segev [Epstein, Levin, Segev, Marion, Schwentick]
2010Improved approximation guarantees for weighted matching in the semi-streaming model
In: 27th International Symposium on Theoretical Aspects of Computer Science (STACS 2010), 347-358
Electronic Proceedings Article
1
Hide details for Epstein, Levin, van Stee [Epstein, Levin, Abramsky, Gavoille, Kirchner, Meyer auf der Heide, Spirakis]Epstein, Levin, van Stee [Epstein, Levin, Abramsky, Gavoille, Kirchner, Meyer auf der Heide, Spirakis]
2010Attachment IconMax-min online allocations with a reordering buffer
In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010, 336-347
Proceedings Article
1
Hide details for Epstein, Levin, van Stee [Epstein, Levin, ]Epstein, Levin, van Stee [Epstein, Levin, ]
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
4
Hide details for Epstein, Levin, van Stee [Epstein, Levin]Epstein, Levin, van Stee [Epstein, Levin]
2012Attachment IconApproximation Schemes for Packing Splittable Items with Cardinality Constraints
In: Algorithmica [62], 102-129
Journal Article
2011Attachment IconMax-min online allocations with a reordering buffer
In: SIAM Journal on Discrete Mathematics [25], 1230-1250
Journal Article
2008Attachment IconOnline unit clustering: Variations on a theme
In: Theoretical Computer Science [407], 85-96
Journal Article
2008Attachment IconTwo-dimensional packing with conflicts
In: Acta Informatica [45], 155-175
Journal Article
2
Hide details for Epstein, van Stee [Epstein, Kaklamanis, Skutella]Epstein, van Stee [Epstein, Kaklamanis, Skutella]
2008Attachment IconApproximation schemes for packing splittable items with cardinality constraints
In: Approximation and Online Algorithms, 5th International Workshop, WAOA 2007, 232-245
Proceedings Article
2008Attachment IconOn the Online Unit Clustering Problem
In: Approximation and Online Algorithms, 5th International Workshop, WAOA 2007, 193-206
Proceedings Article
1
Hide details for Epstein, van Stee [Epstein, Laber, Bornstein, Noguiera, Faria]Epstein, van Stee [Epstein, Laber, Bornstein, Noguiera, Faria]
2008Attachment IconMaximizing the minimum load for selfish agents
In: LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, 264-275
Proceedings Article
1
Hide details for Epstein, van Stee [Epstein, Monien, Schroeder]Epstein, van Stee [Epstein, Monien, Schroeder]
2008Attachment IconThe price of anarchy on uniformly related machines revisited
In: Algorithmic Game Theory, First International Symposium, SAGT 2008, 46-57
Proceedings Article
5
Hide details for Epstein, van Stee [Epstein]Epstein, van Stee [Epstein]
2012Attachment IconThe price of anarchy on uniformly related machines revisited
In: Information and Computation [212], 37-54
Journal Article
2011Attachment IconImproved results for a memory allocation problem
In: Theory of Computing Systems [48], 79-92
Journal Article
2011On the online unit clustering problem
In: ACM Transactions on Algorithms [7], 7:1-7:1
Journal Article
2010Maximizing the minimum load for selfish agents
In: Theoretical Computer Science [411], 44-57
Journal Article
2010Attachment IconOn the online unit clustering problem
In: ACM Transactions on Algorithms [7], 1-18
Journal Article
1
Hide details for Epstein, van Stee, Tamir [Epstein, Tamir]Epstein, van Stee, Tamir [Epstein, Tamir]
2009Attachment IconPaging with request sets
In: Theory of Computing Systems [44], 67-81
Journal Article
1
Hide details for Evans, Schwarz, Teich [Evans, Teich]Evans, Schwarz, Teich [Evans, Teich]
1995Automated design of two-dimensional rational decimation systems
In: Proceedings of IEEE Asilomar Conference on Signals, Systems, and Computers, 498-502
Proceedings Article
1
Hide details for Evans, Schwarz, Teich, Vainshtein, Welzl [Teich, Vainshtein, Welzl, Evans]Evans, Schwarz, Teich, Vainshtein, Welzl [Teich, Vainshtein, Welzl, Evans]
1995Minimal enclosing parallelogram with application
In: 11th Annual ACM Symposium on Computational Geometry (SCG95), C34-C35
Proceedings Article
1
Hide details for Fabri, Giezeman, Kettner, Schirra, Schönherr [Fabri, Giezeman, Kettner, Lin, Manocha, Schönherr]Fabri, Giezeman, Kettner, Schirra, Schönherr [Fabri, Giezeman, Kettner, Lin, Manocha, Schönherr]
1996The CGAL Kernel: A Basis for Geometric Computation
In: Applied Computational Geometry: Towards Geometric Engineering Proceedings (WACG'96), 191-202
Proceedings Article
1
Hide details for Fabri, Giezeman, Kettner, Schirra, Schönherr [Fabri, Giezeman, Kettner, Schönherr]Fabri, Giezeman, Kettner, Schirra, Schönherr [Fabri, Giezeman, Kettner, Schönherr]
2000On the Design of CGAL, a computational geometry algorithms library
In: Software - Practice and Experience [30], 1167-1202
Journal Article
1
Hide details for Fanghänel, Geulen, Hoefer, Vöcking [Fanghänel, Geulen, Vöcking]Fanghänel, Geulen, Hoefer, Vöcking [Fanghänel, Geulen, Vöcking]
2013Online Capacity Maximization in Wireless Networks
In: Journal of Scheduling [16], 81-91
Journal Article
1
Hide details for Farzan, Gagie, Navarro [Gagie, Navarro, Cheong, Chwa, Park]Farzan, Gagie, Navarro [Gagie, Navarro, Cheong, Chwa, Park]
2010Entropy-Bounded Representation of Point Grids
In: Algorithms and Computation : 21st International Symposium, ISAAC 2010. - Pt. II, 327-338
Proceedings Article
1
Hide details for Farzan, Munro [Munro]Farzan, Munro [Munro]
2011Succinct representation of dynamic trees
In: Theoretical Computer Science [412], 2668-2678
Journal Article
1
Hide details for Fatourou, Spirakis [Spirakis]Fatourou, Spirakis [Spirakis]
2000Attachment IconEfficient Scheduling of Strict Multithreaded Computations
In: Theory of Computing Systems [33], 173-232
Journal Article
1
Hide details for Fekete, Fiethe, Friedrichs, Michalik, Orlis [Fekete, Fiethe, Friedrichs, Michalik, Orlis]Fekete, Fiethe, Friedrichs, Michalik, Orlis [Fekete, Fiethe, Friedrichs, Michalik, Orlis]
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
1
Hide details for Fekete, Friedrichs, Kröller, Schmidt [Fekete, Friedrichs, Kröller, Schmidt, Du, Zhang]Fekete, Friedrichs, Kröller, Schmidt [Fekete, Friedrichs, Kröller, Schmidt, Du, Zhang]
2013Facets for Art Gallery Problems
In: Computing and Combinatorics, 208-220
Proceedings Article
1
Hide details for Fekete, Skutella, Woeginger [Fekete, Woeginger]Fekete, Skutella, Woeginger [Fekete, Woeginger]
2003Attachment IconThe complexity of economic equilibria for house allocation markets
In: Information Processing Letters [88], 219-223
Journal Article
1
Hide details for Feld [-]Feld [-]
1998Analyse und Implementierung von Algorithmen zum Minimum Cost Circulation Problem
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Feldmann [-]Feldmann [-]
2012Stochastic optimization with fitness proportional ant systems

Universität des Saarlandes
Thesis - Bachelor thesis
1
Hide details for Fellows, Fertin, Hermelin, Vialette [Fellows, Fertin, Vialette]Fellows, Fertin, Hermelin, Vialette [Fellows, Fertin, Vialette]
2011Upper and lower bounds for finding connected motifs in vertex-colored graphs
In: Journal of Computer and System Sciences [77], 799-811
Journal Article
1
Hide details for Fellows, Friedrich, Hermelin, Narodytska, Rosamond [Fellows, Narodytska, Rosamond, Walsh]Fellows, Friedrich, Hermelin, Narodytska, Rosamond [Fellows, Narodytska, Rosamond, Walsh]
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
1
Hide details for Fellows, Hartman, Hermelin, Landau, Rosamond, Rozenberg [Fellows, Hartman, Landau, Rosamond, Rozenberg]Fellows, Hartman, Hermelin, Landau, Rosamond, Rozenberg [Fellows, Hartman, Landau, Rosamond, Rozenberg]
2011Haplotype Inference Constrained by Plausible Haplotype Data
In: IEEE/ACM Transactions on Computational Biology and Bioinformatics [8], 1692-1699
Journal Article
1
Hide details for Fellows, Hermelin, Rosamond [Fellows, Rosamond]Fellows, Hermelin, Rosamond [Fellows, Rosamond]
2012Well Quasi Orders in Subclasses of Bounded Treewidth Graphs and Their Algorithmic Applications
In: Algorithmica [64], 3-18
Journal Article
1
Hide details for Feremans, Grigoriev, Sitters [Feremans, Grigoriev]Feremans, Grigoriev, Sitters [Feremans, Grigoriev]
2006The geometric generalized minimum spanning tree problem with grid clustering
In: 4OR: A Quarterly Journal of Operations Research [4], 319-329
Journal Article
1
Hide details for Fernau, Fomin, Lokshtanov, Mnich, Philip, Saurabh [Fernau, Fomin, Lokshtanov, Mnich, Saurabh, Iliopoulos, F. SFernau, Fomin, Lokshtanov, Mnich, Philip, Saurabh [Fernau, Fomin, Lokshtanov, Mnich, Saurabh, Iliopoulos, F. Smyth]
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
1
Hide details for Fernau, Fomin, Philip, Saurabh [Fernau, Fomin, Saurabh, Thai, Sahni]Fernau, Fomin, Philip, Saurabh [Fernau, Fomin, Saurabh, Thai, Sahni]
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
1
Hide details for Ferragina, Gross [Gross]Ferragina, Gross [Gross]
1998Optimal On-Line Search and Sublinear Time Update in String Matching
In: SIAM Journal on Computing [27], 713-736
Journal Article
1
Hide details for Fialko [-]Fialko [-]
1997Das planare Augmentierungsproblem
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Fialko, Mutzel [-]Fialko, Mutzel [-]
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
1
Hide details for Fink [-]Fink [-]
2001Oberflächenrekonstruktion von planaren Konturen
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Finkler [-]Finkler [-]
1997Design of Efficient and Correct Algorithms: Theoretical Results and Runtime Prediction of Implementations in Practice
Universität des Saarlandes
Thesis - PhD thesis
2
Hide details for Finkler, Mehlhorn [-]Finkler, Mehlhorn [-]
1999Checking Priority Queues
In: Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-99), 901-902
Proceedings Article
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
3
Hide details for Fleischer [-]Fleischer [-]
1999Decision trees: old and new results
In: Information and computation [152], 44-61
Journal Article
1999Effiziente und Online-Algorithmen
Universität des Saarlandes
Thesis - Habilitation thesis
1996A simple balanced search tree with $O(1)$ worst-case update time
In: International Journal of Foundations of Computer Science [7], 137-149
Journal Article
1
Hide details for Fleischer [Hsu, Kao]Fleischer [Hsu, Kao]
1998On the Bahncard problem
In: Proceedings of the 4th International Conference on Computing and Combinatorics (COCOON-98), 65-74
Proceedings Article
1
Hide details for Fleischer [Lodi, Pagli, Santoro]Fleischer [Lodi, Pagli, Santoro]
1999FUN with implementing algorithms
In: Proceedings of the International Conference on FUN with Algorithms (FUN-98), 88-98
Proceedings Article
1
Hide details for Fleischer, Fries, Mehlhorn, Meiser, Näher, Rohnert, Schirra, Simon, Tsakalidis, Uhrig [, ]Fleischer, Fries, Mehlhorn, Meiser, Näher, Rohnert, Schirra, Simon, Tsakalidis, Uhrig [, ]
1992Selected Topics from Computational Geometry, Data Structures and Motion Planning
In: Data Structures and Efficient Algorithms, Final Report on the DFG Special Joint Initiative, 25-43
Part of a Book
1
Hide details for Fleischer, Jung, Mehlhorn [Jung]Fleischer, Jung, Mehlhorn [Jung]
1995A communication-randomness tradeoff for two-processor systems
In: Information and Computation [116], 155-161
Journal Article
1
Hide details for Fleischer, Jung, Mehlhorn [, ]Fleischer, Jung, Mehlhorn [, ]
1991A Time-Randomness Tradeoff for Communication Complexity
In: Distributed Algorithms, 4th International Workshop, 390-401
Proceedings Article
2
Hide details for Fleischer, Mehlhorn, Rote, Welzl, Yap []Fleischer, Mehlhorn, Rote, Welzl, Yap []
1992Simultaneous Inner and Outer Approximation of Shapes
In: Algorithmica [8], 365-389
Journal Article
1990On Simultaneous Inner and Outer Approximation of Shapes
In: Computational geometry (SCG-90) : 6th annual symposium, 216-224
Proceedings Article
1
Hide details for Fleischer, Skutella [Fleischer]Fleischer, Skutella [Fleischer]
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
1
Hide details for Fleischer, Wahl [Paterson]Fleischer, Wahl [Paterson]
2000Online scheduling revisited
In: Algorithms - ESA 2000, Proceedings of the 8th Annual European Symposium (ESA-00), 202-210
Proceedings Article
1
Hide details for Fogel, Halperin, Kettner, Teillaud, Wein, Wolpert [Fogel, Halperin, Teillaud, Wein, Boissonnat, Teillaud]Fogel, Halperin, Kettner, Teillaud, Wein, Wolpert [Fogel, Halperin, Teillaud, Wein, Boissonnat, Teillaud]
2007Attachment IconArrangements
In: Effective Computational Geometry for Curves and Surfaces, 1-66
Part of a Book
1
Hide details for Follert, Schömer, Sellen, Smid, Thiel [Follert, Schömer, Sellen, Thiagarajan]Follert, Schömer, Sellen, Smid, Thiel [Follert, Schömer, Sellen, Thiagarajan]
1995Computing a largest empty anchored cylinder, and related problems
In: Foundations of Software Technology and Theoretical Computer Science: 15th Conference, 428-442
Proceedings Article
1
Hide details for Follert, Schömer, Sellen, Smid, Thiel [Follert, Schömer, Sellen, Thiel]Follert, Schömer, Sellen, Smid, Thiel [Follert, Schömer, Sellen, Thiel]
1997Computing the largest empty anchored cylinder, and related problems
In: International Journal of Computational Geometry and Applications [7], 563-580
Journal Article
1
Hide details for Fomin, Lokshtanov, Misra, Philip, Saurabh [Fomin, Lokshtanov, Misra, Saurabh, Schwentick, D{Fomin, Lokshtanov, Misra, Philip, Saurabh [Fomin, Lokshtanov, Misra, Saurabh, Schwentick, D{
1
Hide details for "u}rr]"u}rr]
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
1
Hide details for Fomin, Philip, Villanger [Fomin, Villanger, Chakraborty, Kumar]Fomin, Philip, Villanger [Fomin, Villanger, Chakraborty, Kumar]
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
1
Hide details for Fontaine [-]Fontaine [-]
2003Computing the Filtration Efficiency of Shape-Index-Filters for Approximate String Matching
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Fontet, Mehlhorn (ed.) [-]Fontet, Mehlhorn (ed.) [-]
1984Theoretical aspects of computer science (STACS-84) : [1st] symposiumProceedings
1
Hide details for Fotakis [-]Fotakis [-]
2004Attachment IconIncremental Algorithms for Facility Location and k-Median
In: Algorithms – ESA 2004: 12th Annual European Symposium, 347-358
Proceedings Article
1
Hide details for Fotakis [Baeten, Lenstra, Parrow, Woeginger]Fotakis [Baeten, Lenstra, Parrow, Woeginger]
2003Attachment IconOn the Competitive Ratio for Online Facility Location
In: Automata, languages and programming : 30th International Colloquium, ICALP 2003, 637-652
Proceedings Article
1
Hide details for Fotakis, Kontogiannis, Koutsoupias, Mavronicolas, Spirakis [Koutsoupias, Mavronicolas, Spirakis, Widmayer, TriFotakis, Kontogiannis, Koutsoupias, Mavronicolas, Spirakis [Koutsoupias, Mavronicolas, Spirakis, Widmayer, Triguero, Morales, Hennessy, Eidenbenz, Conejo]
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
1
Hide details for Fotakis, Nikoletseas, Papadopoulou, Spirakis [Nikoletseas, Papadopoulou, Spirakis, Kucera]Fotakis, Nikoletseas, Papadopoulou, Spirakis [Nikoletseas, Papadopoulou, Spirakis, Kucera]
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
1
Hide details for Fotakis, Pagh, Sanders, Spirakis [Fotakis, Pagh, Spirakis]Fotakis, Pagh, Sanders, Spirakis [Fotakis, Pagh, Spirakis]
2005Space Efficient Hash Tables With Worst Case Constant Access Time
In: Theory of Computing Systems [38], 229-248
Journal Article
1
Hide details for Fotakis, Pagh, Sanders, Spirakis [Pagh, Spirakis]Fotakis, Pagh, Sanders, Spirakis [Pagh, Spirakis]
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
1
Hide details for Fotakis, Spirakis [Spirakis]Fotakis, Spirakis [Spirakis]
2002Attachment IconMinimum Congestion Redundant Assignments to Tolerate Random Faults
In: Algorithmica [32], 396-422
Journal Article
1
Hide details for Fountoulakis [Fountoulakis]Fountoulakis [Fountoulakis]
2007Percolation on sparse random graphs with given degree sequence
In: Internet Mathematics [4], 329-356
Journal Article
1
Hide details for Fountoulakis, Friedrich, Hermelin [-]Fountoulakis, Friedrich, Hermelin [-]
2011Average Case Parameterized ComplexityUnpublished/Draft
1
Hide details for Fountoulakis, Huber [-]Fountoulakis, Huber [-]
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
2
Hide details for Fountoulakis, Huber, Panagiotou [-]Fountoulakis, Huber, Panagiotou [-]
2010Reliable broadcasting in random networks and the effect of density
In: 2010 Proceedings IEEE INFOCOM, 2552-2560
Proceedings Article
2009The Speed of Broadcasting in Random Networks: Density Does Not Matter
In: 23rd International Symposium on Distributed Computing (DISC '09), 529-530
Proceedings Article
1
Hide details for Fountoulakis, Huber, Panagiotou [Keidar]Fountoulakis, Huber, Panagiotou [Keidar]
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
1
Hide details for Fountoulakis, Kang, McDiarmid [Kang, McDiarmid]Fountoulakis, Kang, McDiarmid [Kang, McDiarmid]
2010The t-stability number of a random graph
In: The Electronic Journal of Combinatorics [17], R59,1-R59,29
Electronic Journal Article
1
Hide details for Fountoulakis, Khosla, Panagiotou [Randall]Fountoulakis, Khosla, Panagiotou [Randall]
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
2
Hide details for Fountoulakis, Kühn, Osthus [Kühn, Osthus]Fountoulakis, Kühn, Osthus [Kühn, Osthus]
2009Minors in random regular graphs
In: Random Structures and Algorithms [35], 444-463
Journal Article
2008The order of the largest complete minor in a random graph
In: Random Structures and Algorithms [33], 127-141
Journal Article
1
Hide details for Fountoulakis, Panagiotou [-]Fountoulakis, Panagiotou [-]
2012Tight Load Thresholds for Cuckoo Hashing
In: Random Structures and Algorithms [41], 306-333
Journal Article
1
Hide details for Fountoulakis, Panagiotou [Abramsky, Gavoille, Kirchner, Meyer auf der Heide, Spirakis]Fountoulakis, Panagiotou [Abramsky, Gavoille, Kirchner, Meyer auf der Heide, Spirakis]
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
1
Hide details for Fountoulakis, Panagiotou [Panagiotou]Fountoulakis, Panagiotou [Panagiotou]
20113-Connected Cores In Random Planar Graphs
In: Combinatorics, Probability & Computing [20], 381-412
Journal Article
1
Hide details for Fountoulakis, Panagiotou [Serna, Shaltiel, Jansen, Rolim]Fountoulakis, Panagiotou [Serna, Shaltiel, Jansen, Rolim]
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
1
Hide details for Fountoulakis, Panagiotou [Steger]Fountoulakis, Panagiotou [Steger]
2013On the Insertion Time of Cuckoo Hashing
In: SIAM Journal on Computing [?], ?-?
Journal Article
1
Hide details for Fountoulakis, Panagiotou, Sauerwald [Panagiotou, Sauerwald, Rabani]Fountoulakis, Panagiotou, Sauerwald [Panagiotou, Sauerwald, Rabani]
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
2
Hide details for Fountoulakis, Reed [Reed]Fountoulakis, Reed [Reed]
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
2007Faster Mixing and Small Bottlenecks
In: Probability Theory and Related Fields [137], 475-486
Journal Article
2
Hide details for Fouz [-]Fouz [-]
2012Randomized Rumor Spreading in Social Networks & Complete Graphs
Universität des Saarlandes
Thesis - PhD thesis
2006Hereditary Discrepancy in Different Numbers of Colors
Universität des Saarlandes
Thesis - Bachelor thesis
1
Hide details for Fraigniaud, Gasieniec, Kowalski, Pelc [Fraigniaud, Gasieniec, Pelc, Farach-Colton]Fraigniaud, Gasieniec, Kowalski, Pelc [Fraigniaud, Gasieniec, Pelc, Farach-Colton]
2004Collective Tree Exploration
In: LATIN 2004: Theoretical informatics, 6th Latin American Symposium, 141-151
Proceedings Article
1
Hide details for Frederickson, Solis-Oba [Frederickson]Frederickson, Solis-Oba [Frederickson]
1998Algorithms for Measuring Perturbability in Matroid Optimization
In: Combinatorica [18], 503-518
Journal Article
1
Hide details for Fredman, Khachiyan [Fredman, Khachiyan]Fredman, Khachiyan [Fredman, Khachiyan]
1996On the Complexity of Dualization of Monotone Disjunctive Normal Forms
In: J. Algorithms [21], 618-628
Journal Article
2
Hide details for Friedrich [-]Friedrich [-]
2007Use and Avoidance of Randomness
Universität des Saarlandes
Thesis - PhD thesis
2005Attachment IconDeterministic Random Walks on Infinite Grids
Friedrich-Schiller-Universität Jena
Thesis - Masters thesis
1
Hide details for Friedrichs, Kulau, Wolf [Friedrichs, Kulau, Wolf]Friedrichs, Kulau, Wolf [Friedrichs, Kulau, Wolf]
2014Energy-efficient voltage scheduling of peripheral components on wireless sensor nodes
In: Communications Workshops (ICC), 2014 IEEE International Conference on, 860-865
Proceedings Article
1
Hide details for Friedrich, Bringmann, Voss, Igel [Bringmann, Voss, Igel, Beyer, Langdon]Friedrich, Bringmann, Voss, Igel [Bringmann, Voss, Igel, Beyer, Langdon]
2011The Logarithmic Hypervolume Indicator
In: FOGA'11 : Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, 81-92
Proceedings Article
1
Hide details for Friedrich, Gairing, Sauerwald [Gairing, Sauerwald, Charikar]Friedrich, Gairing, Sauerwald [Gairing, Sauerwald, Charikar]
2010Quasirandom Load Balancing
In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1620-1629
Proceedings Article
1
Hide details for Friedrich, Gairing, Sauerwald [Gairing]Friedrich, Gairing, Sauerwald [Gairing]
2012Quasirandom Load Balancing
In: SIAM Journal on Computing [41], 747-771
Journal Article
1
Hide details for Friedrich, Hebbinghaus [-]Friedrich, Hebbinghaus [-]
2011Average update times for fully-dynamic all-pairs shortest paths
In: Discrete Applied Mathematics [159], 1751-1758
Journal Article
1
Hide details for Friedrich, Hebbinghaus [Hong, Nagamochi, Fukunaga]Friedrich, Hebbinghaus [Hong, Nagamochi, Fukunaga]
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
2
Hide details for Friedrich, Hebbinghaus, Neumann [-]Friedrich, Hebbinghaus, Neumann [-]
2009Comparison of Simple Diversity Mechanisms on Plateau Functions
In: Theoretical Computer Science [410], 2455-2462
Journal Article
2007Plateaus Can Be Harder in Multi-Objective Optimization
In: IEEE Congress on Evolutionary Computation 2007, 2622-2629
Proceedings Article
1
Hide details for Friedrich, Hebbinghaus, Neumann []Friedrich, Hebbinghaus, Neumann []
2007Rigorous Analyses of Simple Diversity Mechanisms
In: Genetic and Evolutionary Computation Conference 2007, 1219-1225
Proceedings Article
1
Hide details for Friedrich, Hebbinhaus, Neumann [-]Friedrich, Hebbinhaus, Neumann [-]
2010Plateaus Can Be Harder in Multi-Objective Optimization
In: Theoretical Computer Science [411], 854-864
Journal Article
1
Hide details for Friedrich, He, Hebbinghaus, Neumann, Witt [He, Witt, ]Friedrich, He, Hebbinghaus, Neumann, Witt [He, Witt, ]
2007Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models
In: Genetic and Evolutionary Computation Conference 2007, 797-804
Proceedings Article
3
Hide details for Friedrich, He, Hebbinghaus, Neumann, Witt [He, Witt]Friedrich, He, Hebbinghaus, Neumann, Witt [He, Witt]
2010Approximating Covering Problems by Randomized Search Heuristics using Multi-Objective Models
In: Evolutionary Computation [18], 617 - 633
Journal Article
2009Analyses of Simple Hybrid Algorithms for the Vertex Cover Problem
In: Evolutionary Computation, [17], 3-19
Journal Article
2007On Improving Approximate Solutions by Evolutionary Algorithms
In: IEEE Congress on Evolutionary Computation 2007, 2614-2621
Proceedings Article
1
Hide details for Friedrich, Horoba, Neumann [Horoba, Raidl, Rothlauf]Friedrich, Horoba, Neumann [Horoba, Raidl, Rothlauf]
2009Multiplicative Approximations and the Hypervolume Indicator
In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 571-578
Proceedings Article
1
Hide details for Friedrich, Horoba, Neumann [Horoba, Rudolph, Jansen, Lucas, Poloni, Beume]Friedrich, Horoba, Neumann [Horoba, Rudolph, Jansen, Lucas, Poloni, Beume]
2008Runtime Analyses for Using Fairness in Evolutionary Multi-Objective Optimization
In: Parallel Problem Solving from Nature (PPSN X), 671-680
Proceedings Article
1
Hide details for Friedrich, Horoba, Neumann [Horoba]Friedrich, Horoba, Neumann [Horoba]
2011Illustration of fairness in evolutionary multi-objective optimization
In: Theoretical Computer Science [412], 1546-1556
Journal Article
1
Hide details for Friedrich, Kroeger, Neumann [Kroeger, Neumann]Friedrich, Kroeger, Neumann [Kroeger, Neumann]
2012Weighted preferences in evolutionary multi-objective optimization
In: International Journal of Machine Learning and Cybernetics [Online First], 1-10
Electronic Journal Article
2
Hide details for Friedrich, Neumann [-]Friedrich, Neumann [-]
2010When to Use Bit-Wise Neutrality
In: Natural Computing [9], 283 - 294
Journal Article
2008When to Use Bit-wise Neutrality
In: IEEE Congress on Evolutionary Computation 2008, 997-1003
Proceedings Article
1
Hide details for Friedrich, Oliveto, Sudholt, Witt [Friedrich, Oliveto, Sudholt, Witt]Friedrich, Oliveto, Sudholt, Witt [Friedrich, Oliveto, Sudholt, Witt]
2009Analysis of Diversity-Preserving Mechanisms for Global Exploration
In: Evolutionary Computation [17], 455-476
Journal Article
1
Hide details for Friedrich, Oliveto, Sudholt, Witt [Oliveto, Sudholt, Witt, Keijzer]Friedrich, Oliveto, Sudholt, Witt [Oliveto, Sudholt, Witt, Keijzer]
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
1
Hide details for Friedrich, Sauerwald [-]Friedrich, Sauerwald [-]
2010The Cover Time of Deterministic Random Walks
In: The Electronic Journal of Combinatorics [17], R167,1-R167,30
Electronic Journal Article
1
Hide details for Friedrich, Sauerwald [Friedrich, Sauerwald]Friedrich, Sauerwald [Friedrich, Sauerwald]
2009Near-Perfect Load Balancing by Randomized Rounding
In: STOC09 : Proceedings of the 2009 ACM International Symposium on Theory of Computing, 121-130
Proceedings Article
1
Hide details for Friedrich, Sauerwald [Sauerwald, Thai, Sahni]Friedrich, Sauerwald [Sauerwald, Thai, Sahni]
2010The Cover Time of Deterministic Random Walks
In: Computing and Combinatorics : 16th Annual International Conference, COCOON 2010, 130-139
Proceedings Article
1
Hide details for Friedrich, Sauerwald, Stauffer [Stauffer, Asano, Nakano, Okamoto, Watanabe]Friedrich, Sauerwald, Stauffer [Stauffer, Asano, Nakano, Okamoto, Watanabe]
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
1
Hide details for Friedrich, Sauerwald, Vilenchik [Sauerwald, Vilenchik, Albers, Marchetti-Spaccamela, Matias, Nikoletseas, ThomFriedrich, Sauerwald, Vilenchik [Sauerwald, Vilenchik, Albers, Marchetti-Spaccamela, Matias, Nikoletseas, Thomas]
2009Smoothed Analysis of Balancing Networks
In: Automata, Languages and Programming : 36th International Colloquium, ICALP 2009, 472-483
Proceedings Article
2
Hide details for Friedrich, Sauerwald, Vilenchik [Sauerwald, Vilenchik]Friedrich, Sauerwald, Vilenchik [Sauerwald, Vilenchik]
2011Smoothed analysis of balancing networks
In: Random Structures & Algorithms [39], 115-138
Journal Article
2010Smoothed Analysis of Balancing Networks
In: Random Structures and Algorithms [Early View], 1-24
Electronic Journal Article
2
Hide details for Fries [-]Fries [-]
2001Implementation of a Dynamic Convex Hall Algorithm in Arbitrary Dimension
Universität des Saarlandes
Thesis - Masters thesis
2000Implementation of a Dynamic Convex Hull Algorithm in Arbitrary Dimension
Universität des Saarlandes
Thesis - Masters thesis
2
Hide details for Fries, Mehlhorn, Näher [-]Fries, Mehlhorn, Näher [-]
1985Dynamization of geometric data structuresReport
1985Dynamization of geometric data structures
In: Computational geometry (SCG-85) : 1st symposium, 168-176
Proceedings Article
1
Hide details for Fries, Mehlhorn, Näher, Tsakalidis [-]Fries, Mehlhorn, Näher, Tsakalidis [-]
1987A $\log \log n$ data structure for three-sided range queries
In: Information Processing Letters [25], 269-273
Journal Article
1
Hide details for Frigioni, Miller, Nanni, Pasqualone, Schäfer, Zaroliagis [Frigioni, Nanni, Pasqualone, Bilardi, Italiano, PietFrigioni, Miller, Nanni, Pasqualone, Schäfer, Zaroliagis [Frigioni, Nanni, Pasqualone, Bilardi, Italiano, Pietracaprina, Pucci]
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
1
Hide details for Froyland, Koch, Megow, Duane, Wren [Froyland, Koch, Duane, Wren]Froyland, Koch, Megow, Duane, Wren [Froyland, Koch, Duane, Wren]
2008Optimizing the Landside Operation of a Container Terminal
In: OR Spectrum [30], 53-75
Journal Article
1
Hide details for Fuhrmann, Schömer [Fuhrmann]Fuhrmann, Schömer [Fuhrmann]
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
3
Hide details for Funke [-]Funke [-]
2005Topological 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
2001Combinatorial Curve Reconstruction and the Efficient Exact Implementation of Geometric Algorithms
Universität des Saarlandes
Thesis - PhD thesis
1997Exact Arithmetic using Cascaded Computation
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Funke, Guibas, Nguyen, Wang [Guibas, Nguyen, Wang, Gibbons, Abdelzaher, Aspnes, Rao]Funke, Guibas, Nguyen, Wang [Guibas, Nguyen, Wang, Gibbons, Abdelzaher, Aspnes, Rao]
2006Distance-Sensitive Information Brokerage in Sensor Networks
In: Distributed Computing in Sensor Systems, Second IEEE International Conference, DCOSS 2006, 234-251
Proceedings Article
1
Hide details for Funke, Kesselman, Kuhn, Lotker, Segal [Kuhn, Lotker, Segal]Funke, Kesselman, Kuhn, Lotker, Segal [Kuhn, Lotker, Segal]
2007Attachment IconImproved approximation algorithms for connected sensor cover
In: Wireless Networks [13], 153-164
Journal Article
1
Hide details for Funke, Kesselman, Lotker, Segal [Segal, Nikolaidis, Barbeau, Kranakis]Funke, Kesselman, Lotker, Segal [Segal, Nikolaidis, Barbeau, Kranakis]
2004Improved Approximation Algorithms for Connected Sensor Cover
In: Ad-hoc, mobil and wireless networks : Third International Conference, ADHOC-NOW 2004, 56-69
Proceedings Article
1
Hide details for Funke, Kesselman, Meyer, Segal [Funke, Segal]Funke, Kesselman, Meyer, Segal [Funke, Segal]
2006A Simple Improved Distributed Algorithm for Minimum CDS in Unit Disk Graphs
In: ACM Transactions on Sensor Networks [2], 444-453
Journal Article
1
Hide details for Funke, Kesselman, Meyer, Segal [Segal]Funke, Kesselman, Meyer, Segal [Segal]
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
1
Hide details for Funke, Klein [Amenta, Cheong]Funke, Klein [Amenta, Cheong]
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
2
Hide details for Funke, Klein, Mehlhorn, Schmitt [-]Funke, Klein, Mehlhorn, Schmitt [-]
2006Attachment IconControlled Perturbation for Delaunay TriangulationsReport
2005Attachment IconControlled Perturbation for Delaunay Triangulations
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 1047-1056
Proceedings Article
1
Hide details for Funke, Laue [Thomas, Weil]Funke, Laue [Thomas, Weil]
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
1
Hide details for Funke, Laue, Lotker, Naujoks [Funke, Laue, Lotker]Funke, Laue, Lotker, Naujoks [Funke, Laue, Lotker]
2011Power assignment problems in wireless communication: Covering points by disks, reaching few receivers quickly, and energy-efficient travelling salesman tours
In: Ad Hoc Networks [9], 1028-1035
Journal Article
1
Hide details for Funke, Laue, Naujoks [Aspnes, Scheideler, Arora, Madden]Funke, Laue, Naujoks [Aspnes, Scheideler, Arora, Madden]
2007Minimum Energy Broadcast with Few Senders
In: Distributed Computing in Sensor Systems : Third IEEE International Conference, DCOSS 2007, 404-416
Proceedings Article
1
Hide details for Funke, Laue, Naujoks, Lotker [Lotker, , , , ]Funke, Laue, Naujoks, Lotker [Lotker, , , , ]
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
1
Hide details for Funke, Laue, Naujoks, Lotker [Lotker]Funke, Laue, Naujoks, Lotker [Lotker]
2006Power Assignment Problems in Wireless Communication
In: ??? [?], 1-14
Miscellaneous
1
Hide details for Funke, Malamatos, Matijevic, Wolpert [Malamatos, Matijevic, Rappaport]Funke, Malamatos, Matijevic, Wolpert [Malamatos, Matijevic, Rappaport]
2006Attachment Icon(Approximate) Conic Nearest Neighbors and the induced Voronoi Diagram
In: 18th Canadian Conference on Computational Geometry, 23-26
Proceedings Article
2
Hide details for Funke, Malamatos, Ray [-]Funke, Malamatos, Ray [-]
2004Finding Planar Regions in a Terrain
In: 20th European Workshop on Computational Geometry (EWCG), 1-4
Proceedings Article
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
1
Hide details for Funke, Matijevic, Sanders [A. Bertossi, Olariu, M. Pinotti]Funke, Matijevic, Sanders [A. Bertossi, Olariu, M. Pinotti]
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
1
Hide details for Funke, Matijevic, Sanders [Di Battista, Zwick]Funke, Matijevic, Sanders [Di Battista, Zwick]
2003Attachment IconApproximating Energy Efficient Paths in Wireless Multi-hop Networks
In: Algorithms - ESA 2003: 11th Annual European Symposium, 230-241
Proceedings Article
2
Hide details for Funke, Mehlhorn [-]Funke, Mehlhorn [-]
2002LOOK - A Lazy Object-Oriented Kernel for Geometric Computation
In: Computational Geometry - Theory and Applications [22], 99-118
Journal Article
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
1
Hide details for Funke, Mehlhorn, Näher [Näher]Funke, Mehlhorn, Näher [Näher]
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
1
Hide details for Funke, Mehlhorn, Näher []Funke, Mehlhorn, Näher []
2005Attachment IconStructural filtering: a paradigm for efficient and exact geometric programs
In: Computational Geometry [31], 179-194
Journal Article
1
Hide details for Funke, Mehlhorn, Schmitt, Burnikel, Fleischer, Schirra [Burnikel, Fleischer, Schirra]Funke, Mehlhorn, Schmitt, Burnikel, Fleischer, Schirra [Burnikel, Fleischer, Schirra]
2004The LEDA class real number -- extended versionReport
3
Hide details for Funke, Milosavljevic [Milosavljevic]Funke, Milosavljevic [Milosavljevic]
2007Guaranteed-delivery Geographic Routing under Uncertain Node Locations
In: IEEE INFOCOM 2007 : 26th IEEE International Conference on Computer Communications, 1244-1252
Proceedings Article
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
2005Infrastructure-Establishment from Scratch in Wireless Sensor Networks
In: Distributed computing in sensor systems : First IEEE International Conference, DCOSS 2005, 354-367
Proceedings Article
2
Hide details for Funke, Ramos [-]Funke, Ramos [-]
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
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
1
Hide details for Funke, Rauf [Kranakis, Opatrny]Funke, Rauf [Kranakis, Opatrny]
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
2
Hide details for Fürer, Mehlhorn [Fürer, Mehlhorn]Fürer, Mehlhorn [Fürer, Mehlhorn]
1986VLSI Algorithms and Architectures, Aegean Workshop on Computing - >> Dublette
In: VLSI Algorithms and Architectures, Aegean Workshop on Computing, 328
Proceedings
1986VLSI Algorithms and Architectures, Aegean Workshop on Computing - >> Dublette
In: VLSI Algorithms and Architectures, Aegean Workshop on Computing, 328
Proceedings
1
Hide details for Fürer, Mehlhorn [Makedon, Papatheodorou, Spirakis]Fürer, Mehlhorn [Makedon, Papatheodorou, Spirakis]
1986AT$^2$-Optimal Galois Field Multiplier for VLSI
In: VLSI Algorithms and Architectures, Aegean Workshop on Computing, 217-225
Proceedings Article
1
Hide details for Fürer, Mehlhorn []Fürer, Mehlhorn []
1989Attachment IconAT$^2$-Optimal Galois Field Multiplier for VLSI
In: IEEE Transactions on Computers [38], 1333-1336
Journal Article
1
Hide details for Gagie, Gawrychowski, Kärkkäinen, Nekrich, Puglisi [Gagie, Kärkkäinen, Nekrich, Puglisi, Parso, Viola]Gagie, Gawrychowski, Kärkkäinen, Nekrich, Puglisi [Gagie, Kärkkäinen, Nekrich, Puglisi, Parso, Viola]
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
1
Hide details for Gagie, Gawrychowski, Nekrich [Gagie, Nekrich]Gagie, Gawrychowski, Nekrich [Gagie, Nekrich]
2013Heaviest Induced Ancestors and Longest Common Substrings
In: 25th Canadian Conference on Computational Geometry (CCCG 13), 145-150
Proceedings Article
1
Hide details for Gandhi, Mestre [Gandhi]Gandhi, Mestre [Gandhi]
2009Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
In: Algorithmica [54], 54-71
Journal Article
1
Hide details for Gao [-]Gao [-]
2011Distribution of spanning regular subgraphs in random graphsUnpublished/Draft
1
Hide details for Gao, Jerrum, Kaufmann, Mehlhorn, Rülling [-]Gao, Jerrum, Kaufmann, Mehlhorn, Rülling [-]
1988Attachment IconOn Continuous Homotopic One Layer Routing
In: Computational geometry (SCG-88) : 4th symposium, 392-402
Proceedings Article
1
Hide details for Gao, Kaufmann, Mehlhorn, Rülling, Storb, Jerrum [-]Gao, Kaufmann, Mehlhorn, Rülling, Storb, Jerrum [-]
1988On Continuous Homotopic One Layer Routing (Extended Abstract)
In: Computational geometry and its applications (CG-88) : international workshop, 55-70
Proceedings Article
1
Hide details for Gao, Wormald, Su [Wormald, Su]Gao, Wormald, Su [Wormald, Su]
2010Attachment IconInduced subgraphs in sparse random graphs with given degree sequenceUnpublished/Draft
1
Hide details for Garg [-]Garg [-]
1996A 3-approximation for the minimum tree spanning with k-vertices
In: Foundations of computer science (FOCS-96) : 37th annual symposium, 302-309
Proceedings Article
2
Hide details for Garg, Kavitha, Kumar, Mehlhorn, Mestre [Garg, Kavitha, Kumar]Garg, Kavitha, Kumar, Mehlhorn, Mestre [Garg, Kavitha, Kumar]
2010Assigning Papers to Referees
In: Algorithmica [58], 119-136
Journal Article
2008Attachment IconAssigning Papers to RefereesUnpublished/Draft
1
Hide details for Garg, Konjevod, Ravi [Konjevod, Ravi]Garg, Konjevod, Ravi [Konjevod, Ravi]
2000Approximation algorithm for the group Steiner tree problem
In: Journal of Algorithms [37], 66-84
Journal Article
1
Hide details for Garg, Papatriantafilou, Tsigas [-]Garg, Papatriantafilou, Tsigas [-]
1996Distributed List Coloring: How to Dynamically Allocate Frequencies to Mobile Base Stations
In: 8th Annual IEEE Symposium on Parallel and Distributed Processing (SPDP '96), 18-25
Proceedings Article
2
Hide details for Garg, Vazirani [Vazirani]Garg, Vazirani [Vazirani]
1996Approximate max-flow min-(multi)cut theorems and their applications
In: SIAM Journal on Computing [25], 235-251
Journal Article
1995A polyhedron with all s-t cuts as vertices, and adjacency of cuts
In: Mathematical Programming (A) [70], 17-25
Journal Article
1
Hide details for Gärtner, Hotz [Hotz, Ambos-Spies, Löwe, Merkle]Gärtner, Hotz [Hotz, Ambos-Spies, Löwe, Merkle]
2009Computability of Analytic Functions with Analytic Machines
In: Mathematical Theory and Computational Practice : 5th Conference on Computability in Europe, CiE 2009, 250-259
Proceedings Article
1
Hide details for Gasieniec, Indyk [Indyk]Gasieniec, Indyk [Indyk]
1997Efficient Parallel Computing with Memory Faults
In: Proceedings of the 11th Symposium on Fundamentals of Computation Theory (FCT-97), 188-197
Proceedings Article
1
Hide details for Gasieniec, Indyk, Krysta [-]Gasieniec, Indyk, Krysta [-]
1997External inverse pattern matching
In: Proceedings of the 8th Symposium on Combinatorial Pattern Matching (CPM-97), 90-101
Proceedings Article
1
Hide details for Gasieniec, Jansson, Lingas, Östlin [Jiang, Lee, Jansson, Lingas, Östlin]Gasieniec, Jansson, Lingas, Östlin [Jiang, Lee, Jansson, Lingas, Östlin]
1997On the complexity of computing evolutionary trees
In: Proceedings of the 3rd International Conference on Computing and Combinatorics (COCOON-97), 134-145
Proceedings Article
1
Hide details for Gasieniec, Karpinski, Plandowski, Rytter [Hirschberg, Karpinski, Myers, Plandowski, Rytter]Gasieniec, Karpinski, Plandowski, Rytter [Hirschberg, Karpinski, Myers, Plandowski, Rytter]
1996Randomized Efficient Algorithms for Compressed Strings: the Finger-Print Approach
In: Combinatorial Pattern Matching: 7th Annual Symposium (CPM'96), 39-49
Proceedings Article
1
Hide details for Gasieniec, Karpinski, Plandowski, Rytter [Karlsson, Karpinski, Lingas, Plandowski, Rytter]Gasieniec, Karpinski, Plandowski, Rytter [Karlsson, Karpinski, Lingas, Plandowski, Rytter]
1996Efficient Algorithms for Lempel-Ziv Encoding
In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, 392-403
Proceedings Article
1
Hide details for Gasieniec, Kranakis, Krizanc, Pelc [Kranakis, Krizanc, Pelc, Penczek, Szalas]Gasieniec, Kranakis, Krizanc, Pelc [Kranakis, Krizanc, Pelc, Penczek, Szalas]
1996Minimizing Congestion of Layouts for ATM Networks with Faulty Links
In: Mathematical Foundations of Computer Science 1996: 21st International Symposium (MFCS'96), 392-403
Proceedings Article
2
Hide details for Gasieniec, Pelc [Pelc]Gasieniec, Pelc [Pelc]
1997Broadcasting with a bounded fraction of faulty nodes
In: Journal of Parallel and Distributed Computing [42], 11-20
Journal Article
1996Adaptive Broadcasting with Faulty Nodes
In: Parallel Computing [22], 903-912
Journal Article
1
Hide details for Gast [-]Gast [-]
1997Das Maximum-Weight-Trace-Problem bei multiplem Sequenz-Alignment
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Gawrychowski [-]Gawrychowski [-]
2014Simple and efficient LZW-compressed multiple pattern matching
In: Journal of Discrete Algorithms [25], 34-41
Journal Article
1
Hide details for Gawrychowski [Bulatov, Shur]Gawrychowski [Bulatov, Shur]
2013Alphabetic Minimax Trees in Linear Time
In: 8th International Computer Science Symposium in Russia (CSR 2013), 36-48
Proceedings Article
1
Hide details for Gawrychowski [Calderón-Benavides, González-Caro, Chávez, Ziviani]Gawrychowski [Calderón-Benavides, González-Caro, Chávez, Ziviani]
2012Faster Algorithm for Computing the Edit Distance between SLP-Compressed Strings
In: String Processing and Information Retrieval : 19th International Symposium, SPIRE 2012, 229-236
Proceedings Article
1
Hide details for Gawrychowski [Dürr, Wilke]Gawrychowski [Dürr, Wilke]
2012Tying up the loose ends in fully LZW-compressed pattern matching
In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, 624-635
Electronic Proceedings Article
1
Hide details for Gawrychowski [Kärkkäinen, Stoye]Gawrychowski [Kärkkäinen, Stoye]
2012Simple and efficient LZW-compressed multiple pattern matching
In: Combinatorial Pattern Matching : 23rd Annual Symposium, CPM 2012, 232-242
Proceedings Article
1
Hide details for Gawrychowski, Jez, Jez [Jez]Gawrychowski, Jez, Jez [Jez]
2014Validating the Knuth-Morris-Pratt Failure Function, Fast and Online
In: Theory of Computing Systems [54], 337-372
Journal Article
1
Hide details for Gawrychowski, Kucherov, Nekrich, Starikovskaya [Kucherov, Nekrich, Starikovskaya, Kurland, Lewenstein, Porat]Gawrychowski, Kucherov, Nekrich, Starikovskaya [Kucherov, Nekrich, Starikovskaya, Kurland, Lewenstein, Porat]
2013Minimal Discriminating Words Problem Revisited
In: String Processing and Information Retrieval - 20th International Symposium (SPIRE 2013),
Proceedings Article
1
Hide details for Gawrychowski, Manea, Mercas, Nowotka, Tiseanu [Manea, Mercas, Nowotka, Tiseanu, Portier, Wilke]Gawrychowski, Manea, Mercas, Nowotka, Tiseanu [Manea, Mercas, Nowotka, Tiseanu, Portier, Wilke]
2013Finding Pseudo-repetitions
In: 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), 257-268
Proceedings Article
1
Hide details for Gawrychowski, Manea, Nowotka [Manea, Nowotka, Bonizzoni, Brattka, Lowe]Gawrychowski, Manea, Nowotka [Manea, Nowotka, Bonizzoni, Brattka, Lowe]
2013Discovering Hidden Repetitions in Words
In: 9th Conference on Computability in Europe (CiE 2013), 210-219
Proceedings Article
1
Hide details for Gawrychowski, Manea, Nowotka [Manea, Nowotka, Mayr, Portier]Gawrychowski, Manea, Nowotka [Manea, Nowotka, Mayr, Portier]
2014Testing Generalised Freeness of Words
In: 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 337-349
Proceedings Article
1
Hide details for Gawrychowski, Mozes, Weimann [Mozes, Weimann, Esparza, Fraigniaud, Husfeldt, Koutsoupias]Gawrychowski, Mozes, Weimann [Mozes, Weimann, Esparza, Fraigniaud, Husfeldt, Koutsoupias]
2014Improved Submatrix Maximum Queries in Monge Matrices
In: Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I, 525-537
Proceedings Article
1
Hide details for Gawrychowski, Straszak [Straszak, Cai, Cheng, Lam]Gawrychowski, Straszak [Straszak, Cai, Cheng, Lam]
2013Beating O(nm) in Approximate LZW-Compressed Pattern Matching
In: Algorithms and Computation - 24th International Symposium (ISAAC 2013), 78-88
Proceedings Article
1
Hide details for Gawrychowski, Uznanski [Uznanski, Kulikov, Kuznetsov, Pevzner]Gawrychowski, Uznanski [Uznanski, Kulikov, Kuznetsov, Pevzner]
2014Order-Preserving Pattern Matching with k Mismatches
In: Combinatorial Pattern Matching - 25th Annual Symposium, CPM 2014, Moscow, Russia, June 16-18, 2014. Proceedings, 130-139
Proceedings Article
2
Hide details for Geismann, Hemmer, Schömer [-]Geismann, Hemmer, Schömer [-]
2001Computing a 3-dimensional Cell in an Arrangement of Quadrics: Exactly and Actually!
In: Proceedings of the 17th Annual Symposium on Computational Geometry (SCG-01), 264-273
Proceedings Article
2001The Convex Hull of Ellipsoids (Video)
In: Proceedings of the 17th Annual Symposium on Computational Geometry (SCG-01), 321-322
Proceedings Article
1
Hide details for Georgiou, Kowalski, Shvartsman [Georgiou, Shvartsman, Fich]Georgiou, Kowalski, Shvartsman [Georgiou, Shvartsman, Fich]
2003Efficient Gossip and Robust Distributed Computation
In: Distributed Computing, 17th International Conference (DISC 2003), 224-238
Proceedings Article
1
Hide details for Georgiou, Kowalski, Shvartsman [Georgiou, Shvartsman]Georgiou, Kowalski, Shvartsman [Georgiou, Shvartsman]
2005Efficient gossip and robust distributed computation
In: Theoretical Computer Science [347], 130-166
Journal Article
1
Hide details for Gergov [-]Gergov [-]
2000Algorithms for Interval Coloring, Geometric Packing and Memory Optimization
Universität des Saarlandes
Thesis - PhD thesis
1
Hide details for Gergov [Diaz, Serna]Gergov [Diaz, Serna]
1996Approximation Algorithms for Dynamic Storage Allocation
In: Algorithms - ESA '96: 4th Annual European Symposium, 52-61
Proceedings Article
1
Hide details for Gergov, Meinel [Meinel]Gergov, Meinel [Meinel]
1996Mod-2-OBDDs - a Date Structure that generalizes EXOR-Sum-of-Products and Ordered Binary Decision Diagrams
In: Formal Methods in System Design [8], 273-282
Journal Article
1
Hide details for Giakkoupis, Sauerwald [Giakkoupis, Rabani]Giakkoupis, Sauerwald [Giakkoupis, Rabani]
2012Rumor spreading and vertex expansion
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 1623-1641
Proceedings Article
1
Hide details for Giakkoupis, Sauerwald, Sun, Woelfel [Giakkoupis, Woelfel, Dürr, Wilke]Giakkoupis, Sauerwald, Sun, Woelfel [Giakkoupis, Woelfel, Dürr, Wilke]
2012Low Randomness Rumor Spreading via Hashing
In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, 314-325
Electronic Proceedings Article
1
Hide details for Giannopoulos, Klein, Kutz, Marx [Giannopoulos, Klein, Marx]Giannopoulos, Klein, Kutz, Marx [Giannopoulos, Klein, Marx]
2010Computing geometric minimum-dilation graphs is NP-hard
In: International Journal of Computational Geometry & Applications [20], 147-173
Journal Article
1
Hide details for Giannopoulos, Knauer, Wahlström, Werner [Giannopoulos, Knauer, Werner]Giannopoulos, Knauer, Wahlström, Werner [Giannopoulos, Knauer, Werner]
2012Hardness of discrepancy computation and ε-net verification in high dimension
In: Journal of Complexity [28], 162-176
Journal Article
1
Hide details for Gidenstam, Papatriantafilou [Papatriantafilou, Tovar, Tsigas, Fouchal]Gidenstam, Papatriantafilou [Papatriantafilou, Tovar, Tsigas, Fouchal]
2007LFthreads: A Lock-Free Thread Library
In: 11th International Conference On Principles Of Distributed Systems (OPODIS), 217-231
Proceedings Article
1
Hide details for Gidenstam, Papatriantafilou, Sundell, Tsigas [Papatriantafilou, Sundell, Tsigas]Gidenstam, Papatriantafilou, Sundell, Tsigas [Papatriantafilou, Sundell, Tsigas]
2009Efficient and Reliable Lock-Free Memory Reclamation Based on Reference Counting
In: IEEE Transactions on Parallel and Distributed Systems [20], 1173-1187
Journal Article
2
Hide details for Gidenstam, Papatriantafilou, Tsigas [Papatriantafilou, Tsigas]Gidenstam, Papatriantafilou, Tsigas [Papatriantafilou, Tsigas]
2010NBmalloc: Allocating Memory in a Lock-Free Manner
In: Algorithmica [58], 304-338
Journal Article
2009NBmalloc : Allocating Memory in a Lock-Free Manner
In: Algorithmica [Online First], 1-35
Electronic Journal Article
1
Hide details for Giesen [Dey, Goswami]Giesen [Dey, Goswami]
2008Delaunay Triangulation Approximates Anchor Hull
In: Computational Geometry - Theory and Applications [36], 131-143
Journal Article
1
Hide details for Giesen [John]Giesen [John]
2008The Flow Complex: A Data Structure for Geometric Modeling
In: Computational Geometry - Theory and Applications [39], 178-190
Journal Article
1
Hide details for Giesen [Miklos, Pauly]Giesen [Miklos, Pauly]
2007Medial Axis Approximation from Inner Voronoi Balls: A Demo of the Mesecina Tool
In: 23d Annual ACM Symposium on Computational Geometry, 123-124
Proceedings Article
1
Hide details for Giesen [Mueller, Schuberth, Zolliker, wang]Giesen [Mueller, Schuberth, Zolliker, wang]
2008Conjoint Analysis for Measuring the Perceived Quality in Volume Rendering
In: IEEE Transactions on Visualization and Computer Graphics [13], 1664-1671
Journal Article
1
Hide details for Giesen [Schuberth, , , ]Giesen [Schuberth, , , ]
2007The Combinatorial Structure of Polyhedral Choice Based Conjoint Analysis
In: Conjoint Measurement: Methods and Applications, 259-271
Part of a Book
1
Hide details for Giesen, Manjunath [Giesen, Agarwal, Alt, Teillaud]Giesen, Manjunath [Giesen, Agarwal, Alt, Teillaud]
2009Minimizing Absolute Gaussian Curvature over Meshes
In: Computational Geometry, 1-16
Electronic Proceedings Article
1
Hide details for Giesen, Mitsche, Schuberth [Mitsche, Schuberth, Kao, Li]Giesen, Mitsche, Schuberth [Mitsche, Schuberth, Kao, Li]
2007Attachment IconCollaborative Ranking: an aggregation algorithm for individuals' preference estimation
In: Algorithmic Aspects in Information and Management : Third International Conference, AAIM 2007, 58-67
Proceedings Article
1
Hide details for Giesen, Schuberth, Simon, Zolliker, Zweifel [Schuberth, Simon, Zolliker, Zweifel]Giesen, Schuberth, Simon, Zolliker, Zweifel [Schuberth, Simon, Zolliker, Zweifel]
2007Image-Dependent Gamut Mapping as Optimization Problem
In: IEEE Transactions on Image Processing [16], 2401-2410
Journal Article
1
Hide details for Gnewuch, Wahlström, Winzen [Gnewuch]Gnewuch, Wahlström, Winzen [Gnewuch]
2012A New Randomized Algorithm to Approximate the Star Discrepancy Based on Threshold Accepting
In: SIAM Journal on Numerical Analysis [50], 781-807
Journal Article
1
Hide details for Goemans, Skutella [Goemans]Goemans, Skutella [Goemans]
2004Attachment IconCooperative facility location games
In: Journal of Algorithms [50], 194-214
Journal Article
1
Hide details for Goesele, Kautz, Lang, Lensch, Seidel [-]Goesele, Kautz, Lang, Lensch, Seidel [-]
20027th ACM Symposium on Solid Modeling and Applications; Tutorial T1: Geometric Algorithms for Planning and Simulation Tasks in Virtual PrototypingProceedings
1
Hide details for Goldberg, MacKenzie, Paterson, Srinivasan [Goldberg, MacKenzie, Paterson]Goldberg, MacKenzie, Paterson, Srinivasan [Goldberg, MacKenzie, Paterson]
2000Contention resolution with constant expected delay
In: Journal of the ACM [42], 1048-1096
Journal Article
2
Hide details for Golin, Raman, Schwarz, Smid [Golin, Raman]Golin, Raman, Schwarz, Smid [Golin, Raman]
1998Randomized Data Structures for the Dynamic Closest-Pair Problem
In: SIAM Journal on Computing [27], 1036-1072
Journal Article
1995Simple randomized algorithms for closest pair problems
In: Nordic Journal of Computing [2], 3-27
Journal Article
1
Hide details for Golumbic, Mintz, Rotics [Golumbic, Mintz, Rotics]Golumbic, Mintz, Rotics [Golumbic, Mintz, Rotics]
2006Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial k-trees
In: Discrete Applied Mathematics [154], 1465-1477
Journal Article
1
Hide details for Goodrich, Ramos [Goodrich]Goodrich, Ramos [Goodrich]
1997Bounded-independence derandomization of geometric partitioning with applications to parallel fixed-dimensional linear programming
In: Discrete and Computational Geometry [18], 397-420
Journal Article
1
Hide details for Gotsman, Kaligosi, Mehlhorn, Michail, Pyrga [Gotsman]Gotsman, Kaligosi, Mehlhorn, Michail, Pyrga [Gotsman]
2007Attachment IconCycle Bases of Graphs and Sampled Manifolds
In: Computer Aided Geometric Design [24], 464
Journal Article
1
Hide details for Gotthilf, Hermelin, Landau, Lewenstein [Gotthilf, Hermelin, Landau, Lewenstein]Gotthilf, Hermelin, Landau, Lewenstein [Gotthilf, Hermelin, Landau, Lewenstein]
2010Restricted LCS
In: 17th International Symposium on String Processing and Information Retrieval, 250-257
Proceedings Article
1
Hide details for Govindarajan, Dietze, Agarwal, Clark [Dietze, Agarwal, Clark]Govindarajan, Dietze, Agarwal, Clark [Dietze, Agarwal, Clark]
2008Attachment IconA scalable algorithm for dispersing population
In: Journal of Intellingent Information Systems [29], 39-61
Journal Article
1
Hide details for Granados, Hachenberger, Hert, Kettner, Mehlhorn, Seel [-]Granados, Hachenberger, Hert, Kettner, Mehlhorn, Seel [-]
2003Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and ImplementationReport
1
Hide details for Granados, Hachenberger, Hert, Kettner, Mehlhorn, Seel [Di Battista, Zwick]Granados, Hachenberger, Hert, Kettner, Mehlhorn, Seel [Di Battista, Zwick]
2003Attachment IconBoolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation
In: Algorithms - ESA 2003: 11th Annual European Symposium, 654-666
Proceedings Article
1
Hide details for Grigoriev, van Loon, Sitters, Uetz [Grigoriev, van Loon, Uetz, Fomin]Grigoriev, van Loon, Sitters, Uetz [Grigoriev, van Loon, Uetz, Fomin]
2006How to Sell a Graph: Guidelines for Graph Retailers
In: Graph-Theoretic Concepts in Computer Science : 32nd International Workshop, WG 2006, 125-136
Proceedings Article
1
Hide details for Grove [-]Grove [-]
1995On-line Bin Packing with Lookahead
In: 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA95), 430-436
Proceedings Article
1
Hide details for Grove, Kao, Krishnan, Vitter [Akl, Dehne, Kao, Krishnan, Sack, Santoro, Vitter]Grove, Kao, Krishnan, Vitter [Akl, Dehne, Kao, Krishnan, Sack, Santoro, Vitter]
1995Online Perfect Matching and Mobile Computing
In: Algorithms and Data Structures: 4th International Workshop (WADS95), 194-205
Proceedings Article
1
Hide details for Gugelmann, Spöhel [Gugelmann, Nešetřil, Győri, Sali]Gugelmann, Spöhel [Gugelmann, Nešetřil, Győri, Sali]
2011On balanced coloring games in random graphs
In: The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, 425-430
Electronic Proceedings Article
1
Hide details for Guibas, Milosavljevic, Motskin [Motskin, Guibas]Guibas, Milosavljevic, Motskin [Motskin, Guibas]
2010Attachment IconConnected Dominating Sets on Dynamic Geometric Graphs
In: Proceedings of the 22nd Canadian Conference on Computational Geometry (CCCG2010), 27-30
Proceedings Article
1
Hide details for Guillaume [-]Guillaume [-]
1997Praktisches Paralleles Paralleles List Ranking
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Gunopulos, Mannila, Saluja [Manila]Gunopulos, Mannila, Saluja [Manila]
1997Discovering all most specific sentences by randomized algorithms
In: Proceedings of the 6th International Conference on Database Theory (ICDT-97), 215-229
Proceedings Article
1
Hide details for Günther, König, Megow [Günther, König, Bampis, Jansen]Günther, König, Megow [Günther, König, Bampis, Jansen]
2010Scheduling and Packing Malleable Tasks with Precedence Constraints of Bounded Width
In: Approximation and Online Algorithms : 7th International Workshop, WAOA 2009, 170-181
Proceedings Article
1
Hide details for Günther, Maurer, Megow, Wiese [Günther, Maurer]Günther, Maurer, Megow, Wiese [Günther, Maurer]
2013A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio
In: 24st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013),
Proceedings Article
1
Hide details for Guo, Sun, Zhu [Guo, Zhu]Guo, Sun, Zhu [Guo, Zhu]
2011Greedy Construction of 2-Approximate Minimum Manhattan Networks
In: International Journal of Computational Geometry and Applications [21], 331-350
Journal Article
6
Hide details for Gupta, Janardan, Smid [Janardan]Gupta, Janardan, Smid [Janardan]
1999Efficient algorithms for counting and reporting pairwise intersections between convex polygons
In: Information Processing Letters [69], 7-13
Journal Article
1996Algorithms for generalized halfspace range searching and other intersection searching problems
In: Computational Geometry [5], 321-340
Journal Article
1996Algorithms for generalized halfspace range searching and other intersection searching problems
In: Computational Geometry [6], 1-19
Journal Article
1996Fast algorithms for collision and proximity problems involving moving geometric objects
In: Computational Geometry [6], 371-391
Journal Article
1995Further results on generalized intersection searching problems:
counting, reporting, and dynamization
In: Journal of Algorithms [19], 282-317
Journal Article
1995The rectangle enclosure and point-dominance problems revisited
In: 11th Annual !CM Symposium on Computational Geometry, 162-171
Proceedings Article
2
Hide details for Gupta, Janardan, Smid, Dasgupta [Janardan, Dasgupta]Gupta, Janardan, Smid, Dasgupta [Janardan, Dasgupta]
1997The rectangle enclosure and point-dominance problems revisited
In: International Journal of Computational Geometry and Applications [7], 437-456
Journal Article
1995The rectangle enclosure and point-dominance problems revisited
In: 11th Annual ACM Symposium on Computing Geometry, 162-171
Proceedings Article
1
Hide details for Gupta, Kaller, Mahajan, Shermer [Gupta, Kaller, Shermer, Karlsson, Lingas, Karlsson, Lingas, Gupta, Kaller, MaGupta, Kaller, Mahajan, Shermer [Gupta, Kaller, Shermer, Karlsson, Lingas, Karlsson, Lingas, Gupta, Kaller, Mahajan, Shermer]
1996Vertex partitioning problems on partial k-trees
In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, 161-172
Proceedings Article
1
Hide details for Gupta, Mahajan [Mahajan]Gupta, Mahajan [Mahajan]
1997Using amplification to compute majority with small majority gates
In: Computational Complexity [6], 46-63
Journal Article
2
Hide details for Gurvich [Gurvich]Gurvich [Gurvich]
1991Criteria for repetition-freeness of functions in the algebra of logic
In: Soviet Math. Dokl. [43], 721-726
Journal Article
1977On repetition-free Boolean functions
In: Uspekhi Mat. Nauk. (Russian Math. Surveys) [32], 183-184
Journal Article
2
Hide details for Güttler, Mehlhorn, Schneider [-]Güttler, Mehlhorn, Schneider [-]
1980Attachment IconBinary Search Trees: Average and Worst Case Behavior
In: Elektronische Informationsverarbeitung und Kybernetik [16], 41-61
Journal Article
1976Binary Search Trees: Average and Worst Case BehaviorReport
1
Hide details for Güttler, Mehlhorn, Schneider, Wernet [-]Güttler, Mehlhorn, Schneider, Wernet [-]
1976Binary Search Trees: Average and Worst Case Behavior
In: GI - 6. Jahrestagung, 301-313
Proceedings Article
1
Hide details for Gutwenger [-]Gutwenger [-]
1999Design und Implementierung einer Algorithmen-Bibliothek zum Zeichnen von Graphen
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Gutwenger, Mutzel [Whitesides]Gutwenger, Mutzel [Whitesides]
1998Planar Polyline Drawings with Good Angular Resolution
In: Proceedings of the 6th International Symposium on Graph Drawing (GD-98), 167-182
Proceedings Article
2
Hide details for Hachenberger [-]Hachenberger [-]
2006Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms Optimized Implementation, Experiments and Applications
Universität des Saarlandes
Thesis - PhD thesis
1999Dynamic shortest Path Algorithms for Planar and Outerplanar Graphs
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Hachenberger, Kettner [Kobbelt, Shapiro]Hachenberger, Kettner [Kobbelt, Shapiro]
2005Boolean Operations on 3D Selective Nef Complexes: Optimized Implementation and Experiments
In: ACM Symposium on Solid and Physical Modeling (SPM 2005), 163-174
Proceedings Article
1
Hide details for Hachenberger, Kettner, Mehlhorn [-]Hachenberger, Kettner, Mehlhorn [-]
2007Attachment IconBoolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, Optimized Implementation and Experiments
In: Computational Geometry: Theory and Applications [38], 64-99
Journal Article
1
Hide details for Hagedoorn [Calvanese, Lenzerini, Motwani, Calvanese, Lenzerini, Motwani]Hagedoorn [Calvanese, Lenzerini, Motwani, Calvanese, Lenzerini, Motwani]
2003Nearest Neighbors Can Be Found Efficiently If the Dimension Is Small Relative to the Input Size
In: Database Theory - ICDT 2003 : 9th International Conference, 440-454
Proceedings Article
1
Hide details for Hagedoorn, Overmars, Veltkamp [Borgefors, Nystrom, Sanniti di Baja]Hagedoorn, Overmars, Veltkamp [Borgefors, Nystrom, Sanniti di Baja]
2000A New Visibility Partition for Affine Pattern Matching
In: Discrete Geometry for Computer Imagery, Proceedings of the 9th International Conference (DGCI-00), 358-370
Proceedings Article
6
Hide details for Hagerup [-]Hagerup [-]
2000Dynamic algorithms for graphs of bounded treewidth
In: Algorithmica [27], 292-315
Journal Article
2000Parallel preprocessing for path queries without concurrent reading
In: Information and Computation [158], 18-28
Journal Article
1997Allocating Independent Tasks to Parallel Processors: An Experimental Study
In: Journal of Parallel and Distributed Computing [47], 185-197
Journal Article
1995A Lower Bound for the Emulation of PRAM Memories on Processor Networks
In: Information and Computation [119], 124-128
Journal Article
1995Fast Deterministic Processor Allocation
In: Journal of Algorithms [18], 629-649
Journal Article
1995The Parallel Complexity of Integer Prefix Summation
In: Information Processing Letters [56], 59-64
Journal Article
1
Hide details for Hagerup [Degano, Gorrieri, Marchetti-Spaccamela]Hagerup [Degano, Gorrieri, Marchetti-Spaccamela]
1997Dynamic algorithms for graphs of bounded treewidth
In: Proceedings of the 24th International Colloquium on Automata, Languages, and Programming (ICALP-97), 292-302
Proceedings Article
1
Hide details for Hagerup [Ferreira, Rolim, Yang]Hagerup [Ferreira, Rolim, Yang]
1996Allocating Independent Tasks to Parallel Processors: An Experimental Study
In: Parallel Algorithms for Irregularly Structured Problems: 3rd International Workshop (IRREGULAR'96), 1-33
Proceedings Article
1
Hide details for Hagerup [Larsen, Skyum]Hagerup [Larsen, Skyum]
1998Simpler and Faster Dictionaries on the AC° RAM
In: Proceedings of the 25th International Colloquium on Automata, Languages and Programming (ICALP-98), 79-90
Proceedings Article
1
Hide details for Hagerup [Morvan, Meinel, Krob]Hagerup [Morvan, Meinel, Krob]
1998Sorting and Searching on the Word RAM
In: Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science (STACS-98), 366-398
Proceedings Article
1
Hide details for Hagerup, Katajainen, Nishimura, Ragde [Katajainen, Nishimura, Ragde]Hagerup, Katajainen, Nishimura, Ragde [Katajainen, Nishimura, Ragde]
1995Characterizations of k-Terminal Flow Networks and Computing Network Flows in
Partial k-Trees
In: 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA95), 641-649
Proceedings Article
1
Hide details for Hagerup, Keller [Keller]Hagerup, Keller [Keller]
1995Fast Parallel Permutation Algorithms
In: Parallel Processing Letters [5], 139-148
Journal Article
1
Hide details for Hagerup, Kutylowski [Kutylowski]Hagerup, Kutylowski [Kutylowski]
1997Fast integer merging on the EREW PRAM
In: Algorithmica [17], 55-66
Journal Article
1
Hide details for Hagerup, Mehlhorn, Munro [, ]Hagerup, Mehlhorn, Munro [, ]
1993Attachment IconMaintaining Discrete Probability Distributions Optimally
In: Automata, languages and programming (ICALP-93) : 20th international colloquium, 253-264
Proceedings Article
1
Hide details for Hagerup, Sanders, Träff [Träff]Hagerup, Sanders, Träff [Träff]
1998An Implementation of the Binary Blocking Flow Algorithm
In: Proceedings of the 2nd Workshop on Algorithm Engineering (WAE-98), 143-154
Proceedings Article
1
Hide details for Hajiaghayi, Khandekar, Kortsarz, Mestre [Hajiaghayi, Khandekar, Kortsarz, Serna, Shaltiel, Jansen, Rolim]Hajiaghayi, Khandekar, Kortsarz, Mestre [Hajiaghayi, Khandekar, Kortsarz, Serna, Shaltiel, Jansen, Rolim]
2010The Checkpoint Problem
In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 13th International Workshop, APPROX 2010 and 14th International Workshop, RANDOM 2010, 219-231
Proceedings Article
1
Hide details for Hall, Hippler, Skutella [Hall, Hippler, Baeten, Lenstra, Parrow, Woeginger]Hall, Hippler, Skutella [Hall, Hippler, Baeten, Lenstra, Parrow, Woeginger]
2003Attachment IconMulticommodity Flows Over Time: Efficient Algorithms and Complexity
In: Automata, languages and programming : 30th International Colloquium, ICALP 2003, 397-409
Proceedings Article
1
Hide details for Hall, Langkau, Skutella [Hall, Langkau, Arora, Jansen, Rolim, Sahai]Hall, Langkau, Skutella [Hall, Langkau, Arora, Jansen, Rolim, Sahai]
2003An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times
In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, 71-82
Proceedings Article
1
Hide details for Hammerschmidt [-]Hammerschmidt [-]
1999Konzeption und Entwicklung des streng strukturierten und erweiterbaren Datentyps html_page für LEDA
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Han, Kelsen, Ramachandran, Tarjan [Han, Ramachandran, Tarjan]Han, Kelsen, Ramachandran, Tarjan [Han, Ramachandran, Tarjan]
1995Computing minimal spanning subgraphs in linear time
In: SIAM Journal on Computing [24], 1332-1358
Journal Article
1
Hide details for Han, Lam, Lee, To, Wong [Han, Lam, To, Wong]Han, Lam, Lee, To, Wong [Han, Lam, To, Wong]
2010Deadline scheduling and power management for speed bounded processors
In: Theoretical Computer Science [411], 3587-3600
Journal Article
1
Hide details for Happ [-]Happ [-]
2009Analyses of Evolutionary Algorithms
Universität des Saarlandes
Thesis - PhD thesis
1
Hide details for Happ, Johannsen, Klein, Neumann [Ryan, Keijzer]Happ, Johannsen, Klein, Neumann [Ryan, Keijzer]
2008Attachment IconRigorous Analyses of Fitness-Proportional Selection for Optimizing Linear Functions
In: Genetic and Evolutionary Computation Conference 2008, 953-960
Proceedings Article
1
Hide details for Hariharan, Kapoor [Kapoor]Hariharan, Kapoor [Kapoor]
1995Algorithms for Enumerating all Spanning Trees of an Undirected Graph
In: SIAM Journal on Computing [24], 247-265
Journal Article
1
Hide details for Hariharan, Kelsen, Mahajan [Karlsson, Lingas]Hariharan, Kelsen, Mahajan [Karlsson, Lingas]
1996Coloring 2-colorable hypergraphs with a sublinear number of colors
In: Scandinavian Workshop on Algorithm Theory (SWAT96), 41-52
Proceedings Article
1
Hide details for Hariharan, Mahajan [-]Hariharan, Mahajan [-]
1995Derandomizing semidefinite programming based approximation algorithms
In: 36th IEEE Symposium on Foundations of Computer Science, 162-16
Proceedings Article
1
Hide details for Hariharan, Muthukrishnan [Muthukrishnan]Hariharan, Muthukrishnan [Muthukrishnan]
1995String Matching over a General Matching Relation
In: Information and Computation [122], 140-148
Journal Article
1
Hide details for Hariharan, Telikepalli, Mehlhorn [Hariharan, Telikepalli, Bugliesi, Preneel, Sassone, Wegener]Hariharan, Telikepalli, Mehlhorn [Hariharan, Telikepalli, Bugliesi, Preneel, Sassone, Wegener]
2006Attachment IconA Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs
In: Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Part I, 250-261
Proceedings Article
1
Hide details for Harks, Hoefer, Klimm, Skopalik [Harks, Klimm, Skopalik]Harks, Hoefer, Klimm, Skopalik [Harks, Klimm, Skopalik]
2013Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games
In: Mathematical Programming [141], 193-215
Journal Article
4
Hide details for Harren [-]Harren [-]
2010Two-dimensional packing problems
Universität des Saarlandes
Thesis - PhD thesis
2009Attachment IconApproximation Algorithms for Orthogonal Packing Problems for Hypercubes
In: Theoretical Computer Science [410], 4504-4532
Journal Article
2007Mehrdimensionale Packungsprobleme - Approximation geometrischer Verallgemeinerungen klassischer PackungsproblemeBook
2006Approximation mehrdimensionaler Packungsprobleme
Universität Dortmund
Thesis - other
1
Hide details for Harren [Bugliesi, Preneel, Sassone, Wegener]Harren [Bugliesi, Preneel, Sassone, Wegener]
2006Attachment IconApproximating the Orthogonal Knapsack Problem for Hypercubes
In: Automata, Languages and Programming, 238-249
Proceedings Article
1
Hide details for Harren, Jansen, Prädel, van Stee [Jansen, Prädel, Dehne, Iacono, Sack]Harren, Jansen, Prädel, van Stee [Jansen, Prädel, Dehne, Iacono, Sack]
2011Attachment IconA (5/3 + ε)-Approximation for Strip Packing
In: Algorithms and Data Structures : 12th International Symposium, WADS 2011, 475-487
Proceedings Article
1
Hide details for Harren, Kern [Kern, Solis-Oba, Persiano]Harren, Kern [Kern, Solis-Oba, Persiano]
2012Improved Lower Bound for Online Strip Packing
In: Approximation and Online Algorithms : 9th International Workshop ,WAOA 2011, 211-218
Proceedings Article
1
Hide details for Harren, van Stee [-]Harren, van Stee [-]
2012Absolute Approximation Ratios for Packing Rectangles into Bins
In: Journal of Scheduling [15], 63-75
Journal Article
1
Hide details for Harren, van Stee [Dinur, Jansen, Naor, Rolim]Harren, van Stee [Dinur, Jansen, Naor, Rolim]
2009Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems
In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 12th International Workshop, APPROX 2009 and 13th International Workshop, RANDOM 2009, 177-189
Proceedings Article
1
Hide details for Harren, van Stee [Gudmundsson]Harren, van Stee [Gudmundsson]
2008Attachment IconPacking Rectangles into 2 OPT Bins using Rotations
In: 11th Scandinavian Workshop on Algorithm Theory, 306-318
Proceedings Article
1
Hide details for Hazboun [-]Hazboun [-]
1999Molekül-Docking-Reaktionen
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Hebbinghaus [-]Hebbinghaus [-]
2007Attachment IconDiscrepancy of Sums of two Arithmetic ProgressionsReport
1
Hide details for Heinz, Kasprzik, Kötzing [Heinz, Kasprzik]Heinz, Kasprzik, Kötzing [Heinz, Kasprzik]
2012Learning in the limit with lattice-structured hypothesis spaces
In: Theoretical Computer Science [457], 111 - 127
Journal Article
1
Hide details for Helwig, Neumann, Wanka [Helwig, Wanka, Bouchachia, Nedjah, de Macedo Mourelle, Pedrycz]Helwig, Neumann, Wanka [Helwig, Wanka, Bouchachia, Nedjah, de Macedo Mourelle, Pedrycz]
2009Particle Swarm Optimization with Velocity Adaptation
In: 2009 International Conference on Adaptive and Intelligent Systems ICAIS 2009 : proceedings, 146-151
Proceedings Article
8
Hide details for Hemmer [-]Hemmer [-]
2009Modular Arithmetic, CGAL - Computational Geometry Algorithms Library, release 3.4Manual
2009Polynomials, CGAL - Computational Geometry Algorithms Library, release 3.4Manual
2008CGAL package for modular arithmetic operationsReport
2008CGAL package: Algebraic FoundationsReport
2008Evaluation of different approaches in 3D curved kernel for arrangements of quadricsReport
2008Attachment IconExact Computation of the Adjacency Graph of an Arrangement of Quadrics
Johannes Gutenberg-Universität Mainz
Thesis - PhD thesis
2007Algebraic Foundations, CGAL - Computational Geometry Algorithms Library, release 3.3Manual
2002Reliable computation of planar and spatial arrangements of quadrics
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Hemmer, Dupont, Petitjean, Schömer [Dupont, Petitjean, Schömer]Hemmer, Dupont, Petitjean, Schömer [Dupont, Petitjean, Schömer]
2008Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangment of QuadricsReport
1
Hide details for Hemmer, Dupon, Petitjean, Schomer [Dupon, Petitjean, Schomer]Hemmer, Dupon, Petitjean, Schomer [Dupon, Petitjean, Schomer]
2011A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics
In: Journal of Symbolic Computation [46], 467-494
Journal Article
1
Hide details for Hemmer, Hert, Kettner, Pion, Schirra [Hert, Kettner, Pion, Schirra]Hemmer, Hert, Kettner, Pion, Schirra [Hert, Kettner, Pion, Schirra]
2007Number Types, CGAL - Computational Geometry Algorithms Library, release 3.3Manual
2
Hide details for Hemmer, Hülse [Hülse]Hemmer, Hülse [Hülse]
2009Attachment IconGeneric implementation of a modular GCD over Algebraic Extension Fields
In: EuroCG'09 : 25th European Workshop on Computational Geometry, 321-324
Proceedings Article
2007Traits classes for polynomial gcd computation over algebraic extensionsReport
1
Hide details for Hemmer, Kettner, Schömer [Hemmer, Schömer]Hemmer, Kettner, Schömer [Hemmer, Schömer]
2004Effects of a Modular Filter on Geometric ApplicationsReport
2
Hide details for Hemmer, Limbach [Limbach]Hemmer, Limbach [Limbach]
2008Arrangements of quadrics in 3D: continued work on experimental implementationReport
2007Benchmarks on a generic univariate algebraic kernelReport
1
Hide details for Hemmer, Limbach, Schömer [Schömer]Hemmer, Limbach, Schömer [Schömer]
2009Attachment IconContinued Work on the Computation of an Exact Arrangement of Quadrics
In: EuroCG'09 : 25th European Workshop on Computational Geometry, 313-316
Proceedings Article
1
Hide details for Hemmer, Tsigaridas, Zafeirakopoulos, Emiris, Karavelas, Mourrain [Tsigaridas, Zafeirakopoulos, Emiris, KaravelHemmer, Tsigaridas, Zafeirakopoulos, Emiris, Karavelas, Mourrain [Tsigaridas, Zafeirakopoulos, Emiris, Karavelas, Mourrain]
2009Experimental evaluation and cross-benchmarking of univariate real solvers
In: Symbolic Numeric Computation 2009 (SNC 2009), 45-54
Proceedings Article
1
Hide details for Henzinger, Leonardi [Henzinger]Henzinger, Leonardi [Henzinger]
2003Scheduling multicasts on unit-capacity trees and meshes
In: Journal of Computer and System Sciences [66], 567-611
Journal Article
1
Hide details for Henz, Müller, Thiel [Henz, Müller]Henz, Müller, Thiel [Henz, Müller]
2004Global constraints for round robin tournament scheduling
In: European Journal of Operational Research [153], 92-101
Journal Article
1
Hide details for Hermelin, Huang, Kratsch, Wahlström [Huang, Kratsch, Kolman, Kratochvíl]Hermelin, Huang, Kratsch, Wahlström [Huang, Kratsch, Kolman, Kratochvíl]
2011Parameterized Two-Player Nash Equilibrium
In: Graph-Theoretic Concepts in Computer Science : 37th International Workshop, WG 2011, 215-226
Proceedings Article
1
Hide details for Hermelin, Levy, Weimann, Yuster [Levy, Weimann, Yuster, Aceto, Henzinger, Sgall]Hermelin, Levy, Weimann, Yuster [Levy, Weimann, Yuster, Aceto, Henzinger, Sgall]
2011Distance Oracles for Vertex-Labeled Graphs
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 490-501
Proceedings Article
1
Hide details for Hermelin, Mestre, Rawitz [Mestre, Rawitz, Golumbic, Stern, Levy, Morgenstern]Hermelin, Mestre, Rawitz [Mestre, Rawitz, Golumbic, Stern, Levy, Morgenstern]
2012Optimization Problems in Dotted Interval Graphs
In: Graph-Theoretic Concepts in Computer Science : 38th InternationalWorkshop, WG 2012, 46-56
Proceedings Article
1
Hide details for Hermelin, Mnich, van Leeuwen [Mnich, van Leeuwen, Epstein, Ferragina]Hermelin, Mnich, van Leeuwen [Mnich, van Leeuwen, Epstein, Ferragina]
2012Parameterized complexity of induced H-matching on claw-free graphs
In: Algorithms - ESA 2012 : 20th Annual European Symposium, 624-635
Proceedings Article
1
Hide details for Hermelin, Mnich, van Leeuwen, Woeginger [Mnich, van Leeuwen, Woeginger, Aceto, Henzinger, Sgall]Hermelin, Mnich, van Leeuwen, Woeginger [Mnich, van Leeuwen, Woeginger, Aceto, Henzinger, Sgall]
2011Domination When the Stars Are Out
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 462-473
Proceedings Article
1
Hide details for Hermelin, Rawitz [Rawitz]Hermelin, Rawitz [Rawitz]
2011Optimization problems in multiple subtree graphs
In: Discrete Applied Mathematics [159], 588-594
Journal Article
1
Hide details for Hermelin, Rizzi, Vialette [Rizzi, Vialette, Chao, Hsu, Lee]Hermelin, Rizzi, Vialette [Rizzi, Vialette, Chao, Hsu, Lee]
2012Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph
In: Algorithms and Computation : 23rd International Symposium, ISAAC 2012, 465-474
Proceedings Article
1
Hide details for Hermelin, Wu [Wu, Rabani]Hermelin, Wu [Wu, Rabani]
2012Weak compositions and their applications to polynomial lower bounds for kernelization
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 104-113
Proceedings Article
1
Hide details for Hert [-]Hert [-]
2001Attachment IconConnected Area Partitioning
In: Proceedings of the 17th European Workshop on Computational Geometry (CG-01), 35-38
Proceedings Article
1
Hide details for Hertel, Mäntylä, Mehlhorn, Nievergelt [-]Hertel, Mäntylä, Mehlhorn, Nievergelt [-]
1984Attachment IconSpace Sweep Solves Intersection of Convex Polyhedra
In: Acta Informatica [21], 501-519
Journal Article
2
Hide details for Hertel, Mehlhorn [-]Hertel, Mehlhorn [-]
1985Attachment IconFast Triangulation of the Plane with Respect to Simple Polygons
In: Information and Control [64], 52-76
Journal Article
1983Fast Triangulation of Simple Polygons
In: Fundamentals of Computation Theory, Proceedings of the 1983 International FCT-Conference (FCT 1983), 207-218
Proceedings Article
1
Hide details for Hertel, Mehlhorn, Mäntylä, Nievergelt [Hertel, Mehlhorn, Mäntylä, Nievergelt]Hertel, Mehlhorn, Mäntylä, Nievergelt [Hertel, Mehlhorn, Mäntylä, Nievergelt]
1984Attachment IconSpace sweep solves intersection of two convex polyhedra elegantlyReport
1
Hide details for Hert, Hoffmann, Kettner, Pion, Seel [Hert, Hoffmann, Pion, Seel]Hert, Hoffmann, Kettner, Pion, Seel [Hert, Hoffmann, Pion, Seel]
2007An adaptable and extensible geometry kernel
In: Computational Geometry: Theory and Applications [38], 16-36
Journal Article
1
Hide details for Hert, Hoffmann, Kettner, Pion, Seel [Hoffmann, Kettner, Pion, Brodal, Frigioni, Marchetti-Spaccamela]Hert, Hoffmann, Kettner, Pion, Seel [Hoffmann, Kettner, Pion, Brodal, Frigioni, Marchetti-Spaccamela]
2001An Adaptable and Extensible Geometry Kernel
In: Proceedings of the 5th International Workshop on Algorithm Engineering (WAE-01), 79-90
Proceedings Article
1
Hide details for Hert, Lumelsky [-]Hert, Lumelsky [-]
1999Motion Planning in R^3 for Multiple Tethered Robots
In: IEEE Transactions on Robotics and Automation [15], 623-639
Journal Article
1
Hide details for Hert, Richards [Richards, Christensen, Hager]Hert, Richards [Richards, Christensen, Hager]
2002Multiple Robot Motion Planning = Parallel Processing + Geometry
In: Sensor Based Intelligent Robots, 183-205
Proceedings Article
1
Hide details for Heydrich [-]Heydrich [-]
2012Dividing connected chores fairly
Universität des Saarlandes
Thesis - Bachelor thesis
1
Hide details for Heydrich, van Stee [Heydrich, Voecking]Heydrich, van Stee [Heydrich, Voecking]
2013Attachment IconDividing connected chores fairly
In: 6th International Symposium on Algorithmic Game Theory, 420-433
Proceedings Article
1
Hide details for Heydrich, van Stee [van Stee]Heydrich, van Stee [van Stee]
2015Dividing Connected Chores Fairly
In: Theoretical Computer Science [593], 51-61
Journal Article
2
Hide details for Heydthausen, Mehlhorn [-]Heydthausen, Mehlhorn [-]
1976Top Down Parsing of Macro Grammars
In: GI - 6. Jahrestagung, 95-108
Proceedings Article
1976Top down parsing of macro grammars (preliminary report)Report
1
Hide details for Hilpert [-]Hilpert [-]
1996Heuristiken fur das euklidische Travelling Salesman Problem
Universitat des Saarlandes
Thesis - Masters thesis
2
Hide details for Hoefer [-]Hoefer [-]
2013Local Matching Dynamics in Social Networks
In: Information & Computation [222], 20-35
Journal Article
2013Strategic Cooperation in Cost Sharing Games
In: International Journal of Game Theory [42], 29-53
Journal Article
1
Hide details for Hoefer [Jansen, Margraf, Mastrolli, Rolim]Hoefer [Jansen, Margraf, Mastrolli, Rolim]
2003Experimental comparison of heuristic and approximation algorithms for uncapacitated facility location
In: 2nd International Workshop on Experimental and Efficient Algorithms (WEA-03), 165-178
Proceedings Article
1
Hide details for Hoefer, Kesselheim [Kesselheim]Hoefer, Kesselheim [Kesselheim]
2013Brief Announcement: Universally Truthful Secondary Spectrum Auctions
In: 25th Symposium on Parallelism in Algorithms and Architectures (SPAA-13), 99-101
Proceedings Article
1
Hide details for Hoefer, Kesselheim, Vöcking [Kesselheim, Vöcking]Hoefer, Kesselheim, Vöcking [Kesselheim, Vöcking]
2013Truthfulness and Stochastic Dominance with Monetary Transfers.
In: 14th Conf. Electronic Commerce (EC-13), 567-582
Proceedings Article
1
Hide details for Hoefer, Sauerwald [-]Hoefer, Sauerwald [-]
2013Brief Announcement: Threshold Load Balancing in Networks
In: 32nd Symposium on Principles of Distributed Computing (PODC-13), 54-56
Proceedings Article
2
Hide details for Hoefer, Skopalik [Skopalik]Hoefer, Skopalik [Skopalik]
2013Altruism in Atomic Congestion Games
In: ACM Transactions on Economics and Computation [1], 21
Journal Article
2013On the Complexity of Pareto-optimal Nash and Strong Equilibria
In: Theory of Computing Systems [53], 441-453
Journal Article
1
Hide details for Hoefer, Wagner [Wagner, Chen, Immorlica]Hoefer, Wagner [Wagner, Chen, Immorlica]
2013Designing Profit Shares in Matching and Coalition Formation Games
In: 9th Conference on Web and Internet Economics (WINE-13), 249-262
Proceedings Article
1
Hide details for Hoefer, Wagner [Wagner, Fomin, Freivalds, Kwiatkowska, Peleg]Hoefer, Wagner [Wagner, Fomin, Freivalds, Kwiatkowska, Peleg]
2013Locally Stable Marriage with Strict Preferences
In: 40th International Colloquium on Automata, Languages and Programming (ICALP-13), 620-631
Proceedings Article
1
Hide details for Hoepman, Papatriantafilou, Tsigas [Hélary, Hoepman, Raynal]Hoepman, Papatriantafilou, Tsigas [Hélary, Hoepman, Raynal]
1995Self-Stabilization in Wait-Free Shared Memory Objects
In: Distributed Algorithms: 9th International Workshop (WDAG95), 273-287
Proceedings Article
1
Hide details for Hoffmann, Mehlhorn [-]Hoffmann, Mehlhorn [-]
1984Intersecting a line and a simple polygon
In: EATCS Bulletin [22], 120-121
Journal Article
3
Hide details for Hoffmann, Mehlhorn, Rosenstiehl, Tarjan [-]Hoffmann, Mehlhorn, Rosenstiehl, Tarjan [-]
1986Attachment IconSorting Jordan Sequences in Linear Time Using Level-Linked Search Trees
In: Information and Control [68], 170-184
Journal Article
1985Sorting Jordan sequences in linear time
In: Computational geometry (SCG-85) : 1st symposium, 196-203
Proceedings Article
1984Sorting Jordan sequences in linear timeReport
1
Hide details for Höhn, Jacobs, Megow [Höhn, Jacobs]Höhn, Jacobs, Megow [Höhn, Jacobs]
2012On Eulerian extensions and their application to no-wait flowshop scheduling
In: Journal of Scheduling [15], 295-309
Journal Article
1
Hide details for Hong, Mehlhorn [-]Hong, Mehlhorn [-]
1982Cost tradeoffs in graph embeddings, with applicationsReport
2
Hide details for Hong, Mehlhorn, Rosenberg [-]Hong, Mehlhorn, Rosenberg [-]
1983Attachment IconCost Trade-offs in Graph Embeddings, with Applications
In: Journal of the ACM [30], 709-728
Journal Article
1981Cost Tradeoffs in Graph Embeddings, with Applications (Preliminary Version)
In: Automata, languages and programming (ICALP-81) : 8th international colloquium, 41-55
Proceedings Article
1
Show details for Hoogeveen, Skutella, Woeginger [Hoogeveen, Woeginger]Hoogeveen, Skutella, Woeginger [Hoogeveen, Woeginger]

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