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: 5. Year - 8. Counting Publications

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

#YAuthor/EditorTitle
1
Show details for ????
3
Show details for 20152015
18
Show details for 20142014
101
Show details for 20132013
145
Show details for 20122012
151
Show details for 20112011
144
Show details for 20102010
126
Show details for 20092009
140
Show details for 20082008
138
Show details for 20072007
121
Show details for 20062006
98
Show details for 20052005
99
Show details for 20042004
88
Show details for 20032003
74
Show details for 20022002
74
Show details for 20012001
96
Show details for 20002000
88
Hide details for 19991999
1
Show details for BookBook
2
Show details for Part of a BookPart of a Book
44
Show details for Proceedings ArticleProceedings Article
21
Hide details for Journal ArticleJournal Article
Albers, SusanneBetter bounds for online scheduling
In: SIAM Journal on Computing [29], 459-473
Arikati, Srinivasa Rao
Mehlhorn, Kurt
Attachment IconA correctness certificate for the Stoer-Wagner min-cut algorithm
In: Information Processing Letters [70], 251-254
Arya, Sunil
Golin, Mordecai J.
Mehlhorn, Kurt
On the Expected Depth of Random Circuits
In: Combinatorics, Probability and Computing [8], 209-228
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
Cheriyan, Joseph
Mehlhorn, Kurt
Attachment IconAn analysis of the highest-level selection rule in the preflow-push max-flow algorithm
In: Information Processing Letters [69], 239-242
Dinitz, Yefim
Garg, Naveen
Goemans, Michel X.
On the single-source unsplittable flow problem
In: Combinatorica [19], 17-41
Dinitz, Yefim
Nutov, Zeev
A 3-approximation algorithm for finding optimum 4,5-vertex-connected spanning subgraphs
In: Journal of Algorithms [32], 21-30
Fleischer, RudolfDecision trees: old and new results
In: Information and computation [152], 44-61
Gupta, Prosenjit
Janardan, Ravi
Smid, Michiel
Efficient algorithms for counting and reporting pairwise intersections between convex polygons
In: Information Processing Letters [69], 7-13
Hert, Susan
Lumelsky, Vladimir
Motion Planning in R^3 for Multiple Tethered Robots
In: IEEE Transactions on Robotics and Automation [15], 623-639
Kagaris, Dimitrios
Pantziou, Grammati E.
Tragoudas, Spyros
Zaroliagis, Christos
Transmissions in a network with capacities and delays
In: Networks [33
], 167-174
Krysta, Piotr
Pacholski, Leszek
The STO problem is NP-complete
In: Journal of Symbolic Computation [27], 207-219
Lenhof, Hans-Peter
Morgenstern, Burkhard
Reinert, Knut
An exact solution for the segment-to-segment multiple sequence alignment problem
In: Bioinformatics [15], 203-210
Mehlhorn, Kurt
Näher, Stefan
Seel, Michael
Seidel, Raimund
Schilz, Thomas
Schirra, Stefan
Uhrig, Christian
Attachment IconChecking geometric programs or verification of geometric structures
In: Computational Geometry: Theory and Applications [12], 85-104
Mehlhorn, Kurt
Sack, Jörg-Rüdiger
Urrutia, Jorg
Editorial
In: Computational Geometry [12], 153-154
Rathe, Ulrich
Sanders, Peter
Knight, Peter
A case study in scalability: an ADI method for the two-dimensional time-dependent Dirac equation
In: Parallel Computing [25], 525-534
Sanders, PeterAnalysis of nearest neighbor load balancing algorithms for random loads
In: Parallel Computing [25], 1013-1033
Seiden, Steve S.Randomized online scheduling with delivery times
In: Journal of Combinatorial Optimization [3], 399-416
Sibeyn, Jop F.Row-Major Sorting on Meshes
In: SIAM Journal on Computing [28], 847-863
Sibeyn, Jop F.
Guillaume, Frank
Seidel, Tillmann
Practical Parallel List Ranking
In: Journal of Parallel and Distributed Computing [56], 156-180
Subramanian, C. R.Minimum Coloring k-Colorable Graphs in Polynomial Average Time
In: Journal of Algorithms [33], 112-123
12
Show details for Thesis - Masters thesisThesis - Masters thesis
2
Show details for Thesis - PhD thesisThesis - PhD thesis
5
Show details for Thesis - Habilitation thesisThesis - Habilitation thesis
1
Show details for MiscellaneousMiscellaneous
104
Show details for 19981998
109
Show details for 19971997
84
Show details for 19961996
91
Show details for 19951995
26
Show details for 19941994
11
Show details for 19931993
15
Show details for 19921992
10
Show details for 19911991
19
Show details for 19901990
12
Show details for 19891989
17
Show details for 19881988
14
Show details for 19871987
20
Show details for 19861986
13
Show details for 19851985
21
Show details for 19841984
13
Show details for 19831983
7
Show details for 19821982
7
Show details for 19811981
8
Show details for 19801980
11
Show details for 19791979
10
Show details for 19781978
5
Show details for 19771977
13
Show details for 19761976
7
Show details for 19751975
4
Show details for 19741974
3
Show details for 19731973
2359

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