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

MPI-INF D1 Publications

MPI-INF D1 Publications

Entries sorted by: 7. Library - 2. All Years - 7. Author,Editor,Publisher

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

#PAuthor/EditorTitleTypeYear
1
Hide details for Abed, FidaaAbed, Fidaa
1
Hide details for SpringerSpringer
Abed, Fidaa
Huang, Chien-Chung
Preemptive Coordination Mechanisms for Unrelated Machines
In: Algorithms - ESA 2012 : 20th Annual European Symposium, 12-23
Proceedings Article2012
1
Hide details for Abello, JamesAbello, James
1
Hide details for ACMACM
Sibeyn, Jop F.
Abello, James
Meyer, Ulrich
Heuristics for Semi-External Depth First Search on Directed Graphs
In: SPAA 2002 : Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 282-292
Proceedings Article2002
2
Hide details for Abraham, DavidAbraham, David
1
Hide details for SIAMSIAM
Abraham, David
Irving, Robert W.
Mehlhorn, Kurt
Telikepalli, Kavitha
Attachment IconPopular Matchings
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 424-432
Proceedings Article2005
1
Hide details for SpringerSpringer
Abraham, David
Cechlárová, Katarina
Manlove, David F.
Mehlhorn, Kurt
Attachment IconPareto-optimality in house allocation problems
In: Algorithms and Computation: 15th International Symposium, ISAAC 2004, 3-15
Proceedings Article2004
2
Hide details for Abraham, David J.Abraham, David J.
1
Hide details for SIAMSIAM
Abraham, David J.
Irving, Robert W.
Kavitha, Telikepalli
Mehlhorn, Kurt
Attachment IconPopular Matchings
In: SIAM Journal on Computing [37], 1030-1045
Journal Article2007
1
Hide details for SpringerSpringer
Abraham, David J.
Cechlárová, Katarína
Manlove, David
Mehlhorn, Kurt
Pareto Optimality in House Allocation Problems
In: Algorithms and computation : 16th International Symposium, ISAAC 2005, 1163-1175
Proceedings Article2005
1
Hide details for Adamaszek, AnnaAdamaszek, Anna
1
Hide details for IEEEIEEE
Adamaszek, Anna
Wiese, Andreas
Approximation Schemes for Maximum Weight Independent Set of Rectangles
In: Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2013),
Proceedings Article2013
2
Hide details for Adler, MicahAdler, Micah
1
Hide details for Cambridge University PressCambridge University Press
Adler, Micah
Räcke, Harald
Sivadasan, Naveen
Sohler, Christian
Vöcking, Berthold
Attachment IconRandomized Pursuit-Evasion in Graphs
In: Combinatorics, Probability and Computing [12], 225-244
Journal Article2003
1
Hide details for SpringerSpringer
Adler, Micah
Räcke, Harald
Sivadasan, Naveen
Sohler, Christian
Vöcking, Berthold
Randomized Pursuit-Evasion in Graphs
In: Automata, Languages and Programming : 29th International Colloquium, ICALP 2002, 901-912
Proceedings Article2002
2
Hide details for Afshani, PeymanAfshani, Peyman
1
Hide details for Hasso-Plattner-Institut für Softwaresystemtechnik GmbHHasso-Plattner-Institut für Softwaresystemtechnik GmbH
Afshani, Peyman
Agrawal, Manindra
Doerr, Benjamin
Green Larsen, Kasper
Mehlhorn, Kurt
Winzen, Carola
The Query Complexity of Finding a Hidden Permutation
In: Electronic Colloquium on Computational Complexity (ECCC): Report Series [87 (Revision 1)], 1-36
Electronic Journal Article2012
1
Hide details for SpringerSpringer
Afshani, Peyman
Agrawal, Manindra
Doerr, Benjamin
Doerr, Carola
Larsen, Kasper Green
Mehlhorn, Kurt
The Query Complexity of Finding a Hidden Permutation
In: Space-Efficient Data Structures, Streams, and Algorithms, 1-11
Part of a Book2013
1
Hide details for Agarwal, AmitAgarwal, Amit
1
Hide details for SpringerSpringer
Agarwal, Amit
Agarwal, Tarun
Chopra, Sumit
Feldmann, Anja
Kammenhuber, Nils
Krysta, Piotr
Vöcking, Berthold
An experimental study of k-splittable scheduling for DNS-based traffic allocation
In: Euro-Par 2003 parallel processing : 9th International Euro-Par Conference ; proceedings, 230-235
Proceedings Article2003
2
Hide details for Agarwal, PankajAgarwal, Pankaj
1
Hide details for ACMACM
Agarwal, Pankaj
Arge, Lars
Brodal, Gerth Stølting
Vitter, Jeffrey Scott
I/O-Efficient Dynamic Point Location in Monotone Subdivisions
In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-99), 11-20
Proceedings Article1999
1
Hide details for SpringerSpringer
Agarwal, Pankaj
Hagerup, Torben
Ray, Rahul
Sharir, Micha
Smid, Michiel
Welzl, Emo
Translating a Planar Object to Maximize Point Containment
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 42-53
Proceedings Article2002
1
Hide details for Agarwal, Pankaj K.Agarwal, Pankaj K.
1
Hide details for SpringerSpringer
Govindarajan, Sathish
Dietze, Michael C.
Agarwal, Pankaj K.
Clark, James S.
Attachment IconA scalable algorithm for dispersing population
In: Journal of Intellingent Information Systems [29], 39-61
Journal Article2008
1
Hide details for Agarwal, TarunAgarwal, Tarun
1
Hide details for SpringerSpringer
Agarwal, Amit
Agarwal, Tarun
Chopra, Sumit
Feldmann, Anja
Kammenhuber, Nils
Krysta, Piotr
Vöcking, Berthold
An experimental study of k-splittable scheduling for DNS-based traffic allocation
In: Euro-Par 2003 parallel processing : 9th International Euro-Par Conference ; proceedings, 230-235
Proceedings Article2003
5
Hide details for Agrawal, ManindraAgrawal, Manindra
2
Hide details for ACMACM
Agrawal, Manindra
Saha, Chandan
Saptharishi, Ramprasad
Saxena, Nitin
Attachment IconJacobian hits circuits: hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits
In: STOC'12 : Proceedings of the 2012 ACM Symposium on Theory of Computing, 599-614
Proceedings Article2012
Agrawal, Manindra
Saha, Chandan
Saxena, Nitin
A Case of Depth-3 Identity Testing, Sparse Factorization and Duality
In: 45th ACM Symposium on the Theory of Computing (STOC-13), toappear
Proceedings Article2013
1
Hide details for Cornell University LibraryCornell University Library
Agrawal, Manindra
Saha, Chandan
Saxena, Nitin
Attachment IconQuasi-polynomial Hitting-set for Set-depth-Delta Formulas
In: arXiv [abs/1209.2333], 1-13
Electronic Journal Article2012
1
Hide details for Hasso-Plattner-Institut für Softwaresystemtechnik GmbHHasso-Plattner-Institut für Softwaresystemtechnik GmbH
Afshani, Peyman
Agrawal, Manindra
Doerr, Benjamin
Green Larsen, Kasper
Mehlhorn, Kurt
Winzen, Carola
The Query Complexity of Finding a Hidden Permutation
In: Electronic Colloquium on Computational Complexity (ECCC): Report Series [87 (Revision 1)], 1-36
Electronic Journal Article2012
1
Hide details for SpringerSpringer
Afshani, Peyman
Agrawal, Manindra
Doerr, Benjamin
Doerr, Carola
Larsen, Kasper Green
Mehlhorn, Kurt
The Query Complexity of Finding a Hidden Permutation
In: Space-Efficient Data Structures, Streams, and Algorithms, 1-11
Part of a Book2013
1
Hide details for Ahuja, NitinAhuja, Nitin
1
Hide details for SpringerSpringer
Ahuja, Nitin
Baltz, Andreas
Doerr, Benjamin
Privetivy, Ales
Srivastav, Anand
Attachment IconOn the Minimum Load Coloring Problem
In: Third Workshop on Approximation and Online Algorithms (WAOA 2005), 15-26
Proceedings Article2005
1
Hide details for Ahuja, Ravindra K.Ahuja, Ravindra K.
1
Hide details for ACMACM
Ahuja, Ravindra K.
Mehlhorn, Kurt
Orlin, James B.
Tarjan, Robert E.
Attachment IconFaster algorithms for the shortest path problem
In: Journal of the ACM [37], 213-223
Journal Article1990
2
Hide details for Ailon, NirAilon, Nir
1
Hide details for SIAMSIAM
Ailon, Nir
Avigdor-Elgrabli, Noa
Liberty, Edo
van Zuylen, Anke
Improved Approximation Algorithms for Bipartite Correlation Clustering
In: SIAM Journal on Computing [41], 1110-1121
Journal Article2012
1
Hide details for SpringerSpringer
Ailon, Nir
Avigdor-Elgrabli, Noa
Liberty, Noa
van Zuylen, Anke
Improved Approximation Algorithms for Bipartite Correlation Clustering
In: Algorithms - ESA 2011 : 19th Annual European Symposium, 25-36
Proceedings Article2011
12
Hide details for Ajwani, DeepakAjwani, Deepak
2
Hide details for ACMACM
Ajwani, Deepak
Elbassioni, Khaled
Govindarajan, Sathish
Ray, Saurabh
Conflict-free coloring for rectangle ranges using $n^.382$ colors
In: SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallel Algorithms and Architectures, 181-187
Proceedings Article2007
Ajwani, Deepak
Elbassioni, Khaled M.
Govindarajan, Sathish
Ray, Saurabh
Conflict-Free Coloring for Rectangle Ranges Using $\tildeO(n^.382+\epsilon)$ Colors
In: 19th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 07), (to-appear)
Proceedings Article2007
1
Hide details for ACM PressACM Press
Ajwani, Deepak
Friedrich, Tobias
Meyer, Ulrich
An $O(n^2.75)$ algorithm for incremental topological ordering
In: ACM Transactions on Algorithms [4], 1-14
Journal Article2008
1
Hide details for ACM / SIAMACM / SIAM
Ajwani, Deepak
Dementiev, Roman
Meyer, Ulrich
Attachment IconA computational study of external memory BFS algorithms
In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'06, 601-610
Proceedings Article2006
1
Hide details for AMSAMS
Ajwani, Deepak
Meyer, Ulrich
Osipov, Vitaly
Breadth first search on massive graphs
In: The shortest path problem : ninth DIMACS implemenation challenge, 291-307
Part of a Book2009
1
Hide details for ElsevierElsevier
Ajwani, Deepak
Friedrich, Tobias
Average-case Analysis of Incremental Topological Ordering
In: Discrete Applied Mathematics [158], 240-250
Journal Article2010
1
Hide details for SIAMSIAM
Ajwani, Deepak
Meyer, Ulrich
Osipov, Vitaly
Improved external memory BFS implementations
In: 9th Workshop on Algorithm Engineering and Experiments (ALENEX), 3-12
Proceedings Article2007
5
Hide details for SpringerSpringer
Ajwani, Deepak
Elbassioni, Khaled
Govindarajan, Sathish
Ray, Saurabh
Conflict-free coloring for rectangle ranges using O(n .382) colors
In: Discrete & Computational Geometry [48], 39-52
Journal Article2012
Ajwani, Deepak
Friedrich, Tobias
Average-Case Analysis of Online Topological Ordering
In: Algorithms and Computation : 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007. Proceedings, 464-475
Proceedings Article2007
Ajwani, Deepak
Friedrich, Tobias
Meyer, Ulrich
Attachment IconAn $O(n^2.75)$ algorithm for online topological ordering
In: Algorithm theory - SWAT 2006 : 10th Scandinavian Workshop on Algorithm Theory, 53-64
Proceedings Article2006
Ajwani, Deepak
Malinger, Itay
Meyer, Ulrich
Toledo, Sivan
Characterizing the Performance of Flash Memory Storage Devices and Its Impact on Algorithm Design
In: Proc. 7th Intern. Workshop on Experimental Algorithms (WEA), 208-219
Proceedings Article2008
Ajwani, Deepak
Ray, Saurabh
Seidel, Raimund
Tiwary, Hans Raj
On Computing the Centroid of the Vertices of an Arrangement and Related Problems
In: 10th Workshop on Algorithms and Data Structures (WADS), 519-528
Proceedings Article2007
1
Hide details for Akbari, HodaAkbari, Hoda
1
Hide details for ACMACM
Akbari, Hoda
Berenbrink, Petra
Sauerwald, Thomas
A simple approach for adapting continuous load balancing processes to discrete settings
In: PODC'12 : Proceedings of the 2012 ACM Symposium on Principles of Distributed Computing, 271-280
Proceedings Article2012
1
Hide details for Alba, Enrique (ed.)Alba, Enrique (ed.)
1
Hide details for ACMACM
Raidl, Alba, Bacardit, Beyer, Birattari, Blum, Bosman, Congdon, Corne, Cotta, Di Penta, Doerr, Drechsle, Ebner, Grahl, Jansen, Knowles, Lenaerts, Middendorf, Miller, O'Neill, Poli, Squillero, Stanley, Stützle, van Hemert (ed.)GECCO 2009: Proceedings of the 11th Annual conference on Genetic and evolutionary computation.Proceedings2009
16
Hide details for Albers, SusanneAlbers, Susanne
2
Hide details for ACMACM
Albers, Susanne
Arora, Sanjeev
Khanna, Sanjeev
Page replacement for general caching problems
In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-99), 31-40
Proceedings Article1999
Albers, Susanne
Kursawe, Klaus
Exploring unknown environments with obstacles
In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-99), 842-843
Proceedings Article1999
1
Hide details for acm-Pressacm-Press
Albers, SusanneImproved randomized on-line algorithms for the list update problem
In: 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA95), 412-419
Proceedings Article1995
4
Hide details for ACM PressACM Press
Albers, SusanneBetter Bounds for Online Scheduling
In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing (STOC-97), 130-139
Proceedings Article1997
Albers, Susanne
Garg, Naveen
Leonardi, Stefano
Minimizing stall time in single and parallel disk systems
In: Journal of the ACM [47], 969-986
Journal Article2000
Albers, Susanne
Garg, Naveen
Leonardi, Stefano
Minimizing stall time in single and parallel disk systems
In: Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC-98), 454-462
Proceedings Article1998
Albers, Susanne
Henzinger, Monika R.
Exploring Unknown Environments
In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing (STOC-97), 416-425
Proceedings Article1997
1
Hide details for ACM Press / SIAMACM Press / SIAM
Albers, Susanne
Mitzenmacher, Michael
Average case analyses of First-Fit and Random-Fit bin packing
In: Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-98), 290-299
Proceedings Article1998
1
Hide details for ElsevierElsevier
Albers, Susanne
von Stengel, Bernhard
Wechner, Ralph
A combined BIT and TIMESTAMP algorithm for the list update problem
In: Information Processing Letters [56], 135-139
Journal Article1995
1
Hide details for IEEEIEEE
Albers, Susanne
Charikar, Moses
Mitzenmacher, Michael
On delayed information and action in on-line algorithms
In: Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science (FOCS-98), 71-80
Proceedings Article1998
1
Hide details for SIAMSIAM
Albers, SusanneBetter bounds for online scheduling
In: SIAM Journal on Computing [29], 459-473
Journal Article1999
4
Hide details for SpringerSpringer
Albers, Susanne
Koga, Hisashi
Page migration with limited local memory capacity
In: Algorithms and Data Structures: 4th International Workshop (WADS95), 412-158
Proceedings Article1995
Albers, Susanne
Kursawe, Klaus
Schuierer, Sven
Exploring unkown environments with obstacles
In: Algorithmica [32], 123-143
Journal Article2002
Albers, Susanne
Mitzenmacher, Michael
Average Case Analysis of List Update Algorithms, with Applications to Data Compression
In: Automata, Languages and Programming: 23rd International Colloquium (ICALP'96), 514-525
Proceedings Article1996
Albers, Susanne
Westbrook, Jeffery
Self-organizing data structures
In: Online Algorithms: The State of the Art, 13-51
Part of a Book1998
1
Hide details for WileyWiley
Albers, Susanne
Mitzenmacher, Michael
Average-Case Analyses of First Fit and Random Fit Bin Packing
In: Random Structures & Algorithms [16], 240 - 259
Journal Article2000
3
Hide details for Alberts, DavidAlberts, David
1
Hide details for SpringerSpringer
Mutzel, Petra
Gutwenger, Carsten
Brockenauer, Ralf
Fialko, Sergej
Klau, Gunnar W.
Krüger, Michael
Ziegler, Thomas
Näher, Stefan
Alberts, David
Ambras, Dirk
Koch, Gunter
Jünger, Michael
Buchheim, Christoph
Leipert, Sebastian
AGD: A Library of Algorithms for Graph Drawing
In: Proceedings of the 6th International Symposium on Graph Drawing (GD-98), 456-457
Proceedings Article1998
1
Hide details for Università Ca' Foscari di VeneziaUniversità Ca' Foscari di Venezia
Alberts, David
Gutwenger, Carsten
Mutzel, Petra
Näher, Stefan
AGD-Library: A Library of Algorithms for Graph Drawing
In: Proceedings of the Workshop on Algorithm Engineering (WAE-97), 112-123
Proceedings Article1997
1
Hide details for University of TrentoUniversity of Trento
Alberts, David
Cattaneo, G
Italiano, Giuseppe
Nanni, Umberto
Zaroliagis, Christos
A Software Library of Dynamic Graph Algorithms
In: Proceedings of Workshop on Algorithms and Experiments (ALEX-98), 129-136
Proceedings Article1998
2
Hide details for Albrecht, Andreas (ed.)Albrecht, Andreas (ed.)
1
Hide details for Akademie-VerlagAkademie-Verlag
Albrecht, Jung, Mehlhorn (ed.)Parallel algorithms and architectures (WPAA-87) : international workshopProceedings1987
1
Hide details for SpringerSpringer
Albrecht, Jung, Mehlhorn (ed.)Parallel algorithms and architectures : International WorkshopProceedings1987
1
Hide details for Albrecht, MarcAlbrecht, Marc
1
Hide details for SID Society for Information DisplaySID Society for Information Display
Albrecht, Marc
Karrenbauer, Andreas
Xu, Chihao
A clipper-free Algorithm for efficient HW-Implementation of local dimming LED-Backlight
In: Proceedings of the 28th International Display Research Conference (IDRC), 286-289
Proceedings Article2008
1
Hide details for Alcaraz, NicolasAlcaraz, Nicolas
1
Hide details for The Royal Society of ChemistryThe Royal Society of Chemistry
Alcaraz, Nicolas
Friedrich, Tobias
Kötzing, Timo
Krohmer, Anton
Müller, Joachim
Pauling, Josch
Baumbach, Jan
Efficient key pathway mining: combining networks and OMICS data
In: Integrative Biology [4], 756-764
Journal Article2012
1
Hide details for Alefragis, PanayiotisAlefragis, Panayiotis
1
Hide details for SpringerSpringer
Alefragis, Panayiotis
Goumopoulos, Christos
Sanders, Peter
Takkula, Tuomo
Wedelin, Dag
Parallel Crew Scheduling in PAROS
In: Proceedings of the 4th International Euro-Par Conference (Euro-Par-98), 1104-1113
Proceedings Article1998
1
Hide details for Alkassar, EyadAlkassar, Eyad
1
Hide details for SpringerSpringer
Alkassar, Eyad
Böhme, Sascha
Mehlhorn, Kurt
Rizkallah, Christine
Verification of Certifying Computations
In: Computer Aided Verification : 23rd International Conference, CAV 2011, 67-82
Proceedings Article2011
1
Hide details for Alon, NogaAlon, Noga
1
Hide details for ElsevierElsevier
Alon, Noga
Bradford, Phillip Gnassi
Fleischer, Rudolf
Matching nuts and bolts faster
In: Information Processing Letters [59], 123-127
Journal Article1996
1
Hide details for Altafani, C.Altafani, C.
1
Hide details for IETIET
Iacono, G.
Ramezani, Fahimeh
Soranzo, N.
Altafani, C.
Determining the distance to monotonicity of a biological network: a graph-theoretical approach
In: IET Systems Biology [4], 223-235
Journal Article2010
1
Hide details for Altafini, ClaudioAltafini, Claudio
1
Hide details for Oxford University PressOxford University Press
Soranzo, Nicola
Ramezani, Fahimeh
Iacono, Giovanni
Altafini, Claudio
Decompositions of large-scale biological systems based on dynamical properties
In: Bioinformatics [28], 76-83
Journal Article2012
2
Hide details for Altenkamp, DorisAltenkamp, Doris
1
Hide details for ACMACM
Altenkamp, Doris
Mehlhorn, Kurt
Attachment IconCodes: Unequal Probabilities, Unequal Letter Cost
In: Journal of the ACM [27], 412-427
Journal Article1980
1
Hide details for SpringerSpringer
Altenkamp, Doris
Mehlhorn, Kurt
Codes: Unequal Probabilities, Unequal Letter Cost
In: Automata, languages and programming (ICALP-78): 5th international colloquium, 15-25
Proceedings Article1978
25
Hide details for Althaus, ErnstAlthaus, Ernst
1
Hide details for ACLACL
Althaus, Ernst
Karamanis, Nikiforos
Koller, Alexander
Computing Locally Coherent Discourses.
In: Proceedings of the conference and workshops, 42nd annual meeting of the Association for Computational Linguistics, 399-406
Proceedings Article2004
4
Hide details for ACMACM
Althaus, Ernst
Canzar, Stefan
Emmett, Mark
Karrenbauer, Andreas
Marshall, Alan
Meyer-Bäse, Anke
Zhang, Huimin
Computing H/D-exchange speeds of single residues from data of peptic fragments
In: 23rd Annual ACM Symposium on Applied Computing (SAC), 1273-1277
Proceedings Article2008
Althaus, Ernst
Duchier, Denys
Koller, Alexander
Mehlhorn, Kurt
Niehren, Joachim
Thiel, Sven
An Efficient Algorithm for the Configuration Problem of Dominance Graphs
In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-01), 815-824
Proceedings Article2001
Althaus, Ernst
Eisenbrand, Friedrich
Funke, Stefan
Mehlhorn, Kurt
Attachment IconPoint Containment in the Integer Hull of a Polyhedron
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 929-933
Proceedings Article2004
Althaus, Ernst
Mehlhorn, Kurt
TSP-Based Curve Reconstruction in Polynomial Time
In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-00), 686-695
Proceedings Article2000
1
Hide details for ACM PressACM Press
Althaus, Ernst
Kohlbacher, Oliver
Lenhof, Hans-Peter
Müller, Peter
A Combinatorial Approach to Protein Docking with Flexible Side-Chains
In: Proceedings of the 4th Annual International Conference on Computational Molecular Biology (RECOMB-00), 15-24
Proceedings Article2000
1
Hide details for ACM / SiamACM / Siam
Althaus, Ernst
Naujoks, Rouven
Attachment IconComputing Steiner Minimal Trees in Hamming Metric
In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'06, 172-181
Proceedings Article2006
2
Hide details for ElsevierElsevier
Althaus, Ernst
Duchier, Denys
Koller, Alexander
Mehlhorn, Kurt
Niehren, Joachim
Thiel, Sven
Attachment IconAn Efficient Algorithm for the Configuration Problem of Dominance Graphs
In: Journal of Algorithms [48], 194-219
Journal Article2003
Althaus, Ernst
Funke, Stefan
Har-Peled, Sariel
Könemann, Jochen
Ramos, Edgar A.
Skutella, Martin
Approximating k-Hop Minimum-Spanning Trees
In: Operations Research Letters [33], 115-120
Journal Article2005
1
Hide details for IEEEIEEE
Althaus, Ernst
Calinescu, Gruia
Mandoiu, Ion
Prasad, Sushil
Tchervenski, Nickolay
Zelikovsly, Alexander
Power Efficient Range Assignment in Ad-hoc Wireless
In: Proceedings of the IEEE Wireless Communications and Networking Conference (WCNC-03), 1889-1894
Proceedings Article2003
1
Hide details for LiebertLiebert
Althaus, Ernst
Kohlbacher, Oliver
Lenhof, Hans-Peter
Müller, Peter
A combinatorial approach to protein docking with flexible side chains
In: Journal of Computational Biology [9], 597-612
Journal Article2002
1
Hide details for Oxford University PressOxford University Press
Althaus, Ernst
Caprara, Alberto
Lenhof, Hans-Peter
Reinert, Knut
Multiple sequence alignment with arbitrary gap costs: Computing an optimal solution using polyhedral combinatorics
In: Proceedings of the European Conference on Computational Biology (ECCB 2002), S4-S16
Proceedings Article2002
1
Hide details for SIAMSIAM
Althaus, Ernst
Mehlhorn, Kurt
Attachment IconTraveling Salesman-Based Curve Reconstruction in Polynomial Time
In: SIAM Journal on Computing [31], 27-66
Journal Article2001
11
Hide details for SpringerSpringer
Althaus, Ernst
Baumann, Tobias
Schömer, Elmar
Werth, Kai
Trunk Packing Revisited
In: Experimental Algorithms, 6th International Workshop, 420-432
Proceedings Article2007
Althaus, Ernst
Bockmayr, Alexander
Elf, Matthias
Kasper, Thomas
Jünger, Michael
Mehlhorn, Kurt
Attachment IconSCIL - Symbolic Constraints in Integer Linear Programming.
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 75-87
Proceedings Article2002
Althaus, Ernst
Canzar, Stefan
A Lagrangian relaxation approach for the multiple sequence alignment problem
In: Combinatorial Optimization and Applications : First International Conference, COCOA 2007, 267-278
Proceedings Article2007
Althaus, Ernst
Canzar, Stefan
LASA: A tool for non-heuristic alignment of multiple sequences
In: Bioinformatics Research and Development (BIRD’08), 489-498
Proceedings Article2008
Althaus, Ernst
Canzar, Stefan
Elbassioni, Khaled
Karrenbauer, Andreas
Mestre, Julián
Approximating the Interval Constrained Coloring Problem
In: 11th Scandinavian Workshop on Algorithm Theory (SWAT), 210-221
Proceedings Article2008
Althaus, Ernst
Canzar, Stefan
Elbassioni, Khaled
Karrenbauer, Andreas
Mestre, Julian
Approximation Algorithms for the Interval Constrained Coloring Problem
In: Algorithmica [61], 342-361
Journal Article2011
Althaus, Ernst
Dumitriu, Daniel
Fast and Accurate Bounds on Linear Programs
In: Experimental Algorithms : 8th International Symposium on Experimental Algorithms (SEA 2009), 40-50
Proceedings Article2009
Althaus, Ernst
Fink, Christian
A Polyhedral Approach to Surface Reconstruction from Planar Contours.
In: Proceedings of the 9th International Conference on Integer Programming and Combinatorial Optimization, 258-272
Proceedings Article2002
Althaus, Ernst
Kupilas, Joschka
Naujoks, Rouven
On the Low-Dimensional Steiner Minimum Tree Problem in Hamming Metric
In: Theory and Applications of Models of Computation : 8th Annual Conference, TAMC 2011, 308-319
Proceedings Article2011
Althaus, Ernst
Naujoks, Rouven
Reconstructing Phylogenetic Networks with One Recombination
In: Experimental Algorithms, 7th International Workshop, WEA 2008, 275-288
Proceedings Article2008
Althaus, Ernst
Polzin, Tobias
Vahdati Daneshmand, Siavash
Improving Linear Programming Approaches for the Steiner Tree Problem
In: Experimental and efficient algorithms : Second International Workshop, WEA 2003, 1-14
Proceedings Article2003
1
Hide details for University of New MexicoUniversity of New Mexico
Althaus, Ernst
Mehlhorn, Kurt
Näher, Stefan
Schirra, Stefan
Attachment IconExperiments on curve reconstruction
In: Proceedings of 2nd Workshop on Algorithm Engineering and Experiments (ALENEX-00), 103-114
Electronic Proceedings Article2000
19
Hide details for Alt, HelmutAlt, Helmut
3
Hide details for ACMACM
Alt, Helmut
Fleischer, Rudolf
Kaufmann, Michael
Mehlhorn, Kurt
Näher, Stefan
Schirra, Stefan
Uhrig, Christian
Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures
In: Computational geometry (SCG-90) : 6th annual symposium, 281-289
Proceedings Article1990
Alt, Helmut
Mehlhorn, Kurt
Attachment IconA Language over a One Symbol Alphabet Requiring only O(log log n) Space
In: SIGACT News [7], 31-33
Journal Article1975
Alt, Helmut
Mehlhorn, Kurt
Wagener, Hubert
Welzl, Emo
Convergence, Similarity and Symmetries of Geometric Objects
In: Computational geometry (SCG-87) : 3rd symposium, 308-315
Proceedings Article1987
1
Hide details for DunodDunod
Alt, Helmut
Mehlhorn, Kurt
Attachment IconComplexity arguments in algebraic language theory
In: Revue française d'automatique, d'informatique et de recherche opérationnelle : RAIRO / Association Française pour la Cybernétique Economique et Technique [13], 217-225
Journal Article1979
1
Hide details for Edinburgh University PressEdinburgh University Press
Alt, Helmut
Mehlhorn, Kurt
Attachment IconLower Bounds for the Space Complexity of Context-Free Recognition
In: Third International Colloquium on Automata, Languages and Programming, 338-354
Proceedings Article1976
3
Hide details for ElsevierElsevier
Alt, Helmut
Geffert, Viliam
Mehlhorn, Kurt
Attachment IconA lower bound for the nondeterministic space complexity of context-free recognition
In: Information Processing Letters [42], 25-27
Journal Article1992
Alt, Helmut
Mehlhorn, Kurt
Munro, J.
On the complexity of partial match retrieval
In: Information Processing Letters [19], 61-65
Journal Article1984
Alt, Helmut
Mehlhorn, Kurt
Munro, J. Ian
Attachment IconPartial match retrieval in implicit data structures
In: Information Processing Letters [19], 61-65
Journal Article1984
1
Hide details for North-HollandNorth-Holland
Alt, Helmut
Blum, Norbert
Mehlhorn, Kurt
Paul, Markus
Attachment IconComputing a maximum cardinality matching in a bipartite graph in time $O(n^1.5 \sqrtm/\log n)$
In: Information Processing Letters [37], 237-240
Journal Article1991
2
Hide details for SIAMSIAM
Alt, Helmut
Mehlhorn, Kurt
Attachment IconSearching Semisorted Tables
In: SIAM Journal on Computing [14], 840-848
Journal Article1985
Mehlhorn, Kurt
Näher, Stefan
Alt, Helmut
A Lower Bound on the Complexity of the Union-Split-Find Problem
In: SIAM Journal on Computing [17], 1093-1102
Journal Article1988
1
Hide details for Society for Industrial and Applied MathematicsSociety for Industrial and Applied Mathematics
Alt, Helmut
Hagerup, Torben
Mehlhorn, Kurt
Preparata, Franco P.
Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
In: SIAM Journal on Computing [16], 808-835
Journal Article1987
7
Hide details for SpringerSpringer
Alt, Helmut
Fleischer, Rudolf
Kaufmann, Michael
Mehlhorn, Kurt
Näher, Stefan
Schirra, Stefan
Uhrig, Christian
Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
In: Algorithmica [8], 391-408
Journal Article1992
Alt, Helmut
Guibas, L.
Mehlhorn, Kurt
Karp, Richard M.
Wigderson, A.
Attachment IconA Method for Obtaining Randomized Algorithms with Small Tail Probabilities
In: Algorithmica [16], 543-547
Journal Article1996
Alt, Helmut
Hagerup, Torben
Mehlhorn, Kurt
Preparata, Franco P.
Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
In: Mathematical Foundations of Computer Science, 12th Symposium (MFCS 1986), 199-208
Proceedings Article1986
Alt, Helmut
Hagerup,Torben
Mehlhorn, Kurt
Preparata, Franco P.
Attachment IconDeterministic Simulation of Idealized Parallel Computers on more Realistic Ones
In: Parallel Algorithms and Architectures : International Workshop, 11-15
Proceedings Article1987
Alt, Helmut
Mehlhorn, Kurt
Munro, J. Ian
Partial Match Retrieval in Implicit Data Structures
In: Mathematical foundations of computer science (MFCS-81) : 10th symposium, ,, 156-161
Proceedings Article1981
Alt, Helmut
Mehlhorn, Kurt
Wagener, Hubert
Welzl, Emo
Attachment IconCongruence, Similarity, and Symmetries of Geometric Objects
In: Discrete and Computational Geometry [3], 237-256
Journal Article1988
Mehlhorn, Kurt
Näher, Stefan
Alt, Helmut
A Lower Bound for the Complexity of the Union-Split-Find Problem
In: Automata, Languages and Programming (ICALP-87) : 14th International Colloquium, 479-488
Proceedings Article1987
1
Hide details for Alvarez, VictorAlvarez, Victor
1
Hide details for ACMACM
Alvarez, Victor
Bringmann, Karl
Curticapean, Radu
Ray, Saurabh
Attachment IconCounting Crossing Free Structures
In: Proceedings of the Twenty-Eight Annual Symposium on Computational Geometry (SCG'12), 61-68
Proceedings Article2012
2
Hide details for Amaldi, EdoardoAmaldi, Edoardo
2
Hide details for SpringerSpringer
Amaldi, Edoardo
Iuliano, Claudio
Jurkiewicz, Tomasz
Mehlhorn, Kurt
Rizzi, Romeo
Breaking the $O(m^2n)$ Barrier for Minimum Cycle Bases
In: Algorithms - ESA 2009 : 17th Annual European Symposium, 301-312
Proceedings Article2009
Amaldi, Edoardo
Iuliano, Claudio
Jurkiewicz, Tomasz
Mehlhorn, Kurt
Rizzi, Romeo
Breaking the $O(m^2n)$ Barrier for Minimum Cycle Bases
In: Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings, 301-312
Proceedings Article2009
3
Hide details for Amato, Nancy M.Amato, Nancy M.
2
Hide details for ACM PressACM Press
Amato, Nancy M.
Goodrich, Michael T.
Ramos, Edgar A.
Linear-Time Triangulation of a Simple Polygon Made Easier Via Randomization
In: Proceedings of the 16th Annual Symposium on Computational Geometry (SCG-00), 201-212
Proceedings Article2000
Ramos, Edgar A.
Amato, Nancy M.
Goodrich, Michael T.
Computing the arrangement of curve segments: Divide-and-conquer algorithms via sampling
In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-00), 705-706
Proceedings Article2000
1
Hide details for SpringerSpringer
Ramos, Edgar A.
Amato, Nancy M.
Goodrich, Michael T.
A Randomized Algorithm for Triangulating a Simple Polygon in Linear Time
In: Discrete and Computational Geometry [26], 246-265
Journal Article2001
1
Hide details for Ambalath, Abhimanyu M.Ambalath, Abhimanyu M.
1
Hide details for SpringerSpringer
Ambalath, Abhimanyu M.
Balasundaram, Radheshyam
H., Chintan Rao
Koppula, Venkata
Misra, Neeldhara
Philip, Geevarghese
Ramanujan, M. S.
Attachment IconOn the Kernelization Complexity of Colorful Motifs
In: Parameterized and Exact Computation - 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings, 14-25
Proceedings Article2010
1
Hide details for Ambras, DirkAmbras, Dirk
1
Hide details for SpringerSpringer
Mutzel, Petra
Gutwenger, Carsten
Brockenauer, Ralf
Fialko, Sergej
Klau, Gunnar W.
Krüger, Michael
Ziegler, Thomas
Näher, Stefan
Alberts, David
Ambras, Dirk
Koch, Gunter
Jünger, Michael
Buchheim, Christoph
Leipert, Sebastian
AGD: A Library of Algorithms for Graph Drawing
In: Proceedings of the 6th International Symposium on Graph Drawing (GD-98), 456-457
Proceedings Article1998
3
Hide details for Amini, OmidAmini, Omid
1
Hide details for ElsevierElsevier
Amini, Omid
Pérennes, Stéphane
Sau, Ignasi
Hardness and approximation of traffic grooming
In: Theoretical Computer Science [410], 3751-3760
Journal Article2009
1
Hide details for International PressInternational Press
Amini, Omid
Manjunath, Madhusudan
Riemann-Roch for sublattices of the root lattice $A\_n$
In: Electronic Journal of Combinatorics [17], R124,1-R124,50
Electronic Journal Article2010
1
Hide details for SpringerSpringer
Amini, Omid
Peleg, David
Pérennes, Stéphane
Sau, Ignasi
Saurabh, Saket
Degree-Constrained Subgraph Problems: Hardness and Approximation Results
In: Approximation and Online Algorithms : 6th International Workshop, WAOA 2008, 29-42
Proceedings Article2009
1
Hide details for Anagnostopoulos, ArisAnagnostopoulos, Aris
1
Hide details for SpringerSpringer
Anagnostopoulos, Aris
Grandoni, Fabrizio
Leonardi, Stefano
Wiese, Andreas
Constant Integrality Gap LP formulations of Unsplittable Flow on a Path
In: Proceedings of the 16th Conference on Integer Programming and Combinatorial Optimization (IPCO 2013),
Proceedings Article2013
1
Hide details for Anand, SAnand, S
1
Hide details for SpringerSpringer
Anand, S
Bringmann, Karl
Friedrich, Tobias
Garg, Naveen
Kumar, Amit
Minimizing maximum (weighted) flow-time on related and unrelated machines
In: Automata, Languages, and Programming - 40th International Colloquium (ICALP-13), 13-24
Proceedings Article2013
1
Hide details for Anand, S.Anand, S.
1
Hide details for SpringerSpringer
Anand, S.
Garg, Naveen
Megow, Nicole
Meeting deadlines: How much speed suffices?
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011. - Pt. I, 232-243
Proceedings Article2011
2
Hide details for Andersson, ArneAndersson, Arne
1
Hide details for acm-Pressacm-Press
Andersson, Arne
Hagerup, Torben
Nilsson, Stefan
Raman, Rajeev
Sorting in Linear Time?
In: 27th Annual ACM Symposium on Theory of Computing (STOC95), 427-436
Proceedings Article1995
1
Hide details for SIAMSIAM
Andersson, Arne
Hagerup, Torben
Hastad, Johan
Petersson, Ola
Tight bounds for searching a sorted array of strings
In: SIAM Journal on Computing [30], 1552-1578
Journal Article2000
1
Hide details for Andreou, MariaAndreou, Maria
1
Hide details for SpringerSpringer
Andreou, Maria
Fotakis, Dimitris
Nikoletseas, Sotiris
Papadopoulou, Vicky
Spirakis, Paul G.
Attachment IconOn Radiocoloring Hierarchically Specified Planar Graphs: PSPACE-Completeness and Approximations
In: Mathematical Foundations of Computer Science 2002 : 27th International Symposium, MFCS 2002, 81-92
Proceedings Article2002
11
Hide details for Angelopoulos, SpyrosAngelopoulos, Spyros
2
Hide details for AAAI PressAAAI Press
Angelopoulos, Spyros
Lopez-Ortiz, Alejandro
Intertruptible Algorithms for Multi Problem Solving
In: Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI 09), 380-386
Proceedings Article2009
Angelopoulos, Spyros
Lopez-Ortiz, Alejandro
Hamel,Angele
Optimal Scheduling of Contract Algorithms with Soft Deadlines
In: 23rd National Conference on Artificial Intelligence (AAAI 2008), 868-873
Proceedings Article2008
1
Hide details for ACMACM
Angelopoulos, Spyros
Schweitzer, Pascal
Paging and List Update under Bijective Analysis
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 1136-1145
Proceedings Article2009
1
Hide details for Department of Mathematics of the University of PennsylvaniaDepartment of Mathematics of the University of Pennsylvania
Angelopoulos, Spyros
Doerr, Benjamin
Huber, Anna
Panagiotou, Konstantinos
Tight bounds for quasirandom rumor spreading
In: The Electronic Journal of Combinatorics [16], R102,1-R102,19
Electronic Journal Article2009
1
Hide details for ElsevierElsevier
Angelopoulos, Spyros
Borodin, Allan
Randomized Priority Algorithms
In: Theoretical Computer Science [411], 2542-2558
Journal Article2010
2
Hide details for SIAMSIAM
Angelopoulos, SpyrosImproved bounds for the online steiner tree problem in graphs of bounded edge-asymmetry
In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, 248-257
Proceedings Article2007
Angelopoulos, Spyros
Dorrigiv, Reza
López-Ortiz, Alejandro
On the separation and equivalence of paging strategies
In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, 229-237
Proceedings Article2007
4
Hide details for SpringerSpringer
Angelopoulos, SpyrosA Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry
In: 16th Annual European Symposium on Algorithms (ESA 2008), 76-87
Proceedings Article2008
Angelopoulos, SpyrosOn the Competitiveness of the Online Asymmetric and Euclidean Steiner Tree Problems
In: Approximation and Online Algorithms : 7th International Workshop, WAOA 2009, 1-12
Proceedings Article2010
Angelopoulos, SpyrosOnline Priority Steiner Tree Problems
In: Algorithms and Data Structures : 11th International Symposium, WADS 2009, 37-48
Proceedings Article2009
Angelopoulos, Spyros
Dorrigiv, Reza
Lopez-Ortiz, Alejandro
List Update with Locality of Reference
In: 8th Latin American Symposium on Theoretical Informatics (LATIN 2008), 399-410
Proceedings Article2008
1
Hide details for Anshelevich, ElliotAnshelevich, Elliot
1
Hide details for SpringerSpringer
Anshelevich, Elliot
Bhardwaj, Onkar
Hoefer, Martin
Friendship and Stable Matching.
In: 21st European Symposium on Algorithms (ESA-13), 49-60
Proceedings Article2013
1
Hide details for Antoniadis, AntoniosAntoniadis, Antonios
1
Hide details for SpringerSpringer
Antoniadis, Antonios
Huang, Chien-Chung
Ott, Sebastian
Verschae, José
How to Pack Your Items When You Have to Buy Your Knapsack
In: Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, 62-73
Proceedings Article2013
1
Hide details for Antoniol, Giulio (ed.)Antoniol, Giulio (ed.)
1
Hide details for ACMACM
Keizer, Antoniol, Congdon, Deb, Doerr, Hansen, Holmes, Hornby, Howard, Kennedy, Kumar, Lobo, Miller, Moore, Neumann, Pelikan, Pollack, Sastry, Stanley, Stoica, Talbi, Wegener (ed.)GECCO 2008: Proceedings of the 10th Annual Conference on Genetic and Evolutionary ComputationProceedings2008
1
Hide details for Aranov, BorisAranov, Boris
1
Hide details for SpringerSpringer
Aranov, Boris
Asano, Tetsuo
Katoh, Naoki
Mehlhorn, Kurt
Tokuyama, Takeshi
Attachment IconPolyline Fitting of Planar Points Under Min-sum Criteria
In: Algorithms and Computation: 15th International Symposium, ISAAC 2004, 77-88
Proceedings Article2004
1
Hide details for Aref, Walid G.Aref, Walid G.
1
Hide details for IEEEIEEE
Mokbel, Mohamed F.
Aref, Walid G.
Elbassioni, Khaled M.
Kamel, Ibrahim
Attachment IconScalable Multimedia Disk Scheduling
In: 20th International Conference on Data Engineering, ICDE 2004, 498-509
Proceedings Article2004
4
Hide details for Arge, LarsArge, Lars
1
Hide details for ACMACM
Agarwal, Pankaj
Arge, Lars
Brodal, Gerth Stølting
Vitter, Jeffrey Scott
I/O-Efficient Dynamic Point Location in Monotone Subdivisions
In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-99), 11-20
Proceedings Article1999
1
Hide details for European Mathematical Society (EMS)European Mathematical Society (EMS)
Arge, Lars
Meyer, Ulrich
Toma, Laura
Zeh, Norbert
On external-memory planar depth first search
In: Journal of Graph Algorithms and Applications [7], 105-129
Journal Article2003
2
Hide details for SpringerSpringer
Arge, Lars
Meyer, Ulrich
Toma, Laura
External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs
In: Automata, languages and programming : 31st International Colloquium, ICALP 2004, 146-157
Proceedings Article2004
Arge, Lars
Meyer, Ulrich
Toma, Laura
Zeh, Norbert
On External-Memory Planar Depth First Search
In: Proceedings of the 7th International Workshop on Algorithms and Data Structures (WADS-01), 471-482
Proceedings Article2001
6
Hide details for Arikati, Srinivasa RaoArikati, Srinivasa Rao
1
Hide details for ElesevierElesevier
Arikati, Srinivasa Rao
Mehlhorn, Kurt
Attachment IconA correctness certificate for the Stoer-Wagner min-cut algorithm
In: Information Processing Letters [70], 251-254
Journal Article1999
1
Hide details for ElsevierElsevier
Arikati, Srinivasa Rao
Dessmark, Anders
Lingas, Andrzej
Marathe, Madhav V.
Approximation algorithms for maximum two-dimensional pattern matching
In: Theoretical Computer Science [255], 51-62
Journal Article2001
1
Hide details for Society for Industrial and Applied MathematicsSociety for Industrial and Applied Mathematics
Arikati, Srinivasa Rao
Maheshwari, Anil
Realizing degree sequences in parallel
In: SIAM Journal of Computing [9], 317-338
Journal Article1996
3
Hide details for SpringerSpringer
Arikati, Srinivasa Rao
Chaudhuri, Shiva
Zaroliagis, Christos
All-Pairs Min-Cut in Sparse Networks
In: Foundations of software technology and theoretical computer science (FSTTCS-95) : 15th conference, 363-376
Proceedings Article1995
Arikati, Srinivasa Rao
Chen, Danny Z.
Chew, L. Paul
Das, Gautam
Smid, Michiel
Zaroliagis, Christos
Planar Spanners and Approximate Shortest Path Queries among Obstacles in the Plane
In: Algorithms - ESA '96: 4th Annual European Symposium, 514-528
Proceedings Article1996
Arikati, Srinivasa Rao
Dessmark, Anders
Lingas, Andrzej
Marathe, Madhav V.
Approximation algorithms for maximum two-dimensional pattern matching
In: Combinatorial Pattern Matching: 7th Annual Symposium, CPM96, 348-360
Proceedings Article1996
1
Hide details for Aronov, BorisAronov, Boris
1
Hide details for SpringerSpringer
Aronov, Boris
Asano, Tetsuo
Funke, Stefan
Optimal Triangulation with Steiner Points
In: Algorithms and Computation : 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007. Proceedings, 681-691
Proceedings Article2007
1
Hide details for Arora, SanjeevArora, Sanjeev
1
Hide details for ACMACM
Albers, Susanne
Arora, Sanjeev
Khanna, Sanjeev
Page replacement for general caching problems
In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-99), 31-40
Proceedings Article1999
1
Hide details for Arumugam, S.Arumugam, S.
1
Hide details for SpringerSpringer
Arumugam, S.
Chandrasekar, K. Raja
Misra, Neeldhara
Philip, Geevarghese
Saurabh, Saket
Attachment IconAlgorithmic Aspects of Dominator Colorings in Graphs
In: Combinatorial Algorithms - 22nd International Workshop, IWOCA 2011, Victoria, BC, Canada, July 20-22, 2011, Revised Selected Papers, 19-30
Proceedings Article2011
12
Hide details for Arya, SunilArya, Sunil
3
Hide details for ACMACM
Arya, Sunil
Malamatos, Theocharis
Mount, David M.
A simple entropy-based algorithm for planar point location
In: ACM Transactions on Algorithms [3], 17
Journal Article2007
Arya, Sunil
Malamatos, Theocharis
Mount, David M.
On the Importance of Idempotence
In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, STOC'06, 564-573
Proceedings Article2006
Arya, Sunil
Malamatos, Theocharis
Mount, David M.
The Effect of Corners on the Complexity of Approximate Range Searching
In: Proceedings of the 22nd Annual Symposium on Computational Geometry, SCG'06, 11-20
Proceedings Article2006
3
Hide details for acm-Pressacm-Press
Arya, Sunil
Das, Gautam
Mount, David M.
Salowe, Jeffrey S.
Smid, Michiel
Euclidean spanners: short, thin, and lanky
In: 27th Annual ACM Symposium on Theory of Computing (STOC95), 489-498
Proceedings Article1995
Arya, Sunil
Mount, David M.
Approximate range searching
In: 11th Annual ACM Symposium on Computational Geometry (SCG95), 172-181
Proceedings Article1995
Arya, Sunil
Mount, David M.
Narayan, Oruttom
Accounting for boundary effects in nearest neighbor searching
In: 11th Annual ACM Symposium on Computational Geometry (SCG95), 336-344
Proceedings Article1995
1
Hide details for ElsevierElsevier
Arya, Sunil
Mount, David M.
Approximate range searching
In: Computational Geometry [17], 135-152
Journal Article2000
2
Hide details for SIAMSIAM
Arya, Sunil
Malamatos, Theocharis
Mount, David M.
Space-Time Tradeoffs for Approximate Spherical Range Counting
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 535-544
Proceedings Article2005
Arya, Sunil
Malamatos, Theocharis
Mount, David M.
Wong, Ka Chun
Optimal expected-case planar point location
In: SIAM Journal on Computing [37], 584-610
Journal Article2007
3
Hide details for SpringerSpringer
Arya, Sunil
Mount, David M.
Narayan, Oruttom
Accounting for boundary effects in nearest neighbor searching
In: Discrete & Computational Geometry [16], 155-176
Journal Article1996
Arya, Sunil
Smid, Michiel
Efficient construction of a bounded degree spanner with low weight
In: Algorithmica [17], 33-54
Journal Article1997
Kumar, V. S. Anil
Arya, Sunil
Ramesh, Hariharan
Hardness of Set Cover with Intersection 1
In: Automata, Languages and Programming, Proceedings of the 27th International Colloquium (ICALP-00), 624-635
Proceedings Article2000
3
Hide details for Asano, TetsuoAsano, Tetsuo
1
Hide details for Oxford University PressOxford University Press
Teramoto, Sachio
Asano, Tetsuo
Katoh, Naoki
Doerr, Benjamin
Inserting Points Uniformly at Every Instance
In: IEICE - Transactions on Information and Systems [E89-D], 2348-2356
Journal Article2006
2
Hide details for SpringerSpringer
Aranov, Boris
Asano, Tetsuo
Katoh, Naoki
Mehlhorn, Kurt
Tokuyama, Takeshi
Attachment IconPolyline Fitting of Planar Points Under Min-sum Criteria
In: Algorithms and Computation: 15th International Symposium, ISAAC 2004, 77-88
Proceedings Article2004
Aronov, Boris
Asano, Tetsuo
Funke, Stefan
Optimal Triangulation with Steiner Points
In: Algorithms and Computation : 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007. Proceedings, 681-691
Proceedings Article2007
1
Hide details for Auger, Anne (ed.)Auger, Anne (ed.)
1
Hide details for World Scientific PublishingWorld Scientific Publishing
Auger, Doerr (ed.)Theory of Randomized Search HeuristicsBook2011
1
Hide details for Auletta, VincenzoAuletta, Vincenzo
1
Hide details for Academic PressAcademic Press
Auletta, Vincenzo
Dinitz, Yefim
Nutov, Zeev
Parente, Domenico
A 2-approximation algorithm for finding an optimum 3-vertex-connected spanning subgraph
In: Journal of Algorithms [32], 21-30
Journal Article1999
2
Hide details for Avigdor-Elgrabli, NoaAvigdor-Elgrabli, Noa
1
Hide details for SIAMSIAM
Ailon, Nir
Avigdor-Elgrabli, Noa
Liberty, Edo
van Zuylen, Anke
Improved Approximation Algorithms for Bipartite Correlation Clustering
In: SIAM Journal on Computing [41], 1110-1121
Journal Article2012
1
Hide details for SpringerSpringer
Ailon, Nir
Avigdor-Elgrabli, Noa
Liberty, Noa
van Zuylen, Anke
Improved Approximation Algorithms for Bipartite Correlation Clustering
In: Algorithms - ESA 2011 : 19th Annual European Symposium, 25-36
Proceedings Article2011
1
Hide details for Awerbuch, BaruchAwerbuch, Baruch
1
Hide details for IEEEIEEE
Awerbuch, Baruch
Azar, Yossi
Grove, Edward
Kao, Ming-Yang
Krishnan, P.
Vitter, Jeffrey Scott
Load Balancing in the Euclidean Norm
In: 36th Annual Symposium on Foundations of Computer Science, 383-391
Proceedings Article1995
1
Hide details for Azar, YossiAzar, Yossi
1
Hide details for IEEEIEEE
Awerbuch, Baruch
Azar, Yossi
Grove, Edward
Kao, Ming-Yang
Krishnan, P.
Vitter, Jeffrey Scott
Load Balancing in the Euclidean Norm
In: 36th Annual Symposium on Foundations of Computer Science, 383-391
Proceedings Article1995
1
Hide details for Babenko, Maxim A.Babenko, Maxim A.
1
Hide details for SpringerSpringer
Babenko, Maxim A.
Gawrychowski, Pawel
Kociumaka, Tomasz
Starikovskaya, Tatiana A.
Computing Minimal and Maximal Suffixes of a Substring Revisited
In: Combinatorial Pattern Matching - 25th Annual Symposium, CPM 2014, Moscow, Russia, June 16-18, 2014. Proceedings, 30-39
Proceedings Article2014
1
Hide details for Bacardit, Jaume (ed.)Bacardit, Jaume (ed.)
1
Hide details for ACMACM
Raidl, Alba, Bacardit, Beyer, Birattari, Blum, Bosman, Congdon, Corne, Cotta, Di Penta, Doerr, Drechsle, Ebner, Grahl, Jansen, Knowles, Lenaerts, Middendorf, Miller, O'Neill, Poli, Squillero, Stanley, Stützle, van Hemert (ed.)GECCO 2009: Proceedings of the 11th Annual conference on Genetic and evolutionary computation.Proceedings2009
1
Hide details for Bachrach, RanBachrach, Ran
1
Hide details for SpringerSpringer
Bachrach, Ran
El-Yaniv, Ran
Reinstädtler, Martin
On the competitive theory and practice of online list accessing algorithms
In: Algorithmica [32], 201-246
Journal Article2002
1
Hide details for Bacik, RomanBacik, Roman
1
Hide details for SpringerSpringer
Bacik, Roman
Mahajan, Sanjeev
Semidefinite programming and its applications to NP problems
In: Computing and Combinatorics: 1st Annual International Conference (COCOON95), 566-575
Proceedings Article1995
1
Hide details for Bader, DavidBader, David
1
Hide details for SpringerSpringer
Bader, David
Moret, Bernard
Sanders, Peter
Algorithm Engineering for Parallel Computation
In: Experimental Algorithmics, 1-23
Part of a Book2002
1
Hide details for Balasundaram, RadheshyamBalasundaram, Radheshyam
1
Hide details for SpringerSpringer
Ambalath, Abhimanyu M.
Balasundaram, Radheshyam
H., Chintan Rao
Koppula, Venkata
Misra, Neeldhara
Philip, Geevarghese
Ramanujan, M. S.
Attachment IconOn the Kernelization Complexity of Colorful Motifs
In: Parameterized and Exact Computation - 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings, 14-25
Proceedings Article2010
1
Hide details for Baltz, AndreasBaltz, Andreas
1
Hide details for SpringerSpringer
Ahuja, Nitin
Baltz, Andreas
Doerr, Benjamin
Privetivy, Ales
Srivastav, Anand
Attachment IconOn the Minimum Load Coloring Problem
In: Third Workshop on Approximation and Online Algorithms (WAOA 2005), 15-26
Proceedings Article2005
8
Hide details for Banderier, CyrilBanderier, Cyril
2
Hide details for ElsevierElsevier
Banderier, Cyril
Bousquet-Mélou, Mireille
Denise, Alain
Flajolet, Philippe
Gardy, Danièle
Gouyou-Beauchamps, Dominique
Generating Functions for Generating Trees
In: Discrete Mathematics [246], 29-55
Journal Article2002
Banderier, Cyril
Flajolet, Philippe
Basic analytic combinatorics of directed lattice paths
In: Theoretical Computer Science [281], 37-80
Journal Article2002
1
Hide details for Lecture Notes ProceedingsLecture Notes Proceedings
Banderier, CyrilAn Introduction to Analytic Number TheoryMiscellaneous1999
3
Hide details for SpringerSpringer
Banderier, CyrilA Generalized Cover Time for Random Walks on Graphs
In: Proceedings of FPSAC'00, 113-124
Proceedings Article2000
Banderier, CyrilPlanar Maps and Airy Phenomena,
In: Proceedings of ICALP'00, 388-402
Proceedings Article2000
Banderier, Cyril
Beier, Rene
Mehlhorn, Kurt
Attachment IconSmoothed Analysis of Three Combinatorial Problems
In: Mathematical foundations of computer science 2003 : 28th International Symposium, MFCS 2003, 198-207
Proceedings Article2003
1
Hide details for Universitat Politècnica de CatalunyaUniversitat Politècnica de Catalunya
Banderier, CyrilOn Generating Functions of Generating Trees
In: Proceedings of FPSAC'99, 40-52
Proceedings Article1999
1
Hide details for WileyWiley
Banderier, CyrilRandom Maps, Coalescing Saddles, Singularity Analysis, and Airy Phenomena
In: Random Structures & Algorithms [19], 194-246
Journal Article2001
1
Hide details for Bannai, HideoBannai, Hideo
1
Hide details for SpringerSpringer
Bannai, Hideo
Gawrychowski, Pawel
Inenaga, Shunsuke
Takeda, Masayuki
Converting SLP to LZ78 in almost Linear Time
In: Combinatorial Pattern Matching, 24th Annual Symposium (CPM 2013), 38-49
Proceedings Article2013
4
Hide details for Bansal, NikhilBansal, Nikhil
2
Hide details for ACMACM
Bansal, Nikhil
Chan, Ho-Leung
Weighted flow time does not admit O(1)-competitive algorithms
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 1238-1244
Proceedings Article2009
Bansal, Nikhil
Chan, Ho-Leung
Pruhs, Kirk
Speed Scaling with an Arbitrary Power Function
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 693-701
Proceedings Article2009
2
Hide details for SpringerSpringer
Bansal, Nikhil
Chan, Ho-Leung
Pruhs, KIrk
Competitive Algorithms for Due Date Schedulin
In: Algorithmica [59], 569-582
Journal Article2011
Bansal, Nikhil
Gupta, Anupam
Li, Jian
Mestre, Julián
Nagarajan, Viswanath
Rudra, Atri
When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings (Extended Abstract)
In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. II, 218-229
Proceedings Article2010
3
Hide details for Bar-Yehuda, ReuvenBar-Yehuda, Reuven
1
Hide details for ElsevierElsevier
Bar-Yehuda, Reuven
Hermelin, Danny
Rawitz, Dror
Minimum vertex cover in rectangle graphs
In: Computational Geometry [44], 356-364
Journal Article2011
2
Hide details for SpringerSpringer
Bar-Yehuda, Reuven
Flysher, Guy
Mestre, Julián
Rawitz, Dror
Approximation of Partial Capacitated Vertex Cover
In: 15th Annual European Symposium on Algorithms, 335-346
Proceedings Article2007
Bar-Yehuda, Reuven
Hermelin, Danny
Rawitz, Dror
Minimum Vertex Cover in Rectangle Graphs
In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. I, 255-266
Proceedings Article2010
1
Hide details for Bárány, ImreBárány, Imre
1
Hide details for ElsevierElsevier
Bárány, Imre
Doerr, Benjamin
Attachment IconBalanced partitions of vector sequences
In: Linear Algebra and Its Applications [414], 464-469
Journal Article2006
1
Hide details for Barnes, GregBarnes, Greg
1
Hide details for SIAMSIAM
Barnes, Greg
Edmonds, Jeff A.
Time-Space Lower Bounds for Directed st-Connectivity on Graph Automata Models
In: SIAM Journal on Computing [27], 1190-1202
Journal Article1998
1
Hide details for Bartal, YairBartal, Yair
1
Hide details for SpringerSpringer
Bartal, Yair
Leonardi, Stefano
Shallom, Gill
Sitters, Rene
On the value of preemption in scheduling
In: 9th Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX, 39-48
Proceedings Article2006
4
Hide details for Baruah, SanjoyBaruah, Sanjoy
1
Hide details for IEEEIEEE
Baruah, Sanjoy
Bonifaci, Vincenzo
D'Angelo, Gianlorenzo
Li, Haohan
Marchetti-Spaccamela, Alberto
Megow, Nicole
Stougie, Leen
Scheduling Real-Time Mixed-Criticality Jobs
In: IEEE Transactions on Computers [61], 1140-1152
Journal Article2012
3
Hide details for SpringerSpringer
Baruah, Sanjoy
Bonifaci, Vincenzo
D'Angelo, Gianlorenzo
Li, Haohan
Marchetti-Spaccamela, Alberto
Megow, Nicole
Stougie, Leen
Attachment IconScheduling Real-Time Mixed-Criticality Jobs
In: Mathematical Foundations of Computer Science 2010 : 35th International Symposium, MFCS 2010, 90-101
Proceedings Article2010
Baruah, Sanjoy
Bonifaci, Vincenzo
D'Angelo, Gianlorenzo
Marchetti-Spaccamela, Alberto
van der Ster, Suzanne
Stougie, Leen
Attachment IconMixed-criticality scheduling of sporadic task systems
In: Algorithms - ESA 2011 : 19th Annual European Symposium, 555-566
Proceedings Article2011
Baruah, Sanjoy
Bonifaci, Vincenzo
Marchetti-Spaccamela, Alberto
Stiller, Sebastian
Attachment IconImproved Multiprocessor Global Schedulability Analysis
In: Real-Time Systems [46], 3-24
Journal Article2010
1
Hide details for Barve, Rakesh D.Barve, Rakesh D.
1
Hide details for IEEEIEEE
Barve, Rakesh D.
Grove, Edward
Vitter, Jeffrey Scott
An Application-Controlled Paging Algorithm for a Shared Cache
In: 36th Annual Symposium on Foundations of Computer Science, 204-213
Proceedings Article1995
1
Hide details for Basit, AbdulBasit, Abdul
1
Hide details for ElsevierElsevier
Basit, Abdul
Mustafa, Nabil H.
Ray, Saurabh
Raza, Sarfraz
Centerpoints and Tverberg's technique
In: Computational Geometry [43], 593-600
Journal Article2010
1
Hide details for Bäsken, MatthiasBäsken, Matthias
1
Hide details for CGAL ConsortiumCGAL Consortium
Bäsken, Matthias
Brönnimann, Hervé
Frank, Da
Devillers, Olivier
Ester, Ezra
Fabri, Andreas
Flato, Eyal
Gärtner, Bernd
Giezeman, Geert-Jan
Halperin, Dan
Hanniel, Iddo
Har-Peled, Sariel
Herrmann, Thomas
Hert, Susan
Hirsch, Shai
Hoffmann, Michael
Kettner, Lutz
Nechushtan, Oren
Neyer, Gabriele
Pasechnik, Dmitrii
Pion, Sylvain
Schirra, Stefan
Schönherr, Sven
Seel, Michael
Teillaud, Monique
Veltkamp, Remco
Wein, Ron
Wesselink, Wieger
Yvinec, Mariette
CGAL Reference and User ManualsUnknown Form: eBookForm2001
7
Hide details for Bast, HannahBast, Hannah
1
Hide details for Academic PressAcademic Press
Bast, Hannah
Hagerup, Torben
Fast Parallel Space Allocation, Estimation, and Integer Sorting
In: Information and Computation [123], 72-110
Journal Article1995
1
Hide details for ACM PressACM Press
Bast, HannahDynamic Scheduling with Incomplete Information
In: Proceedings of the 10th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-98), 182-191
Proceedings Article1998
4
Hide details for SpringerSpringer
Bast, HannahCar or Public Transport -- Two Worlds
In: Efficient Algorithms : Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday, 355-367
Part of a Book2009
Bast, HannahOn Scheduling Parallel Tasks at Twilight
In: Theory of Computing Systems [33], 489-563
Journal Article2000
Bast, HannahScheduling at Twilight the Easy Way
In: STACS 2002 : 19th Annual Symposium on Theoretical Aspects of Computer Science, 166-178
Proceedings Article2002
Celikik, Marjan
Bast, Hannah
Fast Single-Pass Construction of a Half-Inverted Index
In: String processing and information retrieval : 16th International Symposium, SPIRE 2009, 194-205
Proceedings Article2009
1
Hide details for University of New BrunswickUniversity of New Brunswick
Bast, Hannah
Hert, Susan
The Area Partitioning Problem
In: Proceedings of the 12th Annual Canadian Conference on Computational Geometry (CCCG-00), 163-171
Proceedings Article2000
27
Hide details for Bast, HolgerBast, Holger
8
Hide details for ACMACM
Bast, Holger
Chitea, Alexandru
Suchanek, Fabian
Weber, Ingmar
ESTER: Efficient Search in Text, Entities, and Relations
In: 30th International Conference on Research and Development in Information Retrieval (SIGIR'07), 671-678
Proceedings Article2007
Bast, Holger
Hagerup, Torben
Fast and Reliable Parallel Hashing
In: 3rd Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA'91), 50-61
Proceedings Article1991
Bast, Holger
Majumdar, Debapriyo
Attachment IconWhy Spectral Retrieval Works
In: 28th Annual International Conference on Research and Development in Information Retrieval (SIGIR'05), 11-18
Proceedings Article2005
Bast, Holger
Majumdar, Debapriyo
Schenkel, Ralf
Theobald, Martin
Weikum, Gerhard
Attachment IconIO-Top-k: Index-Access Optimized Top-k Query Processing
In: Proceedings of the 32nd International Conference on Very Large Data Bases, VLDB 2006, 475-486
Proceedings Article2006
Bast, Holger
Majumdar, Debapriyo
Weber, Ingmar
Efficient interactive query expansion with CompleteSearch
In: 16th Conference on Information and Knowledge Management (CIKM'07), 857-860
Proceedings Article2007
Bast, Holger
Weber, Ingmar
Attachment IconType Less, Find More: Fast Autocompletion Search with a Succinct Index
In: SIGIR 2006: Proceedings of the 29th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 364-371
Proceedings Article2006
Bast, Holger
Weber, Ingmar
When You're Lost For Words: Faceted Search With Autocompletion
In: SIGIR'06 Workshop on Faceted Search, 31-35
Proceedings Article2006
Celikik, Marjan
Bast, Holger
Attachment IconFast Error-Tolerant Search on Very Large Texts
In: The 24th Annual ACM Symposium on Applied Computing, 1724-1731
Proceedings Article2009
1
Hide details for AMSAMS
Bast, Holger
Funke, Stefan
Matijevic, Domagoj
Ultrafast shortest-path queries via transit nodes
In: The shortest path problem : ninth DIMACS implemenation challenge, 175-192
Part of a Book2009
1
Hide details for DIMACSDIMACS
Bast, Holger
Funke, Stefan
Matijevic, Domagoj
TRANSIT: Ultrafast Shortest-Path Queries with Linear-Time Preprocessing
In: 9th DIMACS Implementation Challenge --- Shortest Path,
Electronic Proceedings Article2006
1
Hide details for GITOGITO
Bast, Holger
Weber, Ingmar
Managing Helpdesk Tasks with CompleteSearch: A Case Study
In: 4th Conference on Professional Knowledge Management (WM'07), 101-108
Proceedings Article2007
1
Hide details for Homöopathie-Forum e.V.Homöopathie-Forum e.V.
Bast, HolgerAttachment IconPräzisionssuche im homöopathischen Netz
In: Homöopathie-Zeitschrift [I/05], 119-122
Journal Article2005
1
Hide details for IEEEIEEE
Bast, Holger
Weber, Ingmar
Insights from Viewing Ranked Retrieval as Rank Aggregation
In: Workshop on Challenges in Web Information Retrieval and Integration (WIRI'05), 243-248
Proceedings Article2005
1
Hide details for National Institute of Standards and Technology (NIST)National Institute of Standards and Technology (NIST)
Bast, Holger
Majumdar, Debapriyo
Schenkel, Ralf
Theobald, Martin
Weikum, Gerhard
IO-Top-k at TREC 2006: Terabyte Track
In: The Fifteenth Text Retrieval Conference Proceedings, TREC 2006, 1-5
Electronic Proceedings Article2006
1
Hide details for Science/AAASScience/AAAS
Bast, Holger
Funke, Stefan
Sanders, Peter
Schultes, Dominik
Fast Routing in Road Networks using Transit Nodes
In: Science [316], 566
Journal Article2007
1
Hide details for SIAMSIAM
Bast, Holger
Funke, Stefan
Matijevic, Domagoj
Sanders, Peter
Schultes, Dominik
In Transit to Constant Time Shortest-Path Queries in Road Networks
In: 9th Workshop on Algorithm Enginneering and Experiments (ALENEX'07), 46-59
Proceedings Article2007
7
Hide details for SpringerSpringer
Bast, Holger
Dietzfelbinger, Martin
Hagerup, Torben
A Perfect Parallel Dictionary
In: 17th International Symposium on Mathematical Foundations of Computer Science (MFCS'92), 133-141
Proceedings Article1992
Bast, Holger
Dupret, Georges
Majumdar, Debapriyo
Piwowarski, Benjamin
Discovering a Term Taxonomy from Term Similarities Using Principal Component Analysis
In: Semantics, web and mining : Joint International Workshops, EWMF 2005 and KDO 2005, 103-120
Proceedings Article2006
Bast, Holger
Mehlhorn, Kurt
Schäfer, Guido
Tamaki, Hisao
Attachment IconA Heuristic for Dijkstra's Algorithm With Many Targets and its Use in Weighted Matching Algorithms
In: Algorithmica [36], 75-88
Journal Article2003
Bast, Holger
Mehlhorn, Kurt
Schäfer, Guido
Tamaki, Hisao
Attachment IconMatching Algorithms Are Fast in Sparse Random Graphs
In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), 81-92
Proceedings Article2004
Bast, Holger
Mehlhorn, Kurt
Schäfer, Guido
Tamaki, Hisao
Attachment IconMatching Algorithms are Fast in Sparse Random Graphs
In: Theory of Computing Systems [39], 3-14
Journal Article2006
Bast, Holger
Mortensen, Christian Worm
Weber, Ingmar
Attachment IconOutput-Sensitive Autocompletion Search
In: String Processing and Information Retrieval : 13th International Conference, SPIRE 2006, 150-162
Proceedings Article2006
Bast, Holger
Weber, Ingmar
Don't Compare Averages
In: 4th International Workshop on Efficient and Experimental Algorithms (WEA'05), 67-76
Proceedings Article2005
1
Hide details for tbatba
Weikum, Gerhard
Bast, Holger
Canright, Geoffrey
Hales, David
Schindelhauer, Christian
Triantafillou, Peter
Towards Peer-to-Peer Web Search
In: 1st European Conference on Complex Systems, ECCS'05, ?
Proceedings Article2007
1
Hide details for University of BolognaUniversity of Bologna
Bast, HolgerDimension Reduction: A Powerful Principle for Automatically Finding Concepts in Unstructured Data
In: International Workshop on Self-* Properties in Complex Information Systems (SELF-STAR 2004), 113-116
Proceedings Article2004
1
Hide details for University of Paderborn, Heinz Nixdorf InstituteUniversity of Paderborn, Heinz Nixdorf Institute
Weikum, Gerhard
Bast, Holger
Canright, Geoffrey
Hales, David
Schindelhauer, Christian
Triantafillou, Peter
Towards Self-Organizing Query Routing and Processing for Peer-to-Peer Web Search
In: Workshop on Peer-to-peer Data Management in the Complex Systems Perspective, 7-24
Proceedings Article2005
1
Hide details for VLDB EndowmentVLDB Endowment
Bast, Holger
Weber, Ingmar
Attachment IconThe CompleteSearch Engine: Interactive, Efficient, and Towards IR & DB integration
In: CIDR 2007 : 3rd Biennial Conference on Innovative Data Systems Research, 88-95
Electronic Proceedings Article2007
7
Hide details for Baswana, SurenderBaswana, Surender
3
Hide details for ACMACM
Baswana, Surender
Biswas, Somenath
Doerr, Benjamin
Friedrich, Tobias
Kurur, Piyush P.
Neumann, Frank
Computing Single Source Shortest Paths using Single-Objective Fitness Functions
In: FOGA'09 : revised selected papers from ACM SIGEVO
Foundations of Genetic Algorithms X, 59-66
Proceedings Article2009
Baswana, Surender
Kavitha, Telikepalli
Mehlhorn, Kurt
Pettie, Seth
Additive Spanners and (α, β)-Spanners
In: ACM Transactions on Algorithms [7], 5:1-5:26
Journal Article2011
Baswana, Surender
Sen, Sandeep
Attachment IconApproximate distance oracle for unweighted graphs in Expected O(n²) time
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 271-280
Proceedings Article2004
1
Hide details for Chapman & Hall/CRCChapman & Hall/CRC
Baswana, Surender
Sen, Sandeep
Randomized graph data-structures for approximate shortest path problem
In: Handbook of Data Structures and Applications, 38.1-38.19
Part of a Book2004
1
Hide details for SIAMSIAM
Baswana, Surender
Telikepalli, Kavitha
Mehlhorn, Kurt
Pettie, Seth
Attachment IconNew Constructions of (alpha, beta)-Spanners and Purely Additive Spanners
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 672-681
Proceedings Article2005
1
Hide details for SpringerSpringer
Baswana, Surender
Goyal, Vishrut
Sen, Sandeep
Attachment IconAll-pairs nearly 2-approximate shortest paths in $O(n^2 \mathrm polylog n)$ time
In: STACS 2005 : 22nd Annual Symposium on Theoretical Aspects of Computer Science, 666-679
Proceedings Article2005
1
Hide details for WileyWiley
Baswana, Surender
Sen, Sandeep
A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs
In: Random Structures & Algorithms [30], 532-563
Journal Article2007
1
Hide details for Batra, PrashantBatra, Prashant
1
Hide details for ElsevierElsevier
Batra, Prashant
Sharma, Vikram
Bounds on absolute positiveness of multivariate polynomials
In: Journal of Symbolic Computation [45], 617-628
Journal Article2010
1
Hide details for Baumann, NadineBaumann, Nadine
1
Hide details for SpringerSpringer
Baumann, Nadine
Köhler, Ekkehard
Approximating Earliest Arrival Flows with Flow-Dependent Transit Times
In: Mathematical foundations of computer science 2004 : 29th International Symposium, MFCS 2004, 599-610
Proceedings Article2004
1
Hide details for Baumann, TobiasBaumann, Tobias
1
Hide details for SpringerSpringer
Althaus, Ernst
Baumann, Tobias
Schömer, Elmar
Werth, Kai
Trunk Packing Revisited
In: Experimental Algorithms, 6th International Workshop, 420-432
Proceedings Article2007
2
Hide details for Baumbach, JanBaumbach, Jan
1
Hide details for ACMACM
Baumbach, Jan
Friedrich, Tobias
Kötzing, Timo
Krohmer, Anton
Müller, Joachim
Pauling, Josch
Efficient algorithms for extracting biological key pathways with global constraints
In: GECCO'12 : Proceedings of the Fourteenth International Conference on
Genetic and Evolutionary Computation, 169-176
Proceedings Article2012
1
Hide details for The Royal Society of ChemistryThe Royal Society of Chemistry
Alcaraz, Nicolas
Friedrich, Tobias
Kötzing, Timo
Krohmer, Anton
Müller, Joachim
Pauling, Josch
Baumbach, Jan
Efficient key pathway mining: combining networks and OMICS data
In: Integrative Biology [4], 756-764
Journal Article2012
2
Hide details for Baumgarten, HannaBaumgarten, Hanna
1
Hide details for Academic PressAcademic Press
Baumgarten, Hanna
Jung, Hermann
Mehlhorn, Kurt
Attachment IconDynamic point location in general subdivisions
In: Journal of Algorithms [3], 342-380
Journal Article1994
1
Hide details for SIAMSIAM
Baumgarten, Hanna
Jung, Hermann
Mehlhorn, Kurt
Dynamic Point Location in General Subdivisions
In: Discrete algorithms (SODA-92) : 3rd annual ACM-SIAM symposium, 250-258
Proceedings Article1992
2
Hide details for Becchetti, LucaBecchetti, Luca
2
Hide details for IEEEIEEE
Becchetti, Luca
Leonardi, Stefano
Marchetti-Spaccamela, Alberto
Schäfer, Guido
Scheduling to minimize flow time metrics
In: International Parallel and Distributed Processing Symposium (IPDPS-03), 223b-CDROM
Proceedings Article2003
Becchetti, Luca
Leonardi, Stefano
Marchetti-Spaccamela, Alberto
Schäfer, Guido
Vredeveld, Tjark
Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm
In: 44th Annual Symposium on Foundations of Computer Science (FOCS-03), 462-471
Proceedings Article2003
2
Hide details for Becker, MichaelBecker, Michael
1
Hide details for ElsevierElsevier
Becker, Michael
Degenhardt, W.
Doenhardt, J.
Hertel, S.
Kaninke, G.
Kerber, W.
Mehlhorn, Kurt
Näher, Stefan
Rohnert, H.
Winter, T.
Attachment IconA Probabilistic Algorithm for Vertex Connectivity of Graphs
In: Information Processing Letters [15], 135-136
Journal Article1982
1
Hide details for SpringerSpringer
Becker, Michael
Mehlhorn, Kurt
Attachment IconAlgorithms for Routing in Planar Graphs
In: Acta Informatica [23], 163-176
Journal Article1986
2
Hide details for Behle, MarkusBehle, Markus
2
Hide details for SpringerSpringer
Behle, MarkusAttachment IconOn threshold BDDs and the optimal variable ordering problem
In: Combinatorial Optimization and Applications : First International Conference, COCOA 2007, 124-135
Proceedings Article2007
Behle, Markus
Jünger, Michael
Liers, Frauke
Attachment IconA Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem
In: Experimental Algorithms : 6th International Workshop, WEA 2007, 379-392
Proceedings Article2007
13
Hide details for Beier, RenéBeier, René
5
Hide details for ACMACM
Beier, René
Czumaj, Artur
Krysta, Piotr
Vöcking, Berthold
Attachment IconComputing Equilibria for a Service Provider Game with (Im)perfect Information
In: ACM Transactions on Algorithms [2], 679-706
Journal Article2006
Beier, Rene
Krysta, Piotr
Czumaj, Artur
Vöcking, Berthold
Computing Equilibria for Congestion Games with (Im)perfect Information
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 739-748
Proceedings Article2004
Beier, Rene
Vöcking, Berthold
Probabilistic Analysis of Knapsack Core Algorithms
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 461-470
Proceedings Article2004
Beier, Rene
Vöcking, Berthold
Random Knapsack in Expected Polynomial Time
In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC-03), 232-241
Proceedings Article2003
Beier, Rene
Vöcking, Berthold
Typical Properties of Winners and Losers in Discrete Optimization
In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC-04), 343-352
Proceedings Article2004
1
Hide details for Carleton ScientificCarleton Scientific
Beier, Rene
Sibeyn, Jop F.
A powerful heuristic for telephone gossiping
In: Proceedings of the 7th International Colloquium on Structural Information and Communication Complexity (SIROCCO-00), 17-36
Proceedings Article2000
1
Hide details for ElsevierElsevier
Beier, René
Vöcking, Berthold
Random knapsack in expected polynomial time
In: Journal of Computer and System Sciences [69], 306-329
Journal Article2004
1
Hide details for SIAMSIAM
Beier, René
Vöcking, Berthold
Attachment IconTypical Properties of Winners and Losers in Discrete Optimization
In: SIAM Journal on Computing [35], 855-881
Journal Article2006
5
Hide details for SpringerSpringer
Banderier, Cyril
Beier, Rene
Mehlhorn, Kurt
Attachment IconSmoothed Analysis of Three Combinatorial Problems
In: Mathematical foundations of computer science 2003 : 28th International Symposium, MFCS 2003, 198-207
Proceedings Article2003
Beier, Rene
Funke, Stefan
Matijevic, Domagoj
Sanders, Peter
Energy-Efficient Paths in Radio Networks
In: Algorithmica [61], 298-319
Journal Article2011
Beier, René
Röglin, Heiko
Vöcking, Berthold
Attachment IconThe Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization
In: Integer Programming and Combinatorial Optimization : 12th International IPCO Conference, 53-67
Proceedings Article2007
Beier, Rene
Sanders, Peter
Sivadasan, Naveen
Energy Optimal Routing in Radio Networks Using Geometric Data Structures
In: Automata, Languages and Programming : 29th International Colloquium, ICALP 2002, 366-376
Proceedings Article2002
Beier, René
Vöcking, Berthold
Attachment IconAn Experimental Study of Random Knapsack Problems
In: Algorithmica [45], 121-136
Journal Article2006
1
Hide details for Bein, Wolfgang W.Bein, Wolfgang W.
1
Hide details for ElsevierElsevier
Bein, Wolfgang W.
Fleischer, Rudolf
Larmore, Lawrence L.
Limited bookmark randomized online algorithms for the paging problem
In: Information Processing Letters [76], 155-162
Journal Article2000
1
Hide details for Bei, XiaohuiBei, Xiaohui
1
Hide details for SpringerSpringer
Bei, XiaohuiSolving Linear Programming with Constraints Unknown
In: Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I., 129-142
Proceedings Article2015
5
Hide details for Beldiceanu, NicolasBeldiceanu, Nicolas
1
Hide details for AG 1 - MehlhornAG 1 - Mehlhorn
Beldiceanu, Nicolas
Katriel, Irit
Thiel, Sven
Attachment IconFiltering algorithms for the Same and UsedBy constraintsReport2004
1
Hide details for Centre for Research on TransportationCentre for Research on Transportation
Beldiceanu, Nicolas
Carlsson, Mats
Thiel, Sven
Sweep Synchronization as a Global Propagation Mechanism
In: Fifth International Workshop on Integration of AI and OR Techniques
in Constraint Programming for Combinatorial Optimization Problems, 139-152
Electronic Proceedings Article2003
3
Hide details for SpringerSpringer
Beldiceanu, Nicolas
Guo, Qi
Thiel, Sven
Non-overlapping Constraints between Convex Polytopes
In: Proceedings of the 7th International Symposium on Principles and Practice of Constraint Programming (CP-01), 392-407
Proceedings Article2001
Beldiceanu, Nicolas
Katriel, Irit
Thiel, Sven
Filtering algorithms for the Same constraint
In: Integration of AI and OR techniques in constraint programming for combinatorial optimization problems : First International Conference, CPAIOR 2004, 65-79
Proceedings Article2004
Beldiceanu, Nicolas
Katriel, Irit
Thiel, Sven
GCC-like Restrictions on the Same constraint
In: Constraint Satisfaction and Constraint Logic Programming : ERCIM/CoLogNet International Workshop, CSCLP 2004, 1-11
In: Recent Advances in Constraints [3419], 1-11
Proceedings Article2005
1
Hide details for Belfrage, MichaelBelfrage, Michael
1
Hide details for SIAMSIAM
Belfrage, Michael
Mütze, Torsten
Spöhel, Reto
Probabilistic one-player Ramsey games via deterministic two-player games
In: SIAM Journal on Discrete Mathematics [26], 1031-1049
Journal Article2012
1
Hide details for Ben-Zwi, OrenBen-Zwi, Oren
1
Hide details for ElsevierElsevier
Ben-Zwi, Oren
Hermelin, Danny
Lokshtanov, Daniel
Newman, Ilan
Treewidth governs the complexity of target set selection
In: Discrete Optimization [8], 87-96
Journal Article2011
28
Hide details for Berberich, EricBerberich, Eric
7
Hide details for ACMACM
Berberich, Eric
Emeliyanenko, Pavel
Kobel, Alexander
Sagraloff, Michael
Arrangement Computation for Planar Algebraic Curves
In: Proceedings of the 4th Internal Workshop on Symbolic-Numeric Computation, 88-98
Proceedings Article2011
Berberich, Eric
Halperin, Dan
Kerber, Michael
Pogalnikova, Roza
Deconstructing Approximate Offsets
In: Proceedings of the 27th Annual Symposium on Computational Geometry (SCG'11), 187-196
Proceedings Article2011
Berberich, Eric
Hemmer, Michael
Kerber, Michael
A Generic Algebraic Kernel for Non-linear Geometric Applications
In: Proceedings of the 27th Annual Symposium on Computational Geometry (SCG'11), 179-186
Proceedings Article2011
Berberich, Eric
Hemmer, Michael
Kettner, Lutz
Schömer, Elmar
Wolpert, Nicola
An Exact, Complete and Efficient Implementation for Computing Planar Maps of Quadric Intersection Curves
In: 21st Annual Symposium on Computational Geometry (SCG'05), 99-106
Proceedings Article2005
Berberich, Eric
Kerber, Michael
Attachment IconExact Arrangements on Tori and Dupin Cyclides
In: Proceedings of the 2008 ACM Symposium on Solid and Physical Modeling, 59-66
Proceedings Article2008
Berberich, Eric
Kerber, Michael
Sagraloff, Michael
Attachment IconExact Geometric-Topological Analysis of Algebraic Surfaces
In: Proceedings of the 24th ACM Symposium on Computational Geometry, 164-173
Proceedings Article2008
Berberich, Eric
Sagraloff, Michael
Attachment IconA Generic and Flexible Framework for the Geometrical and Topological Analysis of (Algebraic) Surfaces
In: Proceedings of the 2008 ACM Symposium on Solid and Physical Modeling, 171-182
Proceedings Article2008
4
Hide details for Cornell University LibraryCornell University Library
Berberich, Eric
Emeliyanenko, Pavel
Kobel, Alexander
Sagraloff, Michael
Arrangement Computation for Planar Algebraic Curves
In: arXiv [abs/1103.4697],
Electronic Journal Article2011
Berberich, Eric
Emeliyanenko, Pavel
Kobel, Alexander
Sagraloff, Michael
Exact Symbolic-Numeric Computation of Planar Algebraic Curves
In: arXiv [abs/1201.1548v1], 1-46
Electronic Journal Article2012
Berberich, Eric
Emeliyanenko, Pavel
Sagraloff, Michael
An Elimination Method for Solving Bivariate Polynomial Systems: Eliminating the Usual Drawbacks
In: CoRR [abs/1010.1386], 1-16
Electronic Journal Article2010
Berberich, Eric
Halperin, Dan
Kerber, Michael
Pogalnikova, Roza
Deconstructing Approximate Offsets
In: arXiv [abs/1109.2158],
Electronic Journal Article2011
3
Hide details for ElsevierElsevier
Berberich, Eric
Emeliyanenko, Pavel
Kobel, Alexander
Sagraloff, Michael
Exact symbolic–numeric computation of planar algebraic curves
In: Theoretical Computer Science [491], 1-32
Journal Article2013
Berberich, Eric
Kerber, Michael
Sagraloff, Michael
An efficient algorithm for the stratification and triangulation of an algebraic surface
In: Computational Geometry: Theory and Applications (CGTA) [43], 257-278
Journal Article2010
Berberich, Eric
Sagraloff, Michael
A Generic and Flexible Framework for the Geometrical and Topological Analysis of (Algebraic) Surfaces
In: Computer Aided Geometric Design (CAGD) [26], 627-647
Journal Article2009
1
Hide details for SIAMSIAM
Berberich, Eric
Emeliyanenko, Pavel
Sagraloff, Michael
An Elimination Method for Solving Bivariate Polynomial Systems: Eliminating the Usual Drawbacks
In: 2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX), 35-47
Proceedings Article2011
9
Hide details for SpringerSpringer
Berberich, Eric
Eigenwillig, Arno
Hemmer, Michael
Hert, Susan
Kettner, Lutz
Mehlhorn, Kurt
Reichel, Joachim
Schmitt, Susanne
Schömer, Elmar
Wolpert, Nicola
Attachment IconEXACUS: Efficient and exact algorithms for curves and surfaces
In: 13th Annual European Symposium on Algorithms (ESA 2005), 155-166
Proceedings Article2005
Berberich, Eric
Eigenwillig, Arno
Hemmer, Michael
Hert, Susan
Mehlhorn, Kurt
Schömer, Elmar
Attachment IconA Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 174-186
Proceedings Article2002
Berberich, Eric
Fogel, Efi
Halperin, Dan
Kerber, Michael
Setter, Ophir
Arrangements on Parametric Surfaces II: Concretizations and Applications
In: Mathematics in Computer Science [4], 67-91
Journal Article2010
Berberich, Eric
Fogel, Efi
Halperin, Dan
Mehlhorn, Kurt
Wein, Ron
Arrangements on Parametric Surfaces I: General Framework and Infrastructure
In: Mathematics in Computer Science [4], 45-66
Journal Article2010
Berberich, Eric
Fogel, Efi
Halperin, Dan
Mehlhorn, Kurt
Wein, Ron
Attachment IconSweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step
In: Algorithms - ESA 2007, 15th Annual European Symposium, 645-656
Proceedings Article2007
Berberich, Eric
Hagen, Matthias
Hiller, Benjamin
Moser, Hannes
Experiments
In: Algorithm Engineering : Bridging the Gap between Algorithm Theory and Practice, 325-388
Part of a Book2010
Berberich, Eric
Halperin, Dan
Kerber, Michael
Pogalnikova, Roza
Deconstructing Approximate Offsets
In: Discrete & Computational Geometry [48], 964-989
Journal Article2012
Emeliyanenko, Pavel
Berberich, Eric
Sagraloff, Michael
Attachment IconVisualizing Arcs of Implicit Algebraic Curves, Exactly and Fast
In: Advances in Visual Computing : 5th International Symposium, ISVC 2009, 608-619
Proceedings Article2009
Mörig, Marc
Scholz, Sven
Tscheuschner, Tobias
Berberich, Eric
Implementation aspects
In: Algorithm Engineering : Bridging the Gap between Algorithm Theory and Practice, 237-289
Part of a Book2010
3
Hide details for Technische Universitaet GrazTechnische Universitaet Graz
Berberich, Eric
Caroli, Manuel
Wolpert, Nicola
Attachment IconExact Computation of Arrangements of Rotated Conics
In: Proceedings of 23rd European Workshop on Computational Geometry, 231-234
Proceedings Article2007
Berberich, Eric
Fogel, Efi
Halperin, Dan
Wein, Ron
Attachment IconSweeping and Maintaining Two-Dimensional Arrangements on Surfaces
In: Proceedings of 23rd European Workshop on Computational Geometry, 223-226
Proceedings Article2007
Berberich, Eric
Meyerovitch, Michal
Attachment IconComputing Envelopes of Quadrics
In: Proceedings of 23rd European Workshop on Computational Geometry, 235-238
Proceedings Article2007
1
Hide details for TU DortmundTU Dortmund
Berberich, Eric
Halperin, Dan
Kerber, Michael
Pogalnikova, Roza
Polygonal Reconstruction from Approximate Offsets
In: 26th European Workshop on Computational Geometry : Workshop Proceedings, 65-68
Electronic Proceedings Article2010
4
Hide details for Berenbrink, PetraBerenbrink, Petra
1
Hide details for ACMACM
Akbari, Hoda
Berenbrink, Petra
Sauerwald, Thomas
A simple approach for adapting continuous load balancing processes to discrete settings
In: PODC'12 : Proceedings of the 2012 ACM Symposium on Principles of Distributed Computing, 271-280
Proceedings Article2012
2
Hide details for SIAMSIAM
Berenbrink, Petra
Cooper, Colin
Friedetzky, Tom
Friedrich, Tobias
Sauerwald, Thomas
Randomized Diffusion for Indivisible Loads
In: 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA-11), 429-439
Proceedings Article2011
Berenbrink, Petra
Hoefer, Martin
Sauerwald, Thomas
Distributed Selfish Load Balancing on Networks
In: 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA-11), 1487-1497
Proceedings Article2011
1
Hide details for SpringerSpringer
Berenbrink, Petra
Friedetzky, Tom
Elsaesser, Robert
Nagel, Lars
Sauerwald, Thomas
Faster Coupon Collecting via Replication with Applications in Gossiping
In: 36th International Symposium on Mathematical Foundations of Computer Science (MFCS-11), 72-83
Proceedings Article2011
1
Hide details for Berghammer, RudolfBerghammer, Rudolf
1
Hide details for ACMACM
Berghammer, Rudolf
Friedrich, Tobias
Neumann, Frank
Set-based Multi-Objective Optimization, Indicators, and Deteriorative Cycles
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 495-502
Proceedings Article2010
1
Hide details for Berg, Marc deBerg, Marc de
1
Hide details for ACSMACSM
Berg, Marc de
Kreveld, Marc van
Schirra, Stefan
A new approach to subdivision simplification
In: ACSM/ASPRS Annual Convention & Exposition Technical Papers, 79-88
Proceedings Article1995
1
Hide details for Berman, PiotrBerman, Piotr
1
Hide details for ACMACM
Berman, Piotr
Krysta, Piotr
Optimizing Misdirection
In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), 192-201
Proceedings Article2003
1
Hide details for Berthomé, P.Berthomé, P.
1
Hide details for SpringerSpringer
Berthomé, P.
Duboux, T.
Hagerup, Torben
Newman, I.
Schuster, Assaf
Self-Simulation for the Passive Optical Star Model
In: Algorithms-ESA'95: 3rd Annual European Symposium, 268-380
Proceedings Article1995
1
Hide details for Bertino, ElisaBertino, Elisa
1
Hide details for IEEEIEEE
Elbassioni, Khaled
Fouad, Mohamed
Bertino, Elisa
Modeling 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 Article2012
2
Hide details for Beyer, Hans-Georg (ed.)Beyer, Hans-Georg (ed.)
2
Hide details for ACMACM
Raidl, Alba, Bacardit, Beyer, Birattari, Blum, Bosman, Congdon, Corne, Cotta, Di Penta, Doerr, Drechsle, Ebner, Grahl, Jansen, Knowles, Lenaerts, Middendorf, Miller, O'Neill, Poli, Squillero, Stanley, Stützle, van Hemert (ed.)GECCO 2009: Proceedings of the 11th Annual conference on Genetic and evolutionary computation.Proceedings2009
Thierens, Beyer, Bongard, Branke, Clark, Cliff, Congdon, Deb, Doerr, Kovacs, Kumar, Miller, Moore, Neumann, Pelikan, Poli, Sastry, Stanley, Stützle, Watson, Wegener (ed.)GECCO 2007: Proceedings of the 9th Annual Conference on Genetic and Evolutionary ComputationProceedings2007
1
Hide details for Bhardwaj, OnkarBhardwaj, Onkar
1
Hide details for SpringerSpringer
Anshelevich, Elliot
Bhardwaj, Onkar
Hoefer, Martin
Friendship and Stable Matching.
In: 21st European Symposium on Algorithms (ESA-13), 49-60
Proceedings Article2013
1
Hide details for Bhaskar, UmangBhaskar, Umang
1
Hide details for ACMACM
Bhaskar, Umang
Fleischer, Lisa
Hoy, Darrell
Huang, Chien-Chung
Attachment IconEquilibria of Atomic Flow Games are not Unique
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 748-757
Proceedings Article2009
1
Hide details for Biedl, ThereseBiedl, Therese
1
Hide details for SpringerSpringer
Biedl, Therese
Kaufmann, Michael
Mutzel, Petra
Drawing Planar Partitions II: HH-Drawings
In: Proceedings of the 24th Workshop on Graph-Theoretic Concepts in Computer Science (WG-98), 124-136
Proceedings Article1998
1
Hide details for Bifet, AlbertBifet, Albert
1
Hide details for --
Bifet, Albert
Castillo, Carlos
Chirita, Paul-Elexandru
Weber, Ingmar
An Analysis of Factors Used in Search Engine Ranking
In: 1st International Workshop on Adversarial Information Retrieval on the Web (AIRWeb'05), 1-10
Electronic Proceedings Article2005
1
Hide details for Bilardi, GianfrancoBilardi, Gianfranco
1
Hide details for ElsevierElsevier
Bilardi, Gianfranco
Chaudhuri, Shiva
Dubhashi, Devdatt
Mehlhorn, Kurt
Attachment IconA lower bound for area-universal graphs
In: Information Processing Letters [51], 101-105
Journal Article1994
1
Hide details for Birattari, Mauro (ed.)Birattari, Mauro (ed.)
1
Hide details for ACMACM
Raidl, Alba, Bacardit, Beyer, Birattari, Blum, Bosman, Congdon, Corne, Cotta, Di Penta, Doerr, Drechsle, Ebner, Grahl, Jansen, Knowles, Lenaerts, Middendorf, Miller, O'Neill, Poli, Squillero, Stanley, Stützle, van Hemert (ed.)GECCO 2009: Proceedings of the 11th Annual conference on Genetic and evolutionary computation.Proceedings2009
1
Hide details for Biswas, SomenathBiswas, Somenath
1
Hide details for ACMACM
Baswana, Surender
Biswas, Somenath
Doerr, Benjamin
Friedrich, Tobias
Kurur, Piyush P.
Neumann, Frank
Computing Single Source Shortest Paths using Single-Objective Fitness Functions
In: FOGA'09 : revised selected papers from ACM SIGEVO
Foundations of Genetic Algorithms X, 59-66
Proceedings Article2009
1
Hide details for Blelloch, Guy E.Blelloch, Guy E.
1
Hide details for SpringerSpringer
Blelloch, Guy E.
Farzan, Arash
Succinct Representations of Separable Graphs
In: Combinatorial Pattern Matching : 21st Annual Symposium, CPM 2010, 138-150
Proceedings Article2010
1
Hide details for Blum, Christian (ed.)Blum, Christian (ed.)
1
Hide details for ACMACM
Raidl, Alba, Bacardit, Beyer, Birattari, Blum, Bosman, Congdon, Corne, Cotta, Di Penta, Doerr, Drechsle, Ebner, Grahl, Jansen, Knowles, Lenaerts, Middendorf, Miller, O'Neill, Poli, Squillero, Stanley, Stützle, van Hemert (ed.)GECCO 2009: Proceedings of the 11th Annual conference on Genetic and evolutionary computation.Proceedings2009
3
Hide details for Blum, NorbertBlum, Norbert
1
Hide details for ElsevierElsevier
Blum, Norbert
Mehlhorn, Kurt
Attachment IconOn the Average Number of Rebalancing Operations in Weight-Balanced Trees
In: Theoretical Computer Science [11], 303-320
Journal Article1980
1
Hide details for North-HollandNorth-Holland
Alt, Helmut
Blum, Norbert
Mehlhorn, Kurt
Paul, Markus
Attachment IconComputing a maximum cardinality matching in a bipartite graph in time $O(n^1.5 \sqrtm/\log n)$
In: Information Processing Letters [37], 237-240
Journal Article1991
1
Hide details for SpringerSpringer
Blum, Norbert
Mehlhorn, Kurt
Attachment IconMittlere Anzahl von Rebalancierungsoperationen in gewichtsbalancierten Bäumen
In: Theoretical Computer Science, 4th GI-Conference, 67-78
Proceedings Article1979
1
Hide details for Böcker, SebastianBöcker, Sebastian
1
Hide details for SpringerSpringer
Böcker, Sebastian
Hüffner, Falk
Truss, Anke
Wahlström, Magnus
A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams
In: Parameterized and Exact Computation : 4th International Workshop, IWPEC 2009, 38-49
Proceedings Article2009
1
Hide details for Bockmayr, AlexanderBockmayr, Alexander
1
Hide details for SpringerSpringer
Althaus, Ernst
Bockmayr, Alexander
Elf, Matthias
Kasper, Thomas
Jünger, Michael
Mehlhorn, Kurt
Attachment IconSCIL - Symbolic Constraints in Integer Linear Programming.
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 75-87
Proceedings Article2002
1
Hide details for Bodirsky, ManuelBodirsky, Manuel
1
Hide details for ElsevierElsevier
Bodirsky, Manuel
Kutz, Martin
Determining the consistency of partial tree descriptions
In: Artificial Intelligence [171], 185-196
Journal Article2007
3
Hide details for Bodlaender, Hans L.Bodlaender, Hans L.
1
Hide details for SIAMSIAM
Katriel, Irit
Bodlaender, Hans L.
Online Topological Ordering
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 443-450
Proceedings Article2005
2
Hide details for SpringerSpringer
Bodlaender, Hans L.
Feremans, Corinne
Grigoriev, Alexander
Penninkx, Eelko
Sitters, Rene
Wolle, Thomas
On the minimum corridor connection and other generalized geometric problems
In: 4th Workshop on Approximation and Online Algorithms, WAOA, 69-82
Proceedings Article2006
Bodlaender, Hans L.
Hagerup, Torben
Parallel Algorithms with Optimal Speedup for Bounded Treewidth
In: Automata, Languages, and Programming: 22nd International Colloquium (ICALP95), 268-279
Proceedings Article1995
1
Hide details for Bogdan, PaulBogdan, Paul
1
Hide details for SIAMSIAM
Bogdan, Paul
Sauerwald, Thomas
Stauffer, Alexandre
Sun, He
Balls into Bins via Local Search
In: 24th ACM-SIAM Symposium on Discrete Algorithms (SODA-13), 16-34
Electronic Proceedings Article2013
1
Hide details for Boghossian, Nicolas PascalBoghossian, Nicolas Pascal
1
Hide details for SpringerSpringer
Boghossian, Nicolas Pascal
Kohlbacher, Oliver
Lenhof, Hans-Peter
BALL: Biochemical Algorithms Library
In: Algorithm engineering (WAE-99) : 3rd International Workshop, WAE'99, 330-344
Proceedings Article1999
1
Hide details for Böhme, SaschaBöhme, Sascha
1
Hide details for SpringerSpringer
Alkassar, Eyad
Böhme, Sascha
Mehlhorn, Kurt
Rizkallah, Christine
Verification of Certifying Computations
In: Computer Aided Verification : 23rd International Conference, CAV 2011, 67-82
Proceedings Article2011
1
Hide details for Bongard, Joshua (ed.)Bongard, Joshua (ed.)
1
Hide details for ACMACM
Thierens, Beyer, Bongard, Branke, Clark, Cliff, Congdon, Deb, Doerr, Kovacs, Kumar, Miller, Moore, Neumann, Pelikan, Poli, Sastry, Stanley, Stützle, Watson, Wegener (ed.)GECCO 2007: Proceedings of the 9th Annual Conference on Genetic and Evolutionary ComputationProceedings2007
15
Hide details for Bonifaci, VincenzoBonifaci, Vincenzo
1
Hide details for ACMACM
Bonifaci, Vincenzo
Korteweg, Peter
Marchetti-Spaccamela, Alberto
Stougie, Leen
Attachment IconMinimizing Flow Time in the Wireless Gathering Problem
In: ACM Transactions on Algorithms [7], 33:1-33:20
Journal Article2011
2
Hide details for ElsevierElsevier
Bonifaci, Vincenzo
Korteweg, Peter
Marchetti-Spaccamela, Alberto
Stougie, Leen
Attachment IconThe Distributed Wireless Gathering Problem
In: Theoretical Computer Science [412], 633-641
Journal Article2011
Bonifaci, Vincenzo
Mehlhorn, Kurt
Varma, Girish
Physarum Can Compute Shortest Paths
In: Journal of Theoretical Biology [309], 121-133
Journal Article2012
3
Hide details for IEEEIEEE
Baruah, Sanjoy
Bonifaci, Vincenzo
D'Angelo, Gianlorenzo
Li, Haohan
Marchetti-Spaccamela, Alberto
Megow, Nicole
Stougie, Leen
Scheduling Real-Time Mixed-Criticality Jobs
In: IEEE Transactions on Computers [61], 1140-1152
Journal Article2012
Bonifaci, Vincenzo
Marchetti-Spaccamela, Alberto
Megow, Nicole
Wiese, Andreas
Polynomial-Time Exact Schedulability Tests for Harmonic Real-Time Tasks
In: Proceedings of the 34th IEEE Real-Time Systems Symposium (RTSS 2013),
Proceedings Article2013
Bonifaci, Vincenzo
Marchetti-Spaccamela, Alberto
Stiller, Sebastian
Wiese, Andreas
Feasibility Analysis in the Sporadic DAG Task Model
In: Proceedings of the 25th Euromicro Conference on Real-Time Systems (ECRTS 2013),
Proceedings Article2013
1
Hide details for INFORMSINFORMS
Bonifaci, Vincenzo
Harks, Tobias
Schäfer, Guido
Attachment IconStackelberg Routing in Arbitrary Networks
In: Mathematics of Operations Research [35], 330 - 346
Journal Article2010
2
Hide details for SIAMSIAM
Bonifaci, Vincenzo
Chan, Ho-Leung
Marchetti-Spaccamela, Alberto
Megow, Nicole
Attachment IconAlgorithms and Complexity for Periodic Real-Time Scheduling
In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1350-1359
Proceedings Article2010
Bonifaci, Vincenzo
Mehlhorn, Kurt
Varma, Girish
Physarum Can Compute Shortest Paths
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 233-240
Proceedings Article2012
6
Hide details for SpringerSpringer
Baruah, Sanjoy
Bonifaci, Vincenzo
D'Angelo, Gianlorenzo
Li, Haohan
Marchetti-Spaccamela, Alberto
Megow, Nicole
Stougie, Leen
Attachment IconScheduling Real-Time Mixed-Criticality Jobs
In: Mathematical Foundations of Computer Science 2010 : 35th International Symposium, MFCS 2010, 90-101
Proceedings Article2010
Baruah, Sanjoy
Bonifaci, Vincenzo
D'Angelo, Gianlorenzo
Marchetti-Spaccamela, Alberto
van der Ster, Suzanne
Stougie, Leen
Attachment IconMixed-criticality scheduling of sporadic task systems
In: Algorithms - ESA 2011 : 19th Annual European Symposium, 555-566
Proceedings Article2011
Baruah, Sanjoy
Bonifaci, Vincenzo
Marchetti-Spaccamela, Alberto
Stiller, Sebastian
Attachment IconImproved Multiprocessor Global Schedulability Analysis
In: Real-Time Systems [46], 3-24
Journal Article2010
Bonifaci, Vincenzo
Marchetti-Spaccamela, Alberto
Attachment IconFeasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems
In: Algorithmica [63], 763-780
Journal Article2012
Bonifaci, Vincenzo
Marchetti-Spaccamela, Alberto
Attachment IconFeasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems
In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. II, 230-241
Proceedings Article2010
Bonifaci, Vincenzo
Marchetti-Spaccamela, Alberto
Stiller, Sebastian
Attachment IconA Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling
In: Algorithmica [62], 1034-1049
Journal Article2012
2
Hide details for Borgwardt, Karsten M.Borgwardt, Karsten M.
1
Hide details for CSAILCSAIL
Shervashidze, Nino
Vishwanathan, S .V. N.
Petri, Tobias H.
Mehlhorn, Kurt
Borgwardt, Karsten M.
Attachment IconEfficient Graphlet Kernels for Large Graph Comparison
In: Proceedings of the Twelfth International Conference on Artificial Intelligence and Statistics (AISTATS), 488-495
Electronic Proceedings Article2009
1
Hide details for MIT PressMIT Press
Shervashidze, Nino
Schweitzer, Pascal
van Leeuwen, Erik Jan
Mehlhorn, Kurt
Borgwardt, Karsten M.
Weisfeiler-Lehman graph kernels
In: Journal of Machine Learning Research [12], 2539-2561
Journal Article2011
1
Hide details for Borodin, AllanBorodin, Allan
1
Hide details for ElsevierElsevier
Angelopoulos, Spyros
Borodin, Allan
Randomized Priority Algorithms
In: Theoretical Computer Science [411], 2542-2558
Journal Article2010
35
Hide details for Boros, EndreBoros, Endre
1
Hide details for ACM / SIAMACM / SIAM
Khachiyan, Leonid
Boros, Endre
Borys, Konrad
Elbassioni, Khaled M.
Gurvich, Vladimir
Generating All Vertices of a Polyhedron is Hard
In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'06, 758-765
Proceedings Article2006
7
Hide details for ElsevierElsevier
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa
On effectivity functions of game forms
In: Games and Economic Behavior [68], 512-531
Journal Article2010
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa
On Nash equilibria and improvement cycles in pure positional strategies for Chess-like and Backgammon-like n-person games
In: Discrete Mathematics [312], 772-788
Journal Article2012
Boros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, Vladimir
Attachment IconAn Inequality for Polymatroid Functions and its Applications
In: Discrete Applied mathematics [131], 27
Journal Article2003
Khachiyan, Leonid
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
A global parallel algorithm for the hypergraph transversal problem
In: Information Processing Letters [101], 148-155
Journal Article2007
Khachiyan, Leonid
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs
In: Theoretical Computer Science [382], 139-150
Journal Article2007
Khachiyan, Leonid
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa
Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data
In: Theoretical Computer Science [379], 361-376
Journal Article2007
Khachiyan, Leonid
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa
Enumerating disjunctions and conjunctions of paths and cuts in reliability theory
In: Discrete Applied Mathematics [155], 137-149
Journal Article2007
3
Hide details for SIAMSIAM
Boros, Endre
Elbassioni, Khaled
Makino, Kazuhisa
Left-to-right multiplication for monotone Boolean dualization
In: SIAM Journal on Computing [39], 3424-3439
Journal Article2010
Boros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, Vladimir
Makino, Kazuhisa
Attachment IconDual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities
In: SIAM Journal on Computing [31], 20
Journal Article2002
Khachiyan, Leonid
Boros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir
Makino, Kazuhisa
On the Complexity of Some Enumeration Problems for Matroids
In: SIAM Journal on Discrete Mathematics [19], 966-984
Journal Article2005
22
Hide details for SpringerSpringer
Boros, Endre
Borys, Konrad
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa
Rudolf, Gabor
Generating Minimal k-Vertex Connected Spanning Subgraphs
In: Computing and Combinatorics, 13th Annual International Conference, COCOON 2007, Proceedings, 222-231
Proceedings Article2007
Boros, Endre
Elbassioni, Khaled
Fouz, Mahmoud
Gurvich, Vladimir
Makino, Kazuhisa
Manthey, Bodo
Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 147-158
Proceedings Article2011
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa
A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information
In: Integer Programming and Combinatorial Optimization : 14th International Conference, IPCO 2010, 341-354
Proceedings Article2010
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa
Every Stochastic Game with Perfect Information Admits a Canonical Form
In: 2nd International ICST Conference on Game Theory for Networks (GameNets 2011),
Unpublished/Draft2012
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa
Oudalov, Vladimir
A Complete Characterization of Nash-Solvability of Bimatrix Games in Terms of the Exclusion of Certain 2x2 subgames
In: Computer Science - Theory and Applications, Third International Computer Science Symposium in Russia, CSR 2008, 99-109
Proceedings Article2008
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Tiwary, Hans Raj
The negative cycles polyhedron and hardness of checking some polyhedral properties
In: Annals of Operations Research [188], 63-76
Journal Article2011
Boros, Endre
Elbassioni, Khaled
Makino, Kazuhisa
On Berge Multiplication for Monotone Boolean Dualization
In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, 48-59
Proceedings Article2008
Boros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir
Attachment IconAlgorithms for Generating Minimal Blockers of Perfect Matchings in Bipartite Graphs and Related Problems
In: Algorithms – ESA 2004: 12th Annual European Symposium, 122-133
Proceedings Article2004
Boros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir
Khachiyan, Leonid
Attachment IconAlgorithms for Enumerating Circuits in Matroids.
In: Algorithms and Computation, 14th International Symposium, ISAAC 2003, 485-494
Proceedings Article2003
Boros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir
Khachiyan, Leonid
Attachment IconAn Efficient Implementation of a Joint Generation Algorithm
In: Experimental and efficient algorithms : Third International Workshop, WEA 2004, 114-128
Proceedings Article2004
Boros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir
Khachiyan, Leonid
Attachment IconEnumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems
In: Integer programming and combinatorial optimization : 10th International IPCO Conference, 152-162
Proceedings Article2004
Boros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir
Khachiyan, Leonid
Attachment IconGenerating Maximal Independent Sets for Hypergraphs with Bounded Edge-Intersections
In: LATIN 2004: Theoretical Informatics, 6th Latin American Symposium, 488-498
Proceedings Article2004
Boros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir
Khachiyan, Leonid
Makino, Kazuhisa
Attachment IconAn Intersection Inequality for Discrete Distributions and Related Generation Problems
In: Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, 543-555
Proceedings Article2003
Boros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir
Khachiyan, Leonid
Makino, Kazuhisa
Attachment IconGenerating Paths and Cuts in Multi-pole (Di)graphs
In: Mathematical foundations of computer science 2004 : 29th International Symposium, MFCS 2004, 298-309
Proceedings Article2004
Boros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, Vladimir
Attachment IconAn Efficient Implementation of a Quasi-polynomial Algorithm for Generating Hypergraph Transversals
In: Algorithms - ESA 2003, 11th Annual European Symposium, 556-567
Proceedings Article2003
Boros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, Vladimir
Attachment IconExtending the Balas-Yu Bounds on the Number of Maximal Independent Sets in Graphs to Hypergraphs and Lattices
In: Mathematical Programming, Ser. B [98], 14
Journal Article2003
Boros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, Vladimir
Attachment IconMatroid Intersections, Polymatroid Inequalities, and Related Problems
In: Mathematical Foundations of Computer Science 2002, 27th International Symposium, MFCS 2002, 143-154
Proceedings Article2002
Boros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, Vladimir
Makino, Kazuhisa
Attachment IconOn Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities
In: Automata, Languages and Programming, 28th International Colloquium, ICALP 2001, 92-103
Proceedings Article2001
Khachiyan, Leonid
Boros, Endre
Borys, Konrad
Elbassioni, Khaled M.
Gurvich, Vladimir
Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs
In: Algorithms and computation : 16th International Symposium, ISAAC 2005, 156-165
Proceedings Article2005
Khachiyan, Leonid
Boros, Endre
Borys, Konrad
Elbassioni, Khaled M.
Gurvich, Vladimir
Makino, Kazuhisa
Enumerating Spanning and Connected Subsets in Graphs and Matroids
In: Algorithms - ESA 2006, 14th Annual European Symposium, 444-455
Proceedings Article2006
Khachiyan, Leonid
Boros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir
A New Algorithm for the Hypergraph Transversal Problem
In: Computing and combinatorics : 11th Annual International Conference, COCOON 2005, 767-776
Proceedings Article2005
Khachiyan, Leonid
Boros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir
Generating All Minimal Integral Solutions to Monotone $\wedge,\vee$-Systems of Linear, Transversal and Polymatroid Inequalities
In: Mathematical Foundations of Computer Science 2005 : 30th International Symposium, MFCS 2005, 556-567
Proceedings Article2005
1
Hide details for Taylor & FrancisTaylor & Francis
Hide details for Boros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, VladimirBoros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, Vladimir
Attachment IconGenerating Dual-Bounded Hypergraphs
In: Optimization Methods and Software [17], 33
Electronic Journal Article2002
1
Hide details for World ScientificWorld Scientific
Boros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, Vladimir
Attachment IconAn Efficient Incremental Algorithm for Generating All Maximal Independent Sets in Hypergraphs of Bounded Dimension
In: Parallel Processing Letters [10], 14
Journal Article2000
4
Hide details for Borys, KonradBorys, Konrad
1
Hide details for ACM / SIAMACM / SIAM
Khachiyan, Leonid
Boros, Endre
Borys, Konrad
Elbassioni, Khaled M.
Gurvich, Vladimir
Generating All Vertices of a Polyhedron is Hard
In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'06, 758-765
Proceedings Article2006
3
Hide details for SpringerSpringer
Boros, Endre
Borys, Konrad
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa
Rudolf, Gabor
Generating Minimal k-Vertex Connected Spanning Subgraphs
In: Computing and Combinatorics, 13th Annual International Conference, COCOON 2007, Proceedings, 222-231
Proceedings Article2007
Khachiyan, Leonid
Boros, Endre
Borys, Konrad
Elbassioni, Khaled M.
Gurvich, Vladimir
Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs
In: Algorithms and computation : 16th International Symposium, ISAAC 2005, 156-165
Proceedings Article2005
Khachiyan, Leonid
Boros, Endre
Borys, Konrad
Elbassioni, Khaled M.
Gurvich, Vladimir
Makino, Kazuhisa
Enumerating Spanning and Connected Subsets in Graphs and Matroids
In: Algorithms - ESA 2006, 14th Annual European Symposium, 444-455
Proceedings Article2006
1
Hide details for Bosman, Peter A.N. (ed.)Bosman, Peter A.N. (ed.)
1
Hide details for ACMACM
Raidl, Alba, Bacardit, Beyer, Birattari, Blum, Bosman, Congdon, Corne, Cotta, Di Penta, Doerr, Drechsle, Ebner, Grahl, Jansen, Knowles, Lenaerts, Middendorf, Miller, O'Neill, Poli, Squillero, Stanley, Stützle, van Hemert (ed.)GECCO 2009: Proceedings of the 11th Annual conference on Genetic and evolutionary computation.Proceedings2009
1
Hide details for Böttcher, SüntjeBöttcher, Süntje
1
Hide details for SpringerSpringer
Böttcher, Süntje
Doerr, Benjamin
Neumann, Frank
Optimal fixed and adaptive mutation rates for the LeadingOnes problem
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 1-10
Proceedings Article2010
1
Hide details for Bousquet-Mélou, MireilleBousquet-Mélou, Mireille
1
Hide details for ElsevierElsevier
Banderier, Cyril
Bousquet-Mélou, Mireille
Denise, Alain
Flajolet, Philippe
Gardy, Danièle
Gouyou-Beauchamps, Dominique
Generating Functions for Generating Trees
In: Discrete Mathematics [246], 29-55
Journal Article2002
1
Hide details for Bouziane, DrissBouziane, Driss
1
Hide details for ElsevierElsevier
Bouziane, Driss
El Kahoui, M'hammed
Attachment IconComputation of the dual of a plane projective curve
In: Journal of Symbolic Computation [34], 105-117
Journal Article2002
6
Hide details for Bradford, Phillip GnassiBradford, Phillip Gnassi
1
Hide details for Academic PressAcademic Press
Bradford, Phillip Gnassi
Golin, Mordecai J.
Larmore, Lawrence L.
Optimal prefix-free codes for unequal letter costs: Dynamic programming with the Monge property
In: Journal of Algorithms [42], 277-303
Journal Article2002
1
Hide details for ElsevierElsevier
Alon, Noga
Bradford, Phillip Gnassi
Fleischer, Rudolf
Matching nuts and bolts faster
In: Information Processing Letters [59], 123-127
Journal Article1996
4
Hide details for SpringerSpringer
Bradford, Phillip Gnassi
Choppela, Venkatesh
Rawlins, Gregory J.E.
Lower Bounds for the Matrix Chain Ordering Problem
In: LATIN'95: Theoretical Informatics, 2nd Latin American Symposium, 112-130
Proceedings Article1995
Bradford, Phillip Gnassi
Fleischer, Rudolf
Matching nuts and bolts faster
In: Algorithms and Computation: 6th International Symposium (ISAAC'95), 402-408
Proceedings Article1995
Bradford, Phillip Gnassi
Golin, Mordecai J.
Larmore, Lawrence L.
Rytter, Wojciech
Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property
In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), 43-54
Proceedings Article1998
Bradford, Phillip Gnassi
Reinert, Knut
Lower Bounds for Row Minima Searching
In: Automata Languages and Programming: 23rd International Colloquium (ICALP'96), 454-465
Proceedings Article1996
1
Hide details for Bradonjić, MilanBradonjić, Milan
1
Hide details for SIAMSIAM
Bradonjić, Milan
Elsässer, Robert
Friedrich, Tobias
Sauerwald, Thomas
Stauffer, Alexandre
Efficient Broadcast on Random Geometric Graphs
In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1412-1421
Proceedings Article2010
2
Hide details for Brandenburg, Franz J.Brandenburg, Franz J.
2
Hide details for SpringerSpringer
Brandenburg, Franz J.
Jünger, Michael
Mutzel, Petra
Lengauer, Thomas
SPP 731 : Algorithmen zum automatischen Zeichnen von Graphen im Rahmen des DFG-Schwerpunkts "Effiziente Algorithmen für diskrete Probleme und ihre Anwendungen"
In: Informatik '97 : Informatik als Innovationsmotor : 27. Jahrestagung der Gesellschaft für Informatik, 58-67
Proceedings Article1997
Brandenburg, Franz J.
Schreiber, Falk
Jünger, Michael
Marks, Joe
Mutzel, Petra
Graph Drawing Contest Report
In: Proceedings of the 7th International Symposium on Graph Drawing (GD-99), 400-409
Proceedings Article1999
1
Hide details for Branke, Juergen (ed.)Branke, Juergen (ed.)
1
Hide details for ACMACM
Thierens, Beyer, Bongard, Branke, Clark, Cliff, Congdon, Deb, Doerr, Kovacs, Kumar, Miller, Moore, Neumann, Pelikan, Poli, Sastry, Stanley, Stützle, Watson, Wegener (ed.)GECCO 2007: Proceedings of the 9th Annual Conference on Genetic and Evolutionary ComputationProceedings2007
2
Hide details for Bredereck, RobertBredereck, Robert
2
Hide details for SpringerSpringer
Bredereck, Robert
Nichterlein, Andr{\'e}
Niedermeier, Rolf
Philip, Geevarghese
Attachment IconPattern-Guided Data Anonymization and Clustering
In: Mathematical Foundations of Computer Science 2011 - 36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011. Proceedings, 182-193
Proceedings Article2011
Bredereck, Robert
Nichterlein, Andr{\'e}
Niedermeier, Rolf
Philip, Geevarghese
Attachment IconThe Effect of Homogeneity on the Complexity of $k$-Anonymity
In: Fundamentals of Computation Theory - 18th International Symposium, FCT 2011, Oslo, Norway, August 22-25, 2011. Proceedings, 53-64
Proceedings Article2011
2
Hide details for Brengel, KlausBrengel, Klaus
1
Hide details for ACMACM
Crauser, Andreas
Meyer, Ulrich
Brengel, Klaus
An experimental study of priority queues in external memory
In: Journal of Experimental Algorithmics [5], 24
Unpublished/Draft2001
1
Hide details for SpringerSpringer
Brengel, Klaus
Crauser, Andreas
Meyer, Ulrich
Ferragina, Paolo
An Experimental Study of Priority Queues in External Memory
In: Algorithm engineering (WAE-99) : 3rd International Workshop, WAE'99, 345-359
Proceedings Article1999
1
Hide details for Brightwell, GrahamBrightwell, Graham
1
Hide details for WileyWiley
Brightwell, Graham
Panagiotou, Konstantinos
Steger, Angelika
Extremal subgraphs of random graphs
In: Random Structures & Algorithms [41], 147-178
Journal Article2012
25
Hide details for Bringmann, KarlBringmann, Karl
1
Hide details for AAAI PressAAAI Press
Bringmann, Karl
Friedrich, Tobias
Neumann, Frank
Wagner, Markus
Approximation-guided evolutionary multi-objective optimization
In: Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (IJCAI 2011), 1198-1203
Proceedings Article2011
8
Hide details for ACMACM
Alvarez, Victor
Bringmann, Karl
Curticapean, Radu
Ray, Saurabh
Attachment IconCounting Crossing Free Structures
In: Proceedings of the Twenty-Eight Annual Symposium on Computational Geometry (SCG'12), 61-68
Proceedings Article2012
Bringmann, Karl
Friedrich, Tobias
Attachment IconConvergence of Hypervolume-Based Archiving Algorithms II: Competitiveness
In: GECCO'12 : Proceedings of the Fourteenth International Conference on
Genetic and Evolutionary Computation, 457-464
Proceedings Article2012
Bringmann, Karl
Friedrich, Tobias
Convergence of Hypervolume-Based Archiving Algorithms I: Effectiveness
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 745-752
Proceedings Article2011
Bringmann, Karl
Friedrich, Tobias
Don't be greedy when calculating hypervolume contributions
In: FOGA'09 : revised selected papers from ACM SIGEVO
Foundations of Genetic Algorithms X, 103-112
Proceedings Article2009
Bringmann, Karl
Friedrich, Tobias
Parameterized Average-Case Complexity of the Hypervolume Indicator
In: 15th Annual Conference on Genetic and Evolutionary Computation (GECCO-13), 575-582
Proceedings Article2013
Bringmann, Karl
Friedrich, Tobias
The Maximum Hypervolume Set Yields Near-optimal Approximation
In: 12th annual conference on Genetic and evolutionary computation (GECCO 2010), 511-518
Proceedings Article2010
Bringmann, Karl
Green Larsen, Kasper
Succinct Sampling from Discrete Distributions
In: 45th ACM Symposium on Theory of Computing (STOC-13), 775-782
Proceedings Article2013
Friedrich, Tobias
Bringmann, Karl
Voss, Thomas
Igel, Christian
The Logarithmic Hypervolume Indicator
In: FOGA'11 : Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, 81-92
Proceedings Article2011
5
Hide details for ElsevierElsevier
Bringmann, KarlAttachment IconAn improved algorithm for Klee's measure problem on fat boxes
In: Computational Geometry: Theory and Applications [45], 225-233
Journal Article2012
Bringmann, Karl
Friedrich, Tobias
Approximating the least hypervolume contributor: NP-hard in general, but fast in practice
In: Theoretical Computer Science [425], 104-116
Journal Article2012
Bringmann, Karl
Friedrich, Tobias
Approximating the volume of unions and intersections of high-dimensional geometric objects
In: Computational Geometry [43], 601-610
Journal Article2010
Bringmann, Karl
Friedrich, Tobias
Approximation Quality of the Hypervolume Indicator
In: Artificial Intelligence [195], 265–290
Journal Article2013
Bringmann, Karl
Friedrich, Tobias
Igel, Christian
Voß, Thomas
Speeding Up Many-Objective Optimization by Monte Carlo Approximations
In: Artificial Intelligence [204], 22–29
Journal Article2013
1
Hide details for MIT PressMIT Press
Bringmann, Karl
Friedrich, Tobias
An Efficient Algorithm for Computing Hypervolume Contributions
In: Evolutionary Computation [18], 383-402
Journal Article2010
10
Hide details for SpringerSpringer
Anand, S
Bringmann, Karl
Friedrich, Tobias
Garg, Naveen
Kumar, Amit
Minimizing maximum (weighted) flow-time on related and unrelated machines
In: Automata, Languages, and Programming - 40th International Colloquium (ICALP-13), 13-24
Proceedings Article2013
Bringmann, KarlBringing Order to Special Cases of Klee’s Measure Problem
In: 38th International Symposium on Mathematical Foundations of Computer Science (MFCS-13), 207-218
Proceedings Article2013
Bringmann, Karl
Doerr, Benjamin
Neumann, Adrian
Sliacan, Jakub
Online Checkpointing with Improved Worst-Case Guarantees
In: Automata, Languages, and Programming - 40th International Colloquium (ICALP 2013), 255-266
Proceedings Article2013
Bringmann, Karl
Engels, Christian
Manthey, Bodo
Raghavendra Rao, B. V.
Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems
In: 38th International Symposium on Mathematical Foundations of Computer Science (MFCS-13), 219-230
Proceedings Article2013
Bringmann, Karl
Friedrich, Tobias
Approximating the least hypervolume contributor: NP-hard in general, but fast in practice
In: Evolutionary Multi-Criterion Optimization : 5th International Conference, EMO 2009, 6-20
Proceedings Article2009
Bringmann, Karl
Friedrich, Tobias
Approximating the volume of unions and intersections of high-dimensional geometric objects.
In: Proceedings of the 19th International Symposium on Algorithms and Computation (ISAAC 2008), 436-447
Proceedings Article2008
Bringmann, Karl
Friedrich, Tobias
Exact and Efficient Generation of Geometric Random Variates and Random Graphs
In: Automata, Languages, and Programming - 40th International Colloquium (ICALP-13), 267-278
Proceedings Article2013
Bringmann, Karl
Friedrich, Tobias
Tight Bounds for the Approximation Ratio of the Hypervolume Indicator
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 607-616
Proceedings Article2010
Bringmann, Karl
Panagiotou, Konstantinos
Attachment IconEfficient Sampling Methods for Discrete Distributions
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 133-144
Proceedings Article2012
Bringmann, Karl
Sauerwald, Thomas
Stauffer, Alexandre
Sun, He
Balls into bins via local search: cover time and maximum load
In: 31st Symposium on Theoretical Aspects of Computer Science (STACS-14), accepted
Proceedings Article2014
1
Hide details for Brockenauer, RalfBrockenauer, Ralf
1
Hide details for SpringerSpringer
Mutzel, Petra
Gutwenger, Carsten
Brockenauer, Ralf
Fialko, Sergej
Klau, Gunnar W.
Krüger, Michael
Ziegler, Thomas
Näher, Stefan
Alberts, David
Ambras, Dirk
Koch, Gunter
Jünger, Michael
Buchheim, Christoph
Leipert, Sebastian
AGD: A Library of Algorithms for Graph Drawing
In: Proceedings of the 6th International Symposium on Graph Drawing (GD-98), 456-457
Proceedings Article1998
3
Hide details for Brockhoff, DimoBrockhoff, Dimo
1
Hide details for ACMACM
Brockhoff, Dimo
Friedrich, Tobias
Hebbinghaus, Nils
Klein, Christian
Neumann, Frank
Zitzler, Eckart
Do Additional Objectives Make a Problem Harder?
In: Genetic and Evolutionary Computation Conference 2007, 765-772
Proceedings Article2007
1
Hide details for IEEEIEEE
Brockhoff, Dimo
Friedrich, Tobias
Hebbinghaus, Nils
Klein, Christian
Neumann, Frank
Zitzler, Eckart
On the Effects of Adding Objectives to Plateau Functions
In: IEEE Transactions on Evolutionary Computation [13], 591-603
Journal Article2009
1
Hide details for SpringerSpringer
Brockhoff, Dimo
Friedrich, Tobias
Neumann, Frank
Analyzing Hypervolume Indicator Based Algorithms
In: Parallel Problem Solving from Nature (PPSN X), 651-660
Proceedings Article2008
13
Hide details for Brodal, Gerth StøltingBrodal, Gerth Stølting
1
Hide details for Academic PressAcademic Press
Brodal, Gerth Stølting
Träff, Jesper Larsson
Zaroliagis, Christos
A Parallel Priority Queue with Constant Time Operations
In: Journal of Parallel and Distributed Computing, Special Issue on Parallel Data Structures [49], 4-21
Journal Article1998
1
Hide details for ACMACM
Agarwal, Pankaj
Arge, Lars
Brodal, Gerth Stølting
Vitter, Jeffrey Scott
I/O-Efficient Dynamic Point Location in Monotone Subdivisions
In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-99), 11-20
Proceedings Article1999
1
Hide details for ACM Press / SIAMACM Press / SIAM
Brodal, Gerth StøltingFinger Search Trees with Constant Update Time
In: Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-98), 540-549
Proceedings Article1998
1
Hide details for IEEEIEEE
Brodal, Gerth Stølting
Träff, Jesper Larsson
Zaroliagis, Christos
A parallel priority data structure with applications
In: 11th Internatinal Parallel Processing Symposium (IPPS-97), 689-693
Proceedings Article1997
1
Hide details for Publishing Association Nordic Journal of ComputingPublishing Association Nordic Journal of Computing
Brodal, Gerth Stølting
Chaudhuri, Shiva
Radhakrishnan, R.
The randomized complexity of maintaining the minimum
In: Nordic Journal of Computing [3], 337-351
Journal Article1996
8
Hide details for SpringerSpringer
Brodal, Gerth StøltingPredecessor Queries in Dynamic Integer Sets
In: Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science (STACS-97), 21-32
Proceedings Article1997
Brodal, Gerth StøltingPriority queues on parallel machines
In: 5th Scandinavian Workshop on Algorithm Theory (SWAT96), 416-427
Proceedings Article1996
Brodal, Gerth Stølting
Chaudhuri, Shiva
Radhakrishnan, Jaikumar
The randomized complexity of maintaining the minimum
In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, 4-15
Proceedings Article1996
Brodal, Gerth Stølting
Fagerberg, Rolf
Meyer, Ulrich
Zeh, Norbert
Cache-oblivious data structures and algorithms for undirected breadth-first search and shortest paths
In: Algorithm theory, SWAT 2004 : 9th Scandinavian Workshop on Algorithm Theory ; Humlebæk, Denmark, July 8-10, 2004 ; proceedings, 480-492
Proceedings Article2004
Brodal, Gerth Stølting
Gasieniec, Leszek
Approximate Dictionary Queries
In: Combinatorial Pattern Matching: 7th Annual Symposium (CPM'96), 65-74
Proceedings Article1996
Brodal, Gerth Stølting
Kaligosi, Kanela
Katriel, Irit
Kutz, Martin
Faster Algorithms for Computing Longest Common Increasing Subsequences
In: Combinatorial Pattern Matching, 17th Annual Symposium, CPM 2006, 330-341
Proceedings Article2006
Brodal, Gerth Stølting
Katajainen, Jyrki
Worst-Case Efficient External-Memory Priority Queues
In: Proceedings of the 6th Scandinavian Workshop on Algorithm Theory (SWAT-98), 107-118
Proceedings Article1998
Brodal, Gerth Stølting
Pinotti, M. Cristina
Comparator Networks for Binary Heap Construction
In: Proceedings of the 6th Scandinavian Workshop on Algorithm Theory (SWAT-98), 158-168
Proceedings Article1998
6
Hide details for Brönnimann, HervéBrönnimann, Hervé
1
Hide details for ACM PressACM Press
Brönnimann, Hervé
Burnikel, Christoph
Pion, Sylvain
Interval analysis yields efficient dynamic filters for computational geometry
In: Proceedings of the 14th International Annual ACM Symposium on Computational Geometry (SCG-98), 165-174
Proceedings Article1998
1
Hide details for CGAL ConsortiumCGAL Consortium
Bäsken, Matthias
Brönnimann, Hervé
Frank, Da
Devillers, Olivier
Ester, Ezra
Fabri, Andreas
Flato, Eyal
Gärtner, Bernd
Giezeman, Geert-Jan
Halperin, Dan
Hanniel, Iddo
Har-Peled, Sariel
Herrmann, Thomas
Hert, Susan
Hirsch, Shai
Hoffmann, Michael
Kettner, Lutz
Nechushtan, Oren
Neyer, Gabriele
Pasechnik, Dmitrii
Pion, Sylvain
Schirra, Stefan
Schönherr, Sven
Seel, Michael
Teillaud, Monique
Veltkamp, Remco
Wein, Ron
Wesselink, Wieger
Yvinec, Mariette
CGAL Reference and User ManualsUnknown Form: eBookForm2001
1
Hide details for ElsevierElsevier
Brönnimann, Hervé
Burnikel, Christoph
Pion, Sylvain
Interval arithmetic yields efficient dynamic filters for computational geometry
In: Discrete Applied Mathematics [109], 25-47
Journal Article2001
2
Hide details for SIAMSIAM
Brönnimann, Hervé
Kettner, Lutz
Pocchiola, Michel
Snoeyink, Jack
Counting and enumerating pointed pseudo-triangulations with the greedy flip algorithm
In: Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics
(ALENEX/ANALCO 2005), 98-110
Proceedings Article2005
Brönnimann, Hervé
Kettner, Lutz
Pocchiola, Michel
Snoeyink, Jack
Attachment IconCounting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm
In: SIAM Journal on Computing [36], 721-739
Journal Article2006
1
Hide details for SpringerSpringer
Brönnimann, Hervé
Kettner, Lutz
Schirra, Stefan
Veltkamp, Remco
Applications of the Generic Programming Paradigm in the Design of CGAL
In: Generic programming - International Seminar on Generic Programming Dagstuhl Castle, Germany, April 27 - May 1, 1998, selected papers, 206-216
Part of a Book2000
1
Hide details for Buchberger, Bruno (ed.)Buchberger, Bruno (ed.)
1
Hide details for Academic PressAcademic Press
Buchberger, Mehlhorn, Näher, Nievergelt (ed.)Special issue on “algorithms: implementation, libraries and use”Book1994
1
Hide details for Buchheim, ChristophBuchheim, Christoph
1
Hide details for SpringerSpringer
Mutzel, Petra
Gutwenger, Carsten
Brockenauer, Ralf
Fialko, Sergej
Klau, Gunnar W.
Krüger, Michael
Ziegler, Thomas
Näher, Stefan
Alberts, David
Ambras, Dirk
Koch, Gunter
Jünger, Michael
Buchheim, Christoph
Leipert, Sebastian
AGD: A Library of Algorithms for Graph Drawing
In: Proceedings of the 6th International Symposium on Graph Drawing (GD-98), 456-457
Proceedings Article1998
1
Hide details for Bundy, DavidBundy, David
1
Hide details for ElsevierElsevier
Bundy, David
Hebbinghaus, Nils
Stellmacher, Bernd
Attachment IconThe Local C(G,T) Theorem
In: Journal of Algebra [300], 741-789
Journal Article2006
5
Hide details for Burkhardt, StefanBurkhardt, Stefan
1
Hide details for ACMACM
Burkhardt, Stefan
Crauser, Andreas
Ferragina, Paolo
Lenhof, Hans-Peter
Rivals, Eric
Vingron, Martin
q-gram Based Database Searching Using a Suffix Array (QUASAR)
In: Proceedings of the 3rd Annual International Conference on Computational Molecular Biology (RECOMB-99), 77-83
Proceedings Article1999
1
Hide details for IOSIOS
Burkhardt, Stefan
Kärkkäinen, Juha
Better Filtering with Gapped q-Grams
In: Fundamenta Informaticae [56], 51-70
Journal Article2003
3
Hide details for SpringerSpringer
Burkhardt, Stefan
Kärkkäinen, Juha
Better Filtering with Gapped q-Grams
In: Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching, 73-85
Proceedings Article2001
Burkhardt, Stefan
Kärkkäinen, Juha
Attachment IconFast Lightweight Suffix Array Construction and Checking
In: Combinatorial Pattern Matching: 14th Annual Symposium, CPM 2003, 55-69
Proceedings Article2003
Burkhardt, Stefan
Kärkkäinen, Juha
One-Gapped q-Gram Filters for Levenshtein Distance
In: Combinatorial Pattern Matching : 13th Annual Symposium, CPM 2002, 225-234
Proceedings Article2002
12
Hide details for Burnikel, ChristophBurnikel, Christoph
2
Hide details for ACMACM
Burnikel, Christoph
Fleischer, Rudolf
Mehlhorn, Kurt
Schirra, Stefan
Attachment IconEfficient exact geometric computation made easy
In: Proceedings of the 15th Annual Symposium on Computational Geometry (SCG-99), 341-350
Proceedings Article1999
Burnikel, Christoph
Könemann, Jochen
Mehlhorn, Kurt
Näher, Stefan
Schirra, Stefan
Uhrig, Christian
Attachment IconExact Geometric Computation in LEDA
In: 11th ACM Symposium on Computational Geometry (SCG95), C18-C19
Proceedings Article1995
2
Hide details for ACM PressACM Press
Brönnimann, Hervé
Burnikel, Christoph
Pion, Sylvain
Interval analysis yields efficient dynamic filters for computational geometry
In: Proceedings of the 14th International Annual ACM Symposium on Computational Geometry (SCG-98), 165-174
Proceedings Article1998
Burnikel, Christoph
Funke, Stefan
Seel, Michael
Exact Geometric Predicates using Cascaded Computation
In: Proceedings of the 14th International Annual ACM Symposium on Computational Geometry (SCG-98), 175-183
Proceedings Article1998
2
Hide details for ACM / SIAMACM / SIAM
Burnikel, Christoph
Mehlhorn, Kurt
Schirra, Stefan
Attachment IconOn degeneracy in geometric computations
In: Discrete algorithms (SODA-94) : 5th annual ACM-SIAM symposium, 16-23
Proceedings Article1994
Mehlhorn, Kurt
Burnikel, Christoph
Fleischer, Rudolf
Schirra, Stefan
A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Square Roots
In: Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-97), 702-709
Proceedings Article1997
1
Hide details for ElsevierElsevier
Brönnimann, Hervé
Burnikel, Christoph
Pion, Sylvain
Interval arithmetic yields efficient dynamic filters for computational geometry
In: Discrete Applied Mathematics [109], 25-47
Journal Article2001
4
Hide details for SpringerSpringer
Burnikel, Christoph
Fleischer, Rudolf
Mehlhorn, Kurt
Schirra, Stefan
Attachment IconA strong and easily computable separation bound for arithmetic expressions involving radicals
In: Algorithmica [27], 87-99
Journal Article2000
Burnikel, Christoph
Funke, Stefan
Mehlhorn, Kurt
Schirra, Stefan
Schmitt, Susanne
A Separation Bound for Real Algebraic Expressions
In: Algorithmica [55], 14-28
Journal Article2009
Burnikel, Christoph
Funke, Stefan
Mehlhorn, Kurt
Schirra, Stefan
Schmitt, Susanne
Attachment IconA Separation Bound for Real Algebraic Expressions
In: Proceedings of the 9th Annual European Symposium on Algorithms (ESA-01), 254-265
Proceedings Article2001
Burnikel, Christoph
Mehlhorn, Kurt
Schirra, Stefan
Attachment IconHow to Compute the Voronoi Diagram of Line Segments:
Theoretical and Experimental Results
In: Algorithms (ESA-94) : 2nd annual European symposium, 227-239
Proceedings Article1994
1
Hide details for World ScientificWorld Scientific
Burnikel, Christoph
Funke, Stefan
Seel, Michael
Exact geometric computation using Cascading
In: International Journal of Computational Geometry & Applications [11], 245-266
Journal Article2001
1
Hide details for Busch, Philip JohannesBusch, Philip Johannes
1
Hide details for Universität des SaarlandesUniversität des Saarlandes
Busch, Philip JohannesAnalysis of the KIT email graph, with an application of randomized rumour spreading protocols
Universität des Saarlandes
Thesis - Bachelor thesis2011
1
Hide details for Butman, AyeletButman, Ayelet
1
Hide details for ACMACM
Butman, Ayelet
Hermelin, Danny
Lewenstein, Moshe
Rawitz, Dror
Optimization problems in multiple-interval graphs
In: ACM Transactions on Algorithms [6], 40,1-40,18
Journal Article2010
1
Hide details for Cai, Jin-YiCai, Jin-Yi
1
Hide details for SIAMSIAM
Cai, Jin-Yi
Lu, Pinyan
Xia, Mingji
Dichotomy for Holant* Problems with a Function on Domain Size 3
In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 1278-1295
Proceedings Article2013
2
Hide details for Calinescu, GruiaCalinescu, Gruia
1
Hide details for acmacm
Calinescu, Gruia
Fernandes, Cristina G.
Finkler, Ulrich
Karloff, Howard
A better approximation algorithm for finding planar subgraphs
In: 7th ACM-SIAM Symposium on Discrete Algorithms (SODA96), 16-25
Proceedings Article1996
1
Hide details for IEEEIEEE
Althaus, Ernst
Calinescu, Gruia
Mandoiu, Ion
Prasad, Sushil
Tchervenski, Nickolay
Zelikovsly, Alexander
Power Efficient Range Assignment in Ad-hoc Wireless
In: Proceedings of the IEEE Wireless Communications and Networking Conference (WCNC-03), 1889-1894
Proceedings Article2003
2
Hide details for Canright, GeoffreyCanright, Geoffrey
1
Hide details for tbatba
Weikum, Gerhard
Bast, Holger
Canright, Geoffrey
Hales, David
Schindelhauer, Christian
Triantafillou, Peter
Towards Peer-to-Peer Web Search
In: 1st European Conference on Complex Systems, ECCS'05, ?
Proceedings Article2007
1
Hide details for University of Paderborn, Heinz Nixdorf InstituteUniversity of Paderborn, Heinz Nixdorf Institute
Weikum, Gerhard
Bast, Holger
Canright, Geoffrey
Hales, David
Schindelhauer, Christian
Triantafillou, Peter
Towards Self-Organizing Query Routing and Processing for Peer-to-Peer Web Search
In: Workshop on Peer-to-peer Data Management in the Complex Systems Perspective, 7-24
Proceedings Article2005
9
Hide details for Canzar, StefanCanzar, Stefan
1
Hide details for ACMACM
Althaus, Ernst
Canzar, Stefan
Emmett, Mark
Karrenbauer, Andreas
Marshall, Alan
Meyer-Bäse, Anke
Zhang, Huimin
Computing H/D-exchange speeds of single residues from data of peptic fragments
In: 23rd Annual ACM Symposium on Applied Computing (SAC), 1273-1277
Proceedings Article2008
1
Hide details for GIGI
Canzar, Stefan
Remy, Jan
Shape Distributions and Protein Similarity
In: GCB, 1-10
Proceedings Article2006
1
Hide details for SIAMSIAM
Canzar, Stefan
Elbassioni, Khaled
Mestre, Julian
A polynomial delay algorithm for enumerating approximate solutions to the interval coloring problem
In: Workshop on Algorithm Engineering and Experiments 2010 (ALENEX10), 23-33
Proceedings Article2010
6
Hide details for SpringerSpringer
Althaus, Ernst
Canzar, Stefan
A Lagrangian relaxation approach for the multiple sequence alignment problem
In: Combinatorial Optimization and Applications : First International Conference, COCOA 2007, 267-278
Proceedings Article2007
Althaus, Ernst
Canzar, Stefan
LASA: A tool for non-heuristic alignment of multiple sequences
In: Bioinformatics Research and Development (BIRD’08), 489-498
Proceedings Article2008
Althaus, Ernst
Canzar, Stefan
Elbassioni, Khaled
Karrenbauer, Andreas
Mestre, Julián
Approximating the Interval Constrained Coloring Problem
In: 11th Scandinavian Workshop on Algorithm Theory (SWAT), 210-221
Proceedings Article2008
Althaus, Ernst
Canzar, Stefan
Elbassioni, Khaled
Karrenbauer, Andreas
Mestre, Julian
Approximation Algorithms for the Interval Constrained Coloring Problem
In: Algorithmica [61], 342-361
Journal Article2011
Canzar, Stefan
El-Kebir, Mohammed
Pool, Rene
Elbassioni, Khaled
Malde, Alpeshkumar K.
Mark, Alan E.
Geerke, Daan P.
Stougie, Leen
Klau, Gunnar W.
Charge Group Partitioning in Biomolecular Simulation
In: Research in Computational Molecular Biology : 16th Annual International Conference, RECOMB 2012, 29-43
Proceedings Article2012
Canzar, Stefan
Elbassioni, Khaled
Elmasry, Amr
Raman, Rajiv
On the Approximability of the Maximum Interval Constrained Coloring Problem
In: Algorithms and Computation : 21st International Symposium, ISAAC 2010. - Pt. II, 168-179
Proceedings Article2010
1
Hide details for Canzar,StefanCanzar,Stefan
1
Hide details for SpringerSpringer
Canzar,Stefan
Elbassioni, Khaled
Klau, Gunnar W.
Mestre, Julian
On Tree-Constrained Matchings and Generalizations
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 98-109
Proceedings Article2011
1
Hide details for Caprara, AlbertoCaprara, Alberto
1
Hide details for Oxford University PressOxford University Press
Althaus, Ernst
Caprara, Alberto
Lenhof, Hans-Peter
Reinert, Knut
Multiple sequence alignment with arbitrary gap costs: Computing an optimal solution using polyhedral combinatorics
In: Proceedings of the European Conference on Computational Biology (ECCB 2002), S4-S16
Proceedings Article2002
2
Hide details for Caragiannis, IoannisCaragiannis, Ioannis
2
Hide details for ElsevierElsevier
Caragiannis, Ioannis
Fishkin, Aleksei V.
Kaklamanis, Christos
Papaioannou, Evi
A tight bound for online colouring of disk graphs
In: Theoretical Computer Science [384], 152-160
Journal Article2007
Caragiannis, Ioannis
Fishkin, Aleksei V.
Kaklamanis, Christos
Papaioannou, Evi
Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs
In: 29th Symposium on Mathematical Foundations of Computer Science MFCS 2004, 119-136
Proceedings Article2007
1
Hide details for Carlsson, MatsCarlsson, Mats
1
Hide details for Centre for Research on TransportationCentre for Research on Transportation
Beldiceanu, Nicolas
Carlsson, Mats
Thiel, Sven
Sweep Synchronization as a Global Propagation Mechanism
In: Fifth International Workshop on Integration of AI and OR Techniques
in Constraint Programming for Combinatorial Optimization Problems, 139-152
Electronic Proceedings Article2003
1
Hide details for Caroli, ManuelCaroli, Manuel
1
Hide details for Technische Universitaet GrazTechnische Universitaet Graz
Berberich, Eric
Caroli, Manuel
Wolpert, Nicola
Attachment IconExact Computation of Arrangements of Rotated Conics
In: Proceedings of 23rd European Workshop on Computational Geometry, 231-234
Proceedings Article2007
6
Hide details for Case, JohnCase, John
2
Hide details for ElsevierElsevier
Case, John
Kötzing, Timo
Learning secrets interactively. Dynamic modeling in inductive inference
In: Information and Computation [220-221], 60-73
Journal Article2012
Case, John
Kötzing, Timo
Memory-limited non-U-shaped learning with solved open problems
In: Theoretical Computer Science [473], 100-123
Electronic Journal Article2013
1
Hide details for OmnipressOmnipress
Case, John
Kötzing, Timo
Strongly Non-U-Shaped Learning Results by General Techniques
In: COLT 2010 : The 23rd Conference on Learning Theory, 181-193
Proceedings Article2010
1
Hide details for Royal SocietyRoyal Society
Case, John
Kötzing, Timo
Computability-theoretic learning complexity
In: Philosophical Transaction of the Royal Society A [370], 3570-3596
Journal Article2012
1
Hide details for Schloss Dagstuhl - Leibniz-Zentrum fuer InformatikSchloss Dagstuhl - Leibniz-Zentrum fuer Informatik
Case, John
Kötzing, Timo
Measuring Learning Complexity with Criteria Epitomizers
In: 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011), 320-331
Electronic Proceedings Article2011
1
Hide details for SpringerSpringer
Case, John
Kötzing, Timo
Solutions to Open Questions for Non-U-Shaped Learning with Memory Limitations
In: Algorithmic Learning Theory : 21st International Conference, ALT 2010, 285-299
Proceedings Article2010
1
Hide details for Castillo, CarlosCastillo, Carlos
1
Show details for --

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