| # |  | | | Title | BibTeX cite key | |
|---|
| 1 |
 | ?? |
| |
| 1 |
|
| Elbassioni, Rauf, Ray [Rauf] |
| |
| | | | On Enumerating Minimal Transversals of Geometric Hypergraphs | Elbassioni2012d | |
| 3 |
| |
| 1 |
|
| Bei [Chen, Zhang, Halldórsson, Iwama, Kobayashi, Speckmann] |
| |
| | | | Solving Linear Programming with Constraints Unknown
In: Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I., 129-142 | Bei2015 | |
| 1 |
|
| Heydrich, van Stee [van Stee] |
| |
| | | | Dividing Connected Chores Fairly
In: Theoretical Computer Science [593], 51-61 | Heydrich2015 | |
| 1 |
|
| Issac [Bhattacharya, Jaiswal, Kumar, Xu, Du, Du] |
| |
| | | | Sampling in Space Restricted Settings
In: Computing and Combinatorics 2015, | Issac2015Sampling | |
| 12 |
| 2014 |
| |
| 1 |
|
| Babenko, Gawrychowski, Kociumaka, Starikovskaya [Babenko, Gawrychowski, Kociumaka, Starikovskaya, Kulikov, Kuznetsov, Pevzner] |
| |
| | | | Computing Minimal and Maximal Suffixes of a Substring Revisited
In: Combinatorial Pattern Matching - 25th Annual Symposium, CPM 2014, Moscow, Russia, June 16-18, 2014. Proceedings, 30-39 | Gawrychowski2014d | |
| 1 |
|
| Bringmann, Sauerwald, Stauffer, Sun [Sauerwald, Stauffer] |
| |
| | | | Balls into bins via local search: cover time and maximum load
In: 31st Symposium on Theoretical Aspects of Computer Science (STACS-14), accepted | BringmannSSS14 | |
| 1 |
|
| Diekert, Jez, Plandowski [Diekert, Plandowski, Hirsch, Kuznetsov, Pin, Vereshchagin] |
| |
| | | | Finding All Solutions of Equations in Free Groups and Monoids with Involution
In: 9th International Computer Science Symposium in Russia (CSR 2014), 1-15 | Jez2014CSR | |
| 1 |
|
| Fekete, Fiethe, Friedrichs, Michalik, Orlis [Fekete, Fiethe, Friedrichs, Michalik, Orlis] |
| |
| | | | Efficient reconfiguration of processing modules on FPGAs for space instruments
In: Adaptive Hardware and Systems (AHS), 2014 NASA/ESA Conference on, 15-22 | fffmo-eropmoffsi-14 | |
| 1 |
|
| Friedrichs, Kulau, Wolf [Friedrichs, Kulau, Wolf] |
| |
| | | | Energy-efficient voltage scheduling of peripheral components on wireless sensor nodes
In: Communications Workshops (ICC), 2014 IEEE International Conference on, 860-865 | fkw-eevsopcowsn-14 | |
| 1 |
|
| Gagie, Gawrychowski, Kärkkäinen, Nekrich, Puglisi [Gagie, Kärkkäinen, Nekrich, Puglisi, Parso, Viola] |
| |
| | | | LZ77-Based Self-indexing with Faster Pattern Matching
In: LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31 - April 4, 2014. Proceedings, 731-742 | Gawrychowski2014a | |
| 1 |
|
| Gawrychowski, Jez, Jez [Jez] |
| |
| | | | Validating the Knuth-Morris-Pratt Failure Function, Fast and Online
In: Theory of Computing Systems [54], 337-372 | GawrychowskiJez2014 | |
| 1 |
|
| Gawrychowski, Manea, Nowotka [Manea, Nowotka, Mayr, Portier] |
| |
| | | | Testing Generalised Freeness of Words
In: 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 337-349 | Gawrychowski2014 | |
| 1 |
|
| Gawrychowski, Mozes, Weimann [Mozes, Weimann, Esparza, Fraigniaud, Husfeldt, Koutsoupias] |
| |
| | | | Improved Submatrix Maximum Queries in Monge Matrices
In: Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I, 525-537 | Gawrychowski2014b | |
| 1 |
|
| Gawrychowski, Uznanski [Uznanski, Kulikov, Kuznetsov, Pevzner] |
| |
| | | | Order-Preserving Pattern Matching with k Mismatches
In: Combinatorial Pattern Matching - 25th Annual Symposium, CPM 2014, Moscow, Russia, June 16-18, 2014. Proceedings, 130-139 | Gawrychowski2014c | |
| 1 |
|
| Jez, Lohrey [Lohrey, Mayr, Portier] |
| |
| | |  | Approximation of smallest linear tree grammar
In: 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 445-457 | Jez2014STACS | |
| 1 |
|
| |
| | | | Computational completeness of equations over sets of natural numbers
In: Information and Computation [237], 56-94 | Jez2008ICALP | |
| 65 |
| |
| 1 |
|
| Afshani, Agrawal, Doerr, Doerr, Larsen, Mehlhorn [Afshani, Agrawal, Larsen, Brodnik, López-Ortiz, Raman, Viola] |
| |
| | | | The Query Complexity of Finding a Hidden Permutation
In: Space-Efficient Data Structures, Streams, and Algorithms, 1-11 | Afshani2013 | |
| 1 |
|
| Agrawal, Saha, Saxena [Agrawal, Saxena] |
| |
| | | | A Case of Depth-3 Identity Testing, Sparse Factorization and Duality
In: 45th ACM Symposium on the Theory of Computing (STOC-13), toappear | SSS13 | |
| 1 |
|
| Alkassar, Böhme, Mehlhorn, Rizkallah [Alkassar, Böhme] |
| |
| | | | A Framework for the Verification of Certifying Computations | VerificationCertComp12 | |
| 1 |
|
| Alvarez, Bringmann, Ray, Seidel [Alvarez, Ray, Seidel] |
| |
| | | | Counting Triangulations Approximately
In: 25th Canadian Conference on Computational Geometry (CCCG-13), 85-89 | AlvarezBRS13 | |
| 1 |
|
| Anagnostopoulos, Grandoni, Leonardi, Wiese [Anagnostopoulos, Grandoni, Leonardi] |
| |
| | | | Constant Integrality Gap LP formulations of Unsplittable Flow on a Path
In: Proceedings of the 16th Conference on Integer Programming and Combinatorial Optimization (IPCO 2013), | Anagnostopoulos2013 | |
| 1 |
|
| Anand, Bringmann, Friedrich, Garg, Kumar [Friedrich, Garg, Kumar, Fomin, Freivalds, Kwiatkowska, Peleg] |
| |
| | | | Minimizing maximum (weighted) flow-time on related and unrelated machines
In: Automata, Languages, and Programming - 40th International Colloquium (ICALP-13), 13-24 | AnandBFGK13 | |
| 1 |
|
| Anshelevich, Bhardwaj, Hoefer [Anshelevich, Bhardwaj, Bodlaender, Italiano] |
| |
| | | | Friendship and Stable Matching.
In: 21st European Symposium on Algorithms (ESA-13), 49-60 | AnshelevichBH2013 | |
| 1 |
|
| Antoniadis, Huang, Ott, Verschae [Antoniadis, Huang, Verschae, Chatterjee, Sgall] |
| |
| | | | How to Pack Your Items When You Have to Buy Your Knapsack
In: Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, 62-73 | Ott2013 | |
| 1 |
|
| Bannai, Gawrychowski, Inenaga, Takeda [Bannai, Inenaga, Takeda, Fischer, Sanders] |
| |
| | | | Converting SLP to LZ78 in almost Linear Time
In: Combinatorial Pattern Matching, 24th Annual Symposium (CPM 2013), 38-49 | Gawrychowski2013converting | |
| 1 |
|
| Bogdan, Sauerwald, Stauffer, Sun [Bogdan, Stauffer, ] |
| |
| | | | Balls into Bins via Local Search
In: 24th ACM-SIAM Symposium on Discrete Algorithms (SODA-13), 16-34 | BogdanSSS2012 | |
| 1 |
|
| Bonifaci, Marchetti-Spaccamela, Megow, Wiese [Bonifaci, Marchetti-Spaccamela] |
| |
| | | | Polynomial-Time Exact Schedulability Tests for Harmonic Real-Time Tasks
In: Proceedings of the 34th IEEE Real-Time Systems Symposium (RTSS 2013), | Bonifaci2013b | |
| 1 |
|
| Bonifaci, Marchetti-Spaccamela, Stiller, Wiese [Bonifaci, Marchetti-Spaccamela, Stiller] |
| |
| | | | Feasibility Analysis in the Sporadic DAG Task Model
In: Proceedings of the 25th Euromicro Conference on Real-Time Systems (ECRTS 2013), | Bonifaci2013 | |
| 1 |
|
| Bringmann, Doerr, Neumann, Sliacan [Sliacan, Fomin, Freivalds, Kwiatkowska, Peleg] |
| |
| | | | Online Checkpointing with Improved Worst-Case Guarantees
In: Automata, Languages, and Programming - 40th International Colloquium (ICALP 2013), 255-266 | BringmannDoerrNeumannSliacan2013 | |
| 1 |
|
| Bringmann, Engels, Manthey, Raghavendra Rao [Engels, Manthey, Raghavendra Rao, Chatterjee, Sgall] |
| |
| | | | Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems
In: 38th International Symposium on Mathematical Foundations of Computer Science (MFCS-13), 219-230 | BringmannEMR13 | |
| 1 |
|
| Bringmann, Friedrich [Friedrich, Fomin, Freivalds, Kwiatkowska, Peleg] |
| |
| | | | Exact and Efficient Generation of Geometric Random Variates and Random Graphs
In: Automata, Languages, and Programming - 40th International Colloquium (ICALP-13), 267-278 | BringmannF13-2 | |
| 2 |
|
| Bringmann, Friedrich [Friedrich] |
| |
| | | | Approximation Quality of the Hypervolume Indicator
In: Artificial Intelligence [195], 265–290 | BringmannFjournal13 | |
| | | | Parameterized Average-Case Complexity of the Hypervolume Indicator
In: 15th Annual Conference on Genetic and Evolutionary Computation (GECCO-13), 575-582 | BringmannF13 | |
| 1 |
|
| Bringmann, Friedrich, Igel, Voß [Friedrich, Igel, Voß] |
| |
| | | | Speeding Up Many-Objective Optimization by Monte Carlo Approximations
In: Artificial Intelligence [204], 22–29 | BringmannFIV13 | |
| 1 |
|
| Bringmann, Green Larsen [Green Larsen] |
| |
| | | | Succinct Sampling from Discrete Distributions
In: 45th ACM Symposium on Theory of Computing (STOC-13), 775-782 | BringmannGL | |
| 1 |
|
| |
| | | | Dichotomy for Holant* Problems with a Function on Domain Size 3
In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 1278-1295 | Xia2013-soda-clx | |
| 1 |
|
| |
| | | | Memory-limited non-U-shaped learning with solved open problems
In: Theoretical Computer Science [473], 100-123 | CaseKoetzing2012:MemLim | |
| 1 |
|
| Chen, Epstein, Kleiman, van Stee [Chen, Epstein, Kleiman] |
| |
| | | | Maximizing the minimum load: The cost of selfishness
In: Theoretical Computer Science [482], 9-19 | ChEpKS13 | |
| 1 |
|
| Christodoulou, Kovacs, van Stee [Christodoulou, Kovacs] |
| |
| | | | A truthful constant approximation for maximizing the minimum load on related machines
In: Theoretical Computer Science [489-490], 88-98 | ChKoSt2013 | |
| 1 |
|
| Clementi, Crescenzi, Doerr, Fraigniaud, Isopi, Panconesi, Pasquale, Silvestri [Clementi, Crescenzi, Fraigniaud, Isopi, Panconesi, Pasquale, Silvestri] |
| |
| | | | Rumor Spreading in Random Evolving Graphs
In: Proc. of the 21st European Symposium on Algorithms (ESA 2013), 325-336 | Winzen2013z | |
| 1 |
|
| Clementi, Crescenzi, Doerr, Fraigniaud, Pasquale, Silvestri [Clementi, Crescenzi, Fraigniaud, Pasquale, Silvestri] |
| |
| | | | Diffusion probabiliste dans les reseaux dynamiques
In: Proc. of the 15èmes Rencontres Francophones pour les Aspects Algorithmiques des Télécommunications (AlgoTel 2013), | DynamicGraphRumor | |
| 1 |
|
| Curticapean, Künnemann [Curticapean, Bodlaender, Italiano] |
| |
| | | | A Quantization Framework for Smoothed Analysis of Euclidean Optimization Problems
In: 21st Annual European Symposium on Algorithms (ESA 2013), 349-360 | CurticapeanK2013 | |
| 1 |
|
| Dams, Hoefer, Kesselheim [Dams, Kesselheim, Afek] |
| |
| | | | Sleeping Experts in Wireless Networks
In: 27th International Symposium on Distributed Computing (DISC-13), 344-357 | DamsHK2013 | |
| 1 |
|
| Doerr, De Rainville [De Rainville] |
| |
| | | | Constructing Low Star Discrepancy Point Sets with Genetic Algorithms
In: Proc. of Genetic and Evolutionary Computation Conference (GECCO 2013), 789-796 | DoerrDR2013 | |
| 1 |
|
| Doerr, Doerr, Spöhel, Thomas [Doerr, Doerr, Spöhel, Thomas] |
| |
| | | | Playing Mastermind with Many Colors
In: arXiv [abs/1207.0773], 1-22 | Doerr2012x | |
| 1 |
|
| Doerr, Gnewuch, Wahlström [Gnewuch, Chen, Srivastav, Travaglini] |
| |
| | | | Calculation of Discrepancy Measures and Applications
In: A Panorama of Discrepancy Theory, 1-55 | GnewuchWW13 | |
| 1 |
|
| Doerr, Goldberg [Goldberg] |
| |
| | | | Adaptive Drift Analysis
In: Algorithmica [65], 224-250 | DoerrG13algo | |
| 1 |
|
| Doerr, Huber, Levavi [Huber, Levavi] |
| |
| | | | Strong robustness of randomized rumor spreading protocols
In: Discrete Applied Mathematics [161], 778-793 | DoerrHL13 | |
| 1 |
|
| Doerr, Jansen, Sudholt, Winzen, Zarges [Jansen, Sudholt, Zarges] |
| |
| | | | Mutation rate matters even when optimizing monotonic functions
In: Evolutionary Computation [21], 1-27 | DoerrJSWZ13EvCo | |
| 1 |
|
| Doerr, Johannsen, Kötzing, Neumann, Theile [Johannsen, Neumann, Theile] |
| |
| | | | More effective crossover operators for the all-pairs shortest path problem
In: Theoretical Computer Science [471], 12-26 | DoerrJKNT13 | |
| 1 |
|
| Doerr, Kötzing, Lengler, Winzen [Lengler] |
| |
| | | | Black-Box Complexities of Combinatorial Problems
In: Theoretical Computer Science [471], 84-106 | DoerrKLW13 | |
| 1 |
|
| Doerr, Spöhel, Thomas, Winzen [Thomas] |
| |
| | | | Playing Mastermind with many colors
In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013), 695-704 | DoerrSTW13 | |
| 1 |
|
| Doerr, Sudholt, Witt [Sudholt, Witt] |
| |
| | | | When Do Evolutionary Algorithms Optimize Separable Functions in Parallel?
In: ACM/SIGEVO Foundations of Genetic Algorithms (FOGA 2013), 51-63 | DoerrSW2013FOGA | |
| 1 |
|
| Elbassioni, Chalermsook, Nanongkai, Sun [Chalermsook, Nanongkai] |
| |
| | | | Multi-Attribute Profit-Maximizing Pricing | Elbassioni2013a | |
| 1 |
|
| Epstein, Levin, van Stee [Epstein, Levin, ] |
| |
| | | | A unified approach to truthful scheduling on related machines
In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, 1243-1252 | EpLeSt13 | |
| 1 |
|
| Fanghänel, Geulen, Hoefer, Vöcking [Fanghänel, Geulen, Vöcking] |
| |
| | | | Online Capacity Maximization in Wireless Networks
In: Journal of Scheduling [16], 81-91 | FanghaenelGHV2013 | |
| 1 |
|
| Fekete, Friedrichs, Kröller, Schmidt [Fekete, Friedrichs, Kröller, Schmidt, Du, Zhang] |
| |
| | | | Facets for Art Gallery Problems
In: Computing and Combinatorics, 208-220 | ffks-ffagp-13 | |
| 1 |
|
| Fountoulakis, Panagiotou [Steger] |
| |
| | | | On the Insertion Time of Cuckoo Hashing
In: SIAM Journal on Computing [?], ?-? | FPSSICOMP2013 | |
| 1 |
|
| Gagie, Gawrychowski, Nekrich [Gagie, Nekrich] |
| |
| | | | Heaviest Induced Ancestors and Longest Common Substrings
In: 25th Canadian Conference on Computational Geometry (CCCG 13), 145-150 | Gawrychowski2013ancestors | |
| 1 |
|
| Gawrychowski, Kucherov, Nekrich, Starikovskaya [Kucherov, Nekrich, Starikovskaya, Kurland, Lewenstein, Porat] |
| |
| | | | Minimal Discriminating Words Problem Revisited
In: String Processing and Information Retrieval - 20th International Symposium (SPIRE 2013), | Gawrychowski2013discriminating | |
| 1 |
|
| Gawrychowski, Manea, Mercas, Nowotka, Tiseanu [Manea, Mercas, Nowotka, Tiseanu, Portier, Wilke] |
| |
| | | | Finding Pseudo-repetitions
In: 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), 257-268 | Gawrychowski2013 | |
| 1 |
|
| Gawrychowski, Manea, Nowotka [Manea, Nowotka, Bonizzoni, Brattka, Lowe] |
| |
| | | | Discovering Hidden Repetitions in Words
In: 9th Conference on Computability in Europe (CiE 2013), 210-219 | Gawrychowski2013discovering | |
| 1 |
|
| Gawrychowski, Straszak [Straszak, Cai, Cheng, Lam] |
| |
| | | | Beating O(nm) in Approximate LZW-Compressed Pattern Matching
In: Algorithms and Computation - 24th International Symposium (ISAAC 2013), 78-88 | Gawrychowski2013beating | |
| 1 |
|
| Günther, Maurer, Megow, Wiese [Günther, Maurer] |
| |
| | | | A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio
In: 24st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013), | MegowWiese-SODA2013 | |
| 1 |
|
| Harks, Hoefer, Klimm, Skopalik [Harks, Klimm, Skopalik] |
| |
| | | | Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games
In: Mathematical Programming [141], 193-215 | HarksHKS2013 | |
| 1 |
|
| Heydrich, van Stee [Heydrich, Voecking] |
| |
| | | | Dividing connected chores fairly
In: 6th International Symposium on Algorithmic Game Theory, 420-433 | HeySte13 | |
| 1 |
|
| Hoefer, Kesselheim [Kesselheim] |
| |
| | | | Brief Announcement: Universally Truthful Secondary Spectrum Auctions
In: 25th Symposium on Parallelism in Algorithms and Architectures (SPAA-13), 99-101 | HoeferK2013 | |
| 1 |
|
| Hoefer, Kesselheim, Vöcking [Kesselheim, Vöcking] |
| |
| | | | Truthfulness and Stochastic Dominance with Monetary Transfers.
In: 14th Conf. Electronic Commerce (EC-13), 567-582 | HoeferKV2013 | |
| 2 |
|
| Hoefer, Skopalik [Skopalik] |
| |
| | | | Altruism in Atomic Congestion Games
In: ACM Transactions on Economics and Computation [1], 21 | HoeferS-TEAC-2013 | |
| | | | On the Complexity of Pareto-optimal Nash and Strong Equilibria
In: Theory of Computing Systems [53], 441-453 | HoeferS-TOCS-2013 | |
| 1 |
|
| Hoefer, Wagner [Wagner, Chen, Immorlica] |
| |
| | | | Designing Profit Shares in Matching and Coalition Formation Games
In: 9th Conference on Web and Internet Economics (WINE-13), 249-262 | HoeferW-WINE-2013 | |
| 1 |
|
| Hoefer, Wagner [Wagner, Fomin, Freivalds, Kwiatkowska, Peleg] |
| |
| | | | Locally Stable Marriage with Strict Preferences
In: 40th International Colloquium on Automata, Languages and Programming (ICALP-13), 620-631 | HoeferW2013 | |
| 1 |
|
| Jez, Maletti [Maletti] |
| |
| | | | Hyper-minimization for deterministic tree automata
In: International Journal of Foundations of Computer Science [24], 815-830 | JezMaletti2013 | |
| 1 |
|
| Jez, Okhotin [Okhotin, Beal, Carton] |
| |
| | | | Unambiguous Conjunctive Grammars over a One-Letter Alphabet
In: 17th International Conference on Developments in Language Theory (DLT 2013), 277-288 | Jez2013DLT | |
| 1 |
|
| Megow, Mestre [Mestre] |
| |
| | | | Instance-sensitive robustness guarantees for sequencing with unknown packing and covering constraints
In: 4th Conference on Innovations in Theoretical Computer Science (ITCS 2013), | MegowMestre2013 | |
| 1 |
|
| Megow, Verschae [Verschae] |
| |
| | | | Dual techniques for scheduling on a machine with varying speed
In: Proc. of the 40th International Colloquium on Automata, Languages and Programming (ICALP 2013), 745–756 | MegowV2013 | |
| 1 |
|
| Panagiotou, Spöhel, Steger, Thomas [Steger, Thomas] |
| |
| | | | Explosive percolation in Erdös-Rényi-like random graph processes
In: Combinatorics, Probability and Computing [22], 133-145 | SpoehelPST2013 | |
| 1 |
|
| Saha, Saptharishi, Saxena [Saptharishi, Saxena] |
| |
| | | | A Case of Depth-3 Identity Testing, Sparse Factorization and Duality
In: Computational Complexity [22], 39-69 | SSS12 | |
| 1 |
|
| Sanders, Singler, van Stee [Sanders, Singler] |
| |
| | | | Real-time prefetching and caching
In: Journal of Scheduling [16], 47-58 | SaSiSt13 | |
| 1 |
|
| Sviridenko, Wiese [Sviridenko, Goemans] |
| |
| | | | Approximating 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), | SviridenkoWiese2013 | |
| 1 |
|
| Yap, Sagraloff, Sharma [Yap, Sharma] |
| |
| | | | Analytic Root Clustering: A Complete Algorithm using Soft Zero Tests | YSSSoftpredicates2013 | |
| 95 |
| 2012 |
| |
| 1 |
|
| Abed, Huang [Huang, Epstein, Ferragina] |
| |
| | | | Preemptive Coordination Mechanisms for Unrelated Machines
In: Algorithms - ESA 2012 : 20th Annual European Symposium, 12-23 | Abed2012 | |
| 1 |
|
| Afshani, Agrawal, Doerr, Green Larsen, Mehlhorn, Winzen [Afshani, Agrawal, Green Larsen] |
| |
| | | | The Query Complexity of Finding a Hidden Permutation
In: Electronic Colloquium on Computational Complexity (ECCC): Report Series [87 (Revision 1)], 1-36 | AfshaniADGLMW12eccc | |
| 1 |
|
| Agrawal, Saha, Saptharishi, Saxena [Agrawal, Saptharishi, Saxena] |
| |
| | | | Jacobian hits circuits: hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits
In: STOC'12 : Proceedings of the 2012 ACM Symposium on Theory of Computing, 599-614 | ASSS12 | |
| 1 |
|
| Agrawal, Saha, Saxena [Agrawal, Saxena] |
| |
| | | | Quasi-polynomial Hitting-set for Set-depth-Delta Formulas
In: arXiv [abs/1209.2333], 1-13 | ASS12 | |
| 1 |
|
| Ailon, Avigdor-Elgrabli, Liberty, van Zuylen [Ailon, Avigdor-Elgrabli, Liberty] |
| |
| | | | Improved Approximation Algorithms for Bipartite Correlation Clustering
In: SIAM Journal on Computing [41], 1110-1121 | Ailon2012 | |
| 1 |
|
| Ajwani, Elbassioni, Govindarajan, Ray [Ajwani, Govindarajan] |
| |
| | | | Conflict-free coloring for rectangle ranges using O(n .382) colors
In: Discrete & Computational Geometry [48], 39-52 | Ajwani2012 | |
| 1 |
|
| Akbari, Berenbrink, Sauerwald [Akbari, Berenbrink, Kowalski, Panconesi] |
| |
| | | | A simple approach for adapting continuous load balancing processes to discrete settings
In: PODC'12 : Proceedings of the 2012 ACM Symposium on Principles of Distributed Computing, 271-280 | AkbariBS2012 | |
| 1 |
|
| Alcaraz, Friedrich, Kötzing, Krohmer, Müller, Pauling, Baumbach [Krohmer] |
| |
| | | | Efficient key pathway mining: combining networks and OMICS data
In: Integrative Biology [4], 756-764 | AlcarayFKKMPB2012 | |
| 1 |
|
| Alvarez, Bringmann, Curticapean, Ray [Alvarez, Curticapean, Dey, Whitesides] |
| |
| | | | Counting Crossing Free Structures
In: Proceedings of the Twenty-Eight Annual Symposium on Computational Geometry (SCG'12), 61-68 | AlvarezBCS12 | |
| 1 |
|
| Baruah, Bonifaci, D'Angelo, Li, Marchetti-Spaccamela, Megow, Stougie [Baruah, Bonifaci, D'Angelo, Li, Marchetti-Spaccamela, Stougie] |
| |
| | | | Scheduling Real-Time Mixed-Criticality Jobs
In: IEEE Transactions on Computers [61], 1140-1152 | Megow2011-MCsched | |
| 1 |
|
| Baumbach, Friedrich, Kötzing, Krohmer, Müller, Pauling [Krohmer] |
| |
| | | | Efficient algorithms for extracting biological key pathways with global constraints
In: GECCO'12 : Proceedings of the Fourteenth International Conference on
Genetic and Evolutionary Computation, 169-176 | BaumbachFKKMP2011 | |
| 1 |
|
| Belfrage, Mütze, Spöhel [Belfrage, Mütze] |
| |
| | | | Probabilistic one-player Ramsey games via deterministic two-player games
In: SIAM Journal on Discrete Mathematics [26], 1031-1049 | SpoehelBM2012 | |
| 1 |
|
| Berberich, Halperin, Kerber, Pogalnikova [Halperin, Kerber, Pogalnikova] |
| |
| | | | Deconstructing Approximate Offsets
In: Discrete & Computational Geometry [48], 964-989 | bhkp-deconstruct-journal-2012 | |
| 1 |
|
| Bonifaci, Chan, Marchetti-Spaccamela, Megow [Bonifaci, Chan, Marchetti-Spaccamela] |
| |
| | | | Algorithms and Complexity for Periodic Real-Time Scheduling
In: ACM Transactions on Algorithms [9], 601-619 | BonifaciCMM2012 | |
| 1 |
|
| Bonifaci, Marchetti-Spaccamela [Marchetti-Spaccamela] |
| |
| | | | Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems
In: Algorithmica [63], 763-780 | Bonifaci2011:b | |
| 1 |
|
| Bonifaci, Marchetti-Spaccamela, Stiller [Marchetti-Spaccamela, Stiller] |
| |
| | | | A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling
In: Algorithmica [62], 1034-1049 | Bonifaci2012b | |
| 1 |
|
| Bonifaci, Mehlhorn, Varma [Varma, Ravani] |
| |
| | | | Physarum Can Compute Shortest Paths
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 233-240 | Bonifaci2012a | |
| 1 |
|
| Bonifaci, Mehlhorn, Varma [Varma] |
| |
| | | | Physarum Can Compute Shortest Paths
In: Journal of Theoretical Biology [309], 121-133 | Bonifaci2012c | |
| 2 |
|
| Boros, Elbassioni, Gurvich, Makino [Boros, Gurvich, Makino] |
| |
| | | | Every Stochastic Game with Perfect Information Admits a Canonical Form
In: 2nd International ICST Conference on Game Theory for Networks (GameNets 2011), | Elbassioni2011h | |
| | | | On Nash equilibria and improvement cycles in pure positional strategies for Chess-like and Backgammon-like n-person games
In: Discrete Mathematics [312], 772-788 | Elbassioni2011n | |
| 1 |
|
| Brightwell, Panagiotou, Steger [Brightwell, Steger] |
| |
| | | | Extremal subgraphs of random graphs
In: Random Structures & Algorithms [41], 147-178 | Brightwell2012 | |
| 1 |
|
| Bringmann, Panagiotou [Panagiotou, Czumaj, Pitts, Wattenhofer] |
| |
| | | | Efficient Sampling Methods for Discrete Distributions
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 133-144 | BringmannP12 | |
| 1 |
|
| Canzar, El-Kebir, Pool, Elbassioni, Malde, Mark, Geerke, Stougie, Klau [Canzar, El-Kebir, Pool, Malde, Mark, Geerke, Stougie, Klau, Chor] |
| |
| | | | Charge Group Partitioning in Biomolecular Simulation
In: Research in Computational Molecular Biology : 16th Annual International Conference, RECOMB 2012, 29-43 | Elbassioni2012c | |
| 2 |
|
| Case, Kötzing [Case] |
| |
| | | | Computability-theoretic learning complexity
In: Philosophical Transaction of the Royal Society A [370], 3570-3596 | CaseKoetzing2012:PhilTrans | |
| | | | Learning secrets interactively. Dynamic modeling in inductive inference
In: Information and Computation [220-221], 60-73 | CaseKoetzing2012:DynMod | |
| 1 |
|
| Chan, Lam, Lee, Ting [Chan, Lam, Ting] |
| |
| | | | Continuous Monitoring of Distributed Data Streams over a Time-Based Sliding Window
In: Algorithmica [62], 1088-1111 | LeeLK2012 | |
| 1 |
|
| Chan, Megow, Sitters, van Stee [Chan, Sitters] |
| |
| | | | A note on sorting buffers offline
In: Theoretical Computer Science [423], 11-18 | ChMeSS12 | |
| 1 |
|
| Chen, Doerr, Hu, Ma, van Stee, Winzen [Chen, Hu, Ma, Goldberg] |
| |
| | | | The Price of Anarchy for Selfish Ring Routing is Two
In: Internet and Network Economics : 8th International Workshop, WINE 2012, 420-433 | CDHMSW12 | |
| 1 |
|
| Croitoru, Kötzing [Croitoru, Kersting, Toussaint] |
| |
| | | | Deliberative Acceptability of Arguments
In: STAIRS 2012 - Proceedings of the Sixth Starting AI Researchers' Symposium, 71-82 | croikotzi12 | |
| 1 |
|
| Cygan, Dell, Lokshtanov, Marx, Nederlof, Okamoto, Paturi, Saurabh, Wahlström [Cygan, Dell, Lokshtanov, Marx, Nederlof, Okamoto, Paturi, Saurabh] |
| |
| | | | On Problems as Hard as CNF-SAT
In: 2012 IEEE 27th Conference on Computational Complexity (CCC 2012), 74-84 | DLMNOPSW2012 | |
| 1 |
|
| Cygan, Kratsch, Pilipczuk, Pilipczuk, Wahlström [Cygan, Kratsch, Pilipczuk, Pilipczuk, Czumaj, Pitts, Wattenhofer] |
| |
| | | | Clique Cover and Graph Separation: New Incompressibility Results
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 254-265 | CyganKratschPilipczukPilipczukWahlstroem2012 | |
| 1 |
|
| Doerr, Fouz, Friedrich [Fouz, Friedrich, Even, Rawitz] |
| |
| | | | Experimental analysis of rumor spreading in social networks
In: Design and Analysis of Algorithms First Mediterranean Conference on Algorithms, MedAlg 2012, 159-173 | DoerrFF12MedAlg | |
| 1 |
|
| Doerr, Fouz, Friedrich [Fouz, Friedrich, Fomin, Kaski] |
| |
| | | | Asynchronous rumor spreading in preferential attachment graphs
In: Algorithm Theory - SWAT 2012 : 13th Scandinavian Symposium and Workshops, 307-315 | DoerrFF12SWAT | |
| 1 |
|
| Doerr, Fouz, Friedrich [Fouz] |
| |
| | | | Why Rumors Spread Fast in Social Networks
In: Communications of the ACM [55], 70-75 | DoerrFF12CACM | |
| 1 |
|
| Doerr, Hota, Kötzing [Hota, Soule, Moore] |
| |
| | | | Ants easily solve stochastic shortest path problems
In: GECCO'12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation, 17-24 | DoerrHK2012GECCO | |
| 2 |
|
| Doerr, Johannsen, Winzen [Johannsen] |
| |
| | | | Multiplicative Drift Analysis
In: Algorithmica [64], 673-697 | DoerrJW12Multi | |
| | | | Non-existence of linear universal drift functions
In: Theoretical Computer Science [436], 71-86 | DoerrJW12 | |
| 1 |
|
| Doerr, Spöhel, Thomas, Winzen [Thomas] |
| |
| | | | Playing Mastermind with Many Colors
In: Proc. of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2012), | DoerrSTW12 | |
| 1 |
|
| Elbassioni, Fouad, Bertino [Fouad, Bertino] |
| |
| | | | Modeling the Risk & Utility of Information Sharing in Social Networks
In: 2012 ASE/IEEE International Conference on Privacy, Security, Risk and Trust and
2012 ASE/IEEE International Conference on Social Computing : SocialCom/PASSAT 2012, 441-450 | Elbassioni2012f | |
| 1 |
|
| Elbassioni, Garg, Gupta, Kumar, Narula, Pal [Garg, Gupta, Kumar, Narula, Pal, D'Souza, Kavitha, Radhakrishnan] |
| |
| | | | Approximation Algorithms for the Unsplittable Flow Problem on Paths and Trees
In: 32nd International Conference on Foundations of Software Technology and Theoretical Computer Science : FSTTCS 2012, 267-275 | Elbassioni2012g | |
| 1 |
|
| Elbassioni, Jeli´c, Matijevi`c [Jeli´c, Matijevi`c] |
| |
| | | | The relation of Connected Set Cover and Group Steiner Tree
In: Theoretical Computer Science [438], 96-101 | Elbassioni2012i | |
| 1 |
|
| Elbassioni, Matijevic, Severdija [Matijevic, Severdija] |
| |
| | | | Guarding 1.5D terrains with demands
In: International Journal of Computer Mathematics [89], 2143-2151 | Elbassioni2012z | |
| 1 |
|
| Elbassioni, Paluch, van Zuylen [Paluch, Dürr, Wilke] |
| |
| | | | Simpler Approximation of the Maximum Asymmetric Traveling Salesman Problem
In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, 501-506 | Elbassioni2012a | |
| 1 |
|
| Elbassioni, Raman, Ray, Sitters [Raman, Sitters] |
| |
| | | | On the complexity of the highway problem
In: Theoretical Computer Science [460], 70-77 | Elbassioni2012h | |
| 1 |
|
| Elbassioni, Tiwary [Tiwary] |
| |
| | | | Complexity of Approximating the Vertex Centroid of a Polyhedron
In: Theoretical Computer Science [421], 56-61 | Elbassioni2012b | |
| 1 |
|
| Elmasry, Mehlhorn, Schmidt [Elmasry] |
| |
| | | | An O(n+m) Certifying Triconnnectivity Algorithm for Hamiltonian Graphs
In: Algorithmica [62], 754-766 | Elmasry2012 | |
| 1 |
|
| Epstein, Jez, Sgall, van Stee [Epstein, Jez, Sgall, Gupta, Jansen, Rolim, Servedio] |
| |
| | | | Online Scheduling of Jobs with Fixed Start Times on Related Machines
In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 15th International Workshop, APPROX 2012 and 16th International Workshop, RANDOM 2012, 134-145 | EpJeSS12 | |
| 1 |
|
| Epstein, Levin, Marchetti-Spaccamela, Megow, Mestre, Skutella, Stougie [Epstein, Levin, Marchetti-Spaccamela, Stougie] |
| |
| | | | Universal sequencing on an unreliable machine
In: SIAM Journal on Computing [41], 565-586 | Megow2012-universal | |
| 1 |
|
| Epstein, Levin, van Stee [Epstein, Levin] |
| |
| | | | Approximation Schemes for Packing Splittable Items with Cardinality Constraints
In: Algorithmica [62], 102-129 | EpLeSt12 | |
| 1 |
|
| Epstein, van Stee [Epstein] |
| |
| | | | The price of anarchy on uniformly related machines revisited
In: Information and Computation [212], 37-54 | EpsSte12 | |
| 1 |
|
| Fellows, Hermelin, Rosamond [Fellows, Rosamond] |
| |
| | | | Well Quasi Orders in Subclasses of Bounded Treewidth Graphs and Their Algorithmic Applications
In: Algorithmica [64], 3-18 | Fellows2012 | |
| 1 |
|
| Fountoulakis, Panagiotou, Sauerwald [Panagiotou, Sauerwald, Rabani] |
| |
| | | | Ultra-fast rumor spreading in social networks
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 1642-1660 | FountoulakisPS12 | |
| 1 |
|
| Friedrich, Gairing, Sauerwald [Gairing] |
| |
| | | | Quasirandom Load Balancing
In: SIAM Journal on Computing [41], 747-771 | FriedrichGS2012 | |
| 1 |
|
| Friedrich, Kroeger, Neumann [Kroeger, Neumann] |
| |
| | | | Weighted preferences in evolutionary multi-objective optimization
In: International Journal of Machine Learning and Cybernetics [Online First], 1-10 | FriedrichKN2011 | |
| 1 |
|
| Giakkoupis, Sauerwald [Giakkoupis, Rabani] |
| |
| | | | Rumor spreading and vertex expansion
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 1623-1641 | GiakkoupisS12 | |
| 1 |
|
| Giakkoupis, Sauerwald, Sun, Woelfel [Giakkoupis, Woelfel, Dürr, Wilke] |
| |
| | | | Low Randomness Rumor Spreading via Hashing
In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, 314-325 | Sun2012a | |
| 1 |
|
| Giannopoulos, Knauer, Wahlström, Werner [Giannopoulos, Knauer, Werner] |
| |
| | | | Hardness of discrepancy computation and ε-net verification in high dimension
In: Journal of Complexity [28], 162-176 | GKWahlstroemW2012 | |
| 1 |
|
| Gnewuch, Wahlström, Winzen [Gnewuch] |
| |
| | | | A New Randomized Algorithm to Approximate the Star Discrepancy Based on Threshold Accepting
In: SIAM Journal on Numerical Analysis [50], 781-807 | GnewuchWW12 | |
| 1 |
|
| Harren, Kern [Kern, Solis-Oba, Persiano] |
| |
| | | | Improved Lower Bound for Online Strip Packing
In: Approximation and Online Algorithms : 9th International Workshop ,WAOA 2011, 211-218 | HarKer11 | |
| 1 |
|
| Heinz, Kasprzik, Kötzing [Heinz, Kasprzik] |
| |
| | | | Learning in the limit with lattice-structured hypothesis spaces
In: Theoretical Computer Science [457], 111 - 127 | HeinyKasprzikKoetzing2012 | |
| 1 |
|
| Hermelin, Mestre, Rawitz [Mestre, Rawitz, Golumbic, Stern, Levy, Morgenstern] |
| |
| | | | Optimization Problems in Dotted Interval Graphs
In: Graph-Theoretic Concepts in Computer Science : 38th InternationalWorkshop, WG 2012, 46-56 | HermelinMestreRawitz2012 | |
| 1 |
|
| Hermelin, Mnich, van Leeuwen [Mnich, van Leeuwen, Epstein, Ferragina] |
| |
| | | | Parameterized complexity of induced H-matching on claw-free graphs
In: Algorithms - ESA 2012 : 20th Annual European Symposium, 624-635 | HermelinMnichvanLeeuwen2012 | |
| 1 |
|
| Hermelin, Rizzi, Vialette [Rizzi, Vialette, Chao, Hsu, Lee] |
| |
| | | | Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph
In: Algorithms and Computation : 23rd International Symposium, ISAAC 2012, 465-474 | Hermelin2012 | |
| 1 |
|
| Hermelin, Wu [Wu, Rabani] |
| |
| | | | Weak compositions and their applications to polynomial lower bounds for kernelization
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 104-113 | HermelinWu2012 | |
| 1 |
|
| Höhn, Jacobs, Megow [Höhn, Jacobs] |
| |
| | | | On Eulerian extensions and their application to no-wait flowshop scheduling
In: Journal of Scheduling [15], 295-309 | Megow2012-eulerian | |
| 1 |
|
| Huang [, Fomin, Kaski] |
| |
| | | | Non-preemptive Speed Scaling
In: Algorithm Theory - SWAT 2012 : 13th Scandinavian Symposium and Workshops, 249-260 | Huang2012a | |
| 1 |
|
| Jain, Kötzing, Stephan [Jain, Stephan, Bshouty, Stoltz, Vayatis, Zeugmann] |
| |
| | | | Enlarging Learnable Classes
In: Algorithmic Learning Theory : 23rd International Conference, ALT 2012, 36-50 | JainKoetzingStephan2011 | |
| 1 |
|
| Kane, Mehlhorn, Sauerwald, Sun [Kane, Czumaj, Pitts, Wattenhofer] |
| |
| | | | Counting Arbitrary Subgraphs in Data Streams
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 598-609 | Sun2012b | |
| 1 |
|
| Kavitha, Mestre [Mestre] |
| |
| | | | Max-coloring paths: tight bounds and extensions
In: Journal of Combinatiorial Optimization [24], 1-14 | Kavitha2012 | |
| 1 |
|
| Kayal, Saha [Kayal] |
| |
| | | | On the Sum of Square Roots of Polynomials and Related Problems
In: The ACM Transactions on Computation Theory [4], 9:1-9:15 | KS12 | |
| 1 |
|
| Kerber, Sagraloff [Kerber] |
| |
| | | | A worst-case bound for topology computation of algebraic curves
In: Journal of Symbolic Computation [47], 239-258 | KerberSagraloff_JSC_2012 | |
| 1 |
|
| Kim, Paul, Philip [Kim, Paul, Fomin, Kaski] |
| |
| | | | A Single-exponential FPT Algorithm for the K4-Minor Cover Problem
In: Algorithm Theory - SWAT 2012 : 13th Scandinavian Symposium and Workshops, 119-130 | KimPaulPhilip2012 | |
| 1 |
|
| Knauer, Schlipf, Schmidt, Tiwary [Knauer, Schlipf, Tiwary] |
| |
| | | | Largest Inscribed Rectangles in Convex Polygons
In: Journal of Discrete Algorithms [13], 78-85 | Knauer2012 | |
| 1 |
|
| Kötzing, Molter [Molter, Coello Coello, Cutello, Deb, Forrest, Nicosia, Pavone] |
| |
| | | | ACO beats EA on a dynamic pseudo-Boolean function
In: Parallel Problem Solving from Nature - PPSN XII : 12th International Conference, 113-122 | KoetzingMolter2012 | |
| 1 |
|
| Kötzing, Neumann, Röglin, Witt [Neumann, Röglin, Witt] |
| |
| | | | Theoretical analysis of two ACO approaches for the traveling salesman problem
In: Swarm Intelligence [6], 1-21 | KoetzingNRW2012 | |
| 1 |
|
| Kötzing, Sutton, Neumann, O'Reilly [Sutton, Neumann, O'Reilly, Soule, Moore] |
| |
| | | | The max problem revisited: the importance of mutation in genetic programming
In: GECCO’12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation, 1333-1340 | KoetzingSNO2011 | |
| 1 |
|
| Kratsch, Pilipczuk, Pilipczuk, Wahlström [Kratsch, Pilipczuk, Pilipczuk, Czumaj, Pitts, Wattenhofer] |
| |
| | | | Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs
In: Automata, Languages, and Programming ; 39th International Colloquium, ICALP 2012, 581-593 | KratschPilipczukPilipczukWahlstroem2012 | |
| 1 |
|
| Kratsch, Wahlström [Kratsch, Rabani] |
| |
| | | | Compression via matroids: a randomized polynomial kernel for odd cycle transversal
In: Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 94-103 | KratschWahlstroem2012a | |
| 1 |
|
| Kratsch, Wahlström [Kratsch, Roughgarden] |
| |
| | | | Representative Sets and Irrelevant Vertices: New Tools for Kernelization
In: IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS-12), 450-459 | KratschWahlstroem2012b | |
| 1 |
|
| Krivelevich, Spöhel [Krivelevich] |
| |
| | | | Creating small subgraphs in Achlioptas processes with growing parameter
In: SIAM Journal on Discrete Mathematics [26], 670-686 | SpoehelK2012 | |
| 1 |
|
| Lokshtanov, Saurabh, Wahlström [Lokshtanov, Saurabh, D'Souza, Kavitha, Radhakrishna] |
| |
| | | | Subexponential Parameterized Odd Cycle Transversal on Planar Graphs
In: 32nd International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012), 424-434 | LSWahlstroem2012 | |
| 1 |
|
| Megow, Mehlhorn, Schweitzer [Schweitzer] |
| |
| | | | Online Graph Exploration: New Results on Old and New Algorithms
In: Theoretical Computer Science [463], 62-72 | MegowMehlhornSchweitzer2012 | |
| 1 |
|
| Megow, Skutella, Verschae, Wiese [Skutella, Verschae, Czumaj, Pitts, Wattenhofer] |
| |
| | | | The Power of Recourse for Online MST and TSP
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 689-700 | MegowSVW2012 | |
| 1 |
|
| Meyerhenke, Sauerwald [Meyerhenke] |
| |
| | | | Beyond Good Partition Shapes: An Analysis of Diffusive Graph Partitioning
In: Algorithmica [64], 329-361 | MeyerhenkeS2012 | |
| 1 |
|
| Misra, Philip, Raman, Saurabh [Misra, Raman, Saurabh] |
| |
| | | | On Parameterized Independent Feedback Vertex Set
In: Theoretical Computer Science [461], 65-75 | MisraPhilipRamanSaurabh2012 | |
| 1 |
|
| Misra, Philip, Raman, Saurabh, Sikdar [Misra, Raman, Saurabh, Sikdar] |
| |
| | | | FPT Algorithms for Connected Feedback Vertex Set
In: Journal of Combinatorial Optimization [24], 131-146 | MisraPhilipRamanSaurabhSikdar2012 | |
| 1 |
|
| Mnich, Philip, Saurabh, Suchy [Saurabh, Suchy, D'Souza, Kavitha, Radhakrishnan] |
| |
| | | | Beyond Max-Cut: lambda-Extendible Properties
Parameterized Above the Poljak-Turzík Bound
In: 32nd International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012), 412-423 | MnichPhilipSaurabhSuchy2012a | |
| 1 |
|
| Nor, Hermlin, Charlat, Engelstadter, Reuter, Duron, Sagot [Nor, Charlat, Engelstadter, Reuter, Duron, Sagot] |
| |
| | | | Mod/Resc Parsimony Inference: Theory and application
In: Information and Computation [213], 23-32 | Nor2012 | |
| 1 |
|
| Panagiotou, Coja-Oghlan [Coja-Oghlan] |
| |
| | | | Catching the k-NAESAT Threshold
In: STOC’12 : Proceedings of the 2012 ACM Symposium on Theory of Computing, 899-907 | ACO-P2012 | |
| 1 |
|
| Panagiotou, Sinha [Sinha] |
| |
| | | | Vertices of degree k in random unlabeled trees
In: Journal of Graph Theory [69], 114-130 | Panagiotou2012b | |
| 1 |
|
| Philip, Raman, Sikdar [Raman, Sikdar] |
| |
| | | | Polynomial kernels for dominating set in graphs of bounded degeneracy and beyond
In: ACM Transactions on Algorithms [9], 23 | PhilipRamanSikdar2012 | |
| 1 |
|
| Qian, Schalekamp, Williamson, van Zuylen [Qian, Schalekamp, Williamson, Fernández-Baca] |
| |
| | | | On the Integrality Gap of the Subtour LP for the 1,2-TSP
In: LATIN 2012: Theoretical Informatics ; 10th Latin American Symposium, 606-617 | QianSWvZ12 | |
| 1 |
|
| Schalekamp, Williamson, van Zuylen [Schalekamp, Williamson, Rabani] |
| |
| | | | A proof of the Boyd-Carr conjecture
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 1477-1486 | SchalekampWvZ12 | |
| 1 |
|
| Schmidt, Valtr [Valtr] |
| |
| | | | Cubic Plane Graphs on a Given Point Set
In: Proceedings of the Twenty-Eighth Annual Symposium on Computational Geometry (SCG'12), 201-208 | Schmidt2012a | |
| 1 |
|
| Soranzo, Ramezani, Iacono, Altafini [Soranzo, Iacono, Altafini] |
| |
| | | | Decompositions of large-scale biological systems based on dynamical properties
In: Bioinformatics [28], 76-83 | Ramezani2011 | |
| 114 |
| 2011 |
| |
| 1 |
|
| Ailon, Avigdor-Elgrabli, Liberty, van Zuylen [Ailon, Avigdor-Elgrabli, Liberty, Demetrescu, Halldórsson] |
| |
| | | | Improved Approximation Algorithms for Bipartite Correlation Clustering
In: Algorithms - ESA 2011 : 19th Annual European Symposium, 25-36 | AilonESA2011 | |
| 1 |
|
| Alkassar, Böhme, Mehlhorn, Rizkallah [Alkassar, Böhme, Gopalakrishnan, Qadeer] |
| |
| | | | Verification of Certifying Computations
In: Computer Aided Verification : 23rd International Conference, CAV 2011, 67-82 | FormalVerificationofCertifyingComputations | |
| 1 |
|
| Althaus, Canzar, Elbassioni, Karrenbauer, Mestre [Althaus, Canzar, Karrenbauer, Mestre] |
| |
| | | | Approximation Algorithms for the Interval Constrained Coloring Problem
In: Algorithmica [61], 342-361 | Elbassioni2011l | |
| 1 |
|
| Althaus, Kupilas, Naujoks [Althaus, Ogihara, Tarui] |
| |
| | | | On the Low-Dimensional Steiner Minimum Tree Problem in Hamming Metric
In: Theory and Applications of Models of Computation : 8th Annual Conference, TAMC 2011, 308-319 | Althaus2011 | |
| 1 |
|
| Anand, Garg, Megow [Anand, Garg, Aceto, Henzinger, Sgall] |
| |
| | | | Meeting deadlines: How much speed suffices?
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011. - Pt. I, 232-243 | Megow2011-speed | |
| 1 |
|
| Arumugam, Chandrasekar, Misra, Philip, Saurabh [Arumugam, Chandrasekar, Misra, Saurabh, Iliopoulos, Smyth] |
| |
| | | | Algorithmic Aspects of Dominator Colorings in Graphs
In: Combinatorial Algorithms - 22nd International Workshop, IWOCA 2011, Victoria, BC, Canada, July 20-22, 2011, Revised Selected Papers, 19-30 | arumugamchandrasekarmisraphilipsaurabh2011 | |
| 1 |
|
| |
| | | | Memory-constrained algorithms for shortest path problem
In: 23rd Annual Canadian Conference on Computational Geometry (CCCG 2011), 315-319 | DoerrA11CCCG | |
| 1 |
|
| Bansal, Chan, Pruhs [Bansal, Pruhs] |
| |
| | | | Competitive Algorithms for Due Date Schedulin
In: Algorithmica [59], 569-582 | Chan2011 | |
| 1 |
|
| Bar-Yehuda, Hermelin, Rawitz [Bar-Yehuda, Rawitz] |
| |
| | | | Minimum vertex cover in rectangle graphs
In: Computational Geometry [44], 356-364 | Bar-YehudaHermelinRawitz2011 | |
| 1 |
|
| Baruah, Bonifaci, D'Angelo, Marchetti-Spaccamela, van der Ster, Stougie [Baruah, D'Angelo, Marchetti-Spaccamela, van der Ster, Stougie, Demetrescu, Halldórsson] |
| |
| | | | Mixed-criticality scheduling of sporadic task systems
In: Algorithms - ESA 2011 : 19th Annual European Symposium, 555-566 | Bonifaci:2011:c | |
| 1 |
|
| Baswana, Kavitha, Mehlhorn, Pettie [Baswana, Kavitha, Pettie] |
| |
| | | | Additive Spanners and (α, β)-Spanners
In: ACM Transactions on Algorithms [7], 5:1-5:26 | MehlhornTALG2011 | |
| 1 |
|
| Beier, Funke, Matijevic, Sanders [Sanders] |
| |
| | | | Energy-Efficient Paths in Radio Networks
In: Algorithmica [61], 298-319 | Beier2011 | |
| 1 |
|
| Ben-Zwi, Hermelin, Lokshtanov, Newman [Ben-Zwi, Lokshtanov, Newman] |
| |
| | | | Treewidth governs the complexity of target set selection
In: Discrete Optimization [8], 87-96 | BenZwiHermelinLokshtanovNewman2011 | |
| 1 |
|
| Berberich, Halperin, Kerber, Pogalnikova [Halperin, Kerber, Pogalnikova, Hurtado, van Krefeld] |
| |
| | | | Deconstructing Approximate Offsets
In: Proceedings of the 27th Annual Symposium on Computational Geometry (SCG'11), 187-196 | bhkp-minkowksideconstruction-2011 | |
| 1 |
|
| Berberich, Halperin, Kerber, Pogalnikova [Halperin, Kerber, Pogalnikova] |
| |
| | | | Deconstructing Approximate Offsets
In: arXiv [abs/1109.2158], | bhkp-minkowksideconstructiondcg-2011a | |
| 1 |
|
| Berberich, Hemmer, Kerber [Hemmer, Kerber, Hurtado, van Krefeld] |
| |
| | | | A Generic Algebraic Kernel for Non-linear Geometric Applications
In: Proceedings of the 27th Annual Symposium on Computational Geometry (SCG'11), 179-186 | bhk-ak2-2011 | |
| 1 |
|
| Berenbrink, Cooper, Friedetzky, Friedrich, Sauerwald [Berenbrink, Cooper, Friedetzky, Randall] |
| |
| | | | Randomized Diffusion for Indivisible Loads
In: 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA-11), 429-439 | Berenbrink2011b | |
| 1 |
|
| Berenbrink, Friedetzky, Elsaesser, Nagel, Sauerwald [Berenbrink, Friedetzky, Elsaesser, Nagel, Murlak, Sankowski] |
| |
| | | | Faster Coupon Collecting via Replication with Applications in Gossiping
In: 36th International Symposium on Mathematical Foundations of Computer Science (MFCS-11), 72-83 | BerenbrinkEFNS11 | |
| 1 |
|
| Berenbrink, Hoefer, Sauerwald [Berenbrink, Hoefer, Randall] |
| |
| | | | Distributed Selfish Load Balancing on Networks
In: 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA-11), 1487-1497 | Berenbrink2011 | |
| 2 |
|
| Bonifaci, Korteweg, Marchetti-Spaccamela, Stougie [Korteweg, Marchetti-Spaccamela, Stougie] |
| |
| | | | Minimizing Flow Time in the Wireless Gathering Problem
In: ACM Transactions on Algorithms [7], 33:1-33:20 | Bonifaci:2011:b | |
| | | | The Distributed Wireless Gathering Problem
In: Theoretical Computer Science [412], 633-641 | Bonifaci:2011:a | |
| 1 |
|
| Boros, Elbassioni, Fouz, Gurvich, Makino, Manthey [Boros, Fouz, Gurvich, Makino, Manthey, Aceto, Henzinger, Sgall] |
| |
| | | | Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 147-158 | Elbassioni2011e | |
| 1 |
|
| Boros, Elbassioni, Gurvich, Makino [Boros, Gurvich, Makino] |
| |
| | | | A lower bound for discounting algorithms solving two-person zero-sum limit average payoff stochastic games | Elbassioni2011d | |
| 1 |
|
| Boros, Elbassioni, Gurvich, Tiwary [Boros, Gurvich, Tiwary] |
| |
| | | | The negative cycles polyhedron and hardness of checking some polyhedral properties
In: Annals of Operations Research [188], 63-76 | Elbassioni2011k | |
| 1 |
|
| Bredereck, Nichterlein, Niedermeier, Philip [Bredereck, Nichterlein, Niedermeier, Murlak, Sankowski] |
| |
| | | | Pattern-Guided Data Anonymization and Clustering
In: Mathematical Foundations of Computer Science 2011 - 36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011. Proceedings, 182-193 | brederecknichterleinniedermeierphilip2011a | |
| 1 |
|
| Bredereck, Nichterlein, Niedermeier, Philip [Bredereck, Nichterlein, Niedermeier, Owe, Steffen, Telle] |
| |
| | | | The Effect of Homogeneity on the Complexity of $k$-Anonymity
In: Fundamentals of Computation Theory - 18th International Symposium, FCT 2011, Oslo, Norway, August 22-25, 2011. Proceedings, 53-64 | BredereckNichterleinNiedermeierPhilip2011b | |
| 1 |
|
| Bringmann, Friedrich, Neumann, Wagner [Neumann, Wagner, Walsh] |
| |
| | | | Approximation-guided evolutionary multi-objective optimization
In: Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (IJCAI 2011), 1198-1203 | BringmannFNW2011 | |
| 1 |
|
| Canzar, Elbassioni, Klau, Mestre [Canzar, Klau, Mestre, Aceto, Henzinger, Sgall] |
| |
| | | | On Tree-Constrained Matchings and Generalizations
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 98-109 | Elbassioni2011f | |
| 1 |
|
| Canzar, Elbassioni, Klau, Mestre [Canzar, Klau, Mestre] |
| |
| | | | On Tree-Constrained Matchings and Generalizations | Elbassioni2012j | |
| 1 |
|
| Case, Kötzing [Case, Schwentick, Dürr] |
| |
| | | | Measuring Learning Complexity with Criteria Epitomizers
In: 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011), 320-331 | Cas-Koe:c:11:StacsEpit | |
| 1 |
|
| Chan, Edmonds, Lam, Lee, Marchetti-Spaccamela, Pruhs [Chan, Edmonds, Lam, Marchetti-Spaccamela, Pruhs] |
| |
| | | | Nonclairvoyant speed scaling for flow and energy
In: Algorithmica [61], 507-517 | Lee2010d | |
| 1 |
|
| Chan, Lam, Lee [Chan, Lam, Schwentick, Dürr] |
| |
| | | | Scheduling for weighted flow time and energy with rejection penalty
In: 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011), 392-403 | Lee2011b | |
| 1 |
|
| Chin, Guo, Sun [Chin, Guo] |
| |
| | | | Minimum Manhattan Network is NP-Complete
In: Discrete & Computational Geometry [45], 701-722 | Sun2011b | |
| 1 |
|
| Christodoulou, Mehlhorn, Pyrga [Christodoulou, Pyrga, Demetrescu, Halldórsson] |
| |
| | | | Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms
In: Algorithms - ESA 2011 : 19th Annual European Symposium, 119-130 | Becker2011 | |
| 1 |
|
| Cygan, Philip, Pilipczuk, Pilipczuk, Wojtaszczyk [Cygan, Pilipczuk, Pilipczuk, Wojtaszczyk] |
| |
| | | | Dominating set is fixed parameter tractable in claw-free graphs
In: Theoretical Computer Science [412], 6982-7000 | CyganPhilipPilipczukPilipczukWojtaszczyk2011 | |
| 1 |
|
| De Sterck, Henson, Sanders [Henson, Sanders] |
| |
| | | | Multilevel Aggregation Methods for Small-World Graphs with Application to Random-Walk Ranking | DHS2011 | |
| 1 |
|
| De Sterck, Miller, Sanders, Winlaw [Miller, Sanders, Winlaw] |
| |
| | | | Recursively accelerated multilevel aggregation for Markov chains
In: SIAM Journal on Scientific Computing [32], 1652-1671 | DMSW2010 | |
| 1 |
|
| Doerr, Eremeev, Neumann, Theile, Thyssen [Eremeev, Theile, Thyssen] |
| |
| | | | Evolutionary algorithms and dynamic programming
In: Theoretical Computer Science [412], 6020-6035 | DoerrENTT11 | |
| 1 |
|
| Doerr, Fouz [Fouz, Aceto, Henzinger, Sgall] |
| |
| | | | Asymptotically Optimal Randomized Rumor Spreading
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 502-513 | DoerrM11 | |
| 2 |
|
| Doerr, Fouz [Fouz] |
| |
| | | | Asymptotically optimal randomized rumor spreading
In: Electronic Notes in Discrete Mathematics [38], 297-302 | DoerrF12 | |
| | | | Quasi-random rumor spreading: Reducing randomness can be costly
In: Information Processing Letters [111], 227-230 | DF2010b | |
| 1 |
|
| Doerr, Fouz, Friedrich [Fouz, Nešetřil, Győri, Sali] |
| |
| | | | Social Networks Spread Rumors in Sublogarithmic Time
In: The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, 303-308
In: Electronic Notes in Discrete Mathematics [38], 303-308 | DFF11 | |
| 1 |
|
| Doerr, Fouz, Friedrich [Fouz] |
| |
| | | | Social Networks Spread Rumors in Sublogarithmic Time
In: STOC'11 : Proceedings of the 43rd ACM Symposium on Theory of Computing, 21-30 | 2011STOC | |
| 1 |
|
| Doerr, Fouz, Witt [Fouz, Witt, Krasnogor, Lanzi] |
| |
| | | | Sharp bounds by probability-generating functions and variable drift
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 2083-2090 | DoerrFW11 | |
| 1 |
|
| Doerr, Friedrich, Künnemann, Sauerwald [Künnemann] |
| |
| | | | Quasirandom Rumor Spreading: An Experimental Analysis
In: ACM Journal of Experimental Algorithmics [16], Article No. 3.3 | DoerrFKS12 | |
| 1 |
|
| Doerr, Goldberg, Minder, Sauerwald, Scheideler [Goldberg, Minder, Scheideler] |
| |
| | | | Stabilizing consensus with the power of two choices
In: 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA-11), 149-158 | DoerrGMSS11 | |
| 1 |
|
| |
| | | | Theory of Evolutionary Computation
In: Algorithmica [59], 299-300 | DoerrJ11 | |
| 1 |
|
| Doerr, Johannsen, Kötzing, Lehre, Wagner, Winzen [Lehre, Beyer, Langdon] |
| |
| | | | Faster black-box algorithms through higher arity operators
In: Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI (FOGA 2011), 163-172 | Doerr2011 | |
| 1 |
|
| Doerr, Johannsen, Schmidt [Schmidt, Beyer, Langdon] |
| |
| | | | Runtime analysis of the (1+1) evolutionary algorithm on strings over finite alphabets
In: FOGA'11 : Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, 119-126 | DoerrMJ11 | |
| 1 |
|
| Doerr, Künnemann, Wahlström [Künnemann, Müller-Hannemann, Werneck] |
| |
| | | | Dependent Randomized Rounding: The Bipartite Case
In: 2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX), 96-106 | DKW2011 | |
| 1 |
|
| Doerr, Lengler, Kötzing, Winzen [Lengler, Krasnogor, Lanzi] |
| |
| | | | Black-box complexities of combinatorial problems
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 981-988 | DoerrLKW11 | |
| 1 |
|
| Doerr, Neumann, Sudholt, Witt [Neumann, Sudholt, Witt] |
| |
| | | | Runtime analysis of the 1-ANT ant colony optimizer
In: Theoretical Computer Science [412], 1629-1644 | DoerrNSW11 | |
| 1 |
|
| Durrett, Neumann, O'Reilly [Durrett, Neumann, O'Reilly, Beyer, Langdon] |
| |
| | | | Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics
In: FOGA'11 : Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, 69-80 | GPFOGA11 | |
| 1 |
|
| Elbassioni, Elmasry, Makino [Makino] |
| |
| | | | Finding Simplices containing the Origin in Two and Three Dimensions
In: International Journal of Computational Geometry & Applications [21], 495-506 | Elbassioni2011i | |
| 1 |
|
| Elbassioni, Krohn, Matijevic, Mestre, Severdija [Krohn, Matijevic, Severdija] |
| |
| | | | Improved Approximations for Guarding 1.5-Dimensional Terrains
In: Algorithmica [60], 451-463 | Elbassioni2011m | |
| 1 |
|
| Elbassioni, Makino, Rauf [Makino] |
| |
| | | | On the readability of monotone Boolean formulae
In: Journal of Combinatorial Optimization [22], 293-304 | JOCO:EMR10 | |
| 1 |
|
| Elbassioni, Rauf, Ray [Rauf, Collette] |
| |
| | | | Enumerating Minimal Transversals of Geometric Hypergraphs
In: 23rd Canadian Conference on Computational Geometry (CCCG 2011), 437-442 | Elbassioni2011g | |
| 1 |
|
| Elbassioni, Tiwary [Tiwary] |
| |
| | | | On a cone covering problem
In: Computational Geometry [44], 129-134 | Elbassioni2011a | |
| 1 |
|
| Elsaesser, Sauerwald [Elsaesser] |
| |
| | | | Tight bounds for the cover time of multiple random walks
In: Theoretical Computer Science [412], 2623-2641 | ElsaesserS2011 | |
| 1 |
|
| Epstein, Levin, van Stee [Epstein, Levin] |
| |
| | | | Max-min online allocations with a reordering buffer
In: SIAM Journal on Discrete Mathematics [25], 1230-1250 | EpLeSt11a | |
| 2 |
|
| Epstein, van Stee [Epstein] |
| |
| | | | Improved results for a memory allocation problem
In: Theory of Computing Systems [48], 79-92 | EpsSte11 | |
| | | | On the online unit clustering problem
In: ACM Transactions on Algorithms [7], 7:1-7:1 | vanSteeTALG2011 | |
| 1 |
|
| Farzan, Munro [Munro] |
| |
| | | | Succinct representation of dynamic trees
In: Theoretical Computer Science [412], 2668-2678 | FarzanDynamic2011 | |
| 1 |
|
| Fellows, Fertin, Hermelin, Vialette [Fellows, Fertin, Vialette] |
| |
| | | | Upper and lower bounds for finding connected motifs in vertex-colored graphs
In: Journal of Computer and System Sciences [77], 799-811 | FellowsFertinHermelinVialette2011 | |
| 1 |
|
| Fellows, Friedrich, Hermelin, Narodytska, Rosamond [Fellows, Narodytska, Rosamond, Walsh] |
| |
| | | | Constraint Satisfaction Problems: Convexity Makes All Different Constraints Tractable
In: Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (IJCAI 2011), 522-527 | FellowsFriedrichHermelinEtAL2011 | |
| 1 |
|
| Fellows, Hartman, Hermelin, Landau, Rosamond, Rozenberg [Fellows, Hartman, Landau, Rosamond, Rozenberg] |
| |
| | | | Haplotype Inference Constrained by Plausible Haplotype Data
In: IEEE/ACM Transactions on Computational Biology and Bioinformatics [8], 1692-1699 | FellowsHatrmanHermelinEtAl2011 | |
| 1 |
|
| Fernau, Fomin, Lokshtanov, Mnich, Philip, Saurabh [Fernau, Fomin, Lokshtanov, Mnich, Saurabh, Iliopoulos, F. Smyth] |
| |
| | | | Ranking and Drawing in Subexponential Time
In: Combinatorial Algorithms - 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers, | FernauFominLokshtanovMnichPhilipSaurabh2010 | |
| 1 |
|
| Fomin, Lokshtanov, Misra, Philip, Saurabh [Fomin, Lokshtanov, Misra, Saurabh, Schwentick, D{ |
| |
| 1 |
|
| |
| | | | Hitting forbidden minors: Approximation and Kernelization
In: 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany, 189-200 | FominLokshtanovMisraPhilipSaurabh2011 | |
| 1 |
|
| Fomin, Philip, Villanger [Fomin, Villanger, Chakraborty, Kumar] |
| |
| | | | Minimum Fill-in of Sparse Graphs: Kernelization and Approximation
In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India, 164-175 | FominPhilipVillanger2011 | |
| 1 |
|
| Fountoulakis, Panagiotou [Panagiotou] |
| |
| | | | 3-Connected Cores In Random Planar Graphs
In: Combinatorics, Probability & Computing [20], 381-412 | Fountoulakis2011 | |
| 1 |
|
| Friedrich, Bringmann, Voss, Igel [Bringmann, Voss, Igel, Beyer, Langdon] |
| |
| | | | The Logarithmic Hypervolume Indicator
In: FOGA'11 : Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, 81-92 | FBVI2011 | |
| 1 |
|
| Friedrich, Horoba, Neumann [Horoba] |
| |
| | | | Illustration of fairness in evolutionary multi-objective optimization
In: Theoretical Computer Science [412], 1546-1556 | FriedrichTCS2011 | |
| 1 |
|
| Friedrich, Sauerwald, Stauffer [Stauffer, Asano, Nakano, Okamoto, Watanabe] |
| |
| | | | Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary Dimensions
In: 22nd International Symposium on Algorithms and Computation (ISAAC-11), 190-199 | FriedrichSS11 | |
| 1 |
|
| Friedrich, Sauerwald, Vilenchik [Sauerwald, Vilenchik] |
| |
| | | | Smoothed analysis of balancing networks
In: Random Structures & Algorithms [39], 115-138 | FriedrichRSA2011 | |
| 1 |
|
| Funke, Laue, Lotker, Naujoks [Funke, Laue, Lotker] |
| |
| | | | Power assignment problems in wireless communication: Covering points by disks, reaching few receivers quickly, and energy-efficient travelling salesman tours
In: Ad Hoc Networks [9], 1028-1035 | Naujoks2011 | |
| 1 |
|
| Gugelmann, Spöhel [Gugelmann, Nešetřil, Győri, Sali] |
| |
| | | | On balanced coloring games in random graphs
In: The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, 425-430 | Spoehel2011a | |
| 1 |
|
| |
| | | | Greedy Construction of 2-Approximate Minimum Manhattan Networks
In: International Journal of Computational Geometry and Applications [21], 331-350 | Sun2011c | |
| 1 |
|
| Harren, Jansen, Prädel, van Stee [Jansen, Prädel, Dehne, Iacono, Sack] |
| |
| | | | A (5/3 + ε)-Approximation for Strip Packing
In: Algorithms and Data Structures : 12th International Symposium, WADS 2011, 475-487 | HaJaPS11 | |
| 1 |
|
| Hemmer, Dupon, Petitjean, Schomer [Dupon, Petitjean, Schomer] |
| |
| | | | A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics
In: Journal of Symbolic Computation [46], 467-494 | Hemmer2011 | |
| 1 |
|
| Hermelin, Huang, Kratsch, Wahlström [Huang, Kratsch, Kolman, Kratochvíl] |
| |
| | | | Parameterized Two-Player Nash Equilibrium
In: Graph-Theoretic Concepts in Computer Science : 37th International Workshop, WG 2011, 215-226 | HermelinHuangKratschWahlstrom2011 | |
| 1 |
|
| Hermelin, Levy, Weimann, Yuster [Levy, Weimann, Yuster, Aceto, Henzinger, Sgall] |
| |
| | | | Distance Oracles for Vertex-Labeled Graphs
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 490-501 | HermelinLevyWeimanYuster2011 | |
| 1 |
|
| Hermelin, Mnich, van Leeuwen, Woeginger [Mnich, van Leeuwen, Woeginger, Aceto, Henzinger, Sgall] |
| |
| | | | Domination When the Stars Are Out
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 462-473 | HermelinMnichVanLeeuwenWoeginger2011 | |
| 1 |
|
| Hermelin, Rawitz [Rawitz] |
| |
| | | | Optimization problems in multiple subtree graphs
In: Discrete Applied Mathematics [159], 588-594 | HermelinRawitz2011 | |
| 2 |
|
| |
| | | | Near-popular matchings in the Roommates problem
In: 19th European Symposium on Algorithms (ESA), | Huang2011b | |
| | | | Popular Matchings in the Stable Marriage Problem
In: 38th International Colloquium on Automata, Languages and Programming (ICALP), | Huang2011a | |
| 1 |
|
| Huang, Kavitha, Michael, Nasr [Kavitha, Michael, Nasr] |
| |
| | | | Bounded Unpopularity Matchings
In: Algorithmica [61], 738-757 | Huang2011 | |
| 1 |
|
| Kavitha, Mehlhorn, Michail [Kavitha] |
| |
| | | | New Approximation Algorithms for Minimum Cycle Bases of Graphs
In: Algorithmica [59], 471-488 | KavithaALG2011 | |
| 1 |
|
| Kavitha, Mestre, Nasre [Kavitha, Nasre] |
| |
| | | | Popular mixed matchings
In: Theoretical Computer Science [412], 2679-2690 | KavithaTCS2011 | |
| 1 |
|
| Kayal, Saha [Kayal] |
| |
| | | | On the Sum of Square Roots of Polynomials and Related Problems
In: 26th IEEE Conference on Computational Complexity (CCC), 292-299 | KS11 | |
| 1 |
|
| Kerber, Sagraloff [Kerber, Leykin] |
| |
| | | | Efficient Real Root Approximation
In: ISSAC 2011 : Proceedings of the 36th International Symposium on Symbolic and Algebraic Computation, 209-216 | KerberSagraloff:RootApprox:2011 | |
| 1 |
|
| Kerber, Sagraloff [Kerber] |
| |
| | | | A Note on the Complexity of Real Algebraic Hypersurfaces
In: Graphs and Combinatorics [27], 419-430 | ks-ncrah-10 | |
| 1 |
|
| Kötzing, Neumann, Spöhel [Neumann, Krasnogor, Lanzi] |
| |
| | | | PAC learning and genetic programming
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 2091-2096 | KoetzingNS11GP | |
| 1 |
|
| Kötzing, Neumann, Sudholt, Wagner [Neumann, Sudholt, Wagner, Beyer, Langdon] |
| |
| | | | Simple max-min ant systems and the optimization of linear pseudo-Boolean functions
In: FOGA'11 : Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, 209-218 | Koe-Neu-Sud-Wag:c:Foga11AcoLinFun | |
| 1 |
|
| Kötzing, Sudholt, Theile [Sudholt, Theile, Krasnogor, Lanzi] |
| |
| | | | How crossover helps in pseudo-Boolean optimization
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 989-996 | KoetzingST2011 | |
| 1 |
|
| Mainberger, Hoffmann, Weickert, Tang, Johannsen, Neumann, Doerr [Mainberger, Hoffmann, Weickert, Johannsen, Neumann, Bruckstein, ter Haar Romeny, Bronstein, Bronstein] |
| |
| | | | Optimising Spatial and Tonal Data for Homogeneous Diffusion Inpainting
In: Scale Space and Variational Methods in Computer Vision : Third International Conference, SSVM 2011, 26-37 | MainbergerWTJND11 | |
| 1 |
|
| Manjunath, Sharma [Sharma] |
| |
| | | | Applications of dimensionality reduction and exponential sums to graph automorphism
In: Theoretical Computer Science [412], 3639-3649 | Manjunath2011 | |
| 1 |
|
| Megow, Möhring, Schulz [Möhring, Schulz] |
| |
| | | | Decision Support and Optimization in Shutdown and Turnaround Scheduling
In: INFORMS Journal on Computing [23], 189 - 204 | MegowMS10-turnaround | |
| 1 |
|
| Mehlhorn, Näher, Schweitzer [McConnell] |
| |
| | | | Certifying algorithms
In: Computer Science Review [5], 119-161 | McConnell2010 | |
| 1 |
|
| Milosavljevic, Morozov, Skraba [Morozov, Skraba] |
| |
| | | | Zigzag Persistent Homology in Matrix Multiplication Time
In: Proceedings of the 27th Annual Symposium on Computational Geometry (SCG'11), 216-225 | Milosavljevic2011Zigzag | |
| 1 |
|
| Misra, Philip, Raman, Saurabh [Misra, Raman, Saurabh, Fu, Du] |
| |
| | | | On Parameterized Independent Feedback Vertex Set
In: Computing and Combinatorics - 17th Annual International Conference, COCOON 2011, Dallas, TX, USA, August 14-16, 2011. Proceedings, 98-109 | MisraPhilipRamanSaurabh2011 | |
| 1 |
|
| Müller, Perez-Gimenez, Wormald [Müller, Wormald] |
| |
| | | | Disjoint Hamilton cycles in the random geometric graph
In: Journal of Graph Theory [68], 299-322 | PerezGimenez2011 | |
| 1 |
|
| Mütze, Rast, Spöhel [Mütze, Rast, Randall] |
| |
| | | | Coloring random graphs online without creating monochromatic subgraphs
In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), 145-158 | Spoehel2011 | |
| 1 |
|
| Mütze, Spöhel [Mütze, Nešetřil, Győri, Sali] |
| |
| | | | On the path-avoidance vertex-coloring game
In: The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, 657-662 | Spoehel2011b | |
| 1 |
|
| Mütze, Spöhel [Mütze] |
| |
| | | | On the path-avoidance vertex-coloring game
In: The Electronic Journal of Combinatorics [18], 1-33 | Spoehel2011d | |
| 1 |
|
| Neumann, Reichel, Skutella [Reichel, Skutella] |
| |
| | | | Computing Minimum Cuts by Randomized Search Heuristics
In: Algorithmica [59], 323-342 | Neumann2011 | |
| 1 |
|
| Panagiotou, Spöhel, Steger, Thomas [Steger, Thomas, Nešetřil, Győri, Sali] |
| |
| | | | Explosive percolation in Erdős-Rényi-like random graph processes
In: The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, 699-704 | Spoehel2011c | |
| 1 |
|
| Panagiotou, Steger [Steger, Randall] |
| |
| | | | On the Degree Sequence of Random Planar Graphs
In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), 1198-1210 | PanagiotouSteger2011 | |
| 1 |
|
| Pemmaraju, Raman, Varadarajan [Pemmaraju, Varadarajan] |
| |
| | | | Max-coloring and online coloring with bandwidths on interval graphs
In: ACM Transactions on Algorithms [7], 35:1-35:21 | Pemmaraju2011 | |
| 1 |
|
| Rizkallah [Brown] |
| |
| | | | Glivenko and Kuroda for Simple Type Theory | BrownRizkallah2011 | |
| 1 |
|
| Sagraloff, Yap [Yap, Leykin] |
| |
| | | | A 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 | SagraloffYap:CEVAL:2011 | |
| 1 |
|
| Sauerwald, Stauffer [Stauffer, Randall] |
| |
| | | | Rumor Spreading and Vertex Expansion on Regular Graphs
In: 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA-11), 462-475 | Sauerwald2010 | |
| 1 |
|
| Shervashidze, Schweitzer, van Leeuwen, Mehlhorn, Borgwardt [Shervashidze, van Leeuwen, Borgwardt] |
| |
| | | | Weisfeiler-Lehman graph kernels
In: Journal of Machine Learning Research [12], 2539-2561 | Shervashidze2011 | |
| 1 |
|
| van Zuylen, Schalekamp, Williamson [Schalekamp, Williamson, Adacher, Flamini, Leo, Nicosia, Pacifici, Piccialli] |
| |
| | | | Popular Ranking
In: 10th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2011, 267-270 | vanZuylenCTW2011 | |
| 1 |
|
| Wagner, Veeramachaneni, Neumann, O'Reilly [Veeramachaneni, Neumann, O'Reilly] |
| |
| | | | Optimizing the Layout of 1000 Wind Turbines
In: European Wind Energy Association Annual Event, 1-10 | Wagner2011EWEA | |
| 106 |
| 2010 |
| |
| 1 |
|
| Althaus, Altmeyer, Naujoks [Althaus, Altmeyer, Becker, Damm, Fränzle, Olderog, Podelski, Wilhelm] |
| |
| | | | A New Combinatorial Approach to Parametric Path Analysis | Naujoks10a | |
| 1 |
|
| Ambalath, Balasundaram, H., Koppula, Misra, Philip, Ramanujan [Ambalath, Balasundaram, H., Koppula, Misra, Ramanujan, Raman, Saurabh] |
| |
| | | | On the Kernelization Complexity of Colorful Motifs
In: Parameterized and Exact Computation - 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings, 14-25 | AmbalathBalasundaramHKoppulaMisraPhilipRamanujan2010 | |
| 1 |
|
| |
| | | | Riemann-Roch for sublattices of the root lattice $A\_n$
In: Electronic Journal of Combinatorics [17], R124,1-R124,50 | Manjunath2010 | |
| 1 |
|
| Angelopoulos, Borodin [Borodin] |
| |
| | | | Randomized Priority Algorithms
In: Theoretical Computer Science [411], 2542-2558 | Angelopoulos.Borodin:randomized.2010 | |
| 1 |
|
| Bansal, Gupta, Li, Mestre, Nagarajan, Rudra [Bansal, Gupta, Li, Nagarajan, Rudra, de Berg, Meyer] |
| |
| | | | When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings (Extended Abstract)
In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. II, 218-229 | Bansal2010 | |
| 1 |
|
| Bar-Yehuda, Hermelin, Rawitz [Bar-Yehuda, Rawitz, de Berg, Meyer] |
| |
| | | | Minimum Vertex Cover in Rectangle Graphs
In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. I, 255-266 | Hermelin2010 | |
| 1 |
|
| Baruah, Bonifaci, D'Angelo, Li, Marchetti-Spaccamela, Megow, Stougie [Baruah, D'Angelo, Li, Marchetti-Spaccamela, Stougie, Hlinen{ |
| |
| 1 |
|
| 'y}, Kucera] |
| |
| | | | Scheduling Real-Time Mixed-Criticality Jobs
In: Mathematical Foundations of Computer Science 2010 : 35th International Symposium, MFCS 2010, 90-101 | Bonifaci:2010:c | |
| 1 |
|
| Baruah, Bonifaci, Marchetti-Spaccamela, Stiller [Baruah, Marchetti-Spaccamela, Stiller] |
| |
| | | | Improved Multiprocessor Global Schedulability Analysis
In: Real-Time Systems [46], 3-24 | Baruah:2010 | |
| 1 |
|
| Basit, Mustafa, Ray, Raza [Basit, Mustafa, Raza] |
| |
| | | | Centerpoints and Tverberg's technique
In: Computational Geometry [43], 593-600 | Basit2010 | |
| 1 |
|
| Batra, Sharma [Batra] |
| |
| | | | Bounds on absolute positiveness of multivariate polynomials
In: Journal of Symbolic Computation [45], 617-628 | BatraSharma2010 | |
| 1 |
|
| Berberich, Fogel, Halperin, Kerber, Setter [Fogel, Halperin, Kerber, Setter] |
| |
| | | | Arrangements on Parametric Surfaces II: Concretizations and Applications
In: Mathematics in Computer Science [4], 67-91 | bfhks-aos2-2010 | |
| 1 |
|
| Berberich, Fogel, Halperin, Mehlhorn, Wein [Fogel, Halperin, Wein] |
| |
| | | | Arrangements on Parametric Surfaces I: General Framework and Infrastructure
In: Mathematics in Computer Science [4], 45-66 | bfhmw-aos1-2010 | |
| 1 |
|
| Berberich, Hagen, Hiller, Moser [Hagen, Hiller, Moser, Müller-Hannemann, Schirra] |
| |
| | | | Experiments
In: Algorithm Engineering : Bridging the Gap between Algorithm Theory and Practice, 325-388 | bhhm-giae-exp-2010 | |
| 1 |
|
| Berberich, Halperin, Kerber, Pogalnikova [Halperin, Kerber, Pogalnikova, Vahrenhold] |
| |
| | | | Polygonal Reconstruction from Approximate Offsets
In: 26th European Workshop on Computational Geometry : Workshop Proceedings, 65-68 | bhkp-reconstruction-eurocg-2010 | |
| 1 |
|
| Berberich, Hemmer, Kerber [Hemmer, Kerber] |
| |
| | | | A Generic Algebraic Kernel for Non-linear Geometric Applications | bhk-ak2-inria-2010 | |
| 1 |
|
| Berghammer, Friedrich, Neumann [Berghammer, Pelikan, Branke] |
| |
| | | | Set-based Multi-Objective Optimization, Indicators, and Deteriorative Cycles
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 495-502 | BFN2010 | |
| 1 |
|
| Blelloch, Farzan [Blelloch, Amir, Parida] |
| |
| | | | Succinct Representations of Separable Graphs
In: Combinatorial Pattern Matching : 21st Annual Symposium, CPM 2010, 138-150 | Farzan2010a | |
| 1 |
|
| Bonifaci, Chan, Marchetti-Spaccamela, Megow [Marchetti-Spaccamela, Charikar] |
| |
| | | | Algorithms and Complexity for Periodic Real-Time Scheduling
In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1350-1359 | Bonifaci:2010:b | |
| 1 |
|
| Bonifaci, Harks, Schäfer [Harks, Schäfer] |
| |
| | | | Stackelberg Routing in Arbitrary Networks
In: Mathematics of Operations Research [35], 330 - 346 | Bonifaci:2009:a | |
| 1 |
|
| Bonifaci, Marchetti-Spaccamela [Marchetti-Spaccamela, de Berg, Meyer] |
| |
| | | | Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems
In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. II, 230-241 | Bonifaci:2010:d | |
| 1 |
|
| Boros, Elbassioni, Gurvich, Makino [Boros, Gurvich, Makino, Eisenbrand, Shepherd] |
| |
| | | | A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information
In: Integer Programming and Combinatorial Optimization : 14th International Conference, IPCO 2010, 341-354 | Elbassioni2009d | |
| 2 |
|
| Boros, Elbassioni, Gurvich, Makino [Boros, Gurvich, Makino] |
| |
| | | | On effectivity functions of game forms
In: Games and Economic Behavior [68], 512-531 | BorosElbassioniGurvich2010 | |
| | | | On Nash Equilibria and Improvement Cycles in Pure Positional Strategies for Chess-like and Backgammon-like $n$-person Games | Elbassioni2010h | |
| 1 |
|
| Boros, Elbassioni, Makino [Boros, Makino] |
| |
| | | | Left-to-right multiplication for monotone Boolean dualization
In: SIAM Journal on Computing [39], 3424-3439 | BorosElabassioniMakino2010 | |
| 1 |
|
| Böttcher, Doerr, Neumann [Böttcher, Schaefer, Cotta, Kolodziej, Rudolph] |
| |
| | | | Optimal fixed and adaptive mutation rates for the LeadingOnes problem
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 1-10 | BDN2010 | |
| 1 |
|
| Bradonjić, Elsässer, Friedrich, Sauerwald, Stauffer [Bradonjić, Elsässer, Sauerwald, Stauffer, Charikar] |
| |
| | | | Efficient Broadcast on Random Geometric Graphs
In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1412-1421 | FriedrichRGG2010 | |
| 1 |
|
| Bringmann, Friedrich [Bringmann, Schaefer, Cotta, Kolodziej, Rudolph] |
| |
| | | | Tight Bounds for the Approximation Ratio of the Hypervolume Indicator
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 607-616 | BF2010PPSN | |
| 2 |
|
| Bringmann, Friedrich [Bringmann] |
| |
| | | | An Efficient Algorithm for Computing Hypervolume Contributions
In: Evolutionary Computation [18], 383-402 | TF_ECJ4 | |
| | | | The Maximum Hypervolume Set Yields Near-optimal Approximation
In: 12th annual conference on Genetic and evolutionary computation (GECCO 2010), 511-518 | BF2010GECCO | |
| 1 |
|
| Butman, Hermelin, Lewenstein, Rawitz [Butman, Lewenstein, Rawitz] |
| |
| | | | Optimization problems in multiple-interval graphs
In: ACM Transactions on Algorithms [6], 40,1-40,18 | Hermelin2010b | |
| 1 |
|
| Canzar, Elbassioni, Elmasry, Raman [Canzar, Elmasry, Raman, Cheong, Chwa, Park] |
| |
| | | | On the Approximability of the Maximum Interval Constrained Coloring Problem
In: Algorithms and Computation : 21st International Symposium, ISAAC 2010. - Pt. II, 168-179 | Elbassioni2010 | |
| 1 |
|
| Canzar, Elbassioni, Mestre [Canzar] |
| |
| | | | A polynomial delay algorithm for enumerating approximate solutions to the interval coloring problem
In: Workshop on Algorithm Engineering and Experiments 2010 (ALENEX10), 23-33 | Mestre2010a | |
| 1 |
|
| Case, Kötzing [Case, Hutter, Stephan, Vovk, Zeugmann] |
| |
| | | | Solutions to Open Questions for Non-U-Shaped Learning with Memory Limitations
In: Algorithmic Learning Theory : 21st International Conference, ALT 2010, 285-299 | Koetzing2010NUMemLimited | |
| 1 |
|
| Case, Kötzing [Case, Kalai, Mohri] |
| |
| | | | Strongly Non-U-Shaped Learning Results by General Techniques
In: COLT 2010 : The 23rd Conference on Learning Theory, 181-193 | Koetzing2010NUTechniques | |
| 1 |
|
| Chan, Lam, Lee [Chan, Lam, de Berg, Meyer] |
| |
| | | | Non-clairvoyant speed scaling for weighted flow time
In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. I, 23-35 | Lee2010b | |
| 1 |
|
| Chan, Lam, Lee, Ting [Chan, Lam, Ting, Marion, Schwentick] |
| |
| | | | Continuous monitoring of distributed data streams over a time-based sliding window
In: 27th International Symposium on Theoretical Aspects of Computer Science
STACS 2010, 179-190 | Lee2010a | |
| 1 |
|
| Christodoulou, Chung, Ligett, Pyrga, van Stee [Chung, Ligett, Bampis, Jansen] |
| |
| | | | On the price of stability for undirected network design
In: Approximation and Online Algorithms : 7th International Workshop, WAOA 2009, 86-97 | CCLPS2009 | |
| 1 |
|
| Christodoulou, Elbassioni, Fouz [Christodoulou, Fouz, Saberi] |
| |
| | | | Truthful Mechanisms for Exhibitions
In: Internet and Network Economics : 6th International Workshop, WINE 2010, 170-181 | Elbassioni2010i | |
| 1 |
|
| Christodoulou, Koutsoupias, Kovács [Koutsoupias, Kovács] |
| |
| | | | Mechanism Design for Fractional Scheduling on Unrelated Machines
In: ACM Transactions on Algorithms [6], 38:1-38:18 | CKK2009 | |
| 1 |
|
| Christodoulou, Kovács [Kovács, Charikar] |
| |
| | | | A deterministic truthful PTAS for scheduling related machines
In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1005-1016 | ChristodoulouKavacs2010 | |
| 1 |
|
| Christodoulou, Kovacs, van Stee [Christodoulou, Kovacs, Saberi] |
| |
| | | | A truthful constant approximation for maximizing the minimum load on related machines
In: Internet and Network Economics : 6th International Workshop, WINE 2010, 182-193 | ChKoSt10 | |
| 1 |
|
| Christodoulou, Ligett, Pyrga [Christodoulou, Ligett, Abramsky, Gavoille, Kirchner, Meyer auf der Heide, Spirakis] |
| |
| | | | Contention Resolution under Selfishness
In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010. - Pt. II, 430-441 | CPL2010 | |
| 1 |
|
| Cooper, Doerr, Friedrich, Spencer [Cooper, Spencer] |
| |
| | | | Deterministic Random Walks on Regular Trees
In: Random Structures and Algorithms [37], 353-366 | DCFS2010 | |
| 1 |
|
| Doerr, Fouz [Fouz] |
| |
| | | | Hereditary Discrepancies in Different Numbers of Colors II
In: SIAM Journal on Discrete Mathematics [24], 1205-1213 | DoerrFouz2010 | |
| 1 |
|
| Doerr, Fouz, Witt [Witt, Pelikan, Branke] |
| |
| | | | Quasirandom Evolutionary Algorithms
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 1457-1464 | DoerrFW2010 | |
| 1 |
|
| Doerr, Gnewuch, Wahlström [Gnewuch] |
| |
| | | | Algorithmic construction of low-discrepancy point sets via dependent randomized rounding
In: Journal of Complexity [26], 490-507 | DGW10 | |
| 2 |
|
| Doerr, Goldberg [Goldberg, Schaefer, Cotta, Kolodziej, Rudolph] |
| |
| | | | Adaptive Drift Analysis
In: Parallel Problem Solving from Nature -- PPSN XI. -- Pt. 1, 32-41 | DG2010b | |
| | | | Drift Analysis with Tail Bounds
In: Parallel Problem Solving from Nature – PPSN XI. - Pt. 1, 174-183 | DG2010a | |
| 1 |
|
| Doerr, Goldberg, Minder, Sauerwald, Scheideler [Goldberg, Minder, Sauerwald, Scheideler, Lynch, Shvartsman] |
| |
| | | | Brief Announcement: Stabilizing Consensus with the Power of Two Choices
In: Distributed Computing : 24th International Symposium, DISC 2010, 528-530 | Doerretal2010b | |
| 1 |
|
| Doerr, Jansen, Sudholt, Winzen, Zarges [Jansen, Sudholt, Zarges, Schaefer, Cotta, Kolodziej, Rudolph] |
| |
| | | | Optimizing Monotone Functions Can Be Difficult
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 42-51 | DoerrJSWZ10 | |
| 1 |
|
| Doerr, Johannsen [Johannsen, Pelikan, Branke] |
| |
| | | | Edge-based representation beats vertex-based representation in shortest path problems
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 759-766 | DoerrJ2010 | |
| 1 |
|
| Doerr, Johannsen, Kötzing, Neumann, Theile [Theile, Schaefer, Cotta, Kolodziej, Rudolph] |
| |
| | | | More Effective Crossover Operators for the All-Pairs Shortest Path Problem
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 184-193 | Doe-Joh-Koe-Neu-The:c:10:APSPCrossover | |
| 1 |
|
| Doerr, Künnemann, Wahlström [Künnemann, Festa] |
| |
| | | | Randomized Rounding for Routing and Covering Problems: Experiments and Improvements
In: Experimental Algorithms : 9th International Symposium, SEA 2010, 190-201 | DoerrKuennemann2010 | |
| 1 |
|
| Doerr, Neumann, Wegener [Wegener] |
| |
| | | | Editorial
In: Algorithmica [57], 119-120 | DoerrNeumannWegener2010 | |
| 1 |
|
| Elbassioni, Chan [Chan, Charikar] |
| |
| | | | A QPTAS for TSP with Fat Weakly Disjoint Neighborhoods in Doubling Metrics
In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 256-267 | Elbassioni2010a | |
| 1 |
|
| Elbassioni, Fouz, Swamy [Fouz, Swamy, Saberi] |
| |
| | | | Approximation Algorithms for Non-single-minded Profit-Maximization Problems with Limited Supply
In: Internet and Network Economics : 6th International Workshop, WINE 2010, 462-472 | Elbassioni2010g | |
| 1 |
|
| Elbassioni, Matijevic, Severdija [Matijevic, Severdija, Vahrenhold] |
| |
| | | | Guarding 1.5-Dimensional with Demands
In: 26th European Workshop on Computational Geometry (EuroCG 2010), 133-136 | Elbassioni2010b | |
| 1 |
|
| |
| | | | Polynomial-time dualization of r-exact hypergraphs with applications in geometry
In: Discrete Mathematics [310], 2356-2363 | ElbassioniRauf2010 | |
| 1 |
|
| Elmasry, Jensen, Katajainen [Jensen, Katajainen, Boldi, Gargano] |
| |
| | | | The Magic of a Number System
In: Fun with Algorithms : 5th International Conference, FUN 2010, 156-165 | Elmasry2010c | |
| 1 |
|
| Elmasry, Jensen, Katajainen [Jensen, Katajainen, Kaplan] |
| |
| | | | Strictly-regular number system and data structures
In: Algorithm Theory - SWAT 2010 : 12th Scandinavian Symposium and Workshops
on Algorithm Theory, 26-37 | Elmasry2010b | |
| 1 |
|
| Elmasry, Mehlhorn, Schmidt [Schmidt] |
| |
| | | | An $O(m+n)$ Certifying Triconnectivity Algorithm for Hamiltonian Graphs
In: Algorithmica [Online First], 1-13 | ElmasryMehlhornSchmidt2010 | |
| 1 |
|
| Epstein, Levin, Marchetti-Spaccamela, Megow, Mestre, Skutella, Stougie [Epstein, Levin, Marchetti-Spaccamela, Stougie, Eisenbrand, Shepherd] |
| |
| | | | Universal sequencing on a single machine
In: Integer Programming and Combinatorial Optimization : 14th International Conference, IPCO 2010, 230-243 | EpsteinAMMMSS2010 | |
| 1 |
|
| Epstein, Levin, Mestre, Segev [Epstein, Levin, Segev, Marion, Schwentick] |
| |
| | | | Improved approximation guarantees for weighted matching in the semi-streaming model
In: 27th International Symposium on Theoretical Aspects of Computer Science (STACS 2010), 347-358 | Mestre2010b | |
| 1 |
|
| Epstein, Levin, van Stee [Epstein, Levin, Abramsky, Gavoille, Kirchner, Meyer auf der Heide, Spirakis] |
| |
| | | | Max-min online allocations with a reordering buffer
In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010, 336-347 | EpLeSt10 | |
| 2 |
|
| Epstein, van Stee [Epstein] |
| |
| | | | Maximizing the minimum load for selfish agents
In: Theoretical Computer Science [411], 44-57 | EpsSte2009 | |
| | | | On the online unit clustering problem
In: ACM Transactions on Algorithms [7], 1-18 | vanStee2009a | |
| 1 |
|
| Farzan, Gagie, Navarro [Gagie, Navarro, Cheong, Chwa, Park] |
| |
| | | | Entropy-Bounded Representation of Point Grids
In: Algorithms and Computation : 21st International Symposium, ISAAC 2010. - Pt. II, 327-338 | Farzan2010 | |
| 1 |
|
| Fernau, Fomin, Philip, Saurabh [Fernau, Fomin, Saurabh, Thai, Sahni] |
| |
| | | | The Curse of Connectivity: $t$-Total Vertex (Edge) Cover
In: Computing and Combinatorics, 16th Annual International Conference, COCOON 2010, Nha Trang, Vietnam, July 19-21, 2010. Proceedings, 34-43 | FernauFominPhilipSaurabh2010 | |
| 1 |
|
| Fountoulakis, Kang, McDiarmid [Kang, McDiarmid] |
| |
| | | | The t-stability number of a random graph
In: The Electronic Journal of Combinatorics [17], R59,1-R59,29 | FKMcEJC2010 | |
| 1 |
|
| Friedrich, Gairing, Sauerwald [Gairing, Sauerwald, Charikar] |
| |
| | | | Quasirandom Load Balancing
In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1620-1629 | Friedrich2009 | |
| 1 |
|
| Friedrich, He, Hebbinghaus, Neumann, Witt [He, Witt] |
| |
| | | | Approximating Covering Problems by Randomized Search Heuristics using Multi-Objective Models
In: Evolutionary Computation [18], 617 - 633 | FHHNW10 | |
| 1 |
|
| Friedrich, Sauerwald [Sauerwald, Thai, Sahni] |
| |
| | | | The Cover Time of Deterministic Random Walks
In: Computing and Combinatorics : 16th Annual International Conference, COCOON 2010, 130-139 | FriedrichSauerwald2010 | |
| 1 |
|
| Friedrich, Sauerwald, Vilenchik [Sauerwald, Vilenchik] |
| |
| | | | Smoothed Analysis of Balancing Networks
In: Random Structures and Algorithms [Early View], 1-24 | TF_RSA2 | |
| 1 |
|
| Gao, Wormald, Su [Wormald, Su] |
| |
| | | | Induced subgraphs in sparse random graphs with given degree sequence | Gao2010DegSub | |
| 1 |
|
| Garg, Kavitha, Kumar, Mehlhorn, Mestre [Garg, Kavitha, Kumar] |
| |
| | | | Assigning Papers to Referees
In: Algorithmica [58], 119-136 | MehlhonMestre2009 | |
| 1 |
|
| Giannopoulos, Klein, Kutz, Marx [Giannopoulos, Klein, Marx] |
| |
| | | | Computing geometric minimum-dilation graphs is NP-hard
In: International Journal of Computational Geometry & Applications [20], 147-173 | Giannopoulos2010 | |
| 1 |
|
| Gidenstam, Papatriantafilou, Tsigas [Papatriantafilou, Tsigas] |
| |
| | | | NBmalloc: Allocating Memory in a Lock-Free Manner
In: Algorithmica [58], 304-338 | Gidenstam2010 | |
| 1 |
|
| Gotthilf, Hermelin, Landau, Lewenstein [Gotthilf, Hermelin, Landau, Lewenstein] |
| |
| | | | Restricted LCS
In: 17th International Symposium on String Processing and Information Retrieval, 250-257 | HermelinLCS2010 | |
| 1 |
|
| Guibas, Milosavljevic, Motskin [Motskin, Guibas] |
| |
| | | | Connected Dominating Sets on Dynamic Geometric Graphs
In: Proceedings of the 22nd Canadian Conference on Computational Geometry (CCCG2010), 27-30 | Milosavljevic2009 | |
| 1 |
|
| Günther, König, Megow [Günther, König, Bampis, Jansen] |
| |
| | | | Scheduling and Packing Malleable Tasks with Precedence Constraints of Bounded Width
In: Approximation and Online Algorithms : 7th International Workshop, WAOA 2009, 170-181 | GuentherKM2010 | |
| 1 |
|
| Hajiaghayi, Khandekar, Kortsarz, Mestre [Hajiaghayi, Khandekar, Kortsarz, Serna, Shaltiel, Jansen, Rolim] |
| |
| | | | The Checkpoint Problem
In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 13th International Workshop, APPROX 2010 and 14th International Workshop, RANDOM 2010, 219-231 | approxMestre2010 | |
| 1 |
|
| Han, Lam, Lee, To, Wong [Han, Lam, To, Wong] |
| |
| | | | Deadline scheduling and power management for speed bounded processors
In: Theoretical Computer Science [411], 3587-3600 | Lee2010c | |
| 1 |
|
| Iacono, Ramezani, Soranzo, Altafani [Iacono, Soranzo, Altafani] |
| |
| | | | Determining the distance to monotonicity of a biological network: a graph-theoretical approach
In: IET Systems Biology [4], 223-235 | Ramezani2010 | |
| 1 |
|
| Jansen, Kratsch, Marx, Schlotter [Jansen, Marx, Schlotter, Kaplan] |
| |
| | | | Bin Packing with Fixed Number of Bins Revisited
In: Algorithm Theory - SWAT 2010 : 12th Scandinavian Symposium and Workshops
on Algorithm Theory, 260-272 | JansenKMS2010 | |
| 1 |
|
| Jansen, Neumann [Jansen] |
| |
| | | | Editorial for the Special Issue on Theoretical Aspects of Evolutionary Multi-Objective Optimization
In: Evolutionary Computation [18], 333-334 | JansenNeumann2010 | |
| 1 |
|
| Johannsen, Lengler [Kurur, Pelikan, Branke] |
| |
| | | | Can Quantum Search Accelerate Evolutionary Algorithms?
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 1433-1440 | JohannsenLK2010 | |
| 1 |
|
| Kao, Leung, Sun, Zhang [Kao, Leung, Zhang, Kratchovil, Li, Fiala, Kolman] |
| |
| | | | Deterministic Polynomial-Time Algorithms for Designing Short DNA Words
In: Theory and Applications of Models of Computation : 7th Annual Conference, TAMC 2010, 308-319 | Sun2010 | |
| 1 |
|
| Kasprzik, Kötzing [Kasprzik, Martin-Vide, Fernau, Dediu] |
| |
| | | | String Extension Learning Using Lattices
In: Language and Automata Theory and Applications : 4th International Conference, LATA 2010, 380-391 | Koetzing2010LatticeLearning | |
| 1 |
|
| Kavitha, Mestre [Kavitha] |
| |
| | | | Max-coloring paths: Tight bounds and extensions
In: Journal of Combinatorial Optimization [Online First], 1 - 14 | KavithaMestre2010 | |
| 1 |
|
| Kötzing, Lehre, Neumann, Oliveto [Lehre, Oliveto, Pelikan, Branke] |
| |
| | | | Ant Colony Optimization and the Minimum Cut Problem
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 1393-1400 | Koe-Leh-Neu-Oli:c:10:AcoMinCut | |
| 1 |
|
| Kötzing, Neumann, Röglin, Witt [Röglin, Witt, Dorigo, Birattari, Di Caro, Doursat, Engelbrecht, Floreano, Gambardella, Groß, Sahin, Sayama, Stützle] |
| |
| | | | Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem
In: Swarm Intelligence : 7th International Conference, ANTS 2010, 324-335 | Koe-Neu-Roe-Wit:c:10:ACOTSP | |
| 1 |
|
| Kratsch, Lehre, Neumann, Oliveto [Lehre, Neumann, Oliveto, Schaefer, Cotta, Kolodziej, Rudolph] |
| |
| | | | Fixed Parameter Evolutionary Algorithms and Maximum Leaf Spanning Trees: A Matter of Mutation
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 204-213 | KratschLNO2010 | |
| 1 |
|
| Kratsch, Marx, Wahlström [Marx, Hlinený, Kucera] |
| |
| | | | Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems
In: Mathematical Foundations of Computer Science 2010 : 35th International Symposium, MFCS 2010, 489-500 | KMW2010 | |
| 1 |
|
| Kuhn, Panagiotou, Spencer, Steger [Kuhn, Spencer, Steger, Charikar] |
| |
| | | | Synchrony and Asynchrony in Neural Networks
In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 949-964 | KPSS2010 | |
| 1 |
|
| McConnella, Mehlhorn, Näher, Schweitzer [McConnella, Näher, Schweitzer] |
| |
| | | | Certifying algorithms
In: Computer Science Review [Article in Press], 1-43 | McConnella2010 | |
| 1 |
|
| Misra, Philip, Raman, Saurabh [Misra, Raman, Saurabh, Lodaya, Mahajan] |
| |
| | | | The effect of girth on the kernelization complexity of Connected Dominating Set
In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India, 96-107 | MisraPhilipRamanSaurabh2010 | |
| 1 |
|
| Misra, Philip, Raman, Saurabh, Sikdar [Misra, Raman, Saurabh, Sikdar, Rahman, Fujita] |
| |
| | | | FPT Algorithms for Connected Feedback Vertex Set
In: WALCOM: Algorithms and Computation, 4th International Workshop, WALCOM 2010, Dhaka, Bangladesh, February 10-12, 2010. Proceedings, 269-280 | MisraPhilipRamanSaurabhSikdar2010 | |
| 1 |
|
| Mörig, Scholz, Tscheuschner, Berberich [Mörig, Scholz, Tscheuschner, Müller-Hannemann, Schirra] |
| |
| | | | Implementation aspects
In: Algorithm Engineering : Bridging the Gap between Algorithm Theory and Practice, 237-289 | mstb-giae-impl-2010 | |
| 2 |
|
| Neumann, Witt [Witt] |
| |
| | | | Ant Colony Optimization and the minimum spanning tree problem
In: Theoretical Computer Science [411], 2406-2413 | NeumannWitt2010 | |
| | | | Bioinspired Computation in Combinatorial Optimization : Algorithms and Their Computational Complexity | BookNeumannWitt | |
| 1 |
|
| Nor, Hermelin, Charlat, Engelstadter, Reuter, Duron [Nor, Charlat, Engelstadter, Reuter, Duron, Amir, Parida] |
| |
| | | | Mod/Resc Parsimony Inference
In: Combinatorial Pattern Matching : 21st Annual Symposium, CPM 2010, 202-213 | HermelinCulex2010 | |
| 1 |
|
| Panagiotou, Steger [Steger] |
| |
| | | | Maximal Biconnected Subgraphs of Random Planar Graphs
In: ACM Transactions on Algorithms [6], 31,1-31,21 | PanagiotouStegerJournal2010 | |
| 1 |
|
| Philip, Raman, Villanger [Raman, Villanger, Thilikos] |
| |
| | | | A Quartic Kernel for Pathwidth-One Vertex Deletion
In: Graph Theoretic Concepts in Computer Science - 36th International Workshop, WG 2010, Zar\'os, Crete, Greece, June 28-30, 2010 Revised Papers, 196-207 | PhilipRamanVillanger2010 | |
| 1 |
|
| Pountourakis, Vidali [Pountourakis, de Berg, Meyer] |
| |
| | | | A complete characterization of group-strategyproof mechanisms of cost-sharing.
In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. I, 146-157 | Vidali2010 | |
| 1 |
|
| Rusinov, Schweitzer [Rusinov] |
| |
| | | | Homomorphism -- homogeneous graphs
In: Journal of Graph Theory [65], 253-262 | RusinovSchweitzer2010 | |
| 1 |
|
| Schweitzer, Schweitzer [Schweitzer] |
| |
| | | | Connecting face hitting sets in planar graphs
In: Information Processing Letters [111], 11-15 | SchweitzerSchweitzer2010 | |
| 81 |
| |
| 1 |
|
| Ajwani, Meyer, Osipov [Meyer, Osipov, Demetrescu, Goldberg, Johnson] |
| |
| | | | Breadth first search on massive graphs
In: The shortest path problem : ninth DIMACS implemenation challenge, 291-307 | AjwaniMeyerOsipov2009 | |
| 1 |
|
| Althaus, Dumitriu [Althaus, Dumitriu, Vahrenhold] |
| |
| | | | Fast and Accurate Bounds on Linear Programs
In: Experimental Algorithms : 8th International Symposium on Experimental Algorithms (SEA 2009), 40-50 | AlthausD09 | |
| 2 |
|
| Amaldi, Iuliano, Jurkiewicz, Mehlhorn, Rizzi [Amaldi, Iuliano, Rizzi, Fiat, Sanders] |
| |
| | | | Breaking the $O(m^2n)$ Barrier for Minimum Cycle Bases
In: Algorithms - ESA 2009 : 17th Annual European Symposium, 301-312 | AmaldiIulianoetal009 | |
| | | | Breaking the $O(m^2n)$ Barrier for Minimum Cycle Bases
In: Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings, 301-312 | AIJMR09 | |
| 1 |
|
| Amini, Peleg, Pérennes, Sau, Saurabh [Peleg, Pérennes, Sau, Saurabh, Bampis, Skutella] |
| |
| | | | Degree-Constrained Subgraph Problems: Hardness and Approximation Results
In: Approximation and Online Algorithms : 6th International Workshop, WAOA 2008, 29-42 | Aminietal2009 | |
| 1 |
|
| Amini, Pérennes, Sau [Pérennes, Sau] |
| |
| | | | Hardness and approximation of traffic grooming
In: Theoretical Computer Science [410], 3751-3760 | Amini2009a | |
| 1 |
|
| Angelopoulos, Lopez-Ortiz [Lopez-Ortiz] |
| |
| | | | Intertruptible Algorithms for Multi Problem Solving
In: Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI 09), 380-386 | AngLop:ijcai09 | |
| 1 |
|
| Bansal, Chan [Bansal, Mathieu] |
| |
| | | | Weighted flow time does not admit O(1)-competitive algorithms
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 1238-1244 | Chan2008 | |
| 1 |
|
| Bansal, Chan, Pruhs [Bansal, Pruhs, Mathieu] |
| |
| | | | Speed Scaling with an Arbitrary Power Function
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 693-701 | Chan2008b | |
| 1 |
|
| Baswana, Biswas, Doerr, Friedrich, Kurur, Neumann [Baswana, Biswas, Friedrich, Kurur, Jansen, Garibay, Wiegand, Wu] |
| |
| | | | Computing Single Source Shortest Paths using Single-Objective Fitness Functions
In: FOGA'09 : revised selected papers from ACM SIGEVO
Foundations of Genetic Algorithms X, 59-66 | BBDFKN09 | |
| 1 |
|
| Bhaskar, Fleischer, Hoy, Huang [Bhaskar, Fleischer, Hoy, Mathieu] |
| |
| | | | Equilibria of Atomic Flow Games are not Unique
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 748-757 | Huang2008 | |
| 1 |
|
| Böcker, Hüffner, Truss, Wahlström [Böcker, Hüffner, Truss, Chen, Fomin] |
| |
| | | | A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams
In: Parameterized and Exact Computation : 4th International Workshop, IWPEC 2009, 38-49 | BHTWahlstroem2009 | |
| 1 |
|
| Bringmann, Friedrich [Bringmann, Friedrich, Ehrgott, Fonseca, Gandibleux, Hao, Sevaux] |
| |
| | | | Approximating the least hypervolume contributor: NP-hard in general, but fast in practice
In: Evolutionary Multi-Criterion Optimization : 5th International Conference, EMO 2009, 6-20 | BF09b | |
| 1 |
|
| Bringmann, Friedrich [Bringmann, Friedrich, Jansen, Garibay, Paul, Wu] |
| |
| | | | Don't be greedy when calculating hypervolume contributions
In: FOGA'09 : revised selected papers from ACM SIGEVO
Foundations of Genetic Algorithms X, 103-112 | BF09a | |
| 1 |
|
| Brockhoff, Friedrich, Hebbinghaus, Klein, Neumann, Zitzler [Brockhoff, Friedrich, Zitzler] |
| |
| | | | On the Effects of Adding Objectives to Plateau Functions
In: IEEE Transactions on Evolutionary Computation [13], 591-603 | BroetalTEC2009 | |
| 1 |
|
| Burnikel, Funke, Mehlhorn, Schirra, Schmitt [Burnikel, Funke, Schirra] |
| |
| | | | A Separation Bound for Real Algebraic Expressions
In: Algorithmica [55], 14-28 | Burnikel2009 | |
| 1 |
|
| Chan, Dhamdhere, Gupta, Kleinberg, Slivkins [Dhamdhere, Gupta, Kleinberg, Slivkins] |
| |
| | | | Metric Embeddings with Relaxed Guarantees
In: SIAM Journal on Computing [38], 2303-2329 | CDGKS2009 | |
| 1 |
|
| Chan, Edmonds, Lam, Lee, Marchetti-Spaccamela, Pruhs [Edmonds, Lam, Lee, Marchetti-Spaccamela, Pruhs, Albers, Marion] |
| |
| | | | Nonclairvoyant Speed Scaling for Flow and Energy
In: Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS), 255-264 | Chan2008c | |
| 1 |
|
| Chan, Edmonds, Pruhs [Edmonds, Pruhs] |
| |
| | | | Speed Scaling of Processes with Arbitrary Speedup Curves on a Multiprocessor
In: SPAA'09 : proceedings of the Twenty-First Annual Symposium on Parallelism in Algorithms and Architectures, 1-10 | ChanSPAA2009 | |
| 1 |
|
| |
| | | | Small Hop-diameter Sparse Spanners for Doubling Metrics
In: Discrete and Computational Geometry [41], 28-44 | ChanGupta2009 | |
| 1 |
|
| Christodoulou, Koutsoupias [Koutsoupias] |
| |
| | | | Mechanism Design for Scheduling
In: Bulletin of European Association for Theoretical Computer Science [97], 40-59 | CK2009 | |
| 1 |
|
| Christodoulou, Koutsoupias, Nanavati [Koutsoupias, Nanavati] |
| |
| | | | Coordination Mechanisms
In: Theoretical Computer Science [410], 3327-3336 | CKV2009 | |
| 1 |
|
| Christodoulou, Koutsoupias, Vidali [Koutsoupias, Vidali] |
| |
| | | | A lower bound for scheduling mechanisms
In: Algorithmica [85], 729-740 | CKValgorithmica2008 | |
| 1 |
|
| Cooley, Fountoulakis, Kühn, Osthus [Cooley, Fountoulakis, Kühn, Osthus] |
| |
| | | | Embeddings and Ramsey numbers of sparse k-uniform hypergraphs
In: Combinatorica [29], 263-297 | Fountoulakis2009 | |
| 1 |
|
| Correa, Megow, Raman, Suchan [Correa, Suchan, Cafieri, Mucherino, Nannicini, Tarissan, Liberti] |
| |
| | | | Cardinality Constrained Graph Partitioning into Cliques with Submodular Costs
In: 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2009), 347-350 | CorreaMRS2009 | |
| 1 |
|
| Doerr, Eremeev, Horoba, Neumann, Theile [Eremeev, Horoba, Theile, Raidl, Rothlauf] |
| |
| | | | Evolutionary Algorithms and Dynamic Programming
In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 771-777 | DoerretalGECCO2009 | |
| 1 |
|
| |
| | | | A Time-Randomness Tradeoff for Quasi-Random Rumour Spreading
In: Electronic Notes in Discrete Mathematics [34], 335 - 339 | doerrfouz2009 | |
| 1 |
|
| Doerr, Fouz, Schmidt, Wahlström [Schmidt, Rothlauf] |
| |
| | | | BBOB: Nelder-Mead with resize and halfruns
In: Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference (GECCO 2009), 2239-2246 | DoerrFouzSchmidtWahlstroem2009 | |
| 1 |
|
| Doerr, Friedrich, Künnemann, Sauerwald [Friedrich, Künnemann, Sauerwald, Finocchi, Hershberger] |
| |
| | | | Quasirandom Rumor Spreading: An Experimental Analysis
In: 2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX), 145-153 | DFKS09 | |
| 1 |
|
| Doerr, Friedrich, Sauerwald [Sauerwald, Albers, Marchetti-Spaccamela, Matias, Nikoletseas, Thomas] |
| |
| | | | Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness
In: Automata, Languages and Programming : 36th International Colloquium, ICALP 2009, 366-377 | DoerrFriedrichSauerwald09 | |
| 1 |
|
| Doerr, Friedrich, Sauerwald [Sauerwald] |
| |
| | | | Quasirandom Rumor Spreading on Expanders
In: Electronic Notes in Discrete Mathematics [34], 243 - 247 | doerrfriedrichsauerwald2009 | |
| 1 |
|
| Doerr, Gnewuch, Wahlström [Gnewuch, L'Ecuyer, Owen] |
| |
| | | | Implementation of a component-by-component algorithm to generate small low-discrepancy samples
In: Monte Carlo and Quasi-Monte Carlo Methods 2008, 323-338 | DoerrGW2009 | |
| 1 |
|
| Doerr, Theile [Theile, Raidl, Rothlauf] |
| |
| | | | Improved Analysis Methods for Crossover-Based Algorithms
In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 247-254 | DoerrTheileGECCO2009 | |
| 1 |
|
| Dumitriu, Funke, Kutz, Milosavljevic [Dumitriu, Funke, Kutz, Milosavljevic] |
| |
| | | | How Much Geometry It Takes to Reconstruct a 2-Manifold in R 3
In: ACM Journal of Experimental Algorithms [14], 2.2:1-2.2:17 | DFKM2009 | |
| 1 |
|
| Eisenbrand, Karrenbauer, Skutella, Xu [Eisenbrand, Skutella, Xu] |
| |
| | | | Multiline Addressing by Network Flow
In: Algorithmica [53], 583-596 | EKSX2008 | |
| 1 |
|
| Elbassioni, Fishkin, Sitters [Fishkin, Sitters] |
| |
| | | | Approximation algorithms for the Euclidean traveling salesman problem with discrete and continuous neighborhoods
In: International Journal of Computational Geometry & Applications [19], 173-193 | Elbassioni2009x | |
| 1 |
|
| Elbassioni, Krohn, Matijevic, Mestre, Severdija [Krohn, Matijevic, Severdija, Albers, Marion] |
| |
| | | | Improved Approximation Algorithms for 1.5D Terrain Guarding
In: Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS), 361-371 | conf/stacs/ElbassioniKMMS2009 | |
| 1 |
|
| Elbassioni, Krohn, Matijevic, Mestre, Severdija [Krohn, Matijevic, Severdija] |
| |
| | | | Improved Approximations for Guarding 1.5-Dimensional Terrains
In: Algorithmica [Online First], 1-13 | ElbassioniMestre2009a | |
| 1 |
|
| Elbassioni, Makino, Rauf [Makino, Fiat, Sanders] |
| |
| | | | Output-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs
In: Algorithms - ESA 2009 : 17th Annual European Symposium, 143-154 | ESA:EMR09 | |
| 1 |
|
| Elbassioni, Makino, Rauf [Makino, Ngo] |
| |
| | | | On the Readability of Monotone Boolean Formulae
In: Computing and Combinatorics :15th Annual International Conference, COCOON 2009, 496-505 | EMR09 | |
| 1 |
|
| Elbassioni, Raman, Ray, Sitters [Ray, Sitters, Matthieu] |
| |
| | | | On the approximability of the maximum feasible subsystem problem with 0/1-coefficients
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 1210-1219 | Elbassioni2009a | |
| 1 |
|
| Elbassioni, Raman, Ray, Sitters [Sitters, Mavronicolas, Papadopoulou] |
| |
| | | | On Profit-Maximizing Pricing for the Highway and Tollbooth Problems
In: Algorithmic Game Theory : Second International Symposium, SAGT 2009, 275-286
In: ArXiv.org [5814], 275-286 | Raman2009 | |
| 1 |
|
| Elbassioni, Tiwary [Tiwary] |
| |
| | | | Complexity of Approximating the Vertex Centroid of a Polyhedron
In: Algorithms and Computation, 20th International Symposium (ISAAC), 413-422 | Elbassioni2009ISAAC | |
| 1 |
|
| Epstein, Kleiman, Mestre [Epstein, Kleiman, Leonardi] |
| |
| | | | Parametric Packing of Selfish Items and the Subset Sum Algorithm
In: Internet and Network Economics : 5th International Workshop, WINE 2009, 67-78 | Mestre2008 | |
| 1 |
|
| Epstein, Kleiman, van Stee [Epstein, Kleiman, Leonardi] |
| |
| | | | Maximizing the Minimum Load: The Cost of Selfishness
In: Internet and Network Economics : 5th International Workshop, WINE 2009, 232-243 | EpKlSt2009 | |
| 1 |
|
| Epstein, van Stee, Tamir [Epstein, Tamir] |
| |
| | | | Paging with request sets
In: Theory of Computing Systems [44], 67-81 | EpStTa2009 | |
| 1 |
|
| Fountoulakis, Kühn, Osthus [Kühn, Osthus] |
| |
| | | | Minors in random regular graphs
In: Random Structures and Algorithms [35], 444-463 | Fountoulakis2009b | |
| 1 |
|
| Friedrich, He, Hebbinghaus, Neumann, Witt [He, Witt] |
| |
| | | | Analyses of Simple Hybrid Algorithms for the Vertex Cover Problem
In: Evolutionary Computation, [17], 3-19 | FrietalECJ2009 | |
| 1 |
|
| Friedrich, Horoba, Neumann [Horoba, Raidl, Rothlauf] |
| |
| | | | Multiplicative Approximations and the Hypervolume Indicator
In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 571-578 | FriHorNeuGECCO2009 | |
| 1 |
|
| Friedrich, Oliveto, Sudholt, Witt [Friedrich, Oliveto, Sudholt, Witt] |
| |
| | | | Analysis of Diversity-Preserving Mechanisms for Global Exploration
In: Evolutionary Computation [17], 455-476 | FriedrichOSW2009 | |
| 1 |
|
| Friedrich, Sauerwald [Friedrich, Sauerwald] |
| |
| | | | Near-Perfect Load Balancing by Randomized Rounding
In: STOC09 : Proceedings of the 2009 ACM International Symposium on Theory of Computing, 121-130 | FS09 | |
| 1 |
|
| Friedrich, Sauerwald, Vilenchik [Sauerwald, Vilenchik, Albers, Marchetti-Spaccamela, Matias, Nikoletseas, Thomas] |
| |
| | | | Smoothed Analysis of Balancing Networks
In: Automata, Languages and Programming : 36th International Colloquium, ICALP 2009, 472-483 | FriedrichSauerwaldVilenchik09 | |
| 1 |
|
| |
| | | | Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
In: Algorithmica [54], 54-71 | journal/algo/GandhiM2007 | |
| 1 |
|
| Gärtner, Hotz [Hotz, Ambos-Spies, Löwe, Merkle] |
| |
| | | | Computability of Analytic Functions with Analytic Machines
In: Mathematical Theory and Computational Practice : 5th Conference on Computability in Europe, CiE 2009, 250-259 | GaertnerHotzr2009 | |
| 1 |
|
| Gidenstam, Papatriantafilou, Sundell, Tsigas [Papatriantafilou, Sundell, Tsigas] |
| |
| | | | Efficient and Reliable Lock-Free Memory Reclamation Based on Reference Counting
In: IEEE Transactions on Parallel and Distributed Systems [20], 1173-1187 | Gidenstam200902 | |
| 1 |
|
| Gidenstam, Papatriantafilou, Tsigas [Papatriantafilou, Tsigas] |
| |
| | | | NBmalloc : Allocating Memory in a Lock-Free Manner
In: Algorithmica [Online First], 1-35 | Gidenstam200903 | |
| 1 |
|
| Giesen, Manjunath [Giesen, Agarwal, Alt, Teillaud] |
| |
| | | | Minimizing Absolute Gaussian Curvature over Meshes
In: Computational Geometry, 1-16 | Manjunath2009a | |
| 1 |
|
| Helwig, Neumann, Wanka [Helwig, Wanka, Bouchachia, Nedjah, de Macedo Mourelle, Pedrycz] |
| |
| | | | Particle Swarm Optimization with Velocity Adaptation
In: 2009 International Conference on Adaptive and Intelligent Systems ICAIS 2009 : proceedings, 146-151 | HelNeuWan2009 | |
| 1 |
|
| |
| | | | Generic implementation of a modular GCD over Algebraic Extension Fields
In: EuroCG'09 : 25th European Workshop on Computational Geometry, 321-324 | hh-mgcd-2009 | |
| 1 |
|
| Hemmer, Limbach, Schömer [Schömer] |
| |
| | | | Continued Work on the Computation of an Exact Arrangement of Quadrics
In: EuroCG'09 : 25th European Workshop on Computational Geometry, 313-316 | hls-qarr-2009 | |
| 1 |
|
| Hemmer, Tsigaridas, Zafeirakopoulos, Emiris, Karavelas, Mourrain [Tsigaridas, Zafeirakopoulos, Emiris, Karavelas, Mourrain] |
| |
| | | | Experimental evaluation and cross-benchmarking of univariate real solvers
In: Symbolic Numeric Computation 2009 (SNC 2009), 45-54 | HTZ-AKCROSS-2009 | |
| 1 |
|
| |
| | | | Additive Approximations of Pareto-Optimal Sets by Evolutionary Multi-Objective Algorithms
In: FOGA'09 : Revised Selected Papers from ACM SIGEVO Foundations of Genetic Algorithms X, 79-86 | HorNeuFOGA2009 | |
| 1 |
|
| Johannsen, Razgon, Wahlström [Razgon, Kullmann] |
| |
| | | | Solving SAT for CNF formulas with a one-sided variable occurrence restriction
In: Theory and Applications of Satisfiability Testing, SAT 2009 : 12th International Conference, SAT 2009, 80-85 | JohannsenRazgonWahlstroem2008 | |
| 1 |
|
| Kavitha, Liebchen, Mehlhorn, Michail, Rizzi, Ueckerdt, Zweig [Kavitha, Liebchen, Rizzi, Ueckerdt, Zweig] |
| |
| | | | Cycle Bases in Graphs: Characterization, Algorithms, Complexity, and Applications
In: Computer Science Review [3], 199-243 | SurveyCycleBases | |
| 1 |
|
| Kavitha, Mestre [Kavitha, Dong, Du, Ibarra] |
| |
| | | | Max-coloring paths: Tight bounds and extensions
In: Algorithms and Computation : 20th International Symposium, ISAAC 2009, 87-96 | KavithaMestre2008 | |
| 1 |
|
| Kavitha, Mestre, Nasre [Kavitha, Nasre, Albers, Marchetti-Spaccamela, Matias, Nikoletseas, Thomas] |
| |
| | | | Popular Mixed Matchings
In: Automata, Languages and Programming : 36th International Colloquium, ICALP 2009, 574-584 | Mestre2009 | |
| 1 |
|
| Krumke, van Stee, Westphal [Krumke, Westphal, Ravi, Shukla] |
| |
| | | | Online job admissions
In: Fundamental Problems in Computing : Essays in Honor of Professor Daniel J. Rosenkrantz, 435-454 | KrStWe2009 | |
| 1 |
|
| Larsson, Gidenstam, Ha, Papatriantafilou, Tsigas [Larsson, Ha, Papatriantafilou, Tsigas] |
| |
| | | | Multiword Atomic Read/Write Registers on Multiprocessor Systems
In: Journal of experimental algorithmics [13], 7:1-7:30 | Gidenstam200901 | |
| 1 |
|
| Neumann, Oliveto, Witt [Oliveto, Witt, Raidl, Rothlauf] |
| |
| | | | Theoretical Analysis of Fitness-Proportional Selection: Landscapes and Efficiency
In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 835-842 | NeuOliWitGECCO2009 | |
| 1 |
|
| Neumann, Sudholt, Witt [Sudholt, Witt, Lim, Jain, Dehuri] |
| |
| | | | Computational Complexity of Ant Colony Optimization and Its Hybridization with Local Search
In: Innovations in Swarm Intelligence, 91-120 | NSWACOchapter09 | |
| 1 |
|
| Neumann, Sudholt, Witt [Sudholt, Witt] |
| |
| | | | Analysis of Different MMAS ACO Algorithms on Unimodal Functions and Plateaus
In: Swarm Intelligence [3], 35-68 | NeuSudWitSwarm2009 | |
| 1 |
|
| |
| | | | Runtime Analysis of a Simple Ant Colony Optimization Algorithm
In: Algorithmica [54], 243-255 | Neumann2008 | |
| 1 |
|
| Oliveto, Lehre, Neumann [Oliveto, Lehre] |
| |
| | | | Theoretical Analysis of Rank-Based Mutation - Combining Exploration and Exploitation
In: 2009 IEEE Congress on Evolutionary Computation : CEC, 1455-1462 | LehNeuOliCEC2009 | |
| 1 |
|
| Panagiotou [Bernasconi, Steger] |
| |
| | | | The Degree Sequence of Random Graphs from Subcritical Classes
In: Combinatorics, Probability and Computing [18], 647-681 | BernasconiPanagiotouSteger2009 | |
| 1 |
|
| |
| | | | Vertices of Degree k in Random Unlabeled Trees
In: European Conference on Combinatorics, Graph Theory and Applications (EuroComb '09), 41-45 | PanagiotouSinhaProc2009 | |
| 1 |
|
| Panagiotou, Steger [Steger, Matthieu] |
| |
| | | | Maximal Biconnected Subgraphs of Random Planar Graphs
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 432-440 | PanagiotouSteger2008 | |
| 1 |
|
| Philip, Raman, Sikdar [Raman, Sikdar, Fiat, Sanders] |
| |
| | | | Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels
In: Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings, 694-705 | PhilipRamanSikdar2009 | |
| 1 |
|
| Pyrga, Chung [Chung, Mavronicolas, Papadopoulou] |
| |
| | | | Stochastic Stability in Internet Router Congestion Games
In: Algorithmic Game Theory : Second International Symposium, SAGT 2009, 183-195 | Pyrga2009 | |
| 1 |
|
| Sanders, Sivadasan, Skutella [Sanders, Skutella] |
| |
| | | | Online scheduling with bounded migration
In: Mathematics of Operations Research [34], 481-498 | Sivadasan2009 | |
| 1 |
|
| Schwarz, Karrenbauer, Schehr, Rieger [Schwarz, Schehr, Rieger] |
| |
| | | | Domain walls and chaos in the disordered SOS model
In: Journal of statistical mechanics : theory and experiment [P08022], 1-23 | Schwarzetal2009 | |
| 1 |
|
| Shervashidze, Vishwanathan, Petri, Mehlhorn, Borgwardt [Shervashidze, Vishwanathan, Petri, Borgwardt, van Dyk, Welling] |
| |
| | | | Efficient Graphlet Kernels for Large Graph Comparison
In: Proceedings of the Twelfth International Conference on Artificial Intelligence and Statistics (AISTATS), 488-495 | Graphlets | |
| 84 |
| |
| 1 |
|
| Ajwani, Malinger, Meyer, Toledo [Malinger, Meyer, Toledo, McGeoch] |
| |
| | | | Characterizing the Performance of Flash Memory Storage Devices and Its Impact on Algorithm Design
In: Proc. 7th Intern. Workshop on Experimental Algorithms (WEA), 208-219 | Flash-WEA-2008 | |
| 1 |
|
| Albrecht, Karrenbauer, Xu [Albrecht, Xu] |
| |
| | | | A clipper-free Algorithm for efficient HW-Implementation of local dimming LED-Backlight
In: Proceedings of the 28th International Display Research Conference (IDRC), 286-289 | AKX08 | |
| 1 |
|
| Althaus, Canzar, Emmett, Karrenbauer, Marshall, Meyer-Bäse, Zhang [Emmett, Marshall, Meyer-Bäse, Zhang] |
| |
| | | | Computing H/D-exchange speeds of single residues from data of peptic fragments
In: 23rd Annual ACM Symposium on Applied Computing (SAC), 1273-1277 | AltCanKar08 | |
| 1 |
|
| Angelopoulos, Dorrigiv, Lopez-Ortiz [Dorrigiv, Lopez-Ortiz] |
| |
| | | | List Update with Locality of Reference
In: 8th Latin American Symposium on Theoretical Informatics (LATIN 2008), 399-410 | ADLO:08.listupdate | |
| 1 |
|
| Angelopoulos, Lopez-Ortiz, Hamel [Lopez-Ortiz, Hamel] |
| |
| | | | Optimal Scheduling of Contract Algorithms with Soft Deadlines
In: 23rd National Conference on Artificial Intelligence (AAAI 2008), 868-873 | ALOH:08.soft | |
| 1 |
|
| Berberich, Hemmer, Karavelas, Pion, Teillaud, Tsigaridas [Karavelas, Pion, Teillaud, Tsigaridas] |
| |
| | | | Prototype implementation of the algebraic kernel | ACS-TR-121202-01 | |
| 1 |
|
| Boros, Elbassioni, Gurvich, Makino, Oudalov [Boros, Gurvich, Makino, Oudalov] |
| |
| | | | A Complete Characterization of Nash-Solvability of Bimatrix Games in Terms of the Exclusion of Certain 2x2 subgames
In: Computer Science - Theory and Applications, Third International Computer Science Symposium in Russia, CSR 2008, 99-109 | Elbassioni2008d | |
| 1 |
|
| Boros, Elbassioni, Gurvich, Tiwary [Boros, Gurvich, Tiwary] |
| |
| | | | Characterization of the vertices and extreme directions of the negative cycle polyhedron and hardness of generating vertices of 0/1-polyhedra
In: CoRR [abs/0801.3790], x-x | Elbassioni2008 | |
| 1 |
|
| Boros, Elbassioni, Makino [Boros, Makino] |
| |
| | | | On Berge Multiplication for Monotone Boolean Dualization
In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, 48-59 | Elbassioni2008c | |
| 1 |
|
| Brockhoff, Friedrich, Neumann [Brockhoff, Rudolph, Jansen, Lucas, Poloni, Beume] |
| |
| | | | Analyzing Hypervolume Indicator Based Algorithms
In: Parallel Problem Solving from Nature (PPSN X), 651-660 | BroFriNeuPPSN2008 | |
| 1 |
|
| Cameron, Johannsen, Prellberg, Schweitzer [Cameron, Prellberg] |
| |
| | | | Counting Defective Parking Functions
In: Electronic Journal of Combinatorics [15], R92 | CameronJohannsenPrellbergSchweitzer2008 | |
| 1 |
|
| Chang, Johnson [Johnson] |
| |
| | | | Online and offline selling in limit order markets
In: 4th International Workshop on Internet and Network Economics (WINE 2008), 41-52 | Chang2008a | |
| 1 |
|
| Christodoulou, Koutsoupias, Vidali [Koutsoupias, Vidali, Halperin] |
| |
| | | | A Characterization of 2-Player Mechanisms for Scheduling
In: Algorithms - ESA 2008, 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008. Proceedings., 297-307 | ChristodoulouKV2008 | |
| 1 |
|
| Christodoulou, Kovács, Schapira [Kovács, Schapira, Aceto, Damg{ |
| |
| 1 |
|
| aa}rd, Goldberg, Halldórsson, Ingólfsdóttir, Walukiewicz] |
| |
| | | | Bayesian Combinatorial Auctions
In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I, 820-832 | ChristodoulouKS2008 | |
| 1 |
|
| Cooley, Fountoulakis, Kühn, Osthus [Cooley, Kühn, Osthus] |
| |
| | | | 3-Uniform hypergraphs of bounded degree have linear Ramsey numbers
In: Journal of Combinatorial Theory B [98], 484-505 | Fountoulakis2008a | |
| 1 |
|
| Cooper, Doerr, Friedrich, Spencer [Cooper, Spencer] |
| |
| | | | Deterministic Random Walks on Regular Trees
In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, 766-772 | Doerr2008-SODAb | |
| 1 |
|
| Diedrich, Harren, Jansen, Thöle, Thomas [Diedrich, Jansen, Thöle, Thomas] |
| |
| | | | Approximation Algorithms for 3D Orthogonal Knapsack
In: Journal of Science and Technology [23], 749-762 | DiedrichHarrenJansenThoeleThomas2008 | |
| 1 |
|
| Diedrich, Kehden, Neumann [Diedrich, Kehden, Berghammer, Möller, Struth] |
| |
| | | | Multi-objective Problems in Terms of Relational Algebra
In: Relations and Kleene Algebra in Computer Science 2008, 84-98 | DieKehNeu2008 | |
| 1 |
|
| Diedrich, Neumann [Diedrich] |
| |
| | | | Using Fast Matrix Multiplication in Bio-Inspired Computation for Complex Optimization Problems
In: IEEE Congress on Evolutionary Computation 2008, 3828-3833 | DieNeuCEC2008 | |
| 1 |
|
| Doerr, Friedrich, Sauerwald [Sauerwald] |
| |
| | | | Quasirandom Rumor Spreading
In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, 773-781 | Doerr2008-SODA | |
| 1 |
|
| Doerr, Gnewuch [Gnewuch, Keller, Heinrich, Niederreiter] |
| |
| | | | Construction of Low-Discrepancy Point Sets of Small Size by Bracketing Covers and Dependent Randomized Rounding
In: Monte Carlo and Quasi-Monte Carlo Methods 2006, 299-312 | DoerrGnewuch2008 | |
| 2 |
|
| Doerr, Gnewuch, Kritzer, Pillichshammer [Gnewuch, Kritzer, Pillichshammer] |
| |
| | | | Component-by-component construction of low-discrepancy point sets of small size
In: Monte Carlo Methods and Applications [14], 129-149 | DoerrGnewuchKritzerPillichshammer2008 | |
| | | | Component-by-component construction of low-discrepancy point sets of small size
In: Monte Carlo Methods Applications [14], 129-150 | DoerrGKP08 | |
| 1 |
|
| Doerr, Jansen, Klein [Jansen, Klein, Ryan, Keijzer] |
| |
| | | | Comparing local and global mutations on bit-strings.
In: Genetic and Evolutionary Computation Conference 2008, 929-936 | DoerrJansenKlein2008 | |
| 1 |
|
| Doerr, Johannsen, Tang [Tang, , , , , ] |
| |
| | | | How Single Ant ACO Systems Optimize Pseudo-Boolean Functions
In: Parallel Problem Solving from Nature – PPSN X, 378-388 | DoerrJohannsenTang2008a | |
