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 - 2. Last Year - 1. Standard Format

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

Author/EditorYearTitleTypeUnit / Correlation
Adamaszek, Wiese2013Approximation Schemes for Maximum Weight Independent Set of RectanglesProceedings ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Afshani, Agrawal, Doerr, Doerr, Larsen, Mehlhorn2013The Query Complexity of Finding a Hidden PermutationPart of a BookMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Agrawal, Saha, Saxena2013A Case of Depth-3 Identity Testing, Sparse Factorization and DualityProceedings ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Alkassar, Böhme, Mehlhorn, Rizkallah2013A Framework for the Verification of Certifying ComputationsUnpublished/DraftMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Alvarez, Bringmann, Ray, Seidel2013Counting Triangulations ApproximatelyProceedings ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Anagnostopoulos, Grandoni, Leonardi, Wiese2013Constant Integrality Gap LP formulations of Unsplittable Flow on a PathProceedings ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Anand, Bringmann, Friedrich, Garg, Kumar2013Minimizing maximum (weighted) flow-time on related and unrelated machinesProceedings ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Anshelevich, Bhardwaj, Hoefer2013Friendship and Stable Matching.Proceedings ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Antoniadis, Huang, Ott, Verschae2013How to Pack Your Items When You Have to Buy Your KnapsackProceedings ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Bannai, Gawrychowski, Inenaga, Takeda2013Converting SLP to LZ78 in almost Linear TimeProceedings ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Berberich, Emeliyanenko, Kobel, Sagraloff2013Exact symbolic–numeric computation of planar algebraic curvesJournal ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Geometry, Topology, and Algebra
Bogdan, Sauerwald, Stauffer, Sun2013Balls into Bins via Local SearchElectronic Proceedings ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Bonifaci, Marchetti-Spaccamela, Megow, Wiese2013Polynomial-Time Exact Schedulability Tests for Harmonic Real-Time TasksProceedings ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Bonifaci, Marchetti-Spaccamela, Stiller, Wiese2013Feasibility Analysis in the Sporadic DAG Task ModelProceedings ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Bringmann2013Bringing Order to Special Cases of Klee’s Measure ProblemProceedings ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Bringmann, Doerr, Neumann, Sliacan2013Online Checkpointing with Improved Worst-Case GuaranteesProceedings ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Bringmann, Engels, Manthey, Raghavendra Rao2013Random Shortest Paths: Non-Euclidean Instances for Metric Optimization ProblemsProceedings ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Bringmann, Friedrich2013Approximation Quality of the Hypervolume IndicatorJournal ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Bringmann, Friedrich2013Exact and Efficient Generation of Geometric Random Variates and Random GraphsProceedings ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Bringmann, Friedrich2013Parameterized Average-Case Complexity of the Hypervolume IndicatorProceedings ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Bringmann, Friedrich, Igel, Voß2013Speeding Up Many-Objective Optimization by Monte Carlo ApproximationsJournal ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Bringmann, Green Larsen2013Succinct Sampling from Discrete DistributionsProceedings ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Cai, Lu, Xia2013Dichotomy for {Holant*} Problems with a Function on Domain Size 3Proceedings ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Case, Kötzing2013Memory-limited {non-U-shaped} learning with solved open problemsElectronic Journal ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Chen, Epstein, Kleiman, van Stee2013Attachment IconMaximizing the minimum load: The cost of selfishnessJournal ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Christodoulou, Kovacs, van Stee2013Attachment IconA truthful constant approximation for maximizing the minimum load on related machinesJournal ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Clementi, Crescenzi, Doerr, Fraigniaud, Isopi, Panconesi, Pasquale, Silvestri2013Rumor Spreading in Random Evolving GraphsProceedings ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Clementi, Crescenzi, Doerr, Fraigniaud, Pasquale, Silvestri2013Diffusion probabiliste dans les reseaux dynamiquesProceedings ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Croitoru2013Abstract DebatesProceedings ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Curticapean, Künnemann2013A Quantization Framework for Smoothed Analysis of Euclidean Optimization ProblemsProceedings ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Dams, Hoefer, Kesselheim2013Sleeping Experts in Wireless NetworksProceedings ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Doerr2013Improved approximation algorithms for the Min-Max Selecting Items problemJournal ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Doerr, De Rainville2013Constructing Low Star Discrepancy Point Sets with Genetic AlgorithmsProceedings ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Doerr, Doerr, Ebel2013Lessons From the Black-Box: Fast Crossover-Based Genetic AlgorithmsProceedings ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Doerr, Doerr, Spöhel, Thomas2013Playing {Mastermind} with Many ColorsElectronic Journal ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Doerr, Gnewuch, Wahlström2013Calculation of Discrepancy Measures and ApplicationsPart of a BookMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Doerr, Goldberg2013Adaptive Drift AnalysisJournal ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Doerr, Huber, Levavi2013Strong robustness of randomized rumor spreading protocolsJournal ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Doerr, Jansen, Sudholt, Winzen, Zarges2013Mutation rate matters even when optimizing monotonic functionsJournal ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Doerr, Johannsen, Kötzing, Neumann, Theile2013More effective crossover operators for the all-pairs shortest path problemJournal ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Doerr, Kodric, Voigt2013Lower bounds for the runtime of a global multi-objective evolutionary algorithmProceedings ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Doerr, Kötzing, Lengler, Winzen2013Black-Box Complexities of Combinatorial ProblemsJournal ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Doerr, Künnemann2013How the (1+λ) Evolutionary Algorithm Optimizes Linear FunctionsProceedings ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Doerr, Künnemann2013Royal Road Functions and the (1 + λ) Evolutionary Algorithm: Almost no Speed-up from Larger Offspring PopulationsProceedings ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Doerr, Schmidt, Ramakrishna2013Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear TimeProceedings ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Doerr, Spöhel, Thomas, Winzen2013Playing Mastermind with many colorsProceedings ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Doerr, Sudholt, Witt2013When Do Evolutionary Algorithms Optimize Separable Functions in Parallel?Proceedings ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Duan2013Attachment IconBreaking the $O(n^{2.5})$ Deterministic Time Barrier for Undirected Unit-Capacity Maximum FlowProceedings ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Elbassioni, Chalermsook, Nanongkai, Sun2013Multi-Attribute Profit-Maximizing PricingUnpublished/DraftMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Elbassioni, Makino, Mehlhorn, Ramezani2013On Randomized Fictitious Play for Approximating Saddle Points over Convex SetsProceedings ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Elmasry, Mehlhorn, Schmidt2013Every {DFS} tree of a 3-connected graph contains a contractible edgeJournal ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Epstein, Levin, van Stee2013Attachment IconA unified approach to truthful scheduling on related machinesProceedings ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Fanghänel, Geulen, Hoefer, Vöcking2013Online Capacity Maximization in Wireless NetworksJournal ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Fekete, Friedrichs, Kröller, Schmidt2013Facets for Art Gallery ProblemsProceedings ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Fountoulakis, Panagiotou2013On the Insertion Time of Cuckoo HashingJournal ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Gagie, Gawrychowski, Nekrich2013Heaviest Induced Ancestors and Longest Common SubstringsProceedings ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Gawrychowski2013Alphabetic Minimax Trees in Linear TimeProceedings ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Gawrychowski, Kucherov, Nekrich, Starikovskaya2013Minimal Discriminating Words Problem RevisitedProceedings ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Gawrychowski, Manea, Mercas, Nowotka, Tiseanu2013Finding Pseudo-repetitionsProceedings ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Gawrychowski, Manea, Nowotka2013Discovering Hidden Repetitions in WordsProceedings ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Gawrychowski, Straszak2013Beating O(nm) in Approximate LZW-Compressed Pattern MatchingProceedings ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Günther, Maurer, Megow, Wiese2013A New Approach to Online Scheduling: Approximating the Optimal Competitive RatioProceedings ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Harks, Hoefer, Klimm, Skopalik2013Computing Pure Nash and Strong Equilibria in Bottleneck Congestion GamesJournal ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Heydrich, van Stee2013Attachment IconDividing connected chores fairlyProceedings ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Hoefer2013Local Matching Dynamics in Social NetworksJournal ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Hoefer2013Strategic Cooperation in Cost Sharing GamesJournal ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Hoefer, Kesselheim2013Brief Announcement: Universally Truthful Secondary Spectrum AuctionsProceedings ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Hoefer, Kesselheim, Vöcking2013Truthfulness and Stochastic Dominance with Monetary Transfers.Proceedings ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Hoefer, Sauerwald2013Brief Announcement: Threshold Load Balancing in NetworksProceedings ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Hoefer, Skopalik2013Altruism in Atomic Congestion GamesJournal ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Hoefer, Skopalik2013On the Complexity of Pareto-optimal Nash and Strong EquilibriaJournal ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Hoefer, Wagner2013Designing Profit Shares in Matching and Coalition Formation GamesProceedings ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Hoefer, Wagner2013Locally Stable Marriage with Strict PreferencesProceedings ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Jez2013Attachment IconApproximation of Grammar-Based Compression via RecompressionProceedings ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Jez2013Attachment IconOne-Variable Word Equations in Linear TimeProceedings ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Jez2013Attachment IconRecompression: a simple and powerful technique for word equationsProceedings ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Jez2013Attachment IconRecompression: Word Equations and BeyondProceedings ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Jez, Maletti2013Hyepr-minimization for deterministic tree automataJournal ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Jez, Okhotin2013Unambiguous Conjunctive Grammars over a One-Letter AlphabetProceedings ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Jurkiewicz2013Attachment IconToward Better Computation Models for Modern MachinesThesis - Doctoral dissertationMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Jurkiewicz, Mehlhorn2013The cost of address translationProceedings ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Khosla2013Balls into Bins Made FasterProceedings ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Kobel, Sagraloff2013Fast Approximate Polynomial Multipoint Evaluation and ApplicationsElectronic Journal ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Geometry, Topology, and Algebra
Kollias2013Nonpreemptive Coordination Mechanisms for Identical MachinesElectronic Journal ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Megow, Mestre2013Instance-sensitive robustness guarantees for sequencing with unknown packing and covering constraintsProceedings ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Megow, Verschae2013Dual techniques for scheduling on a machine with varying speedProceedings ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Mehlhorn, Neumann, Schmidt2013Certifying 3-Edge-ConnectivityProceedings ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Mehlhorn, Sagraloff, Wang2013From Approximate Factorization to Root Isolation with Application to Cylindrical Algebraic DecompositionElectronic Journal ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Panagiotou, Pourmiri, Sauerwald2013Faster Rumor Spreading with Multiple CallsProceedings ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Panagiotou, Spöhel, Steger, Thomas2013Explosive percolation in {E}rdös-{R}ényi-like random graph processesJournal ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Saha, Saptharishi, Saxena2013Attachment IconA Case of Depth-3 Identity Testing, Sparse Factorization and DualityElectronic Journal ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Sanders, Singler, van Stee2013Attachment IconReal-time prefetching and cachingJournal ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Schmidt2013A Planarity Test via Construction SequencesProceedings ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Schmidt2013A Simple Test on 2-Vertex- and 2-Edge-ConnectivityJournal ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Schmidt2013Contractions, Removals and Certifying 3-Connectivity in Linear TimeJournal ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Schmidt2013Contractions, Removals and How to Certify 3-Connectivity in Linear TimeUnpublished/DraftMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Sviridenko, Wiese2013Approximating the Configuration-{LP} for Minimizing Weighted Sum of Completion Times on Unrelated MachinesProceedings ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
van Stee2013SIGACT News Online Algorithms Column 22Journal ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Wahlström2013Abusing the {T}utte Matrix: An Algebraic Instance Compression for the {K}-set-cycle ProblemElectronic Proceedings ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Winzen2013Direction-Reversing Quasi-Random Rumor Spreading with RestartsJournal ArticleMax-Planck-Institut für Informatik
Algorithms and Complexity Group
Yap, Sagraloff, Sharma2013Analytic Root Clustering: A Complete Algorithm using Soft Zero TestsUnpublished/DraftMax-Planck-Institut für Informatik
Algorithms and Complexity Group

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