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
Hide details for 20092009
6
Show details for Part of a BookPart of a Book
1
Show details for ProceedingsProceedings
65
Show details for Proceedings ArticleProceedings Article
6
Show details for Electronic Proceedings ArticleElectronic Proceedings Article
35
Hide details for Journal ArticleJournal Article
Amini, Omid
Pérennes, Stéphane
Sau, Ignasi
Hardness and approximation of traffic grooming
In: Theoretical Computer Science [410], 3751-3760
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
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
Burnikel, Christoph
Funke, Stefan
Mehlhorn, Kurt
Schirra, Stefan
Schmitt, Susanne
A Separation Bound for Real Algebraic Expressions
In: Algorithmica [55], 14-28
Chan, T-H. Hubert
Dhamdhere, Kedar
Gupta, Anupam
Kleinberg, Jon
Slivkins, Aleksandrs
Metric Embeddings with Relaxed Guarantees
In: SIAM Journal on Computing [38], 2303-2329
Chan, T.-H. Hubert
Gupta, Anupam
Small Hop-diameter Sparse Spanners for Doubling Metrics
In: Discrete and Computational Geometry [41], 28-44
Christodoulou, George
Koutsoupias, Elias
Mechanism Design for Scheduling
In: Bulletin of European Association for Theoretical Computer Science [97], 40-59
Christodoulou, George
Koutsoupias, Elias
Nanavati, Akash
Coordination Mechanisms
In: Theoretical Computer Science [410], 3327-3336
Christodoulou, George
Koutsoupias, Elias
Vidali, Angelina
A lower bound for scheduling mechanisms
In: Algorithmica [85], 729-740
Cilleruelo, Javier
Hebbinghaus, Nils
Discrepancy in generalized arithmetic progressions
In: European Journal of Combinatorics [30], 1607-1611
Cooley, Oliver
Fountoulakis, Nikolaos
Kühn, Daniela
Osthus, Deryk
Embeddings and Ramsey numbers of sparse k-uniform hypergraphs
In: Combinatorica [29], 263-297
Doerr, Benjamin
Fouz, Mahmoud
A Time-Randomness Tradeoff for Quasi-Random Rumour Spreading
In: Electronic Notes in Discrete Mathematics [34], 335 - 339
Doerr, Benjamin
Friedrich, Tobias
Deterministic Random Walks on the Two-Dimensional Grid
In: Combinatorics, Probability and Computing [18], 123-144
Doerr, Benjamin
Friedrich, Tobias
Sauerwald, Thomas
Quasirandom Rumor Spreading on Expanders
In: Electronic Notes in Discrete Mathematics [34], 243 - 247
Eisenbrand, Friedrich
Karrenbauer, Andreas
Skutella, Martin
Xu, Chihao
Multiline Addressing by Network Flow
In: Algorithmica [53], 583-596
Elbassioni, KhaledAlgorithms for Dualization over Products of Partially Ordered Sets
In: SIAM Journal on Discrete Mathematics [23], 487-510
Elbassioni, Khaled
Fishkin, Aleksei V.
Sitters, René
Approximation algorithms for the Euclidean traveling salesman problem with discrete and continuous neighborhoods
In: International Journal of Computational Geometry & Applications [19], 173-193
Elmasry, AmrComputing the subset partial order for dense families of sets
In: Information Processing Letters [109], 1082-1086
Epstein, Leah
van Stee, Rob
Tamir, Tami
Attachment IconPaging with request sets
In: Theory of Computing Systems [44], 67-81
Fountoulakis, Nikolaos
Huber, Anna
Quasirandom rumor spreading on the complete graph is as fast as randomized rumor spreading
In: SIAM Journal on Discrete Mathematics [23], 1964-1991
Fountoulakis, Nikolaos
Kühn, Daniela
Osthus, Deryk
Minors in random regular graphs
In: Random Structures and Algorithms [35], 444-463
Friedrich, Tobias
Hebbinghaus, Nils
Neumann, Frank
Comparison of Simple Diversity Mechanisms on Plateau Functions
In: Theoretical Computer Science [410], 2455-2462
Friedrich, Tobias
He, Jun
Hebbinghaus, Nils
Neumann, Frank
Witt, Carsten
Analyses of Simple Hybrid Algorithms for the Vertex Cover Problem
In: Evolutionary Computation, [17], 3-19
Friedrich, Tobias
Oliveto, Pietro
Sudholt, Dirk
Witt, Carsten
Analysis of Diversity-Preserving Mechanisms for Global Exploration
In: Evolutionary Computation [17], 455-476
Gandhi, Rajiv
Mestre, Julián
Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
In: Algorithmica [54], 54-71
Gidenstam, Anders
Papatriantafilou, Marina
Sundell, Håkan
Tsigas, Philippas
Efficient and Reliable Lock-Free Memory Reclamation Based on Reference Counting
In: IEEE Transactions on Parallel and Distributed Systems [20], 1173-1187
Harren, RolfAttachment IconApproximation Algorithms for Orthogonal Packing Problems for Hypercubes
In: Theoretical Computer Science [410], 4504-4532
Kavitha, T.
Liebchen, Ch.
Mehlhorn, K.
Michail, D.
Rizzi, R.
Ueckerdt, T.
Zweig, K.
Attachment IconCycle Bases in Graphs: Characterization, Algorithms, Complexity, and Applications
In: Computer Science Review [3], 199-243
Kerber, MichaelDivision-Free Computation of Subresultants Using Bezout Matrices
In: International Journal of Computer Mathematics [86], 2186-2200
Kowalik, LukaszImproved edge-coloring with three colors
In: Theoretical Computer Science [410], 3733-3742
Neumann, Frank
Sudholt, Dirk
Witt, Carsten
Analysis of Different MMAS ACO Algorithms on Unimodal Functions and Plateaus
In: Swarm Intelligence [3], 35-68
Neumann, Frank
Witt, Carsten
Runtime Analysis of a Simple Ant Colony Optimization Algorithm
In: Algorithmica [54], 243-255
Panagiotou, KonstantinosThe Degree Sequence of Random Graphs from Subcritical Classes
In: Combinatorics, Probability and Computing [18], 647-681
Sanders, Peter
Sivadasan, Naveen
Skutella, Martin
Online scheduling with bounded migration
In: Mathematics of Operations Research [34], 481-498
Schweitzer, PascalUsing the Incompressibility Method to obtain Local Lemma results for Ramsey-type Problems
In: Information Processing Letters [109], 229-232
7
Show details for Electronic Journal ArticleElectronic Journal Article
1
Show details for Thesis - Masters thesisThesis - Masters thesis
3
Show details for Thesis - PhD thesisThesis - PhD thesis
2
Show details for ManualManual
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
Show details for 19991999
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)