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

MPI-INF D1 Publications

MPI-INF D1 Publications

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

Login to this database


 

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

#YearTitleType
1
Hide details for Sabo [-]Sabo [-]
1999Ein schnelles Verfahren zur exakten Berechnung von Skalarprodukten
Universität des Saarlandes
Thesis - Masters thesis
4
Hide details for Sagraloff [-]Sagraloff [-]
2012Exaktes geometrisches RechnenMiscellaneous
2011When Newton meets Descartes: A Simple and Fast Algorithm to Isolate the Real Roots of a Polynomial
In: arXiv [abs/1109.6279v1], 1-21
Electronic Journal Article
2010A General Approach to Isolating Roots of a Bitstream Polynomial
In: Mathematics in Computer Science [4], 481-506
Journal Article
2010On the Complexity of Real Root Isolation
In: CoRR [abs/1011.0344], 1-33
Electronic Journal Article
1
Hide details for Sagraloff [van der Hoeven, van Hoeij]Sagraloff [van der Hoeven, van Hoeij]
2012When Newton meets Descartes: A Simple and Fast Algorithm to Isolate the Real Roots of a Polynomial
In: ISSAC 2012 : Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation, 297-304
Proceedings Article
1
Hide details for Sagraloff, Kerber, Hemmer [Suzuki, Hong, Anai, Yap, Sato, Yoshida]Sagraloff, Kerber, Hemmer [Suzuki, Hong, Anai, Yap, Sato, Yoshida]
2009Certified Complex Root Isolation via Adaptive Root Separation Bounds
In: The Joint Conference of ASCM 2009 and MACIS 2009, 151-166
Proceedings Article
1
Hide details for Sagraloff, Yap [Yap, Leykin]Sagraloff, Yap [Yap, Leykin]
2011A Simple But Exact and Efficient Algorithm for Complex Root Isolation
In: ISSAC 2011 : Proceedings of the 36th International Symposium on Symbolic and Algebraic Computation, 353-360
Proceedings Article
1
Hide details for Saha, Saptharishi, Saxena [Saptharishi, Saxena]Saha, Saptharishi, Saxena [Saptharishi, Saxena]
2013Attachment IconA Case of Depth-3 Identity Testing, Sparse Factorization and Duality
In: Computational Complexity [22], 39-69
Electronic Journal Article
10
Hide details for Sanders [-]Sanders [-]
2004Algorithms for Scalable Storage Servers
In: SOFSEM 2004 : theory and practice of computer science ; 30th Conference on Current Trends in Theory and Practice of Computer Science, 82-101
Proceedings Article
2003Asynchronous Scheduling of Redundant Disk Arrays
In: IEEE Transactions on Computers [52], 1170-1184
Journal Article
2002Randomized Receiver Initiated Load Balancing Algorithms for Tree Shaped Computations
In: The Computer Journal [45], 561-573
Journal Article
2002Reconciling simplicity and realism in parallel disk models
In: Parallel Computing [28], 705-723
Journal Article
2001Reconciling Simplicity and Realism in Parallel Disk Models
In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-01), 67-76
Proceedings Article
2000Fast Priority Queues for Cached Memory
In: Journal of Experimental Algorithmics [5], 1-25
Electronic Journal Article
1999Analysis of nearest neighbor load balancing algorithms for random loads
In: Parallel Computing [25], 1013-1033
Journal Article
1998Random Permutations on Distributed, External and Hierarchical Memory
In: Information Processing Letters [67], 305-309
Journal Article
1998Random Permutations on Distributed, External and Hierarchical Memory
In: PARS-Mitteilungen, 160-165
In: PARS-Mitteilungen [1998], 160-165
Journal Article
1998Randomized Priority Queues for Fast Parallel Access
In: Journal Parallel and Distributed Computing [49], 86-97
Journal Article
1
Hide details for Sanders [Aggarwal, Rangan]Sanders [Aggarwal, Rangan]
1999Asynchronous Random Polling Dynamic Load Balancing
In: Algorithms and computation : 10th International Symposium, ISAAC'99, 37-48
Proceedings Article
1
Hide details for Sanders [Bode]Sanders [Bode]
1998Tree Shaped Computations as a Model for Parallel Applications
In: Anwendungsbezogene Lastverteilung (ALV), 123-132
Proceedings Article
1
Hide details for Sanders [Fleischer, Moret, Meineche Schmidt]Sanders [Fleischer, Moret, Meineche Schmidt]
2002Presenting Data from Experiments in Algorithmics
In: Experimental Algorithmics, 181-196
Part of a Book
1
Hide details for Sanders [Goodrich, McGeoc]Sanders [Goodrich, McGeoc]
1999Fast Priority Queues for Cached Memory
In: Selected papers of the International Workshop on Algorithm Engineering and Experimentation (ALENEX-99), 312-327
Proceedings Article
1
Hide details for Sanders [Plehn, Deutschmann]Sanders [Plehn, Deutschmann]
1999Berechnungen mit großen Datenmengen
In: Jahrbuch der Max-Planck-Gesellschaft 1999, 534-540
Part of a Book
1
Hide details for Sanders [Sibeyn]Sanders [Sibeyn]
2003Memory hierarchies - models and lower bounds
In: Algorithms for memory hierarchies, 1-10
Part of a Book
1
Hide details for Sanders [Teng]Sanders [Teng]
2000Asynchronous Scheduling of Redundant Disk Arrays
In: Proceedings of the 12th Annual ACM Symposium on Parallel Algorithms and Architecture (SPAA-00), 89-98
Proceedings Article
1
Hide details for Sanders [Wiedermann, van Emde Boas, Nielsen]Sanders [Wiedermann, van Emde Boas, Nielsen]
1999Accessing Multiple Sequences Through Set Associative Caches
In: Proceedings of the 26th International Colloquium on Automata, Languages and Programming (ICALP-99), 655-664
Proceedings Article
1
Hide details for Sanders [Winkel]Sanders [Winkel]
2004Super Scalar Sample Sort
In: Algorithms – ESA 2004: 12th Annual European Symposium, 784-796
Proceedings Article
1
Hide details for Sanders, Egner, Korst [Egner, Korst]Sanders, Egner, Korst [Egner, Korst]
2000Fast Concurrent Access to Parallel Disks
In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-00), 849-858
Proceedings Article
1
Hide details for Sanders, Egner, Tolhuizen [Egner, Tolhuizen]Sanders, Egner, Tolhuizen [Egner, Tolhuizen]
2003Polynomial Time Algorithms For Network Information Flow
In: Proceedings of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA-03), 286-294
Proceedings Article
1
Hide details for Sanders, Pettie [-]Sanders, Pettie [-]
2004Attachment IconA Simpler Linear Time 2/3 - epsilon Approximation for Maximum
Weight Matching
Report
1
Hide details for Sanders, Reussner, Prechelt, Müller [Reussner, Prechelt, Müller, Alexandrov]Sanders, Reussner, Prechelt, Müller [Reussner, Prechelt, Müller, Alexandrov]
1998SKaMPI: A Detailed, Accurate MPI Benchmark
In: Proceedings of the 5th European PVM/MPI Users' Group Meeting, 52-59
Proceedings Article
1
Hide details for Sanders, Sibeyn [-]Sanders, Sibeyn [-]
2000A Bandwidth Latency Tradeoff for Broadcast and Reduction
In: Euro-Par 2000 Parallel Processing, Proceedings of the 6th International Euro-Par Conference (Euro-Par-00), 918-926
Proceedings Article
1
Hide details for Sanders, Sibeyn [Sibeyn]Sanders, Sibeyn [Sibeyn]
2003A Bandwidth Latency Tradeoff for Broadcast and Reduction
In: Information Processing Letters [86], 33-38
Journal Article
1
Hide details for Sanders, Singler, van Stee [Sanders, Singler]Sanders, Singler, van Stee [Sanders, Singler]
2013Attachment IconReal-time prefetching and caching
In: Journal of Scheduling [16], 47-58
Journal Article
1
Hide details for Sanders, Sivadasan, Skutella [Díaz, Karhumäki, Lepistö, Sannella]Sanders, Sivadasan, Skutella [Díaz, Karhumäki, Lepistö, Sannella]
2004Attachment IconOnline scheduling with bounded migration
In: Automata, languages and programming : 31st International Colloquium, ICALP 2004, 1111-1122
Proceedings Article
1
Hide details for Sanders, Sivadasan, Skutella [Sanders, Skutella]Sanders, Sivadasan, Skutella [Sanders, Skutella]
2009Online scheduling with bounded migration
In: Mathematics of Operations Research [34], 481-498
Journal Article
2
Hide details for Sanders, Solis-Oba [Solis-Oba]Sanders, Solis-Oba [Solis-Oba]
2001How Helpers Hasten h-Relations
In: Journal of Algorithms [41], 86-98
Journal Article
2000How Helpers Hasten h-Relations
In: Algorithms - ESA 2000, Proceedings of the 8th Annual European Symposium (ESA-00), 392-402
Proceedings Article
1
Hide details for Sanders, Steurer [-]Sanders, Steurer [-]
2005An Asymptotic Approximation Scheme for Multigraph Edge Coloring
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 897-906
Proceedings Article
1
Hide details for Sanders, Takkula, Wedelin [Takkula, Wedelin, Sloot, Bubak, Hoekstra, Hertzberger]Sanders, Takkula, Wedelin [Takkula, Wedelin, Sloot, Bubak, Hoekstra, Hertzberger]
1999High performance integer optimization for crew scheduling
In: Proceedings of the 7th International Conference on High-Performance Computing and Networking Europe (HPCN Europe-99), 3-12
Proceedings Article
1
Hide details for Sanders, Träff [Monien, Feldman, Träff]Sanders, Träff [Monien, Feldman, Träff]
2002The factor algorithm for regular all-to-all communication on clusters of SMP nodes
In: Proceedings of the 8th International Euro-Par Conference, 799-803
Proceedings Article
1
Hide details for Sanders, Vöcking [-]Sanders, Vöcking [-]
2003Tail bounds and expectations for random arc allocation and applications
In: Combinatorics, Probability and Computing [12], 225-244
Journal Article
1
Hide details for Sanders, Vöcking [Penttonen, Meineche Schmidt]Sanders, Vöcking [Penttonen, Meineche Schmidt]
2002Random Arc Allocation and Applications to Disks, Drums and DRAMs
In: Algorithm theory, SWAT 2002 : 8th Scandinavian Workshop on Algorithm Theory, 121-130
Proceedings Article
1
Hide details for Sanders, Vollmar, Worsch [Vollmar, Worsch]Sanders, Vollmar, Worsch [Vollmar, Worsch]
2002Feasible models of computation: Three-dimensionality and energy consumption
In: Fundamenta Informaticae [52], 233-248
Journal Article
1
Hide details for Sauerwald, Stauffer [Stauffer, Randall]Sauerwald, Stauffer [Stauffer, Randall]
2011Rumor Spreading and Vertex Expansion on Regular Graphs
In: 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA-11), 462-475
Proceedings Article
1
Hide details for Sauerwald, Sun [Roughgarden]Sauerwald, Sun [Roughgarden]
2012Tight Bounds For Randomized Load Balancing on Arbitrary Network Topologies
In: IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS-12), 341-350
Proceedings Article
2
Hide details for Schäfer [-]Schäfer [-]
2004Worst case instances are fragile: average case and smoothed competitive analysis of algorithms
Universität des Saarlandes
Thesis - PhD thesis
2000Weighted Matchings in General Graphs
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Schäfer, Sivadasan [Diekert, Habib]Schäfer, Sivadasan [Diekert, Habib]
2004Attachment IconTopology matters: Smoothed competitiveness of metrical task systems
In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), 489-500
Proceedings Article
1
Hide details for Schalekamp, Williamson, van Zuylen [Schalekamp, Williamson, Rabani]Schalekamp, Williamson, van Zuylen [Schalekamp, Williamson, Rabani]
2012A proof of the Boyd-Carr conjecture
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 1477-1486
Proceedings Article
1
Hide details for Schanne [-]Schanne [-]
2001Visualisierung der Dialektgeographie und Topographie im deutschen Dialektraum
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Schilz [-]Schilz [-]
2000Effiziente Algorithmen für das verteilte Rechnen auf Workstation-Clustern
Universität des Saarlandes
Thesis - PhD thesis
2
Hide details for Schirra [-]Schirra [-]
2000Robustness and Precision Issues in Geometric Computation
In: Handbook of Computational Geometry, 597-632
Part of a Book
1998Computational Geometry: Theory and Implementation
Universität des Saarlandes
Thesis - Habilitation thesis
1
Hide details for Schirra [Goodrich, McGeoch]Schirra [Goodrich, McGeoch]
1999A Case Study on the Cost of Geometric Computing
In: Selected papers of the International Workshop on Algorithm Engineering and Experimentation (ALENEX-99), 156-176
Proceedings Article
1
Hide details for Schirra [van Kreveld, Nievergelt, Roos, Widmayer]Schirra [van Kreveld, Nievergelt, Roos, Widmayer]
1997Precision and Robustness in Geometric Computations
In: Algorithmic Foundations of Geographic Information Systems, 255-287
Part of a Book
5
Hide details for Schmidt [-]Schmidt [-]
2013A Planarity Test via Construction Sequences
In: 38th International Symposium on Mathematical Foundations of Computer Science (MFCS'13), 765-776
Proceedings Article
2013A Simple Test on 2-Vertex- and 2-Edge-Connectivity
In: Information Processing Letters [113], 241-244
Journal Article
2013Contractions, Removals and Certifying 3-Connectivity in Linear Time
In: SIAM Journal on Computing [42], 494-535
Journal Article
2013Contractions, Removals and How to Certify 3-Connectivity in Linear TimeUnpublished/Draft
2012Construction Sequences and Certifying 3-Connectivity
In: Algorithmica [62], 192-208
Journal Article
1
Hide details for Schmidt [Czumaj, Pitts, Wattenhofer]Schmidt [Czumaj, Pitts, Wattenhofer]
2012Certifying 3-Connectivity in Linear Time
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 786-797
Proceedings Article
1
Hide details for Schmidt, Valtr [Valtr]Schmidt, Valtr [Valtr]
2012Cubic Plane Graphs on a Given Point Set
In: Proceedings of the Twenty-Eighth Annual Symposium on Computational Geometry (SCG'12), 201-208
Proceedings Article
5
Hide details for Schmitt [-]Schmitt [-]
2006Implementierung einer Überlagerungvon konvexen Arrangements der Kugeloberfläche
Universität des Saarlandes
Thesis - Bachelor thesis
2004Common Subexpression Search in LEDA_reals -- a study of the diamond-operatorReport
2004Improved separation bounds for the diamond operatorReport
2003Common Subexpression Search in LEDA_realsReport
2003The Diamond Operator for Real Algebraic NumbersReport
1
Hide details for Schmitt [Ganzha, Mayr, Vorozhtsov]Schmitt [Ganzha, Mayr, Vorozhtsov]
2005Attachment IconThe diamond operator - Implementation of exact real algebraic numbers
In: Computer Algebra in Scientific Computing, 8th International Workshop, CASC 2005, 355-366
Proceedings Article
1
Hide details for Schmitt, Fousse [-]Schmitt, Fousse [-]
2004Attachment IconA comparison of polynomial evaluation schemesReport
1
Hide details for Schmitt, Zimmer [Zimmer]Schmitt, Zimmer [Zimmer]
2003Elliptic Curves : A Computational ApproachBook
1
Hide details for Schmitz [-]Schmitz [-]
1995Analyse von Branch-and-Bound Algorithmen zum Problem des Handlungsreisenden
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Schnorr, Subramanian [Schnorr, Luby, Rolim, Serna]Schnorr, Subramanian [Schnorr, Luby, Rolim, Serna]
1998Almost optimal (on the average) algorithms for boolean matrix product witnesses, computing the diameter
In: Proceedings of the 2nd International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM-98), 218-231
Proceedings Article
1
Hide details for Schömer, Reichel, Warken, Lennerz [Lee, Patrikalakis]Schömer, Reichel, Warken, Lennerz [Lee, Patrikalakis]
2002Efficient Collision Detection for Curved Solid Objects
In: Proceedings of the Seventh ACM Symposium on Solid Modeling and Applications, 321-328
Proceedings Article
1
Hide details for Schömer, Thiel [Schömer]Schömer, Thiel [Schömer]
1995Efficient Collision Detection for Moving Polyhedra
In: 11th Annual ACM Symposium on Computational Geometry (SCG95), 51-60
Proceedings Article
1
Hide details for Schömer, Wolpert [Schömer]Schömer, Wolpert [Schömer]
2006An Exact and Efficient Approach for Computing a Cell in an Arrangement of Quadrics
In: Computational Geometry [33], 65 - 97
Journal Article
1
Hide details for Schröder [-]Schröder [-]
1998Upper and Lower Bounds for Basic Scheduling Problems
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Schulte [-]Schulte [-]
2001Exaktes Lösen von Linearen Programmen
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Schultes [-]Schultes [-]
2005Fast and Exact Shortest Path Queries Using Highway Hierachies
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Schwarzenecker [-]Schwarzenecker [-]
1995Ein NP-schweres Plazierungsproblem
Universität des Saarlandes
Thesis - PhD thesis
1
Hide details for Schwarz, Karrenbauer, Schehr, Rieger [Schwarz, Schehr, Rieger]Schwarz, Karrenbauer, Schehr, Rieger [Schwarz, Schehr, Rieger]
2009Domain walls and chaos in the disordered SOS model
In: Journal of statistical mechanics : theory and experiment [P08022], 1-23
Electronic Journal Article
2
Hide details for Schweitzer [-]Schweitzer [-]
2009Problems of Unknown Complexity: Graph isomorphism and Ramsey theoretic numbers
Universität des Saarlandes
Thesis - PhD thesis
2009Using the Incompressibility Method to obtain Local Lemma results for Ramsey-type Problems
In: Information Processing Letters [109], 229-232
Journal Article
1
Hide details for Schweitzer, Schweitzer [Schweitzer]Schweitzer, Schweitzer [Schweitzer]
2010Connecting face hitting sets in planar graphs
In: Information Processing Letters [111], 11-15
Journal Article
2
Hide details for Schwerdt, Smid, Schirra [Schwerdt, Smid]Schwerdt, Smid, Schirra [Schwerdt, Smid]
1997Computing the Minimum Diameter for Moving Points: An Exact Implementation using Parametric Search
In: Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), 466-468
Proceedings Article
1997Computing the Minimum Diameter for Moving Points: An Exact Implementation using Parametric Search
In: Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), 466-468
Proceedings Article
2
Hide details for Seel [-]Seel [-]
2001Planar Nef Polyhedra and Generic Higher-dimensional Geometry
Universität des Saarlandes
Thesis - PhD thesis
1994Eine Implementierung abstrakter Voronoidiagramme
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Seidel [-]Seidel [-]
1997Paralleles List Ranking
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Seidel, Wolpert [Seidel]Seidel, Wolpert [Seidel]
2005On the Exact Computation of the Topology of Real Algebraic Curves
In: Proceedings of the 21st ACM Symposium on Computational Geometry, 107-115
Proceedings Article
2
Hide details for Seiden [-]Seiden [-]
2000Online randomized multiprocessor scheduling
In: Algorithmica [28], 173-216
Journal Article
1999Randomized online scheduling with delivery times
In: Journal of Combinatorial Optimization [3], 399-416
Journal Article
1
Hide details for Semeloglou [-]Semeloglou [-]
2000Kürzeste Wege in planare Graphen. Implementierung eines parallelen Algorithmus mithilfe von PAD
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Sharma [-]Sharma [-]
2008Complexity of real root isolation using continued fractions
In: Theoretical Computer Science [409], 292-310
Electronic Journal Article
1
Hide details for Shervashidze, Schweitzer, van Leeuwen, Mehlhorn, Borgwardt [Shervashidze, van Leeuwen, Borgwardt]Shervashidze, Schweitzer, van Leeuwen, Mehlhorn, Borgwardt [Shervashidze, van Leeuwen, Borgwardt]
2011Weisfeiler-Lehman graph kernels
In: Journal of Machine Learning Research [12], 2539-2561
Journal Article
1
Hide details for Shervashidze, Vishwanathan, Petri, Mehlhorn, Borgwardt [Shervashidze, Vishwanathan, Petri, Borgwardt, van Dyk,Shervashidze, Vishwanathan, Petri, Mehlhorn, Borgwardt [Shervashidze, Vishwanathan, Petri, Borgwardt, van Dyk, Welling]
2009Attachment IconEfficient Graphlet Kernels for Large Graph Comparison
In: Proceedings of the Twelfth International Conference on Artificial Intelligence and Statistics (AISTATS), 488-495
Electronic Proceedings Article
10
Hide details for Sibeyn [-]Sibeyn [-]
2000Solving fundamental problems on sparse-meshes
In: IEEE Transactions on Parallel & Distributed Systems [11], 1324-1332
Journal Article
1999Better Deterministic Routing on Meshes
In: Proceedings of the 13th International Parallel Processing Symposium, and 10th Symposium on Parallel and Distributed Processing (IPPS/SPDP-99), 420-425
Proceedings Article
1999Effiziente parallele Algorithmen
Universität des Saarlandes
Thesis - Habilitation thesis
1999Row-Major Sorting on Meshes
In: SIAM Journal on Computing [28], 847-863
Journal Article
1998List Ranking on Meshes
In: Acta Informatica [35], 543-566
Journal Article
1997Better Trade-offs for Parallel List Ranking
In: Proceedings of the 9th Symposium on Parallel Algorithms and Architectures (SPAA-97), 221-230
Proceedings Article
1997Routing on Triangles, Tori and Honeycombs
In: International Journal on the Foundations of Computer Science [8], 269-287
Journal Article
1997Routing with Finite Speeds of Memory and Network
In: Proceedings of the 22nd Symposium on the Mathematical Foundations of Computer Science (MFCS-97), 488-497
Proceedings Article
1997Sample Sort on Meshes
In: Proceedings of the 3rd International Euro-Par Conference on Parallel Processing (Euro-Par-97), 389-398
Proceedings Article
1995Sample Sort on Meshes
In: Proceedings of Computing Science in the Netherlands, SION, 217-228
Proceedings Article
1
Hide details for Sibeyn [Arnborg, Ivansson]Sibeyn [Arnborg, Ivansson]
1998Solving Fundamental Problems on Sparse-Meshes
In: Proceedings of the 6th Scandinavian Workshop on Algorithm Theory (SWAT-98), 288-299
Proceedings Article
1
Hide details for Sibeyn [Banerjee, Prasanna, Sinha]Sibeyn [Banerjee, Prasanna, Sinha]
1999Ultimate Parallel List Ranking?
In: Proceedings of the 6th International Conference on High Performance Computing (HiPC-99), 197-201
Proceedings Article
1
Hide details for Sibeyn [Bougé, Fraigniaud, Mignotte, Robert]Sibeyn [Bougé, Fraigniaud, Mignotte, Robert]
1996List Ranking on Interconnection Networks
In: 2nd Euro-Par Conference, 529-541
Proceedings Article
1
Hide details for Sibeyn [Gavoille, Bermond, Raspaud]Sibeyn [Gavoille, Bermond, Raspaud]
1999Power and Limitations of Optical Reconfigurable Arrays
In: Proceedings of the 6th International Colloquium on Structural Information and Communication Complexity (SIROCCO 6), 249-263
Proceedings Article
1
Hide details for Sibeyn [Meinel, Tison]Sibeyn [Meinel, Tison]
1999External Selection
In: Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science (STACS-99), 291-301
Proceedings Article
1
Hide details for Sibeyn [Penczek, Szalas]Sibeyn [Penczek, Szalas]
1996Routing on Triangles, Tori and Honeycombs
In: Mathematical Foundations of Computer Science 1996: 21st International Symposium (MFCS'96), 529-541
Proceedings Article
1
Hide details for Sibeyn, Abello, Meyer [Sibeyn, Abello]Sibeyn, Abello, Meyer [Sibeyn, Abello]
2002Heuristics for Semi-External Depth First Search on Directed Graphs
In: SPAA 2002 : Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 282-292
Proceedings Article
1
Hide details for Sibeyn, Grammatikakis, Hsu, Kraetzl [Grammatikakis, Hsu, Kraetzl]Sibeyn, Grammatikakis, Hsu, Kraetzl [Grammatikakis, Hsu, Kraetzl]
1998Packet Routing in Fixed-Connection Networks: A Survey
In: Journal of Parallel and Distributed Computing [54], 77-132
Journal Article
2
Hide details for Sibeyn, Guillaume, Seidel [Guillaume, Seidel]Sibeyn, Guillaume, Seidel [Guillaume, Seidel]
1999Practical Parallel List Ranking
In: Journal of Parallel and Distributed Computing [56], 156-180
Journal Article
1997Practical Parallel List Ranking
In: Proceedings of the 4th Symposium on Solving Irregularly Structured Problems in Parallel (IRREGULAR-97), 25-36
Proceedings Article
1
Hide details for Sibeyn, Juurlink, Rao [Juurlink, Rao]Sibeyn, Juurlink, Rao [Juurlink, Rao]
1998Gossiping on Meshes and Tori
In: IEEE Transactions on Parallel and Distributed Systems [9], 513-525
Journal Article
2
Hide details for Sibeyn, Kaufmann [Kaufmann]Sibeyn, Kaufmann [Kaufmann]
1997BSP-Like External-Memory Computation
In: Proceedings of the 3rd Italian Conference on Algorithms and Complexity (CIAC-97), 229-240
Proceedings Article
1997Randomized Multipacket Routing and Sorting on Meshes
In: Algorithmica [17], 224-244
Journal Article
1
Hide details for Sibeyn, Kaufmann, Chlebus [-]Sibeyn, Kaufmann, Chlebus [-]
1997Deterministic Permutation Routing on Meshes
In: Journal of Algorithms [22], 111-141
Journal Article
1
Hide details for Sitters [-]Sitters [-]
2005Complexity of preemptive minsum scheduling on unrelated parallel machines
In: Journal of Algorithms [57], 37-48
Journal Article
1
Hide details for Sitters, Stougie [Stougie]Sitters, Stougie [Stougie]
2006The general two-server problem
In: Journal of the ACM [53], 437-458
Journal Article
1
Hide details for Sivadasan [-]Sivadasan [-]
2004Online Problems and Two-Player Games: Algorithms and Analysis
Universität des Saarlandes
Thesis - PhD thesis
1
Hide details for Sivadasan, Sanders, Skutella [-]Sivadasan, Sanders, Skutella [-]
2004Attachment IconOnline Scheduling with Bounded MigrationReport
1
Hide details for Smid [-]Smid [-]
1995Dynamic rectangular point location, with an application to the closest pair problem
In: Information and Computation [16], 1-9
Journal Article
1
Hide details for Smid, Ray, Wendt, Lange [Smid, Lange, Wendt]Smid, Ray, Wendt, Lange [Smid, Lange, Wendt]
2004Computing Large Planar Regions in Terrains, with an Application to Fracture Surface
In: Discrete Applied Mathematics [139], 253-264
Journal Article
1
Hide details for Solis-Oba [BIlardi, Italiano, Pietracaprina, Pucci]Solis-Oba [BIlardi, Italiano, Pietracaprina, Pucci]
19982-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves
In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), 441-452
Proceedings Article
1
Hide details for Solis-Oba, Frederickson [Frederickson, Degano, Vaccaro, Pirillo]Solis-Oba, Frederickson [Frederickson, Degano, Vaccaro, Pirillo]
1998Rooted Spanning Trees with Small Weight and Average Length
In: Theoretical Computer Science, 114-125
Proceedings Article
1
Hide details for Solis-Oba, Jansen, Sviridenko [Jansen, Sviridenko, Hochbaum, Rolim, Sinclair]Solis-Oba, Jansen, Sviridenko [Jansen, Sviridenko, Hochbaum, Rolim, Sinclair]
1999A linear time approximation scheme for the job shop scheduling problem
In: Proceedings of the 3rd International Workshop on Randomization and Approximation Techniques in Computer Science, and 2nd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (RANDOM-APPROX-99), 177-188
Proceedings Article
1
Hide details for Solis-Oba, Jansen, Sviridenko [Jansen, Sviridenko]Solis-Oba, Jansen, Sviridenko [Jansen, Sviridenko]
1999Makespan minimization in job shops: a polynomial time approximation scheme
In: Proceedings of the 31st Annual ACM Symposium on Theory of Computing (STOC-99), 394-399
Proceedings Article
1
Hide details for Son [-]Son [-]
1999Berechnung konvexer Hüllen in erwarteter Linearzeit
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Soranzo, Ramezani, Iacono, Altafini [Soranzo, Iacono, Altafini]Soranzo, Ramezani, Iacono, Altafini [Soranzo, Iacono, Altafini]
2012Decompositions of large-scale biological systems based on dynamical properties
In: Bioinformatics [28], 76-83
Journal Article
1
Hide details for Sridharan, Subramanian, Sudha [Sridharan, Sudha]Sridharan, Subramanian, Sudha [Sridharan, Sudha]
1998Some Properties of Touching Distances for Polygons and Polyhedra
In: Applied Mathematics Letters [11], 1-7
Journal Article
1
Hide details for Srivastava [-]Srivastava [-]
1996Entwicklung und Implementierung eines Entscheidungsalgorithmus zur Zuordnung von Probleminstanzen an Hierarchieebenen
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Stephan [-]Stephan [-]
2000Implementierung eines heuristischen und eines exakten Ansatzes zur Berechnung minimaler Steinerbäume in Netzwerken
Universität des Saarlandes
Thesis - Masters thesis
2
Hide details for Steurer [-]Steurer [-]
2006An Asymptomic Approximation Scheme for Multigraph Edge Coloring
Universität des Saarlandes
Thesis - Masters thesis
2006Tight Bounds on the Min-Max Boundary Decomposition Cost of Weighted Graphs
Universität des Saarlandes
Thesis - Bachelor thesis
1
Hide details for Stormer [-]Stormer [-]
1998Ein Programm zum visuellen Erlernen von Graphalgorithmen
Universität des Saarlandes
Thesis - Masters thesis
3
Hide details for Subramanian [-]Subramanian [-]
2000Algorithms for Colouring Random k-colourable Graphs
In: Combinatorics, Probability and Computing [9], 45-77
Journal Article
1999A Generalization of Janson inequalities and its application to finding shortest paths
In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-99), 795-804
Proceedings Article
1999Minimum Coloring k-Colorable Graphs in Polynomial Average Time
In: Journal of Algorithms [33], 112-123
Journal Article
1
Hide details for Subramanian, Fürer, Veni Madhavan [Subramanian, Fürer, Veni Madhavan]Subramanian, Fürer, Veni Madhavan [Subramanian, Fürer, Veni Madhavan]
1998Algorithms for Coloring Semi-random Graphs
In: Random Structures & Algorithms [13], 125-158
Journal Article
1
Hide details for Sviridenko, Wiese [Sviridenko, Goemans]Sviridenko, Wiese [Sviridenko, Goemans]
2013Approximating the Configuration-LP for Minimizing Weighted Sum of Completion Times on Unrelated Machines
In: Proceedings of the 16th Conference on Integer Programming and Combinatorial Optimization (IPCO 2013),
Proceedings Article
1
Hide details for Telikepalli [Pandya, Radhakrishnan]Telikepalli [Pandya, Radhakrishnan]
2003Efficient Algorithms for Abelian group isomorphism and related problems
In: FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science : 23rd Conference, 277-288
Proceedings Article
1
Hide details for Telikepalli, Chandran, Subramanian [Subramanian, Warnow, Zhu]Telikepalli, Chandran, Subramanian [Subramanian, Warnow, Zhu]
2003Isoperimetric Inequalities and Width Parameters of Graphs
In: Computing and Combinatorics : 9th Annual International Conference, COCOON 2003, 385-393
Proceedings Article
1
Hide details for Telikepalli, Varadarajan [Varadarajan, McAllister]Telikepalli, Varadarajan [Varadarajan, McAllister]
2003On Shortest Paths in Line Arrangements
In: 15th Canadian Conference in Computational Geometry (CCCG-03), 170-173
Proceedings Article
1
Hide details for Teramoto, Asano, Katoh, Doerr [Teramoto, Asano, Katoh]Teramoto, Asano, Katoh, Doerr [Teramoto, Asano, Katoh]
2006Inserting Points Uniformly at Every Instance
In: IEICE - Transactions on Information and Systems [E89-D], 2348-2356
Journal Article
3
Hide details for Thiel [-]Thiel [-]
2004Efficient Algorithms for Constraint Propagation and for Processing Tree Descriptions
Universität des Saarlandes
Thesis - PhD thesis
1999Attachment IconPersistente Suchbäume
Universität des Saarlandes
Thesis - Masters thesis
1996Effiziente Algorithmen für Probleme der Kollisionserkennung und der geometrischen Optimierung
Universität des Saarlandes
Thesis - PhD thesis
1
Hide details for Thierens, Beyer, Bongard, Branke, Clark, Cliff, Congdon, Deb, Doerr, Kovacs, Kumar, Miller, Moore, Neumann, PeThierens, Beyer, Bongard, Branke, Clark, Cliff, Congdon, Deb, Doerr, Kovacs, Kumar, Miller, Moore, Neumann, Pelikan, Poli, Sastry, Stanley, Stützle, Watson, Wegener (ed.) [Thierens, Beyer, Bongard, Branke, Clark, Cliff, Congdon, Deb, Kovacs, Kumar, Miller, Moore, Pelikan, Poli, Sastry, Stanley, Stützle, Watson, Wegener]
2007GECCO 2007: Proceedings of the 9th Annual Conference on Genetic and Evolutionary ComputationProceedings
1
Hide details for Thome [-]Thome [-]
2000Erweiterung des hierarchischen Zeichenmodells in ArchEd
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Thorup [-]Thorup [-]
2000Floats, Integers, and Single Source Shortest Paths
In: Journal of Algorithms [35], 189 -201
Journal Article
1
Hide details for Tiwary, Elbassioni [Tiwary]Tiwary, Elbassioni [Tiwary]
2008On the complexity of checking self-duality of polytopes and its relations to vertex enumeration and graph isomorphism
In: Symposium on Computational Geometry 2008, 192-198
Proceedings Article
2
Hide details for Träff [-]Träff [-]
1996A Heuristic for Blocking Flow Algorithms
In: European Journal of Operational Research [89], 564-569
Journal Article
1995An Experimental Comparison of two Distributed Singel-Source Shortest Path Algorithm
In: Parallel Computing [21], 1505-1532
Journal Article
1
Hide details for Träff, Zaroliagis [-]Träff, Zaroliagis [-]
2000A simple parallel algorithm for the single-source shortest path problem on planar digraphs
In: Journal of Parallel and Distributed Computing [60], 1103-1124
Journal Article
1
Hide details for Träff, Zaroliagis [Ferreira, Rolim, Saad, Yang]Träff, Zaroliagis [Ferreira, Rolim, Saad, Yang]
1996A Simple Parallel Algorithm for the Single-Source Shortest Path Problem on Planar Digraphs
In: Parallel Algorithms for Irregularly Structured Problems: 3rd International Workshop (IRREGULAR'96), 183-194
Proceedings Article
1
Hide details for van Leeuwen, Mehlhorn, Reps (ed.) [-]van Leeuwen, Mehlhorn, Reps (ed.) [-]
1994Attachment IconIncremental Computation and Dynamic Algorithms 02.05.-06.05.94Report
5
Hide details for van Stee [-]van Stee [-]
2013SIGACT News Online Algorithms Column 22
In: SIGACT News [44], 125
Journal Article
2012Attachment IconAn improved algorithm for online rectangle filling
In: Theoretical Computer Science [423], 59-74
Journal Article
2012Attachment IconSIGACT News Online Algorithms Column 20: The Power of Harmony
In: SIGACT News [43], 127-136
Journal Article
2012Attachment IconSIGACT News Online Algorithms Column 21: APPROX and ALGO
In: SIGACT News [43], 123-129
Journal Article
2008Attachment IconCombinatorial algorithms for packing and scheduling problems
Universität Karlsruhe
Thesis - Habilitation thesis
1
Hide details for van Stee [Jansen, Solis-Oba]van Stee [Jansen, Solis-Oba]
2011Attachment IconAn improved algorithm for online rectangle filling
In: Approximation and Online Algorithms : 8th International Workshop, WAOA 2010, 249-260
Proceedings Article
2
Hide details for van Stee [Kao]van Stee [Kao]
2008Attachment IconPacket Switching in Single Buffer
In: Encyclopedia of Algorithms, 1-99
Part of a Book
2008Attachment IconPaging
In: Encyclopedia of Algorithms, 1-99
Part of a Book
3
Hide details for van Zuylen [-]van Zuylen [-]
2011An improved monotone algorithm for scheduling related machines with precedence constraints
In: Operations Research Letters [39], 423-427
Journal Article
2011Deterministic Sampling Algorithms for Network Design
In: Algorithmica [60], 110-151
Journal Article
2011Linear programming based approximation algorithms for feedback set problems in bipartite tournaments.
In: Theoretical Computer Science [412], 2556-2561
Journal Article
1
Hide details for van Zuylen [Solis-Oba, Persiano]van Zuylen [Solis-Oba, Persiano]
2012Simpler 3/4-approximation algorithms for MAX SAT
In: Approximation and Online Algorithms : 9th International Workshop, WAOA 2011, 188-197
Proceedings Article
1
Hide details for van Zuylen, Schalekamp, Williamson [Schalekamp, Williamson, Adacher, Flamini, Leo, Nicosia, Pacifici, Picciallvan Zuylen, Schalekamp, Williamson [Schalekamp, Williamson, Adacher, Flamini, Leo, Nicosia, Pacifici, Piccialli]
2011Popular Ranking
In: 10th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2011, 267-270
Electronic Proceedings Article
1
Hide details for Vidali [Leonardi]Vidali [Leonardi]
2009The Geometry of Truthfulness
In: Internet and Network Economics : 5th International Workshop, WINE 2009, 340-350
Proceedings Article
1
Hide details for Vingron, Lenhof, Mutzel [Vingron]Vingron, Lenhof, Mutzel [Vingron]
1997Computational Molecular Biology
In: Annotated Bibliographies in Combinatorial Optimization, 445-471
Part of a Book
2
Hide details for Vöcking [-]Vöcking [-]
2001Almost Optimal Permutation Routing on Hypercubes
In: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC-01), 530-539
Proceedings Article
2001Symmetric vs. Asymmetric Multiple-Choice Algorithms
In: Proceedings of the 2nd International Workshop on Approximation and Randomized Algorithms in Communication Networks (ARACNE), 1-10
Proceedings Article
1
Hide details for von Braunmühl, Cook, Mehlhorn, Verbeek [-]von Braunmühl, Cook, Mehlhorn, Verbeek [-]
1983The Recognition of Deterministic CFL's in Small Time and Space
In: Information and Control [56], 34-51
Journal Article
1
Hide details for von Zülow [-]von Zülow [-]
1994Das k-Closest-Pair-Problem
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Wagner, Veeramachaneni, Neumann, O'Reilly [Veeramachaneni, Neumann, O'Reilly]Wagner, Veeramachaneni, Neumann, O'Reilly [Veeramachaneni, Neumann, O'Reilly]
2011Attachment IconOptimizing the Layout of 1000 Wind Turbines
In: European Wind Energy Association Annual Event, 1-10
Proceedings Article
1
Hide details for Wahl [-]Wahl [-]
2000Ein neuer Algorithmus für Online-Scheduling
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Wahlström [-]Wahlström [-]
2011New Plain-Exponential Time Classes for Graph Homomorphism
In: Theory of Computing Systems [49], 273-282
Journal Article
1
Hide details for Wahlström [Frid, Morozov, Rybalchenko, Wagner]Wahlström [Frid, Morozov, Rybalchenko, Wagner]
2009New Plain-Exponential Time Classes for Graph Homomorphism
In: Computer Science – Theory and Applications : 4th International Computer Science Symposium in Russia, CSR 2009, 346-355
Proceedings Article
1
Hide details for Wahlström [Grohe, Niedermeier]Wahlström [Grohe, Niedermeier]
2008A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances
In: 3rd International Workshop on Parameterized and Exact Computation (IWPEC 2008), 202-213
Proceedings Article
1
Hide details for Wahlström [Portier, Wilke]Wahlström [Portier, Wilke]
2013Abusing the Tutte Matrix: An Algebraic Instance Compression for the K-set-cycle Problem
In: 29th International Symposium on Theoretical Aspects of Computer Science (STACS-13),
Electronic Proceedings Article
1
Hide details for Wang [-]Wang [-]
2012Certification of Curve Arrangements
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Warken [-]Warken [-]
2004Collision detection for Curved Rigid Objects in the Context of Dynamics Simulations
Universität des Saarlandes
Thesis - PhD thesis
1
Hide details for Warken, Schömer [Skala]Warken, Schömer [Skala]
2001Rolling Rigid Objects
In: Proceedings of the 9th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision (WSCG-01), 57-62
Proceedings Article
2
Hide details for Weber [-]Weber [-]
2007Attachment IconEfficient Index Structures for and Applications of the CompleteSearch Engine
Universität des Saarlandes
Thesis - PhD thesis
2006Solving large Sparse Linear Systems exactly
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Weikum, Bast, Canright, Hales, Schindelhauer, Triantafillou [Canright, Hales, Schindelhauer, Triantafillou, ScWeikum, Bast, Canright, Hales, Schindelhauer, Triantafillou [Canright, Hales, Schindelhauer, Triantafillou, Schindelhauer]
2005Towards 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 Article
1
Hide details for Weikum, Bast, Canright, Hales, Schindelhauer, Triantafillou [Canright, Hales, Schindelhauer, Triantafillou]Weikum, Bast, Canright, Hales, Schindelhauer, Triantafillou [Canright, Hales, Schindelhauer, Triantafillou]
2007Towards Peer-to-Peer Web Search
In: 1st European Conference on Complex Systems, ECCS'05, ?
Proceedings Article
1
Hide details for Weinand [-]Weinand [-]
2005Fill-in Reduction while Solving large, sparse Linear Systems with Graph Theoretical Methods
Universität des Saarlandes
Thesis - Masters thesis
2
Hide details for Weiskircher [-]Weiskircher [-]
2002New Applications of SPQR-Trees in Graph Drawing
Universität des Saarlandes
Thesis - PhD thesis
1997Attachment Icon2-Schicht-Planarisierung bipartiter Graphen
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Wendt, Lange, Ray, Smid [Wendt, Lange, Smid]Wendt, Lange, Ray, Smid [Wendt, Lange, Smid]
2001Surface Topography Quantification using Computational GeometryMiscellaneous
1
Hide details for Wendt, Lange, Smid, Ray, Tönnies [Tönnies, Wendt, Lange, Smid]Wendt, Lange, Smid, Ray, Tönnies [Tönnies, Wendt, Lange, Smid]
2002Surface Topography Quantification by Integral and Feature-related Parameters
In: Materialwissenschaft und Werkstofftechnik [33], 621-627
Journal Article
1
Hide details for Wilhelmi [-]Wilhelmi [-]
1995Erzeugung von Pseudozufallszahlen gemäß einer veränderbaren Verteilung
Universität des Saarlandes
Thesis - Masters thesis
3
Hide details for Winzen [-]Winzen [-]
2013Direction-Reversing Quasi-Random Rumor Spreading with Restarts
In: Information Processing Letters [113], 921-926
Journal Article
2011Direction-Reversing Quasi-Random Rumor Spreading with RestartsUnpublished/Draft
2011Toward a complexity theory for randomized search heuristics : black box models
Universität des Saarlandes
Thesis - PhD thesis
1
Hide details for Wissen [-]Wissen [-]
1998Automatisiertes Zeichnen von Zustandsdiagrammen
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Wolpert [-]Wolpert [-]
2002An Exact and Efficient Approach for Computing a Cell in an Arrangement of Quadrics
Universität des Saarlandes
Thesis - PhD thesis
1
Hide details for Wolpert [Di Battista, Zwick]Wolpert [Di Battista, Zwick]
2003Jacobi Curves: Computing the Exact Topology of Arrangements of Non-Singular Algebraic CurvesReport
1
Hide details for Xu, Karrenbauer, Soh, Codrea [Xu, Soh, Codrea]Xu, Karrenbauer, Soh, Codrea [Xu, Soh, Codrea]
2008Consecutive multiline addressing: A scheme for addressing PMOLEDs
In: Journal of the Society for Information Display [16], 211-219
Journal Article
1
Hide details for Xu, Karrenbauer, Soh, Wahl [Xu, Soh, Wahl, Morreale]Xu, Karrenbauer, Soh, Wahl [Xu, Soh, Wahl, Morreale]
2007A New Addressing Scheme for PM OLED Display
In: SID 2007 International Symposium Digest of Technical Papers, 97-100
Proceedings Article
1
Hide details for Xu, Wahl, Eeisenbrand, Karrenbauer, Soh, Hitzelberger [Xu, Wahl, Eeisenbrand, Soh, Hitzelberger]Xu, Wahl, Eeisenbrand, Karrenbauer, Soh, Hitzelberger [Xu, Wahl, Eeisenbrand, Soh, Hitzelberger]
2005Verfahren zur Ansteuerung von MatrixanzeigenMiscellaneous
1
Hide details for Yap, Sagraloff, Sharma [Yap, Sharma]Yap, Sagraloff, Sharma [Yap, Sharma]
2013Analytic Root Clustering: A Complete Algorithm using Soft Zero TestsUnpublished/Draft
1
Hide details for Zaroliagis [-]Zaroliagis [-]
1997Simple and Work-Efficient Parallel Algorithms for the Minimum Spanning Tree Problem
In: Parallel Processing Letters [7], 25-37
Journal Article
1
Hide details for Ziegelmann [-]Ziegelmann [-]
2001Constrained Shortest Paths and Related Problems
Universität des Saarlandes
Thesis - PhD thesis
1
Hide details for Ziegenbein [-]Ziegenbein [-]
1997Bewertung verschiedener paarweiser Alignment-Methoden, Ersetzungsmatrizen und Gap-Funktionen
Universität des Saarlandes
Thesis - Masters thesis
2
Hide details for Ziegler [-]Ziegler [-]
2000Crossing Minimization in Automatic Graph Drawing
Universität des Saarlandes
Thesis - PhD thesis
1995Max-Weighted-Matching auf allgemeinen Graphen
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Zosin []Zosin []
1997A 2-Approximation Algorithm for the Directed Multiway Cut Problem
In: Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS-97), 548-553
Proceedings Article
1
Hide details for Zotenko, Mestre, O'Leary, Przytyzka [-]Zotenko, Mestre, O'Leary, Przytyzka [-]
2008Essential Complex Biological Modules Explain the Centrality-Lethality Rule
In: PLoS Computational Biology [x], x-x
Journal Article
2359

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