max planck institut
informatik
informatik
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/Editor | Year | Title | Type | Unit / Correlation | |
|---|---|---|---|---|---|
| Abed, Huang | 2012 | Preemptive Coordination Mechanisms for Unrelated Machines | Proceedings Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Afshani, Agrawal, Doerr, Green Larsen, Mehlhorn, Winzen | 2012 | The Query Complexity of Finding a Hidden Permutation | Electronic Journal Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Agrawal, Saha, Saptharishi, Saxena | 2012 |  | Jacobian hits circuits: hitting-sets, lower bounds for {depth-D} occur-k formulas & depth-3 transcendence degree-k circuits | Proceedings Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group |
| Agrawal, Saha, Saxena | 2012 | | Quasi-polynomial Hitting-set for Set-depth-Delta Formulas | Electronic Journal Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group |
| Ailon, Avigdor-Elgrabli, Liberty, van Zuylen | 2012 | Improved Approximation Algorithms for Bipartite Correlation Clustering | Journal Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Ajwani, Elbassioni, Govindarajan, Ray | 2012 | Conflict-free coloring for rectangle ranges using O(n .382) colors | Journal Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Akbari, Berenbrink, Sauerwald | 2012 | A simple approach for adapting continuous load balancing processes to discrete settings | Proceedings Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Alcaraz, Friedrich, Kötzing, Krohmer, Müller, Pauling, Baumbach | 2012 | Efficient key pathway mining: combining networks and {OMICS} data | Journal Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Alvarez, Bringmann, Curticapean, Ray | 2012 | | Counting Crossing Free Structures | Proceedings Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group |
| Baruah, Bonifaci, D'Angelo, Li, Marchetti-Spaccamela, Megow, Stougie | 2012 | Scheduling Real-Time Mixed-Criticality Jobs | Journal Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Baumbach, Friedrich, Kötzing, Krohmer, Müller, Pauling | 2012 | Efficient algorithms for extracting biological key pathways with global constraints | Proceedings Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Becker | 2012 | The {Bolzano} Method to Isolate the Roots of a Bitstream Polynomial | Thesis - Bachelor thesis | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Belfrage, Mütze, Spöhel | 2012 | Probabilistic one-player {R}amsey games via deterministic two-player games | Journal Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Berberich, Emeliyanenko, Kobel, Sagraloff | 2012 | Exact Symbolic-Numeric Computation of Planar Algebraic Curves | Electronic Journal Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Berberich, Halperin, Kerber, Pogalnikova | 2012 | Deconstructing Approximate Offsets | Journal Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Bonifaci, Marchetti-Spaccamela | 2012 | | Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems | Journal Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group |
| Bonifaci, Marchetti-Spaccamela, Stiller | 2012 | | A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling | Journal Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group |
| Bonifaci, Mehlhorn, Varma | 2012 | Physarum Can Compute Shortest Paths | Journal Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Bonifaci, Mehlhorn, Varma | 2012 | Physarum Can Compute Shortest Paths | Proceedings Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Boros, Elbassioni, Gurvich, Makino | 2012 | Every Stochastic Game with Perfect Information Admits a Canonical Form | Unpublished/Draft | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Boros, Elbassioni, Gurvich, Makino | 2012 | On {Nash} equilibria and improvement cycles in pure positional strategies for {Chess}-like and {Backgammon}-like n-person games | Journal Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Brightwell, Panagiotou, Steger | 2012 | Extremal subgraphs of random graphs | Journal Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Bringmann | 2012 | | An improved algorithm for {Klee's} measure problem on fat boxes | Journal Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group |
| Bringmann, Friedrich | 2012 | Approximating the least hypervolume contributor: {NP-hard} in general, but fast in practice | Journal Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Bringmann, Friedrich | 2012 | | Convergence of Hypervolume-Based Archiving Algorithms {II}: Competitiveness | Proceedings Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group |
| Bringmann, Mehlhorn, Neumann | 2012 | | Remarks on Category-Based Routing in Social Networks | Unpublished/Draft | Max-Planck-Institut für Informatik Algorithms and Complexity Group |
| Bringmann, Panagiotou | 2012 | | Efficient Sampling Methods for Discrete Distributions | Proceedings Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group |
| Canzar, El-Kebir, Pool, Elbassioni, Malde, Mark, Geerke, Stougie, Klau | 2012 | Charge Group Partitioning in Biomolecular Simulation | Proceedings Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Case, Kötzing | 2012 | Computability-theoretic learning complexity | Journal Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Case, Kötzing | 2012 | Learning secrets interactively. {D}ynamic modeling in inductive inference | Journal Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Case, Kötzing | 2012 | Memory-limited {non-U-shaped} learning with solved open problems | Electronic Journal Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Chan, Lam, Lee, Ting | 2012 | Continuous Monitoring of Distributed Data Streams over a Time-Based Sliding Window | Journal Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Chan, Megow, Sitters, van Stee | 2012 | | A note on sorting buffers offline | Journal Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group |
| Chen, Doerr, Hu, Ma, van Stee, Winzen | 2012 | | The Price of Anarchy for Selfish Ring Routing is Two | Proceedings Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group |
| Croitoru | 2012 | Algorithmic aspects of abstract argumentation frameworks | Thesis - Master's thesis | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Croitoru, Kötzing | 2012 | Deliberative Acceptability of Arguments | Proceedings Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Cygan, Dell, Lokshtanov, Marx, Nederlof, Okamoto, Paturi, Saurabh, Wahlström | 2012 | On Problems as Hard as {CNF-SAT} | Proceedings Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Cygan, Kratsch, Pilipczuk, Pilipczuk, Wahlström | 2012 | Clique Cover and Graph Separation: {New} Incompressibility Results | Proceedings Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| De Sterck | 2012 | A Nonlinear {GMRES} Optimization Algorithm for Canonical Tensor Decomposition | Journal Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| De Sterck | 2012 | A Self-learning Algebraic Multigrid Method for Extremal Singular Triplets and Eigenpairs | Journal Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| De Sterck | 2012 | Steepest Descent Preconditioning for Nonlinear GMRES Optimization | Unpublished/Draft | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Doerr | 2012 | Black-box complexity: from complexity theory to playing mastermind | Proceedings Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Doerr, Doerr, Spöhel, Thomas | 2012 | Playing {Mastermind} with Many Colors | Electronic Journal Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Doerr, Fouz, Friedrich | 2012 | Asynchronous rumor spreading in preferential attachment graphs | Proceedings Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Doerr, Fouz, Friedrich | 2012 | Experimental analysis of rumor spreading in social networks | Proceedings Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Doerr, Fouz, Friedrich | 2012 | Why Rumors Spread Fast in Social Networks | Journal Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Doerr, Happ, Klein | 2012 | Crossover can provably be useful in evolutionary computation | Journal Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Doerr, Hota, Kötzing | 2012 | Ants easily solve stochastic shortest path problems | Proceedings Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Doerr, Johannsen, Winzen | 2012 | Multiplicative Drift Analysis | Journal Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Doerr, Johannsen, Winzen | 2012 | Non-existence of linear universal drift functions | Journal Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Doerr, Moran, Moran, Winzen | 2012 | Fast Fault Tolerant Rumor Spreading with Minimum Message Complexity | Electronic Journal Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Doerr, Pohl | 2012 | Run-time analysis of the (1+1) evolutionary algorithm optimizing linear functions over a finite alphabet | Proceedings Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Doerr, Winzen | 2012 | Black-box complexity: {Breaking} the {O}(n logn) barrier of {LeadingOnes} | Proceedings Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Doerr, Winzen | 2012 | Memory-restricted black-box complexity of {OneMax} | Journal Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Doerr, Winzen | 2012 | Playing {Mastermind} with Constant-Size Memory | Electronic Journal Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Doerr, Winzen | 2012 | Playing {Mastermind} with Constant-Size Memory | Electronic Proceedings Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Doerr, Winzen | 2012 | Reducing the arity in unbiased black-box complexity | Proceedings Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Duan, Mehlhorn | 2012 | A Combinatorial Polynomial Algorithm for the Linear {A}rrow-{D}ebreu Market | Electronic Journal Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Elbassioni | 2012 | A {QPTAS} for ε-Envy-Free Profit-Maximizing Pricing on Line Graphs | Proceedings Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Elbassioni, Fouad, Bertino | 2012 | Modeling the Risk & Utility of Information Sharing in Social Networks | Proceedings Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Elbassioni, Garg, Gupta, Kumar, Narula, Pal | 2012 | Approximation Algorithms for the Unsplittable Flow Problem on Paths and Trees | Electronic Proceedings Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Elbassioni, Jeli´c, Matijevi`c | 2012 | The relation of Connected Set Cover and Group {Steiner} Tree | Journal Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Elbassioni, Matijevic, Severdija | 2012 | Guarding 1.5{D} terrains with demands | Journal Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Elbassioni, Paluch, van Zuylen | 2012 | Simpler Approximation of the Maximum Asymmetric Traveling Salesman Problem | Electronic Proceedings Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Elbassioni, Raman, Ray, Sitters | 2012 | On the complexity of the highway problem | Journal Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Elbassioni, Tiwary | 2012 | Complexity of Approximating the Vertex Centroid of a Polyhedron | Journal Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Elmasry, Mehlhorn, Schmidt | 2012 | An {O}(n+m) Certifying Triconnnectivity Algorithm for {Hamiltonian} Graphs | Journal Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Emeliyanenko | 2012 | | Computing resultants on Graphics Processing Units: {Towards} {GPU}-accelerated computer algebra | Electronic Journal Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group |
| Emeliyanenko | 2012 | Harnessing the Power of {GPUs} for Problems in Real Algebraic Geometry | Thesis - Doctoral dissertation | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Emeliyanenko, Sagraloff | 2012 | On the Complexity of Solving a Bivariate Polynomial System | Proceedings Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Epstein, Jez, Sgall, van Stee | 2012 | | Online Scheduling of Jobs with Fixed Start Times on Related Machines | Proceedings Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group |
| Epstein, Levin, Marchetti-Spaccamela, Megow, Mestre, Skutella, Stougie | 2012 | Universal sequencing on an unreliable machine | Journal Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Epstein, Levin, van Stee | 2012 | | Approximation Schemes for Packing Splittable Items with Cardinality Constraints | Journal Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group |
| Epstein, van Stee | 2012 | | The price of anarchy on uniformly related machines revisited | Journal Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group |
| Feldmann | 2012 | Stochastic optimization with fitness proportional ant systems | Thesis - Bachelor thesis | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Fellows, Hermelin, Rosamond | 2012 | Well Quasi Orders in Subclasses of Bounded Treewidth Graphs and Their Algorithmic Applications | Journal Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Fountoulakis, Panagiotou | 2012 | Tight Load Thresholds for Cuckoo Hashing | Journal Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Fountoulakis, Panagiotou, Sauerwald | 2012 | Ultra-fast rumor spreading in social networks | Proceedings Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Fouz | 2012 | Randomized Rumor Spreading in Social Networks & Complete Graphs | Thesis - Doctoral dissertation | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Friedrich, Gairing, Sauerwald | 2012 | Quasirandom Load Balancing | Journal Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Friedrich, Kroeger, Neumann | 2012 | Weighted preferences in evolutionary multi-objective optimization | Electronic Journal Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Gawrychowski | 2012 | Faster Algorithm for Computing the Edit Distance between {SLP}-Compressed Strings | Proceedings Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Gawrychowski | 2012 | Simple and efficient {LZW}-compressed multiple pattern matching | Proceedings Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Gawrychowski | 2012 | Tying up the loose ends in fully {LZW}-compressed pattern matching | Electronic Proceedings Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Giakkoupis, Sauerwald | 2012 | Rumor spreading and vertex expansion | Proceedings Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Giakkoupis, Sauerwald, Sun, Woelfel | 2012 | Low Randomness Rumor Spreading via Hashing | Electronic Proceedings Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Giannopoulos, Knauer, Wahlström, Werner | 2012 | Hardness of discrepancy computation and ε-net verification in high dimension | Journal Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Gnewuch, Wahlström, Winzen | 2012 | A New Randomized Algorithm to Approximate the Star Discrepancy Based on Threshold Accepting | Journal Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Harren, Kern | 2012 | Improved Lower Bound for Online Strip Packing | Proceedings Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Harren, van Stee | 2012 | Absolute Approximation Ratios for Packing Rectangles into Bins | Journal Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Heinz, Kasprzik, Kötzing | 2012 | Learning in the limit with lattice-structured hypothesis spaces | Journal Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Hermelin, Mestre, Rawitz | 2012 | Optimization Problems in Dotted Interval Graphs | Proceedings Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Hermelin, Mnich, van Leeuwen | 2012 | Parameterized complexity of induced {H}-matching on claw-free graphs | Proceedings Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Hermelin, Rizzi, Vialette | 2012 | Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph | Proceedings Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Hermelin, Wu | 2012 | Weak compositions and their applications to polynomial lower bounds for kernelization | Proceedings Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Heydrich | 2012 | Dividing connected chores fairly | Thesis - Bachelor thesis | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Höhn, Jacobs, Megow | 2012 | On {Eulerian} extensions and their application to no-wait flowshop scheduling | Journal Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Huang | 2012 | Non-preemptive Speed Scaling | Proceedings Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Jain, Kötzing, Stephan | 2012 | Enlarging Learnable Classes | Proceedings Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Kane, Mehlhorn, Sauerwald, Sun | 2012 | Counting Arbitrary Subgraphs in Data Streams | Proceedings Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Kavitha, Mestre | 2012 | Max-coloring paths: tight bounds and extensions | Journal Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Kayal, Saha | 2012 | | On the Sum of Square Roots of Polynomials and Related Problems | Journal Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group |
| Kerber, Sagraloff | 2012 | A worst-case bound for topology computation of algebraic curves | Journal Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Kim, Paul, Philip | 2012 | | A Single-exponential {FPT} Algorithm for the {K4}-Minor Cover Problem | Proceedings Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group |
| Knauer, Schlipf, Schmidt, Tiwary | 2012 | Largest Inscribed Rectangles in Convex Polygons | Journal Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Kollias | 2012 | Nonpreemptive Coordination Mechanisms for Identical Machines | Electronic Journal Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Kötzing, Molter | 2012 | {ACO} beats {EA} on a dynamic pseudo{-B}oolean function | Proceedings Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Kötzing, Neumann, Röglin, Witt | 2012 | Theoretical analysis of two {ACO} approaches for the traveling salesman problem | Journal Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Kötzing, Sutton, Neumann, O'Reilly | 2012 | The max problem revisited: the importance of mutation in genetic programming | Proceedings Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Kratsch, Pilipczuk, Pilipczuk, Wahlström | 2012 | Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs | Proceedings Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Kratsch, Wahlström | 2012 | Compression via matroids: a randomized polynomial kernel for odd cycle transversal | Proceedings Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Kratsch, Wahlström | 2012 | Representative Sets and Irrelevant Vertices: New Tools for Kernelization | Proceedings Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Krivelevich, Spöhel | 2012 | Creating small subgraphs in {A}chlioptas processes with growing parameter | Journal Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Krohmer | 2012 | Finding cliques in scale-free networks | Thesis - Master's thesis | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Lokshtanov, Saurabh, Wahlström | 2012 | Subexponential Parameterized Odd Cycle Transversal on Planar Graphs | Electronic Proceedings Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Megow, Mehlhorn, Schweitzer | 2012 | Online Graph Exploration: New Results on Old and New Algorithms | Journal Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Megow, Skutella, Verschae, Wiese | 2012 | The Power of Recourse for Online {MST} and {TSP} | Proceedings Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Mehlhorn, Neumann, Schmidt | 2012 | | Certifying 3-Edge-Connectivity | Unpublished/Draft | Max-Planck-Institut für Informatik Algorithms and Complexity Group |
| Meyerhenke, Sauerwald | 2012 | Beyond Good Partition Shapes: An Analysis of Diffusive Graph Partitioning | Journal Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Misra, Philip, Raman, Saurabh | 2012 | | On Parameterized Independent Feedback Vertex Set | Journal Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group |
| Misra, Philip, Raman, Saurabh, Sikdar | 2012 | | {FPT} Algorithms for Connected Feedback Vertex Set | Journal Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group |
| Mnich, Philip, Saurabh, Suchy | 2012 | | Beyond Max-Cut: lambda-Extendible Properties Parameterized Above the {Poljak-Turzík} Bound | Electronic Proceedings Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group |
| Molter | 2012 | {ACO} beats {EA} on a dynamic pseudo-{Boolean} function | Thesis - Master's thesis | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Moran | 2012 | Shattering extremal systems | Thesis - Master's thesis | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Nor, Hermlin, Charlat, Engelstadter, Reuter, Duron, Sagot | 2012 | Mod/Resc Parsimony Inference: Theory and application | Journal Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Ott | 2012 | Thou shalt not lie : on truthfully maximizing the minimum load on selfish related machines | Thesis - Master's thesis | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Panagiotou, Coja-Oghlan | 2012 | Catching the k-{NAESAT} Threshold | Proceedings Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Panagiotou, Sinha | 2012 | Vertices of degree k in random unlabeled trees | Journal Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Philip, Raman, Sikdar | 2012 | Polynomial kernels for dominating set in graphs of bounded degeneracy and beyond | Journal Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| P. Gao | 2012 | Distribution of the number of spanning regular subgraphs in random graphs | Unpublished/Draft | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| P. Gao | 2012 | Distributions of sparse spanning subgraphs in random graphs | Unpublished/Draft | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| P. Gao | 2012 | Uniform generation of d-factors in dense host graphs | Unpublished/Draft | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Qian, Schalekamp, Williamson, van Zuylen | 2012 | On the Integrality Gap of the Subtour {LP} for the 1,2-{TSP} | Proceedings Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Sagraloff | 2012 | Exaktes geometrisches Rechnen | Miscellaneous | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Sagraloff | 2012 | When {N}ewton meets {D}escartes: A Simple and Fast Algorithm to Isolate the Real Roots of a Polynomial | Proceedings Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Saha, Saptharishi, Saxena | 2012 | | A Case of Depth-3 Identity Testing, Sparse Factorization and Duality | Electronic Journal Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group |
| Sauerwald, Sun | 2012 | Tight Bounds For Randomized Load Balancing on Arbitrary Network Topologies | Proceedings Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Schalekamp, Williamson, van Zuylen | 2012 | A proof of the {B}oyd-{C}arr conjecture | Proceedings Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Schmidt | 2012 | Certifying 3-Connectivity in Linear Time | Proceedings Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Schmidt | 2012 | Construction Sequences and Certifying 3-Connectivity | Journal Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Schmidt, Valtr | 2012 | Cubic Plane Graphs on a Given Point Set | Proceedings Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Soranzo, Ramezani, Iacono, Altafini | 2012 | Decompositions of large-scale biological systems based on dynamical properties | Journal Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| van Stee | 2012 | | An improved algorithm for online rectangle filling | Journal Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group |
| van Stee | 2012 | | {SIGACT} {News} Online Algorithms Column 20: The Power of Harmony | Journal Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group |
| van Stee | 2012 | | {SIGACT} {News} Online Algorithms Column 21: {APPROX} and {ALGO} | Journal Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group |
| van Zuylen | 2012 | Simpler 3/4-approximation algorithms for {MAX} {SAT} | Proceedings Article | Max-Planck-Institut für Informatik Algorithms and Complexity Group | |
| Wang | 2012 | Certification of Curve Arrangements | Thesis - Master's thesis | Max-Planck-Institut für Informatik Algorithms and Complexity Group |