Previous Page | Next Page | Expand All | Collapse All | Search (Full Text)
Show entries starting with: A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
![]() | ![]() | Date | Time | Created By ... | Author(s) [non member] | Editor(s) [non member] | Year | Title | Type | ||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1 |
| ![]() | |||||||||||||
1 |
|
| ![]() | ||||||||||||
![]() | 15:18:35 | Sandy Heydrich | Heydrich, Sandy [van Stee, Rob] | 2015 | Dividing Connected Chores Fairly In: Theoretical Computer Science [593], 51-61 | Journal Article | ![]() | ||||||||
2 |
| ![]() | |||||||||||||
2 |
|
| ![]() | ||||||||||||
![]() | ![]() | ![]() | ![]() | 13:01:05 | Xiaohui Bei | Bei, Xiaohui | [Halldórsson, Magnús M.] [Iwama, Kazuo] [Kobayashi, Naoki] [Speckmann, Bettina] | 2015 | 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 | Proceedings Article | ![]() | ||||
![]() | 18:59:48 | Davis Issac | Issac, Davis | [Xu, Dachuan] [Du, Donglei] [Du, Dingzhu] | 2015 | Sampling in Space Restricted Settings In: Computing and Combinatorics 2015, | Proceedings Article | ![]() | |||||||
87 |
| ![]() | |||||||||||||
7 |
|
| ![]() | ||||||||||||
![]() | ![]() | ![]() | ![]() | 18:27:06 | Administrators,LocalDomainServers,[AGEditors] | Gawrychowski, Pawel Jez, Artur [Jez, Lukasz] | ![]() | 2014 | Validating the Knuth-Morris-Pratt Failure Function, Fast and Online In: Theory of Computing Systems [54], 337-372 | Journal Article | ![]() | ||||
![]() | 18:21:05 | Administrators,LocalDomainServers,[AGEditors] | Jez, Artur [Okhotin, Alexander] | 2014 | Computational completeness of equations over sets of natural numbers In: Information and Computation [237], 56-94 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 16:31:02 | Administrators,LocalDomainServers,[AGEditors] | Jez, Artur | ![]() | 2014 | The Complexity of Compressed Membership Problems for Finite Automata In: Theory of Computing Systems [55], 685-718 | Journal Article | ![]() | ||||
![]() | 15:06:02 | Administrators,LocalDomainServers,[AGEditors] | Jez, Artur | [Kulikov, Alexander] [Kuznetsov, Sergei] [Pevzner, Pavel] | 2014 | A really Simple Approximation of Smallest Grammar In: 25th Annual Symposium on Combinatorial Pattern Matching (CPM 2014), 182-191 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 14:21:57 | Administrators,LocalDomainServers,[AGEditors] | [Diekert, Volker] Jez, Artur [Plandowski, Wojciech] | [Hirsch, Edward] [Kuznetsov, Sergei] [Pin, Jean-Eric] [Vereshchagin, Nikolai] | 2014 | Finding All Solutions of Equations in Free Groups and Monoids with Involution In: 9th International Computer Science Symposium in Russia (CSR 2014), 1-15 | Proceedings Article | ![]() | ||||
![]() | 14:13:54 | Administrators,LocalDomainServers,[AGEditors] | Jez, Artur | [Esparza, Javier] [Fraigniaud, Pierre] [Husfeldt, Thore] [Koutsoupia, Elias] | 2014 | Context Unification is in PSPACE In: 41st International Colloquium on Automata, Languages, and Programming (ICALP 2014), 244-255 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 14:04:23 | Administrators,LocalDomainServers,[AGEditors] | Jez, Artur [Lohrey, Markus] | [Mayr, Ernst] [Portier, Natacha] | 2014 | ![]() | Approximation of smallest linear tree grammar In: 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 445-457 | Proceedings Article | ![]() | |||
9 |
|
| ![]() | ||||||||||||
![]() | ![]() | ![]() | ![]() | 14:52:37 | Administrators,LocalDomainServers,[AGEditors] | Gawrychowski, Pawel | ![]() | 2014 | Simple and efficient LZW-compressed multiple pattern matching In: Journal of Discrete Algorithms [25], 34-41 | Journal Article | ![]() | ||||
![]() | 14:47:56 | Administrators,LocalDomainServers,[AGEditors] | [Babenko, Maxim A.] [Gawrychowski, Pawel] [Kociumaka, Tomasz] [Starikovskaya, Tatiana A.] | [Kulikov, Alexander S.] [Kuznetsov, Sergei O.] [Pevzner, Pavel A.] | 2014 | 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 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 14:44:18 | Administrators,LocalDomainServers,[AGEditors] | Gawrychowski, Pawel [Uznanski, Przemyslaw] | [Kulikov, Alexander S.] [Kuznetsov, Sergei O.] [Pevzner, Pavel A.] | 2014 | 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 | Proceedings Article | ![]() | ||||
![]() | 14:41:02 | Administrators,LocalDomainServers,[AGEditors] | Gawrychowski, Pawel [Mozes, Shay] [Weimann, Oren] | [Esparza, Javier] [Fraigniaud, Pierre] [Husfeldt, Thore] [Koutsoupias, Elias] | 2014 | 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 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 14:32:15 | Administrators,LocalDomainServers,[AGEditors] | [Gagie, Travis] Gawrychowski, Pawel [Kärkkäinen, Juha] [Nekrich, Yakov] [Puglisi, Simon J.] | [Parso, Alberto] [Viola, Alfredo] | 2014 | 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 | Proceedings Article | ![]() | ||||
![]() | 14:21:03 | Administrators,LocalDomainServers,[AGEditors] | Gawrychowski, Pawel [Manea, Florin] [Nowotka, Dirk] | Mayr, Ernst W. [Portier, Natacha] | 2014 | Testing Generalised Freeness of Words In: 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 337-349 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 16:10:31 | Administrators,LocalDomainServers,[AGEditors] | [Friedrichs, Stephan] [Kulau, Ulf] [Wolf, Lars] | ![]() | 2014 | Energy-efficient voltage scheduling of peripheral components on wireless sensor nodes In: Communications Workshops (ICC), 2014 IEEE International Conference on, 860-865 | Proceedings Article | ![]() | ||||
![]() | 15:00:51 | Administrators,LocalDomainServers,[AGEditors] | [Fekete, Sándor P.] [Fiethe, Björn] [Friedrichs, Stephan] [Michalik, Harald] [Orlis, Christos] | 2014 | Efficient reconfiguration of processing modules on FPGAs for space instruments In: Adaptive Hardware and Systems (AHS), 2014 NASA/ESA Conference on, 15-22 | Proceedings Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 14:30:34 | Stephan Friedrichs | [Fekete, Sándor P.] [Friedrichs, Stephan] [Kröller, Alexander] [Schmidt, Christiane] | [Du, Ding-Zhu] [Zhang, Guochuan] | 2013 | Facets for Art Gallery Problems In: Computing and Combinatorics, 208-220 | Proceedings Article | ![]() | ||||
1 |
|
| ![]() | ||||||||||||
![]() | ![]() | ![]() | ![]() | 23:34:22 | Administrators,LocalDomainServers,[AGEditors] | Jurkiewicz, Tomasz | ![]() | 2013 | ![]() | Toward Better Computation Models for Modern Machines Universität des Saarlandes | Thesis - PhD thesis | ![]() | |||
70 |
|
| ![]() | ||||||||||||
![]() | ![]() | ![]() | ![]() | 16:42:33 | Administrators,LocalDomainServers,[AGEditors] | [Gagie, Travis] Gawrychowski, Pawel [Nekrich, Yakov] | ![]() | 2013 | Heaviest Induced Ancestors and Longest Common Substrings In: 25th Canadian Conference on Computational Geometry (CCCG 13), 145-150 | Proceedings Article | ![]() | ||||
![]() | 16:40:05 | Administrators,LocalDomainServers,[AGEditors] | [Bonifaci, Vincenzo] [Marchetti-Spaccamela, Alberto] Megow, Nicole Wiese, Andreas | 2013 | Polynomial-Time Exact Schedulability Tests for Harmonic Real-Time Tasks In: Proceedings of the 34th IEEE Real-Time Systems Symposium (RTSS 2013), | Proceedings Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 16:38:20 | Administrators,LocalDomainServers,[AGEditors] | Adamaszek, Anna Wiese, Andreas | ![]() | 2013 | Approximation Schemes for Maximum Weight Independent Set of Rectangles In: Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2013), | Proceedings Article | ![]() | ||||
![]() | 16:36:58 | Administrators,LocalDomainServers,[AGEditors] | Gawrychowski, Pawel [Straszak, Damian] | [Cai, Leizhen] [Cheng, Siu-Wing] [Lam, Tak Wah] | 2013 | Beating O(nm) in Approximate LZW-Compressed Pattern Matching In: Algorithms and Computation - 24th International Symposium (ISAAC 2013), 78-88 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 16:36:13 | Administrators,LocalDomainServers,[AGEditors] | [Bonifaci, Vincenzo] [Marchetti-Spaccamela, Alberto] [Stiller, Sebastian] Wiese, Andreas | ![]() | 2013 | Feasibility Analysis in the Sporadic DAG Task Model In: Proceedings of the 25th Euromicro Conference on Real-Time Systems (ECRTS 2013), | Proceedings Article | ![]() | ||||
![]() | 16:30:38 | Administrators,LocalDomainServers,[AGEditors] | [Anagnostopoulos, Aris] [Grandoni, Fabrizio] [Leonardi, Stefano] Wiese, Andreas | 2013 | 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), | Proceedings Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 16:11:41 | Administrators,LocalDomainServers,[AGEditors] | Gawrychowski, Pawel [Kucherov, Gregory] [Nekrich, Yakov] [Starikovskaya, Tatiana] | [Kurland, Oren] [Lewenstein, Moshe] [Porat, Ely] | 2013 | Minimal Discriminating Words Problem Revisited In: String Processing and Information Retrieval - 20th International Symposium (SPIRE 2013), | Proceedings Article | ![]() | ||||
![]() | 16:06:16 | Administrators,LocalDomainServers,[AGEditors] | [Bannai, Hideo] Gawrychowski, Pawel [Inenaga, Shunsuke] [Takeda, Masayuki] | [Fischer, Johannes] [Sanders, Peter] | 2013 | Converting SLP to LZ78 in almost Linear Time In: Combinatorial Pattern Matching, 24th Annual Symposium (CPM 2013), 38-49 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 16:00:37 | Administrators,LocalDomainServers,[AGEditors] | Gawrychowski, Pawel [Manea, Florin] [Nowotka, Dirk] | [Bonizzoni, Paola] [Brattka, Vasco] [Lowe, Benedikt] | 2013 | Discovering Hidden Repetitions in Words In: 9th Conference on Computability in Europe (CiE 2013), 210-219 | Proceedings Article | ![]() | ||||
![]() | 15:54:48 | Administrators,LocalDomainServers,[AGEditors] | Gawrychowski, Pawel | [Bulatov, Andrei A.] [Shur, Arseny M.] | 2013 | Alphabetic Minimax Trees in Linear Time In: 8th International Computer Science Symposium in Russia (CSR 2013), 36-48 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 15:38:10 | [Library] | Gawrychowski, Pawel [Manea, Florin] [Mercas, Robert] [Nowotka, Dirk] [Tiseanu, Catalin] | [Portier, Natacha] [Wilke, Thomas] | 2013 | Finding Pseudo-repetitions In: 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), 257-268 | Proceedings Article | ![]() | ||||
![]() | 01:22:21 | Administrators,LocalDomainServers,[AGEditors] | Croitoru, Cosmina | 2013 | Abstract Debates In: IEEE International Conference on Tools with Artificial Intelligence (ICTAI) - 2013, | Proceedings Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 00:55:04 | Administrators,LocalDomainServers,[AGEditors] | Croitoru, Cosmina Kötzing, Timo | ![]() | 2014 | A Normal Form for Argumentation Frameworks In: Theory and Applications of Formal Argumentation (TAFA'13), 32-45 | Proceedings Article | ![]() | ||||
![]() | 19:08:52 | Administrators,LocalDomainServers,[AGEditors] | Hoefer, Martin [Skopalik, Alexander] | 2013 | Altruism in Atomic Congestion Games In: ACM Transactions on Economics and Computation [1], 21 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 19:07:53 | Administrators,LocalDomainServers,[AGEditors] | [Harks, Tobias] Hoefer, Martin [Klimm, Max] [Skopalik, Alexander] | ![]() | 2013 | Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games In: Mathematical Programming [141], 193-215 | Journal Article | ![]() | ||||
![]() | 19:05:58 | Administrators,LocalDomainServers,[AGEditors] | Hoefer, Martin [Skopalik, Alexander] | 2013 | On the Complexity of Pareto-optimal Nash and Strong Equilibria In: Theory of Computing Systems [53], 441-453 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 19:04:31 | Administrators,LocalDomainServers,[AGEditors] | [Fanghänel, Alexander] [Geulen, Sascha] Hoefer, Martin [Vöcking, Berthold] | ![]() | 2013 | Online Capacity Maximization in Wireless Networks In: Journal of Scheduling [16], 81-91 | Journal Article | ![]() | ||||
![]() | 19:02:45 | Administrators,LocalDomainServers,[AGEditors] | Hoefer, Martin | 2013 | Strategic Cooperation in Cost Sharing Games In: International Journal of Game Theory [42], 29-53 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 19:01:47 | Administrators,LocalDomainServers,[AGEditors] | Hoefer, Martin | ![]() | 2013 | Local Matching Dynamics in Social Networks In: Information & Computation [222], 20-35 | Journal Article | ![]() | ||||
![]() | 19:00:16 | Administrators,LocalDomainServers,[AGEditors] | Hoefer, Martin [Wagner, Lisa] | [Chen, Yiling] [Immorlica, Nicole] | 2013 | Designing Profit Shares in Matching and Coalition Formation Games In: 9th Conference on Web and Internet Economics (WINE-13), 249-262 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 18:57:32 | Administrators,LocalDomainServers,[AGEditors] | [Dams, Johannes] Hoefer, Martin [Kesselheim, Thomas] | [Afek, Yehuda] | 2013 | Sleeping Experts in Wireless Networks In: 27th International Symposium on Distributed Computing (DISC-13), 344-357 | Proceedings Article | ![]() | ||||
![]() | 18:53:37 | Administrators,LocalDomainServers,[AGEditors] | [Anshelevich, Elliot] [Bhardwaj, Onkar] Hoefer, Martin | [Bodlaender, Hans] [Italiano, Giuseppe] | 2013 | Friendship and Stable Matching. In: 21st European Symposium on Algorithms (ESA-13), 49-60 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 18:50:13 | Administrators,LocalDomainServers,[AGEditors] | Hoefer, Martin Sauerwald, Thomas | ![]() | 2013 | Brief Announcement: Threshold Load Balancing in Networks In: 32nd Symposium on Principles of Distributed Computing (PODC-13), 54-56 | Proceedings Article | ![]() | ||||
![]() | 18:47:01 | Administrators,LocalDomainServers,[AGEditors] | Hoefer, Martin [Kesselheim, Thomas] | 2013 | Brief Announcement: Universally Truthful Secondary Spectrum Auctions In: 25th Symposium on Parallelism in Algorithms and Architectures (SPAA-13), 99-101 | Proceedings Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 18:42:37 | Administrators,LocalDomainServers,[AGEditors] | Hoefer, Martin [Wagner, Lisa] | [Fomin, Fedor] [Freivalds, Rusins] [Kwiatkowska, Marta] [Peleg, David] | 2013 | Locally Stable Marriage with Strict Preferences In: 40th International Colloquium on Automata, Languages and Programming (ICALP-13), 620-631 | Proceedings Article | ![]() | ||||
![]() | 18:33:03 | Administrators,LocalDomainServers,[AGEditors] | Hoefer, Martin [Kesselheim, Thomas] [Vöcking, Berthold] | 2013 | Truthfulness and Stochastic Dominance with Monetary Transfers. In: 14th Conf. Electronic Commerce (EC-13), 567-582 | Proceedings Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 15:59:28 | Administrators,LocalDomainServers,[AGEditors] | Khosla, Megha | [Bodlaender, Hans L.] [Italiano, Giuseppe F.] | 2013 | Balls into Bins Made Faster In: Algorithms - ESA 2013, | Proceedings Article | ![]() | ||||
![]() | 14:50:13 | Administrators,LocalDomainServers,[AGEditors] | [Curticapean, Radu] Künnemann, Marvin | [Bodlaender, Hans L.] [Italiano, Giuseppe F.] | 2013 | A Quantization Framework for Smoothed Analysis of Euclidean Optimization Problems In: 21st Annual European Symposium on Algorithms (ESA 2013), 349-360 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 16:03:32 | Administrators,LocalDomainServers,[AGEditors] | Jez, Artur [Maletti, Andreas] | ![]() | 2013 | Hyper-minimization for deterministic tree automata In: International Journal of Foundations of Computer Science [24], 815-830 | Journal Article | ![]() | ||||
![]() | 15:42:12 | Administrators,LocalDomainServers,[AGEditors] | Jez, Artur | [Fomin, Fedor V.] [Freivalds, Rusins] [Kwiatkowska, Marta Z.] [Peleg, David] | 2013 | ![]() | One-Variable Word Equations in Linear Time In: 40th International Colloquium on Automata, Languages, and Programming (ICALP 2013), 324-335 | Proceedings Article | ![]() | ||||||
![]() | ![]() | ![]() | ![]() | 15:29:19 | Administrators,LocalDomainServers,[AGEditors] | Jez, Artur [Okhotin, Alexander] | [Beal, Marie-Pierre] [Carton, Olivier] | 2013 | Unambiguous Conjunctive Grammars over a One-Letter Alphabet In: 17th International Conference on Developments in Language Theory (DLT 2013), 277-288 | Proceedings Article | ![]() | ||||
![]() | 15:23:12 | Administrators,LocalDomainServers,[AGEditors] | Jez, Artur | [Beal, Marie-Pierre] [Carton, Olivier] | 2013 | ![]() | Recompression: Word Equations and Beyond In: 17th International Conference on Developments in Language Theory (DLT 2013), 12-26 | Proceedings Article | ![]() | ||||||
![]() | ![]() | ![]() | ![]() | 15:15:16 | Administrators,LocalDomainServers,[AGEditors] | Jez, Artur | [Fischer, Johannes] [Sanders, Peter] | 2013 | ![]() | Approximation of Grammar-Based Compression via Recompression In: 24th Annual Symposium on Combinatorial Pattern Matching (CPM 2013), 165-176 | Proceedings Article | ![]() | |||
![]() | 01:25:04 | Administrators,LocalDomainServers,[AGEditors] | [Bonifaci, Vincenzo] [Chan, Ho-Leung] [Marchetti-Spaccamela, Alberto] Megow, Nicole | 2012 | Algorithms and Complexity for Periodic Real-Time Scheduling In: ACM Transactions on Algorithms [9], 601-619 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 01:17:10 | Administrators,LocalDomainServers,[AGEditors] | Megow, Nicole [Verschae, Jose] | ![]() | 2013 | 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 | Proceedings Article | ![]() | ||||
![]() | 18:29:04 | Administrators,LocalDomainServers,[AGEditors] | Bringmann, Karl [Friedrich, Tobias] [Igel, Christian] [Voß, Thomas] | 2013 | Speeding Up Many-Objective Optimization by Monte Carlo Approximations In: Artificial Intelligence [204], 22–29 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 18:15:48 | Administrators,LocalDomainServers,[AGEditors] | Bringmann, Karl [Friedrich, Tobias] | ![]() | 2013 | Approximation Quality of the Hypervolume Indicator In: Artificial Intelligence [195], 265–290 | Journal Article | ![]() | ||||
![]() | 18:11:26 | Administrators,LocalDomainServers,[AGEditors] | Bringmann, Karl [Sauerwald, Thomas] [Stauffer, Alexandre] Sun, He | 2014 | Balls into bins via local search: cover time and maximum load In: 31st Symposium on Theoretical Aspects of Computer Science (STACS-14), accepted | Proceedings Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 18:07:43 | Administrators,LocalDomainServers,[AGEditors] | [Alvarez, Victor] Bringmann, Karl [Ray, Saurabh] [Seidel, Raimund] | ![]() | 2013 | Counting Triangulations Approximately In: 25th Canadian Conference on Computational Geometry (CCCG-13), 85-89 | Proceedings Article | ![]() | ||||
![]() | 17:57:43 | Administrators,LocalDomainServers,[AGEditors] | Bringmann, Karl | [Chatterjee, Krishnendu] [Sgall, Jirí] | 2013 | Bringing Order to Special Cases of Klee’s Measure Problem In: 38th International Symposium on Mathematical Foundations of Computer Science (MFCS-13), 207-218 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 17:54:57 | Administrators,LocalDomainServers,[AGEditors] | Bringmann, Karl [Engels, Christian] [Manthey, Bodo] [Raghavendra Rao, B. V.] | [Chatterjee, Krishnendu] [Sgall, Jirí] | 2013 | Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems In: 38th International Symposium on Mathematical Foundations of Computer Science (MFCS-13), 219-230 | Proceedings Article | ![]() | ||||
![]() | 17:25:10 | Administrators,LocalDomainServers,[AGEditors] | Bringmann, Karl [Friedrich, Tobias] | [Fomin, Fedor V.] [Freivalds, Rūsiņš] [Kwiatkowska, Marta] [Peleg, David] | 2013 | Exact and Efficient Generation of Geometric Random Variates and Random Graphs In: Automata, Languages, and Programming - 40th International Colloquium (ICALP-13), 267-278 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 17:19:58 | Administrators,LocalDomainServers,[AGEditors] | Anand, S Bringmann, Karl [Friedrich, Tobias] [Garg, Naveen] [Kumar, Amit] | [Fomin, Fedor V.] [Freivalds, Rūsiņš] [Kwiatkowska, Marta] [Peleg, David] | 2013 | Minimizing maximum (weighted) flow-time on related and unrelated machines In: Automata, Languages, and Programming - 40th International Colloquium (ICALP-13), 13-24 | Proceedings Article | ![]() | ||||
![]() | 17:14:16 | Administrators,LocalDomainServers,[AGEditors] | Bringmann, Karl [Friedrich, Tobias] | 2013 | Parameterized Average-Case Complexity of the Hypervolume Indicator In: 15th Annual Conference on Genetic and Evolutionary Computation (GECCO-13), 575-582 | Proceedings Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 21:48:05 | Administrators,LocalDomainServers,[AGEditors] | [Clementi, Andrea] [Crescenzi, Pierluigi] Doerr, Carola [Fraigniaud, Pierre] [Pasquale, Francesco] [Silvestri, Riccardo] | ![]() | 2013 | Diffusion probabiliste dans les reseaux dynamiques In: Proc. of the 15èmes Rencontres Francophones pour les Aspects Algorithmiques des Télécommunications (AlgoTel 2013), | Proceedings Article | ![]() | ||||
![]() | 21:42:33 | Carola Winzen | Doerr, Benjamin Spöhel, Reto [Thomas, Henning] Winzen, Carola | 2012 | Playing Mastermind with Many Colors In: Proc. of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2012), | Proceedings Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 21:39:01 | Administrators,LocalDomainServers,[AGEditors] | Doerr, Benjamin Doerr, Carola Ebel, Franziska | ![]() | 2013 | Lessons From the Black-Box: Fast Crossover-Based Genetic Algorithms In: Proc. of Genetic and Evolutionary Computation Conference (GECCO 2013), 781-788 | Proceedings Article | ![]() | ||||
![]() | 17:35:34 | [Library] | Doerr, C. Schmidt, Jens M. Ramakrishna, G. | 2013 | Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time In: 39th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'13), 225-236 | Proceedings Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 17:33:18 | Administrators,LocalDomainServers,[AGEditors] | Mehlhorn, Kurt Neumann, A. Schmidt, Jens M. | ![]() | 2013 | Certifying 3-Edge-Connectivity In: 39th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'13), 358-369 | Proceedings Article | ![]() | ||||
![]() | 17:16:24 | Administrators,LocalDomainServers,[AGEditors] | van Stee, Rob | 2013 | SIGACT News Online Algorithms Column 22 In: SIGACT News [44], 125 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 17:04:27 | Administrators,LocalDomainServers,[AGEditors] | Schmidt, Jens M. | ![]() | 2013 | A Planarity Test via Construction Sequences In: 38th International Symposium on Mathematical Foundations of Computer Science (MFCS'13), 765-776 | Proceedings Article | ![]() | ||||
![]() | 16:52:31 | Administrators,LocalDomainServers,[AGEditors] | Schmidt, Jens M. | 2013 | A Simple Test on 2-Vertex- and 2-Edge-Connectivity In: Information Processing Letters [113], 241-244 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 16:50:59 | Administrators,LocalDomainServers,[AGEditors] | Schmidt, Jens M. | ![]() | 2013 | Contractions, Removals and Certifying 3-Connectivity in Linear Time In: SIAM Journal on Computing [42], 494-535 | Journal Article | ![]() | ||||
![]() | 16:16:33 | Administrators,LocalDomainServers,[AGEditors] | [Antoniadis, Antonios] [Huang, Chien-Chung] Ott, Sebastian [Verschae, José] | [Chatterjee, Krishnendu] [Sgall, Jiri] | 2013 | 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 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 16:07:35 | Administrators,LocalDomainServers,[AGEditors] | Elbassioni, Khaled M. Makino, Kazuhisa Mehlhorn, Kurt Ramezani, Fahimeh | Du, Ding-Zhu Zhang, Guochuan | 2013 | On Randomized Fictitious Play for Approximating Saddle Points over Convex Sets In: 19th Annual International Computing and Combinatorics Conference (COCOON-13), 65-76 | Proceedings Article | ![]() | ||||
![]() | 16:06:18 | Administrators,LocalDomainServers,[AGEditors] | Kobel, Alexander Sagraloff, Michael | 2013 | Fast Approximate Polynomial Multipoint Evaluation and Applications In: arXiv [abs/1304.8069], 17 | Electronic Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 16:05:27 | [Library] | [Clementi, Andrea] [Crescenzi, Pierluigi] Doerr, Carola [Fraigniaud, Pierre] [Isopi, Marc] [Panconesi, Alessandro] [Pasquale, Francesco] [Silvestri, Riccardo] | ![]() | 2013 | Rumor Spreading in Random Evolving Graphs In: Proc. of the 21st European Symposium on Algorithms (ESA 2013), 325-336 | Proceedings Article | ![]() | ||||
![]() | 16:02:47 | Administrators,LocalDomainServers,[AGEditors] | [Heydrich, Sandy] van Stee, Rob | [Voecking, Berthold] | 2013 | ![]() | Dividing connected chores fairly In: 6th International Symposium on Algorithmic Game Theory, 420-433 | Proceedings Article | ![]() | ||||||
![]() | ![]() | ![]() | ![]() | 16:02:07 | Administrators,LocalDomainServers,[AGEditors] | Doerr, Carola [De Rainville, François-Michel] | ![]() | 2013 | Constructing Low Star Discrepancy Point Sets with Genetic Algorithms In: Proc. of Genetic and Evolutionary Computation Conference (GECCO 2013), 789-796 | Proceedings Article | ![]() | ||||
![]() | 15:58:25 | Administrators,LocalDomainServers,[AGEditors] | Winzen, Carola | 2013 | Direction-Reversing Quasi-Random Rumor Spreading with Restarts In: Information Processing Letters [113], 921-926 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 15:54:39 | Administrators,LocalDomainServers,[AGEditors] | [Chen, Xujin] [Epstein, Leah] [Kleiman, Elena] van Stee, Rob | ![]() | 2013 | ![]() | Maximizing the minimum load: The cost of selfishness In: Theoretical Computer Science [482], 9-19 | Journal Article | ![]() | |||
![]() | 15:52:29 | Administrators,LocalDomainServers,[AGEditors] | Panagiotou, Konstantinos Pourmiri, Ali Sauerwald, Thomas | Leizhen Cai, Siu-Wing Cheng, Tak Wah Lam | 2013 | Faster Rumor Spreading with Multiple Calls In: 24th International Symposium on Algorithms and Computation (ISAAC-13), 446-456 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 15:51:10 | Administrators,LocalDomainServers,[AGEditors] | [Christodoulou, George] [Kovacs, Annamaria] van Stee, Rob | ![]() | 2013 | ![]() | A truthful constant approximation for maximizing the minimum load on related machines In: Theoretical Computer Science [489-490], 88-98 | Journal Article | ![]() | |||
![]() | 15:50:28 | Administrators,LocalDomainServers,[AGEditors] | Berberich, Eric Emeliyanenko, Pavel Kobel, Alexander Sagraloff, Michael | 2013 | Exact symbolic–numeric computation of planar algebraic curves In: Theoretical Computer Science [491], 1-32 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 11:16:28 | Administrators,LocalDomainServers,[AGEditors] | Bringmann, Karl Doerr, Benjamin Neumann, Adrian [Sliacan, Jakub] | [Fomin, Fedor V.] [Freivalds, Rūsiņš] [Kwiatkowska, Marta] [Peleg, David] | 2013 | Online Checkpointing with Improved Worst-Case Guarantees In: Automata, Languages, and Programming - 40th International Colloquium (ICALP 2013), 255-266 | Proceedings Article | ![]() | ||||
![]() | 06:56:58 | Administrators,LocalDomainServers,[AGEditors] | Doerr, Benjamin Künnemann, Marvin | [Blum, Christian] | 2013 | How the (1+λ) Evolutionary Algorithm Optimizes Linear Functions In: 15th Annual Conference on Genetic and Evolutionary Computation Conference (GECCO '13), 1589-1596 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 07:34:26 | Administrators,LocalDomainServers,[AGEditors] | Doerr, Benjamin Künnemann, Marvin | ![]() | 2013 | Royal Road Functions and the (1 + λ) Evolutionary Algorithm: Almost no Speed-up from Larger Offspring Populations In: 2013 IEEE Congress on Evolutionary Computation (CEC 2013), 424-431 | Proceedings Article | ![]() | ||||
![]() | 23:34:23 | Administrators,LocalDomainServers,[AGEditors] | Doerr, Benjamin Kodric, Bojana Voigt, Marco | 2013 | Lower bounds for the runtime of a global multi-objective evolutionary algorithm In: IEEE Congress on Evolutionary Computation, 432-439 | Proceedings Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 23:14:49 | Administrators,LocalDomainServers,[AGEditors] | [Afshani, Peyman] [Agrawal, Manindra] Doerr, Benjamin Doerr, Carola [Larsen, Kasper Green] Mehlhorn, Kurt | [Brodnik, Andrej] [López-Ortiz, Alejandro] [Raman, Venkatesh] [Viola, Alfredo] | 2013 | The Query Complexity of Finding a Hidden Permutation In: Space-Efficient Data Structures, Streams, and Algorithms, 1-11 | Part of a Book | ![]() | ||||
![]() | 22:44:16 | Administrators,LocalDomainServers,[AGEditors] | Doerr, Benjamin | 2013 | Improved approximation algorithms for the Min-Max Selecting Items problem In: Information Processing Letters [113], 747-749 | Journal Article | ![]() | ||||||||
52 |
| ![]() | |||||||||||||
6 |
|
| ![]() | ||||||||||||
![]() | ![]() | ![]() | ![]() | 15:12:39 | Administrators,LocalDomainServers,[AGEditors] | [Nor, Igor] Hermlin, Danny [Charlat, Sylvain] [Engelstadter, Jan] [Reuter, Max] [Duron, Olivier] [Sagot, Marie-France] | ![]() | 2012 | Mod/Resc Parsimony Inference: Theory and application In: Information and Computation [213], 23-32 | Journal Article | ![]() | ||||
![]() | 11:17:14 | Administrators,LocalDomainServers,[AGEditors] | [Fellows, Michael R.] Hermelin, Danny [Rosamond, Fraces A.] | 2012 | Well Quasi Orders in Subclasses of Bounded Treewidth Graphs and Their Algorithmic Applications In: Algorithmica [64], 3-18 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 10:50:26 | Administrators,LocalDomainServers,[AGEditors] | [Brightwell, Graham] Panagiotou, Konstantinos [Steger, Angelika] | ![]() | 2012 | Extremal subgraphs of random graphs In: Random Structures & Algorithms [41], 147-178 | Journal Article | ![]() | ||||
![]() | 10:10:23 | [Library] | [Ajwani, Deepak] Elbassioni, Khaled [Govindarajan, Sathish] Ray, Saurabh | 2012 | Conflict-free coloring for rectangle ranges using O(n .382) colors In: Discrete & Computational Geometry [48], 39-52 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 10:04:43 | Administrators,LocalDomainServers,[AGEditors] | [Ailon, Nir] [Avigdor-Elgrabli, Noa] [Liberty, Edo] van Zuylen, Anke | ![]() | 2012 | Improved Approximation Algorithms for Bipartite Correlation Clustering In: SIAM Journal on Computing [41], 1110-1121 | Journal Article | ![]() | ||||
![]() | 13:08:58 | Administrators,LocalDomainServers,[AGEditors] | Philip, Geevarghese [Raman, Venkatesh] [Sikdar, Somnath] | 2012 | Polynomial kernels for dominating set in graphs of bounded degeneracy and beyond In: ACM Transactions on Algorithms [9], 23 | Journal Article | ![]() | ||||||||
24 |
|
| ![]() | ||||||||||||
![]() | 15:39:07 | Administrators,LocalDomainServers,[AGEditors] | [Sanders, Peter] [Singler, Johannes] van Stee, Rob | 2013 | ![]() | Real-time prefetching and caching In: Journal of Scheduling [16], 47-58 | Journal Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 16:14:01 | Administrators,LocalDomainServers,[AGEditors] | Jez, Artur | [Portier, Natacha] [Wilke, Thomas] | 2013 | ![]() | Recompression: a simple and powerful technique for word equations In: 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), 233-244 | Proceedings Article | ![]() | |||
![]() | 14:46:52 | Administrators,LocalDomainServers,[AGEditors] | Bringmann, Karl [Green Larsen, Kasper] | 2013 | Succinct Sampling from Discrete Distributions In: 45th ACM Symposium on Theory of Computing (STOC-13), 775-782 | Proceedings Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 13:43:57 | Administrators,LocalDomainServers,[AGEditors] | Heydrich, Sandy | ![]() | 2012 | Dividing connected chores fairly Universität des Saarlandes | Thesis - Bachelor thesis | ![]() | ||||
![]() | 13:41:56 | Administrators,LocalDomainServers,[AGEditors] | Feldmann, Matthias | 2012 | Stochastic optimization with fitness proportional ant systems Universität des Saarlandes | Thesis - Bachelor thesis | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 11:24:14 | Administrators,LocalDomainServers,[AGEditors] | Croitoru, Cosima | ![]() | 2012 | Algorithmic aspects of abstract argumentation frameworks Universität des Saarlandes | Thesis - Masters thesis | ![]() | ||||
![]() | 11:22:08 | [Library] | Molter, Hendrik | 2012 | ACO beats EA on a dynamic pseudo-Boolean function Universität des Saarlandes | Thesis - Masters thesis | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 11:16:25 | Administrators,LocalDomainServers,[AGEditors] | Moran, Shay | ![]() | 2012 | Shattering extremal systems Universität des Saarlandes | Thesis - Masters thesis | ![]() | ||||
![]() | 11:14:41 | Administrators,LocalDomainServers,[AGEditors] | Krohmer, Anton | 2012 | Finding cliques in scale-free networks Universität des Saarlandes | Thesis - Masters thesis | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 11:12:30 | [Library] | Ott, Sebastian | ![]() | 2012 | Thou shalt not lie : on truthfully maximizing the minimum load on selfish related machines Universität des Saarlandes | Thesis - Masters thesis | ![]() | ||||
![]() | 11:58:27 | [Library] | Elbassioni, Khaled [Matijevic, Domagoj] [Severdija, Domagoj] | 2012 | Guarding 1.5D terrains with demands In: International Journal of Computer Mathematics [89], 2143-2151 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 11:45:58 | Administrators,LocalDomainServers,[AGEditors] | Bringmann, Karl Friedrich, Tobias | ![]() | 2012 | Approximating the least hypervolume contributor: NP-hard in general, but fast in practice In: Theoretical Computer Science [425], 104-116 | Journal Article | ![]() | ||||
![]() | 14:09:59 | Administrators,LocalDomainServers,[AGEditors] | Panagiotou, Konstantinos [Sinha, Makrand] | 2012 | Vertices of degree k in random unlabeled trees In: Journal of Graph Theory [69], 114-130 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 13:05:18 | Administrators,LocalDomainServers,[AGEditors] | Kavitha, Telikepalli [Mestre, Julián] | ![]() | 2012 | Max-coloring paths: tight bounds and extensions In: Journal of Combinatiorial Optimization [24], 1-14 | Journal Article | ![]() | ||||
![]() | 12:55:08 | [Library] | [Doerr, Benjamin] [Doerr, Carola] [Spöhel, Reto] [Thomas, Henning] | 2013 | Playing Mastermind with Many Colors In: arXiv [abs/1207.0773], 1-22 | Electronic Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 12:39:29 | Administrators,LocalDomainServers,[AGEditors] | Fouz, Mahmoud | ![]() | 2012 | Randomized Rumor Spreading in Social Networks & Complete Graphs Universität des Saarlandes | Thesis - PhD thesis | ![]() | ||||
![]() | 18:41:40 | Administrators,LocalDomainServers,[AGEditors] | [Agrawal, Manindra] Saha, Chandan [Saxena, Nitin] | 2013 | A Case of Depth-3 Identity Testing, Sparse Factorization and Duality In: 45th ACM Symposium on the Theory of Computing (STOC-13), toappear | Proceedings Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 08:08:59 | Administrators,LocalDomainServers,[AGEditors] | [Cai, Jin-Yi] [Lu, Pinyan] Xia, Mingji | ![]() | 2013 | 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 | Proceedings Article | ![]() | ||||
![]() | 17:46:36 | Chien-Chung Huang | Huang, Chien-Chung [Kavitha, Telikepalli] | 2011 | Near-popular matchings in the Roommates problem In: 19th European Symposium on Algorithms (ESA), | Proceedings Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 17:44:08 | Chien-Chung Huang | Huang, Chien-Chung [Kavitha, Telikepalli] | ![]() | 2011 | Popular Matchings in the Stable Marriage Problem In: 38th International Colloquium on Automata, Languages and Programming (ICALP), | Proceedings Article | ![]() | ||||
![]() | 17:41:08 | Administrators,LocalDomainServers,[AGEditors] | Huang, Chien-Chung | [Fomin, Fedor V.] [Kaski, Petteri] | 2012 | Non-preemptive Speed Scaling In: Algorithm Theory - SWAT 2012 : 13th Scandinavian Symposium and Workshops, 249-260 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 10:26:22 | Administrators,LocalDomainServers,[AGEditors] | Friedrich, Tobias [Kroeger, Trent] [Neumann, Frank] | ![]() | 2012 | Weighted preferences in evolutionary multi-objective optimization In: International Journal of Machine Learning and Cybernetics [Online First], 1-10 | Electronic Journal Article | ![]() | ||||
![]() | 13:06:21 | Administrators,LocalDomainServers,[AGEditors] | Elbassioni, Khaled [Jeli´c, Slobodan] [Matijevi`c, Domagoj] | 2012 | The relation of Connected Set Cover and Group Steiner Tree In: Theoretical Computer Science [438], 96-101 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 13:00:42 | Administrators,LocalDomainServers,[AGEditors] | Elbassioni, Khaled [Raman, Rajiv] Ray, Saurabh [Sitters, René] | ![]() | 2012 | On the complexity of the highway problem In: Theoretical Computer Science [460], 70-77 | Journal Article | ![]() | ||||
22 |
|
| ![]() | ||||||||||||
![]() | ![]() | ![]() | ![]() | 13:02:07 | [Library] | Hermelin, Danny [Rizzi, Romeo] [Vialette, Stephane] | [Chao, Kun-Mao] [Hsu, Tsan-sheng] [Lee, Der-Tsai] | 2012 | Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph In: Algorithms and Computation : 23rd International Symposium, ISAAC 2012, 465-474 | Proceedings Article | ![]() | ||||
![]() | 10:55:19 | [Library] | [Elmasry, Amr] Mehlhorn, Kurt Schmidt, Jens M. | 2012 | An O(n+m) Certifying Triconnnectivity Algorithm for Hamiltonian Graphs In: Algorithmica [62], 754-766 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 13:21:20 | Administrators,LocalDomainServers,[AGEditors] | [Chan, Ho-Leung] [Lam, Tak-Wah] Lee, Lap-Kei [Ting, Hing-Fung] | ![]() | 2012 | Continuous Monitoring of Distributed Data Streams over a Time-Based Sliding Window In: Algorithmica [62], 1088-1111 | Journal Article | ![]() | ||||
![]() | 19:19:05 | Administrators,LocalDomainServers,[AGEditors] | Mehlhorn, Kurt Sagraloff, Michael Wang, Pengming | 2013 | From Approximate Factorization to Root Isolation with Application to Cylindrical Algebraic Decomposition In: arXiv [abs/1301.4870], | Electronic Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 19:14:05 | Michael Sagraloff | [Yap, Chee] Sagraloff, Michael [Sharma, Vikram] | ![]() | 2013 | Analytic Root Clustering: A Complete Algorithm using Soft Zero Tests | Unpublished/Draft | ![]() | ||||
![]() | 19:02:06 | Michael Sagraloff | Sagraloff, Michael | 2012 | Exaktes geometrisches Rechnen | Miscellaneous | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 18:51:51 | Administrators,LocalDomainServers,[AGEditors] | Emeliyanenko, Pavel | ![]() | 2012 | Harnessing the Power of GPUs for Problems in Real Algebraic Geometry Universität des Saarlandes | Thesis - PhD thesis | ![]() | ||||
![]() | 18:49:40 | Administrators,LocalDomainServers,[AGEditors] | Wang, Pengming | 2012 | Certification of Curve Arrangements Universität des Saarlandes | Thesis - Masters thesis | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 18:46:29 | [Library] | Becker, Ruben | ![]() | 2012 | The Bolzano Method to Isolate the Roots of a Bitstream Polynomial Universität des Saarlandes | Thesis - Bachelor thesis | ![]() | ||||
![]() | 08:50:32 | Administrators,LocalDomainServers,[AGEditors] | [Agrawal, Manindra] Saha, Chandan [Saxena, Nitin] | 2012 | ![]() | Quasi-polynomial Hitting-set for Set-depth-Delta Formulas In: arXiv [abs/1209.2333], 1-13 | Electronic Journal Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 08:42:25 | [Library] | [Agrawal, Manindra] Saha, Chandan [Saptharishi, Ramprasad] [Saxena, Nitin] | ![]() | 2012 | ![]() | 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 | Proceedings Article | ![]() | |||
![]() | 08:31:38 | [Library] | Saha, Chandan [Saptharishi, Ramprasad] [Saxena, Nitin] | 2013 | ![]() | A Case of Depth-3 Identity Testing, Sparse Factorization and Duality In: Computational Complexity [22], 39-69 | Electronic Journal Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 07:40:15 | Administrators,LocalDomainServers,[AGEditors] | [Kayal, Neeraj] Saha, Chandan | ![]() | 2012 | ![]() | On the Sum of Square Roots of Polynomials and Related Problems In: The ACM Transactions on Computation Theory [4], 9:1-9:15 | Journal Article | ![]() | |||
![]() | 07:26:18 | Administrators,LocalDomainServers,[AGEditors] | [Kayal, Neeraj] Saha, Chandan | 2011 | ![]() | On the Sum of Square Roots of Polynomials and Related Problems In: 26th IEEE Conference on Computational Complexity (CCC), 292-299 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 19:38:37 | Administrators,LocalDomainServers,[AGEditors] | Doerr, Carola [Gnewuch, Michael] Wahlström, Magnus | [Chen, W.W.L.] [Srivastav, A.] [Travaglini, G.] | 2013 | Calculation of Discrepancy Measures and Applications In: A Panorama of Discrepancy Theory, 1-55 | Part of a Book | ![]() | ||||
![]() | 19:21:15 | Khaled Elbassioni | Elbassioni, Khaled [Chalermsook, Parinya] [Nanongkai, Danupon] Sun, He | 2013 | Multi-Attribute Profit-Maximizing Pricing | Unpublished/Draft | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 07:58:36 | Christine Rizkallah | Rizkallah, Christine | ![]() | 2011 | Maximum Cardinality Matching In: Archive of Formal Proofs, | Electronic Journal Article | ![]() | ||||
![]() | 13:42:10 | Jens M. Schmidt | Mehlhorn, Kurt Näher, Stefan Schweitzer, Pascal | 2011 | Certifying algorithms In: Computer Science Review [5], 119-161 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 18:42:25 | Jens M. Schmidt | Schmidt, Jens M. | ![]() | 2013 | Contractions, Removals and How to Certify 3-Connectivity in Linear Time | Unpublished/Draft | ![]() | ||||
![]() | 14:58:12 | Administrators,LocalDomainServers,[AGEditors] | [Afshani, Peyman] [Agrawal, Manindra] Doerr, Benjamin [Green Larsen, Kasper] Mehlhorn, Kurt Winzen, Carola | 2012 | The Query Complexity of Finding a Hidden Permutation In: Electronic Colloquium on Computational Complexity (ECCC): Report Series [87 (Revision 1)], 1-36 | Electronic Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 16:21:21 | Christine Rizkallah | [Alkassar, Eyad] [Böhme, Sascha] Mehlhorn, Kurt Rizkallah, Christine | ![]() | 2013 | A Framework for the Verification of Certifying Computations | Unpublished/Draft | ![]() | ||||
![]() | 03:39:47 | Administrators,LocalDomainServers,[AGEditors] | Duan, Ran Mehlhorn, Kurt | 2012 | A Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market In: arXiv [abs/1212.0979v1], 1-8 | Electronic Journal Article | ![]() | ||||||||
201 |
| ![]() | |||||||||||||
81 |
|
| ![]() | ||||||||||||
![]() | ![]() | ![]() | ![]() | 15:33:41 | [Library] | Hermelin, Danny [Mnich, Matthias] [van Leeuwen, Erik Jan] | [Epstein, Leah] [Ferragina, Paolo] | 2012 | Parameterized complexity of induced H-matching on claw-free graphs In: Algorithms - ESA 2012 : 20th Annual European Symposium, 624-635 | Proceedings Article | ![]() | ||||
![]() | 15:30:12 | Administrators,LocalDomainServers,[AGEditors] | Hermelin, Danny [Wu, Xi] | [Rabani, Yuval] | 2012 | 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 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 15:25:51 | Administrators,LocalDomainServers,[AGEditors] | Hermelin, Danny [Mestre, Julian] [Rawitz, Dror] | [Golumbic, Martin Charles] [Stern, Michal] [Levy, Avivit] [Morgenstern, Gila] | 2012 | Optimization Problems in Dotted Interval Graphs In: Graph-Theoretic Concepts in Computer Science : 38th InternationalWorkshop, WG 2012, 46-56 | Proceedings Article | ![]() | ||||
![]() | 19:16:07 | Administrators,LocalDomainServers,[AGEditors] | Duan, Ran | 2013 | ![]() | Breaking the $O(n^2.5)$ Deterministic Time Barrier for Undirected Unit-Capacity Maximum Flow In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013), 1171-1179 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 13:51:31 | Jens M. Schmidt | P. Gao | ![]() | 2012 | Uniform generation of d-factors in dense host graphs | Unpublished/Draft | ![]() | ||||
![]() | 13:50:17 | Jens M. Schmidt | P. Gao | 2012 | Distribution of the number of spanning regular subgraphs in random graphs | Unpublished/Draft | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 13:49:05 | Jens M. Schmidt | P. Gao | ![]() | 2012 | Distributions of sparse spanning subgraphs in random graphs | Unpublished/Draft | ![]() | ||||
![]() | 13:43:25 | Jens M. Schmidt | De Sterck, Hans | 2012 | Steepest Descent Preconditioning for Nonlinear GMRES Optimization | Unpublished/Draft | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 13:42:22 | [Library] | De Sterck, Hans | ![]() | 2012 | A Nonlinear GMRES Optimization Algorithm for Canonical Tensor Decomposition In: SIAM Journal on Scientific Computing [34], A1351-A1379 | Journal Article | ![]() | ||||
![]() | 13:41:22 | Administrators,LocalDomainServers,[AGEditors] | De Sterck, Hans | 2012 | A Self-learning Algebraic Multigrid Method for Extremal Singular Triplets and Eigenpairs In: SIAM Journal on Scientific Computing [34], A2092-A2117 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 05:50:58 | [Library] | Mnich, Matthias Philip, Geevarghese [Saurabh, Saket] [Suchy, Ondrej] | [D'Souza, Deepak] [Kavitha, Telikepalli] [Radhakrishnan, Jaikumar] | 2012 | ![]() | 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 | Electronic Proceedings Article | ![]() | |||
![]() | 15:11:42 | Adrian Neumann | Mehlhorn, Kurt Neumann, Adrian Schmidt, Jens M. | 2012 | ![]() | Certifying 3-Edge-Connectivity | Unpublished/Draft | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 14:37:34 | Adrian Neumann | Bringmann, Karl Mehlhorn, Kurt Neumann, Adrian | ![]() | 2012 | ![]() | Remarks on Category-Based Routing in Social Networks | Unpublished/Draft | ![]() | |||
![]() | 22:44:50 | Administrators,LocalDomainServers,[AGEditors] | [Berenbrink, Petra] [Friedetzky, Tom] [Elsaesser, Robert] [Nagel, Lars] Sauerwald, Thomas | [Murlak, Filip] [Sankowski, Piotr] | 2011 | Faster Coupon Collecting via Replication with Applications in Gossiping In: 36th International Symposium on Mathematical Foundations of Computer Science (MFCS-11), 72-83 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 22:40:31 | Administrators,LocalDomainServers,[AGEditors] | Friedrich, Tobias Sauerwald, Thomas [Stauffer, Alexandre] | [Asano, Takao] [Nakano, Shin-Ichi] [Okamoto, Yoshio] [Watanabe, Osamu] | 2011 | Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary Dimensions In: 22nd International Symposium on Algorithms and Computation (ISAAC-11), 190-199 | Proceedings Article | ![]() | ||||
![]() | 22:36:00 | Thomas Sauerwald | [Elsaesser, Robert] Sauerwald, Thomas | 2011 | Tight bounds for the cover time of multiple random walks In: Theoretical Computer Science [412], 2623-2641 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 22:32:32 | Administrators,LocalDomainServers,[AGEditors] | Fountoulakis, Nikolaos [Panagiotou, Konstantinos] [Sauerwald, Thomas] | [Rabani, Yuval] | 2012 | Ultra-fast rumor spreading in social networks In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 1642-1660 | Proceedings Article | ![]() | ||||
![]() | 22:23:42 | Administrators,LocalDomainServers,[AGEditors] | [Giakkoupis, George] Sauerwald, Thomas | [Rabani, Yuval] | 2012 | Rumor spreading and vertex expansion In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 1623-1641 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 22:10:36 | Administrators,LocalDomainServers,[AGEditors] | [Bogdan, Paul] Sauerwald, Thomas [Stauffer, Alexandre] Sun, He | [Sanjeev Khanna] | 2013 | Balls into Bins via Local Search In: 24th ACM-SIAM Symposium on Discrete Algorithms (SODA-13), 16-34 | Electronic Proceedings Article | ![]() | ||||
![]() | 22:04:21 | [Library] | [Akbari, Hoda] [Berenbrink, Petra] Sauerwald, Thomas | [Kowalski, Darek] [Panconesi, Alessandro] | 2012 | 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 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 21:58:09 | Administrators,LocalDomainServers,[AGEditors] | [Meyerhenke, Henning] Sauerwald, Thomas | ![]() | 2012 | Beyond Good Partition Shapes: An Analysis of Diffusive Graph Partitioning In: Algorithmica [64], 329-361 | Journal Article | ![]() | ||||
![]() | 21:56:17 | Administrators,LocalDomainServers,[AGEditors] | Friedrich, Tobias [Gairing, Martin] Sauerwald, Thomas | 2012 | Quasirandom Load Balancing In: SIAM Journal on Computing [41], 747-771 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 16:40:13 | Khaled Elbassioni,Naveen Garg,Divya Gupta,Amit Kumar,Vishal Narula,Arindam Pal,[Library],[Department],Deepak D'Souza,Telikepalli Kavitha,Jaikumar Radhakrishnan | Elbassioni, Khaled [Garg, Naveen] [Gupta, Divya] [Kumar, Amit] [Narula, Vishal] [Pal, Arindam] | [D'Souza, Deepak] [Kavitha, Telikepalli] [Radhakrishnan, Jaikumar] | 2012 | 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 | Electronic Proceedings Article | ![]() | ||||
![]() | 16:30:43 | Administrators,LocalDomainServers,[AGEditors] | Elbassioni, Khaled [Fouad, Mohamed] [Bertino, Elisa] | 2012 | 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 | Proceedings Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 22:34:43 | Administrators,LocalDomainServers,[AGEditors] | Fountoulakis, Nikolaos Panagiotou, Konstantinos | ![]() | 2013 | On the Insertion Time of Cuckoo Hashing In: SIAM Journal on Computing [?], ?-? | Journal Article | ![]() | ||||
![]() | 22:24:55 | Administrators,LocalDomainServers,[AGEditors] | Fountoulakis, Nikolaos Panagiotou, Konstantinos | 2012 | Tight Load Thresholds for Cuckoo Hashing In: Random Structures and Algorithms [41], 306-333 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 21:05:50 | [Library] | Kollias, Konstantinos | ![]() | 2013 | Nonpreemptive Coordination Mechanisms for Identical Machines In: Theory of Computing Systems [53], 424-440 | Electronic Journal Article | ![]() | ||||
![]() | 17:14:03 | Administrators,LocalDomainServers,[AGEditors] | [Croitoru, Cosmina] Kötzing, Timo | [Kersting, Kristian] [Toussaint, Marc] | 2012 | Deliberative Acceptability of Arguments In: STAIRS 2012 - Proceedings of the Sixth Starting AI Researchers' Symposium, 71-82 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 16:03:31 | Administrators,LocalDomainServers,[AGEditors] | [Lokshtanov, Daniel] [Saurabh, Saket] Wahlström, Magnus | [D'Souza, Deepak] [Kavitha, Telikepalli] [Radhakrishna, Jaikumar] | 2012 | 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 | Electronic Proceedings Article | ![]() | ||||
![]() | 15:52:08 | Administrators,LocalDomainServers,[AGEditors] | Wahlström, Magnus | [Portier, Natacha] [Wilke, Thomas] | 2013 | Abusing the Tutte Matrix: An Algebraic Instance Compression for the K-set-cycle Problem In: 29th International Symposium on Theoretical Aspects of Computer Science (STACS-13), | Electronic Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 15:40:51 | Administrators,LocalDomainServers,[AGEditors] | [Giannopoulos, Panos] [Knauer, Christian] Wahlström, Magnus [Werner, Daniel] | ![]() | 2012 | Hardness of discrepancy computation and ε-net verification in high dimension In: Journal of Complexity [28], 162-176 | Journal Article | ![]() | ||||
![]() | 15:30:54 | Administrators,LocalDomainServers,[AGEditors] | [Kratsch, Stefan] Wahlström, Magnus | [Rabani, Yuval] | 2012 | 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 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 15:24:50 | [Library] | [Cygan, Marek] [Dell, Holger] [Lokshtanov, Daniel] [Marx, Daniel] [Nederlof, Jesper] [Okamoto, Yoshio] [Paturi, Ramamohan] [Saurabh, Saket] Wahlström, Magnus | ![]() | 2012 | On Problems as Hard as CNF-SAT In: 2012 IEEE 27th Conference on Computational Complexity (CCC 2012), 74-84 | Proceedings Article | ![]() | ||||
![]() | 15:05:31 | Administrators,LocalDomainServers,[AGEditors] | [Kratsch, Stefan] [Pilipczuk, Marcin] [Pilipczuk, Michał] Wahlström, Magnus | [Czumaj, Artur] Mehlhorn, Kurt [Pitts, Andrew M.] [Wattenhofer, Roger] | 2012 | Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs In: Automata, Languages, and Programming ; 39th International Colloquium, ICALP 2012, 581-593 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 15:01:17 | Administrators,LocalDomainServers,[AGEditors] | [Cygan, Marek] [Kratsch, Stefan] [Pilipczuk, Marcin] [Pilipczuk, Michał] Wahlström, Magnus | [Czumaj, Artur] Mehlhorn, Kurt [Pitts, Andrew M.] [Wattenhofer, Roger] | 2012 | Clique Cover and Graph Separation: New Incompressibility Results In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 254-265 | Proceedings Article | ![]() | ||||
![]() | 14:47:54 | [Library] | [Kratsch, Stefan] Wahlström, Magnus | [Roughgarden, Tim] | 2012 | Representative Sets and Irrelevant Vertices: New Tools for Kernelization In: IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS-12), 450-459 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 14:06:13 | [Library] | Elbassioni, Khaled | [Czumaj, Artur] Mehlhorn, Kurt [Pitts, Andrew M.] [Wattenhofer, Roger] | 2012 | A QPTAS for ε-Envy-Free Profit-Maximizing Pricing on Line Graphs In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 513-524 | Proceedings Article | ![]() | ||||
![]() | 13:58:07 | Khaled Elbassioni,Katarzyna Paluch,Anke van Zuylen,[Library],[Department],Christoph Dürr,Thomas Wilke | Elbassioni, Khaled [Paluch, Katarzyna] van Zuylen, Anke | [Dürr, Christoph] [Wilke, Thomas] | 2012 | Simpler Approximation of the Maximum Asymmetric Traveling Salesman Problem In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, 501-506 | Electronic Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 12:14:44 | [Library] | Abed, Fidaa [Huang, Chien-Chung] | [Epstein, Leah] [Ferragina, Paolo] | 2012 | Preemptive Coordination Mechanisms for Unrelated Machines In: Algorithms - ESA 2012 : 20th Annual European Symposium, 12-23 | Proceedings Article | ![]() | ||||
![]() | 16:39:00 | Administrators,LocalDomainServers,[AGEditors] | Gawrychowski, Pawel | [Calderón-Benavides, Liliana] [González-Caro, Cristina N.] [Chávez, Edgar] [Ziviani, Nivio] | 2012 | Faster Algorithm for Computing the Edit Distance between SLP-Compressed Strings In: String Processing and Information Retrieval : 19th International Symposium, SPIRE 2012, 229-236 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 16:33:52 | [Library] | Gawrychowski, Pawel | [Kärkkäinen, Juha] [Stoye, Jens] | 2012 | Simple and efficient LZW-compressed multiple pattern matching In: Combinatorial Pattern Matching : 23rd Annual Symposium, CPM 2012, 232-242 | Proceedings Article | ![]() | ||||
![]() | 16:28:49 | [Library] | Gawrychowski, Pawel | [Dürr, Christoph] [Wilke, Thomas] | 2012 | Tying up the loose ends in fully LZW-compressed pattern matching In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, 624-635 | Electronic Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 13:34:21 | [Library] | Doerr, Benjamin Winzen, Carola | [Hao, Jin-Kao] [Legrand, Pierrick] [Collet, Pierre] [Monmarché, Nicolas] [Lutton, Evelyne] [Schoenauer, Marc] | 2012 | Black-box complexity: Breaking the O(n logn) barrier of LeadingOnes In: Artificial Evolution 10th International Conference Evolution Artificielle, EA 2011, 205-216 | Proceedings Article | ![]() | ||||
![]() | 10:37:09 | Administrators,LocalDomainServers,[AGEditors] | [Sviridenko, Maxim] Wiese, Andreas | [Goemans, Michel] | 2013 | 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), | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 10:33:29 | [Library] | Bringmann, Karl [Panagiotou, Konstantinos] | [Czumaj, Artur] Mehlhorn, Kurt [Pitts, Andrew M.] [Wattenhofer, Roger] | 2012 | ![]() | Efficient Sampling Methods for Discrete Distributions In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 133-144 | Proceedings Article | ![]() | |||
![]() | 10:28:39 | [Library] | Bringmann, Karl Friedrich, Tobias | 2012 | ![]() | Convergence of Hypervolume-Based Archiving Algorithms II: Competitiveness In: GECCO'12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation, 457-464 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 10:25:02 | Administrators,LocalDomainServers,[AGEditors] | [Alvarez, Victor] Bringmann, Karl [Curticapean, Radu] Ray, Saurabh | [Dey, Tamal K.] [Whitesides, Sue] | 2012 | ![]() | Counting Crossing Free Structures In: Proceedings of the Twenty-Eight Annual Symposium on Computational Geometry (SCG'12), 61-68 | Proceedings Article | ![]() | |||
![]() | 17:50:47 | Administrators,LocalDomainServers,[AGEditors] | Doerr, Benjamin [Sudholt, Dirk] [Witt, Carsten] | 2013 | When Do Evolutionary Algorithms Optimize Separable Functions in Parallel? In: ACM/SIGEVO Foundations of Genetic Algorithms (FOGA 2013), 51-63 | Proceedings Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 17:47:25 | [Library] | Bringmann, Karl | ![]() | 2012 | ![]() | An improved algorithm for Klee's measure problem on fat boxes In: Computational Geometry: Theory and Applications [45], 225-233 | Journal Article | ![]() | |||
![]() | 17:05:49 | [Library] | Doerr, Benjamin Moran, Shay Moran, Shlomo Winzen, Carola | 2012 | Simple and Optimal Fault-Tolerant Rumor Spreading In: arXiv [abs/1209.6158], 1-18 | Electronic Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 15:52:33 | [Library] | Jurkiewicz, Tomasz Mehlhorn, Kurt | ![]() | 2013 | The cost of address translation In: Proceedings of the Meeting on Algorithm Engineering & Experiments, | Proceedings Article | ![]() | ||||
![]() | 14:53:00 | Administrators,LocalDomainServers,[AGEditors] | Doerr, Benjamin Happ, Edda Klein, Christian | 2012 | Crossover can provably be useful in evolutionary computation In: Theoretical Computer Science [425], 17-33 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 16:59:18 | Administrators,LocalDomainServers,[AGEditors] | [Asano, Tetsuo] Doerr, Benjamin | ![]() | 2011 | Memory-constrained algorithms for shortest path problem In: 23rd Annual Canadian Conference on Computational Geometry (CCCG 2011), 315-319 | Proceedings Article | ![]() | ||||
![]() | 16:43:03 | Administrators,LocalDomainServers,[AGEditors] | Doerr, Benjamin [Fouz, Mahmoud] [Friedrich, Tobias] | [Fomin, Fedor V.] [Kaski, Petteri] | 2012 | Asynchronous rumor spreading in preferential attachment graphs In: Algorithm Theory - SWAT 2012 : 13th Scandinavian Symposium and Workshops, 307-315 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 16:20:55 | [Library] | Doerr, Benjamin | [Soule, Terence] [Moore, Jason H.] | 2012 | Black-box complexity: from complexity theory to playing mastermind In: GECCO'12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation, 1079-1092 | Proceedings Article | ![]() | ||||
![]() | 16:10:49 | [Library] | Doerr, Benjamin [Fouz, Mahmoud] [Friedrich, Tobias] | [Even, Guy] [Rawitz, Dror] | 2012 | Experimental analysis of rumor spreading in social networks In: Design and Analysis of Algorithms First Mediterranean Conference on Algorithms, MedAlg 2012, 159-173 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 16:04:39 | [Library] | Doerr, Benjamin Pohl, Sebastian | [Soule, Terence] [Moore, Jason H.] | 2012 | Run-time analysis of the (1+1) evolutionary algorithm optimizing linear functions over a finite alphabet In: GECCO'12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation, 1317-1324 | Proceedings Article | ![]() | ||||
![]() | 23:10:06 | Administrators,LocalDomainServers,[AGEditors] | Sagraloff, Michael | [van der Hoeven, Joris] [van Hoeij, Mark] | 2012 | When Newton meets Descartes: A Simple and Fast Algorithm to Isolate the Real Roots of a Polynomial In: ISSAC 2012 : Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation, 297-304 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 22:47:55 | [Library] | [Kerber, Michael] Sagraloff, Michael | ![]() | 2012 | A worst-case bound for topology computation of algebraic curves In: Journal of Symbolic Computation [47], 239-258 | Journal Article | ![]() | ||||
![]() | 17:37:03 | He Sun | [Guo, Zeyu] Sun, He [Zhu, Hong] | 2011 | Greedy Construction of 2-Approximate Minimum Manhattan Networks In: International Journal of Computational Geometry and Applications [21], 331-350 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 17:32:50 | He Sun | [Chin, Francis Y. L.] [Guo, Zeyu] Sun, He | ![]() | 2011 | Minimum Manhattan Network is NP-Complete In: Discrete & Computational Geometry [45], 701-722 | Journal Article | ![]() | ||||
![]() | 17:28:55 | [Library] | Sauerwald, Thomas Sun, He | [Roughgarden, Tim] | 2012 | Tight Bounds For Randomized Load Balancing on Arbitrary Network Topologies In: IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS-12), 341-350 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 17:11:21 | Administrators,LocalDomainServers,[AGEditors] | Manjunath, Madhusudan Mehlhorn, Kurt Panagiotou, Konstantinos Sun, He | [Demetrescu, Camil] [M. Halldórsson, Magnús] | 2011 | Approximate Counting of Cycles in Streams In: 19th Annual European Symposium on Algorithms (ESA-11), 677-688 | Proceedings Article | ![]() | ||||
![]() | 17:02:17 | George Giakkoupis,Thomas Sauerwald,He Sun,Philipp Woelfel,Christoph Dürr,Thomas Wilke,[Library],[Department] | [Giakkoupis, George] Sauerwald, Thomas Sun, He [Woelfel, Philipp] | [Dürr, Christoph] [Wilke, Thomas] | 2012 | Low Randomness Rumor Spreading via Hashing In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, 314-325 | Electronic Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 16:44:56 | [Library] | [Kane, Daniel] Mehlhorn, Kurt Sauerwald, Thomas Sun, He | [Czumaj, Artur] Mehlhorn, Kurt [Pitts, Andrew M.] [Wattenhofer, Roger] | 2012 | Counting Arbitrary Subgraphs in Data Streams In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 598-609 | Proceedings Article | ![]() | ||||
![]() | 14:09:16 | Franziska Huth | Doerr, Benjamin Winzen, Carola | 2011 | Memory-Restricted Black-Box Complexity In: Electronic Colloquium on Computational Complexity [18], 7 | Electronic Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 13:41:21 | Administrators,LocalDomainServers,[AGEditors] | Doerr, Benjamin [Jansen, Thomas] [Sudholt, Dirk] Winzen, Carola [Zarges, Christine] | ![]() | 2013 | Mutation rate matters even when optimizing monotonic functions In: Evolutionary Computation [21], 1-27 | Journal Article | ![]() | ||||
![]() | 13:34:00 | Administrators,LocalDomainServers,[AGEditors] | Doerr, Benjamin [Huber, Anna] [Levavi, Ariel] | 2013 | Strong robustness of randomized rumor spreading protocols In: Discrete Applied Mathematics [161], 778-793 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 13:28:48 | [Library] | Doerr, Benjamin [Johannsen, Daniel] Kötzing, Timo [Neumann, Frank] [Theile, Madeleine] | ![]() | 2013 | More effective crossover operators for the all-pairs shortest path problem In: Theoretical Computer Science [471], 12-26 | Journal Article | ![]() | ||||
![]() | 19:57:38 | Administrators,LocalDomainServers,[AGEditors] | [Belfrage, Michael] [Mütze, Torsten] Spöhel, Reto | 2012 | Probabilistic one-player Ramsey games via deterministic two-player games In: SIAM Journal on Discrete Mathematics [26], 1031-1049 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 18:53:37 | Administrators,LocalDomainServers,[AGEditors] | Panagiotou, Konstantinos Spöhel, Reto [Steger, Angelika] [Thomas, Henning] | ![]() | 2013 | Explosive percolation in Erdös-Rényi-like random graph processes In: Combinatorics, Probability and Computing [22], 133-145 | Journal Article | ![]() | ||||
![]() | 04:37:55 | [Library] | [Kim, Eun Jung] [Paul, Christophe] Philip, Geevarghese | [Fomin, Fedor V.] [Kaski, Petteri] | 2012 | ![]() | A Single-exponential FPT Algorithm for the K4-Minor Cover Problem In: Algorithm Theory - SWAT 2012 : 13th Scandinavian Symposium and Workshops, 119-130 | Proceedings Article | ![]() | ||||||
![]() | ![]() | ![]() | ![]() | 15:50:17 | [Library] | Panagiotou, Konstantinos [Coja-Oghlan, Amin] | ![]() | 2012 | Catching the k-NAESAT Threshold In: STOC’12 : Proceedings of the 2012 ACM Symposium on Theory of Computing, 899-907 | Proceedings Article | ![]() | ||||
![]() | 13:06:01 | Administrators,LocalDomainServers,[AGEditors] | Doerr, Benjamin Spöhel, Reto [Thomas, Henning] Winzen, Carola | 2013 | Playing Mastermind with many colors In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013), 695-704 | Proceedings Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 13:01:08 | [Library] | Doerr, Benjamin Winzen, Carola | [Soule, Terence] [Moore, Jason H.] | 2012 | Reducing the arity in unbiased black-box complexity In: GECCO'12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation, 1309-1316 | Proceedings Article | ![]() | ||||
![]() | 12:54:27 | Benjamin Doerr,Carola Winzen,Christoph D{\"u}rr,Thomas Wilke,[Library],[Department],Christoph Dürr | Doerr, Benjamin Winzen, Carola | [Dürr, Christoph] [Wilke, Thomas] | 2012 | Playing Mastermind with Constant-Size Memory In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, 441-452 | Electronic Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 12:47:17 | Administrators,LocalDomainServers,[AGEditors] | Doerr, Benjamin Kötzing, Timo [Lengler, Johannes] Winzen, Carola | ![]() | 2013 | Black-Box Complexities of Combinatorial Problems In: Theoretical Computer Science [471], 84-106 | Journal Article | ![]() | ||||
![]() | 12:41:49 | [Library] | Doerr, Benjamin Winzen, Carola | 2012 | Playing Mastermind with Constant-Size Memory In: Theory of Computing Systems [Online First], 1-27 | Electronic Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 12:38:14 | Administrators,LocalDomainServers,[AGEditors] | Doerr, Benjamin Winzen, Carola | ![]() | 2014 | Ranking-Based Black-Box Complexity In: Algorithmica [?], ? | Journal Article | ![]() | ||||
![]() | 12:33:06 | [Library] | Doerr, Benjamin [Johannsen, Daniel] Winzen, Carola | 2012 | Multiplicative Drift Analysis In: Algorithmica [64], 673-697 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 22:56:17 | Administrators,LocalDomainServers,[AGEditors] | Berberich, Eric [Halperin, Dan] [Kerber, Michael] [Pogalnikova, Roza] | ![]() | 2012 | Deconstructing Approximate Offsets In: Discrete & Computational Geometry [48], 964-989 | Journal Article | ![]() | ||||
33 |
|
| ![]() | ||||||||||||
![]() | ![]() | ![]() | ![]() | 15:37:33 | [Library] | [Case, John] Kötzing, Timo | ![]() | 2013 | Memory-limited non-U-shaped learning with solved open problems In: Theoretical Computer Science [473], 100-123 | Electronic Journal Article | ![]() | ||||
![]() | 15:34:59 | [Library] | [Case, John] Kötzing, Timo | 2012 | Learning secrets interactively. Dynamic modeling in inductive inference In: Information and Computation [220-221], 60-73 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 15:32:36 | Administrators,LocalDomainServers,[AGEditors] | [Case, John] Kötzing, Timo | ![]() | 2012 | Computability-theoretic learning complexity In: Philosophical Transaction of the Royal Society A [370], 3570-3596 | Journal Article | ![]() | ||||
![]() | 15:26:37 | Administrators,LocalDomainServers,[AGEditors] | [Heinz, Jeffrey] [Kasprzik, Anna] Kötzing, Timo | 2012 | Learning in the limit with lattice-structured hypothesis spaces In: Theoretical Computer Science [457], 111 - 127 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 15:23:11 | Administrators,LocalDomainServers,[AGEditors] | Alcaraz, Nicolas Friedrich, Tobias Kötzing, Timo [Krohmer, Anton] Müller, Joachim Pauling, Josch Baumbach, Jan | ![]() | 2012 | Efficient key pathway mining: combining networks and OMICS data In: Integrative Biology [4], 756-764 | Journal Article | ![]() | ||||
![]() | 15:19:26 | Administrators,LocalDomainServers,[AGEditors] | Kötzing, Timo [Neumann, Frank] [Röglin, Heiko] [Witt, Carsten] | 2012 | Theoretical analysis of two ACO approaches for the traveling salesman problem In: Swarm Intelligence [6], 1-21 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 15:13:39 | Administrators,LocalDomainServers,[AGEditors] | [Jain, Sanjay] Kötzing, Timo [Stephan, Frank] | [Bshouty, Nader] [Stoltz, Gilles] [Vayatis, Nicolas] [Zeugmann, Thomas] | 2012 | Enlarging Learnable Classes In: Algorithmic Learning Theory : 23rd International Conference, ALT 2012, 36-50 | Proceedings Article | ![]() | ||||
![]() | 15:09:56 | [Library] | Kötzing, Timo [Molter, Hendrik] | [Coello Coello, Carlos A.] [Cutello, Vincenzo] [Deb, Kalyanmoy] [Forrest, Stephanie] [Nicosia, Giuseppe] [Pavone, Mario] | 2012 | ACO beats EA on a dynamic pseudo-Boolean function In: Parallel Problem Solving from Nature - PPSN XII : 12th International Conference, 113-122 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 15:04:24 | Administrators,LocalDomainServers,[AGEditors] | Kötzing, Timo [Sutton, Andrew M.] [Neumann, Frank] [O'Reilly, Una-May] | [Soule, Terence] [Moore, Jason H.] | 2012 | 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 | Proceedings Article | ![]() | ||||
![]() | 15:00:09 | [Library] | Doerr, Benjamin [Hota, Ashish] Kötzing, Timo | [Soule, Terence] [Moore, Jason H.] | 2012 | Ants easily solve stochastic shortest path problems In: GECCO'12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation, 17-24 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 14:57:25 | [Library] | Baumbach, Jan Friedrich, Tobias Kötzing, Timo [Krohmer, Anton] Müller, Joachim Pauling, Josch | ![]() | 2012 | 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 | Proceedings Article | ![]() | ||||
![]() | 00:06:42 | Administrators,LocalDomainServers,[AGEditors] | Megow, Nicole Mehlhorn, Kurt [Schweitzer, Pascal] | 2012 | Online Graph Exploration: New Results on Old and New Algorithms In: Theoretical Computer Science [463], 62-72 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 00:04:01 | Administrators,LocalDomainServers,[AGEditors] | [Epstein, Leah] [Levin, Asaf] [Marchetti-Spaccamela, Alberto] Megow, Nicole Mestre, Julian Skutella, Martin [Stougie, Leen] | ![]() | 2012 | Universal sequencing on an unreliable machine In: SIAM Journal on Computing [41], 565-586 | Journal Article | ![]() | ||||
![]() | 23:52:50 | Administrators,LocalDomainServers,[AGEditors] | [Günther, Elisabeth] [Maurer, Olaf] Megow, Nicole Wiese, Andreas | 2013 | A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio In: 24st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013), | Proceedings Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 23:49:11 | Administrators,LocalDomainServers,[AGEditors] | Megow, Nicole [Mestre, Julian] | ![]() | 2013 | Instance-sensitive robustness guarantees for sequencing with unknown packing and covering constraints In: 4th Conference on Innovations in Theoretical Computer Science (ITCS 2013), | Proceedings Article | ![]() | ||||
![]() | 23:45:53 | [Library] | Megow, Nicole [Skutella, Martin] [Verschae, Jose] Wiese, Andreas | [Czumaj, Artur] Mehlhorn, Kurt [Pitts, Andrew M.] [Wattenhofer, Roger] | 2012 | The Power of Recourse for Online MST and TSP In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 689-700 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 18:04:20 | Administrators,LocalDomainServers,[AGEditors] | Bonifaci, Vincenzo Mehlhorn, Kurt [Varma, Girish] | ![]() | 2012 | Physarum Can Compute Shortest Paths In: Journal of Theoretical Biology [309], 121-133 | Journal Article | ![]() | ||||
![]() | 16:21:28 | Administrators,LocalDomainServers,[AGEditors] | Bonifaci, Vincenzo Mehlhorn, Kurt [Varma, Girish] | [Ravani, Yuval] | 2012 | Physarum Can Compute Shortest Paths In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 233-240 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 16:08:11 | Administrators,LocalDomainServers,[AGEditors] | Schmidt, Jens M. | ![]() | 2012 | Construction Sequences and Certifying 3-Connectivity In: Algorithmica [62], 192-208 | Journal Article | ![]() | ||||
![]() | 14:38:01 | Administrators,LocalDomainServers,[AGEditors] | Schmidt, Jens M. | [Czumaj, Artur] Mehlhorn, Kurt [Pitts, Andrew] [Wattenhofer, Roger] | 2012 | Certifying 3-Connectivity in Linear Time In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 786-797 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 14:32:16 | [Library] | Schmidt, Jens M. [Valtr, Pavel] | ![]() | 2012 | Cubic Plane Graphs on a Given Point Set In: Proceedings of the Twenty-Eighth Annual Symposium on Computational Geometry (SCG'12), 201-208 | Proceedings Article | ![]() | ||||
![]() | 14:23:22 | Administrators,LocalDomainServers,[AGEditors] | Elmasry, Amr Mehlhorn, Kurt Schmidt, Jens M. | 2013 | Every DFS tree of a 3-connected graph contains a contractible edge In: Journal of Graph Theory [72], 112-121 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 13:58:06 | Administrators,LocalDomainServers,[AGEditors] | [Knauer, Christian] [Schlipf, Lena] Schmidt, Jens M. [Tiwary, Hans Raj] | ![]() | 2012 | Largest Inscribed Rectangles in Convex Polygons In: Journal of Discrete Algorithms [13], 78-85 | Journal Article | ![]() | ||||
![]() | 12:34:42 | Administrators,LocalDomainServers,[AGEditors] | Harren, Rolf [Kern, Walter] | [Solis-Oba, Roberto] [Persiano, Giuseppe] | 2012 | Improved Lower Bound for Online Strip Packing In: Approximation and Online Algorithms : 9th International Workshop ,WAOA 2011, 211-218 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 17:28:09 | Administrators,LocalDomainServers,[AGEditors] | [Gnewuch, Michael] Wahlström, Magnus Winzen, Carola | ![]() | 2012 | A New Randomized Algorithm to Approximate the Star Discrepancy Based on Threshold Accepting In: SIAM Journal on Numerical Analysis [50], 781-807 | Journal Article | ![]() | ||||
![]() | 14:06:03 | Administrators,LocalDomainServers,[AGEditors] | [Epstein, Leah] [Levin, Asaf] van Stee, Rob | [Sanjeev Khanna] | 2013 | ![]() | 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 | Proceedings Article | ![]() | ||||||
![]() | ![]() | ![]() | ![]() | 13:56:08 | [Library] | van Stee, Rob | ![]() | 2012 | ![]() | SIGACT News Online Algorithms Column 21: APPROX and ALGO In: SIGACT News [43], 123-129 | Journal Article | ![]() | |||
![]() | 13:53:32 | [Library] | van Stee, Rob | 2012 | ![]() | SIGACT News Online Algorithms Column 20: The Power of Harmony In: SIGACT News [43], 127-136 | Journal Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 13:40:12 | Administrators,LocalDomainServers,[AGEditors] | [Chen, Xujin] Doerr, Benjamin [Hu, Xiaodong] [Ma, Weidong] van Stee, Rob Winzen, Carola | [Goldberg, Paul W.] | 2012 | ![]() | The Price of Anarchy for Selfish Ring Routing is Two In: Internet and Network Economics : 8th International Workshop, WINE 2012, 420-433 | Proceedings Article | ![]() | |||
![]() | 11:58:51 | Administrators,LocalDomainServers,[AGEditors] | [Epstein, Leah] [Jez, Lukasz] [Sgall, Jiri] van Stee, Rob | [Gupta, Anupam] [Jansen, Klaus] [Rolim, José] [Servedio, Rocco] | 2012 | ![]() | 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 | Proceedings Article | ![]() | ||||||
![]() | ![]() | ![]() | ![]() | 11:49:33 | Administrators,LocalDomainServers,[AGEditors] | van Stee, Rob | ![]() | 2012 | ![]() | An improved algorithm for online rectangle filling In: Theoretical Computer Science [423], 59-74 | Journal Article | ![]() | |||
![]() | 11:46:18 | Administrators,LocalDomainServers,[AGEditors] | [Chan, Ho-Leung] Megow, Nicole [Sitters, René] van Stee, Rob | 2012 | ![]() | A note on sorting buffers offline In: Theoretical Computer Science [423], 11-18 | Journal Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 11:37:18 | Administrators,LocalDomainServers,[AGEditors] | [Epstein, Leah] van Stee, Rob | ![]() | 2012 | ![]() | The price of anarchy on uniformly related machines revisited In: Information and Computation [212], 37-54 | Journal Article | ![]() | |||
4 |
|
| ![]() | ||||||||||||
![]() | ![]() | ![]() | ![]() | 16:25:22 | Administrators,LocalDomainServers,[AGEditors] | Emeliyanenko, Pavel | ![]() | 2012 | ![]() | Computing resultants on Graphics Processing Units: Towards GPU-accelerated computer algebra In: Journal of Parallel and Distributed Computing [In press], 1-14 | Electronic Journal Article | ![]() | |||
![]() | 13:27:12 | Administrators,LocalDomainServers,[AGEditors] | Emeliyanenko, Pavel Sagraloff, Michael | [van der Hoeven, Joris] [van Hoeij, Mark] | 2012 | On the Complexity of Solving a Bivariate Polynomial System In: ISSAC 2012 : Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation, 154-161 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 13:42:33 | Administrators,LocalDomainServers,[AGEditors] | [Qian, Jiawei] [Schalekamp, Frans] [Williamson, David P.] van Zuylen, Anke | [Fernández-Baca, David] | 2012 | On the Integrality Gap of the Subtour LP for the 1,2-TSP In: LATIN 2012: Theoretical Informatics ; 10th Latin American Symposium, 606-617 | Proceedings Article | ![]() | ||||
![]() | 13:35:32 | [Library] | [Schalekamp, Frans] [Williamson, David P.] van Zuylen, Anke | [Rabani, Yuval] | 2012 | A proof of the Boyd-Carr conjecture In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 1477-1486 | Proceedings Article | ![]() | |||||||
2 |
|
| ![]() | ||||||||||||
![]() | 20:30:23 | Administrators,LocalDomainServers,[AGEditors] | Johannsen, Daniel Lengler, Johannes | [Pelikan, Martin] [Branke, Jürgen] | 2010 | ![]() | Can Quantum Search Accelerate Evolutionary Algorithms? In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 1433-1440 | Proceedings Article | ![]() | ||||||
![]() | ![]() | ![]() | ![]() | 22:30:34 | Administrators,LocalDomainServers,[AGEditors] | [Krivelevich, Michael] Spöhel, Reto | ![]() | 2012 | Creating small subgraphs in Achlioptas processes with growing parameter In: SIAM Journal on Discrete Mathematics [26], 670-686 | Journal Article | ![]() | ||||
2 |
|
| ![]() | ||||||||||||
![]() | ![]() | ![]() | ![]() | 11:25:13 | Administrators,LocalDomainServers,[AGEditors] | Doerr, Benjamin [Johannsen, Daniel] Winzen, Carola | ![]() | 2012 | Non-existence of linear universal drift functions In: Theoretical Computer Science [436], 71-86 | Journal Article | ![]() | ||||
![]() | 14:46:27 | Administrators,LocalDomainServers,[AGEditors] | Bonifaci, Vincenzo [Marchetti-Spaccamela, Alberto] | 2012 | ![]() | Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems In: Algorithmica [63], 763-780 | Journal Article | ![]() | |||||||
18 |
|
| ![]() | ||||||||||||
![]() | 17:35:42 | Administrators,LocalDomainServers,[AGEditors] | Philip, Geevarghese | 2008 | ![]() | Fixed-Parameter Algorithms for Graph Problems Using Graph Minor Theory Homi Bhabha National Institute | Thesis - Masters thesis | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 17:04:06 | [Library] | [Misra, Neeldhara] Philip, Geevarghese [Raman, Venkatesh] [Saurabh, Saket] | ![]() | 2012 | ![]() | On Parameterized Independent Feedback Vertex Set In: Theoretical Computer Science [461], 65-75 | Journal Article | ![]() | |||
![]() | 15:37:26 | Administrators,LocalDomainServers,[AGEditors] | Philip, Geevarghese | 2011 | ![]() | The Kernelization Complexity of some Domination and Covering Problems Homi Bhabha National Institute | Thesis - PhD thesis | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 15:24:58 | Administrators,LocalDomainServers,[AGEditors] | [Misra, Neeldhara] Philip, Geevarghese [Raman, Venkatesh] [Saurabh, Saket] | [Fu, Bin] [Du, Ding-Zhu] | 2011 | ![]() | 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 | Proceedings Article | ![]() | |||
![]() | 15:12:49 | Administrators,LocalDomainServers,[AGEditors] | [Bredereck, Robert] [Nichterlein, Andr{\'e}] [Niedermeier, Rolf] Philip, Geevarghese | [Owe, Olaf] [Steffen, Martin] [Telle, Jan Arne] | 2011 | ![]() | 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 | Proceedings Article | ![]() | ||||||
![]() | ![]() | ![]() | ![]() | 14:30:36 | Administrators,LocalDomainServers,[AGEditors] | [Fomin, Fedor V.] Philip, Geevarghese [Villanger, Yngve] | [Chakraborty, Supratik] [Kumar, Amit] | 2011 | ![]() | 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 | Proceedings Article | ![]() | |||
![]() | 13:58:28 | Administrators,LocalDomainServers,[AGEditors] | [Arumugam, S.] [Chandrasekar, K. Raja] [Misra, Neeldhara] Philip, Geevarghese [Saurabh, Saket] | [Iliopoulos, Costas S.] [Smyth, William F.] | 2011 | ![]() | 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 | Proceedings Article | ![]() | ||||||
![]() | ![]() | ![]() | ![]() | 13:29:57 | Administrators,LocalDomainServers,[AGEditors] | [Bredereck, Robert] [Nichterlein, Andr{\'e}] [Niedermeier, Rolf] Philip, Geevarghese | [Murlak, Filip] [Sankowski, Piotr] | 2011 | ![]() | 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 | Proceedings Article | ![]() | |||
![]() | 13:09:28 | Administrators,LocalDomainServers,[AGEditors] | [Fomin, Fedor V.] [Lokshtanov, Daniel] [Misra, Neeldhara] Philip, Geevarghese [Saurabh, Saket] | [Schwentick, Thomas] [D{\"u}rr, Christoph] | 2011 | ![]() | 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 | Proceedings Article | ![]() | ||||||
![]() | ![]() | ![]() | ![]() | 19:13:51 | [Library] | [Misra, Neeldhara] Philip, Geevarghese [Raman, Venkatesh] [Saurabh, Saket] [Sikdar, Somnath] | ![]() | 2012 | ![]() | FPT Algorithms for Connected Feedback Vertex Set In: Journal of Combinatorial Optimization [24], 131-146 | Journal Article | ![]() | |||
![]() | 18:41:03 | Administrators,LocalDomainServers,[AGEditors] | [Cygan, Marek] Philip, Geevarghese [Pilipczuk, Marcin] [Pilipczuk, Micha\l{}] [Wojtaszczyk, Jakub Onufry] | 2011 | ![]() | Dominating set is fixed parameter tractable in claw-free graphs In: Theoretical Computer Science [412], 6982-7000 | Journal Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 18:03:17 | Administrators,LocalDomainServers,[AGEditors] | [Fernau, Henning] [Fomin, Fedor V.] Philip, Geevarghese [Saurabh, Saket] | [Thai, My T.] [Sahni, Sartaj] | 2010 | ![]() | 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 | Proceedings Article | ![]() | |||
![]() | 17:48:43 | Administrators,LocalDomainServers,[AGEditors] | [Misra, Neeldhara] Philip, Geevarghese [Raman, Venkatesh] [Saurabh, Saket] | [Lodaya, Kamal] [Mahajan, Meena] | 2010 | ![]() | 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 | Proceedings Article | ![]() | ||||||
![]() | ![]() | ![]() | ![]() | 17:31:36 | Administrators,LocalDomainServers,[AGEditors] | [Ambalath, Abhimanyu M.] [Balasundaram, Radheshyam] [H., Chintan Rao] [Koppula, Venkata] [Misra, Neeldhara] Philip, Geevarghese [Ramanujan, M. S.] | [Raman, Venkatesh] [Saurabh, Saket] | 2010 | ![]() | 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 | Proceedings Article | ![]() | |||
![]() | 17:14:14 | Administrators,LocalDomainServers,[AGEditors] | [Fernau, Henning] [Fomin, Fedor V.] [Lokshtanov, Daniel] [Mnich, Matthias] Philip, Geevarghese [Saurabh, Saket] | [Iliopoulos, Costas S.] [F. Smyth, William] | 2011 | ![]() | Ranking and Drawing in Subexponential Time In: Combinatorial Algorithms - 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers, | Proceedings Article | ![]() | ||||||
![]() | ![]() | ![]() | ![]() | 16:51:50 | Administrators,LocalDomainServers,[AGEditors] | [Misra, Neeldhara] Philip, Geevarghese [Raman, Venkatesh] [Saurabh, Saket] [Sikdar, Somnath] | [Rahman, Md. Saidur] [Fujita, Satoshi] | 2010 | ![]() | 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 | Proceedings Article | ![]() | |||
![]() | 16:32:48 | Administrators,LocalDomainServers,[AGEditors] | Philip, Geevarghese [Raman, Venkatesh] [Villanger, Yngve] | [Thilikos, Dimitrios M.] | 2010 | ![]() | 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 | Proceedings Article | ![]() | ||||||
![]() | ![]() | ![]() | ![]() | 16:08:26 | Administrators,LocalDomainServers,[AGEditors] | Philip, Geevarghese [Raman, Venkatesh] [Sikdar, Somnath] | [Fiat, Amos] [Sanders, Peter] | 2009 | ![]() | 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 | Proceedings Article | ![]() | |||
18 |
|
| ![]() | ||||||||||||
![]() | ![]() | ![]() | ![]() | 15:14:23 | Administrators,LocalDomainServers,[AGEditors] | [Shervashidze, Nino] Schweitzer, Pascal [van Leeuwen, Erik Jan] Mehlhorn, Kurt [Borgwardt, Karsten M.] | ![]() | 2011 | Weisfeiler-Lehman graph kernels In: Journal of Machine Learning Research [12], 2539-2561 | Journal Article | ![]() | ||||
![]() | 13:58:34 | Administrators,LocalDomainServers,[AGEditors] | [Pemmaraju, Sriram V.] Raman, Rajiv [Varadarajan, Kasturi] | 2011 | Max-coloring and online coloring with bandwidths on interval graphs In: ACM Transactions on Algorithms [7], 35:1-35:21 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 13:53:46 | Administrators,LocalDomainServers,[AGEditors] | Neumann, Frank [Reichel, Joachim] [Skutella, Martin] | ![]() | 2011 | Computing Minimum Cuts by Randomized Search Heuristics In: Algorithmica [59], 323-342 | Journal Article | ![]() | ||||
![]() | 13:48:08 | Administrators,LocalDomainServers,[AGEditors] | [Müller, Tobias] Perez-Gimenez, Xavier [Wormald, Nicholas] | 2011 | Disjoint Hamilton cycles in the random geometric graph In: Journal of Graph Theory [68], 299-322 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 13:38:08 | Administrators,LocalDomainServers,[AGEditors] | Manjunath, Madhusudan [Sharma, Vikram] | ![]() | 2011 | Applications of dimensionality reduction and exponential sums to graph automorphism In: Theoretical Computer Science [412], 3639-3649 | Journal Article | ![]() | ||||
![]() | 13:21:37 | Administrators,LocalDomainServers,[AGEditors] | [Kavitha, Telikepalli] Mehlhorn, Kurt Michail, Dimitrios | 2011 | New Approximation Algorithms for Minimum Cycle Bases of Graphs In: Algorithmica [59], 471-488 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 13:16:17 | Administrators,LocalDomainServers,[AGEditors] | [Kavitha, Telikepalli] Mestre, Julian [Nasre, Meghana] | ![]() | 2011 | Popular mixed matchings In: Theoretical Computer Science [412], 2679-2690 | Journal Article | ![]() | ||||
![]() | 13:11:25 | Administrators,LocalDomainServers,[AGEditors] | Huang, Chien-Chung [Kavitha, Telikepalli] [Michael, Dimitrios] [Nasr, Meghana] | 2011 | Bounded Unpopularity Matchings In: Algorithmica [61], 738-757 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 11:37:28 | Administrators,LocalDomainServers,[AGEditors] | Hemmer, Michael [Dupon, Laurent] [Petitjean, Sylvain] [Schomer, Elmar] | ![]() | 2011 | 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 | Journal Article | ![]() | ||||
![]() | 11:05:58 | Administrators,LocalDomainServers,[AGEditors] | [Funke, Stefan] [Laue, Soeren] [Lotker, Zvi] Naujoks, Rouven | 2011 | 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 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 11:01:19 | Administrators,LocalDomainServers,[AGEditors] | Friedrich, Tobias Hebbinghaus, Nils | ![]() | 2011 | Average update times for fully-dynamic all-pairs shortest paths In: Discrete Applied Mathematics [159], 1751-1758 | Journal Article | ![]() | ||||
![]() | 10:57:49 | Anja Becker | Friedrich, Tobias [Sauerwald, Thomas] [Vilenchik, Dan] | 2011 | Smoothed analysis of balancing networks In: Random Structures & Algorithms [39], 115-138 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 10:52:39 | Administrators,LocalDomainServers,[AGEditors] | Friedrich, Tobias [Horoba, Christian] Neumann, Frank | ![]() | 2011 | Illustration of fairness in evolutionary multi-objective optimization In: Theoretical Computer Science [412], 1546-1556 | Journal Article | ![]() | ||||
![]() | 10:48:22 | Administrators,LocalDomainServers,[AGEditors] | Fountoulakis, Nikolaos [Panagiotou, Konstantinos] | 2011 | 3-Connected Cores In Random Planar Graphs In: Combinatorics, Probability & Computing [20], 381-412 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 10:39:43 | Administrators,LocalDomainServers,[AGEditors] | [Epstein, Leah] van Stee, Rob | ![]() | 2011 | On the online unit clustering problem In: ACM Transactions on Algorithms [7], 7:1-7:1 | Journal Article | ![]() | ||||
![]() | 16:03:23 | Administrators,LocalDomainServers,[AGEditors] | Beier, Rene Funke, Stefan Matijevic, Domagoj [Sanders, Peter] | 2011 | Energy-Efficient Paths in Radio Networks In: Algorithmica [61], 298-319 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 15:55:38 | Administrators,LocalDomainServers,[AGEditors] | [Baswana, Surender] [Kavitha, Telikepalli] Mehlhorn, Kurt [Pettie, Seth] | ![]() | 2011 | Additive Spanners and (α, β)-Spanners In: ACM Transactions on Algorithms [7], 5:1-5:26 | Journal Article | ![]() | ||||
![]() | 15:50:30 | Administrators,LocalDomainServers,[AGEditors] | [Bansal, Nikhil] Chan, Ho-Leung [Pruhs, KIrk] | 2011 | Competitive Algorithms for Due Date Schedulin In: Algorithmica [59], 569-582 | Journal Article | ![]() | ||||||||
8 |
|
| ![]() | ||||||||||||
![]() | 11:18:52 | Joanna Barth | Doerr, Benjamin [Gnewuch, Michael] [Kritzer, Peter] [Pillichshammer, Peter] | 2008 | Component-by-component construction of low-discrepancy point sets of small size In: Monte Carlo Methods Applications [14], 129-150 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 12:39:46 | [Library] | [Christodoulou, George] Mehlhorn, Kurt [Pyrga, Evangelia] | [Demetrescu, Camil] [Halldórsson, Magnús M.] | 2011 | Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms In: Algorithms - ESA 2011 : 19th Annual European Symposium, 119-130 | Proceedings Article | ![]() | ||||
![]() | 11:34:06 | Administrators,LocalDomainServers,[AGEditors] | Busch, Philip Johannes | 2011 | Analysis of the KIT email graph, with an application of randomized rumour spreading protocols Universität des Saarlandes | Thesis - Bachelor thesis | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 11:28:24 | Administrators,LocalDomainServers,[AGEditors] | Winzen, Carola | ![]() | 2011 | Toward a complexity theory for randomized search heuristics : black box models Universität des Saarlandes | Thesis - PhD thesis | ![]() | ||||
![]() | 15:26:35 | Christine Rizkallah | Rizkallah, Christine | 2011 | ![]() | Glivenko and Kuroda for Simple Type Theory | Unpublished/Draft | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 14:56:20 | Administrators,LocalDomainServers,[AGEditors] | Ingalalli, Vijay | ![]() | 2011 | Evolutionary algorithms to compute lower bounds for the star discrepancy Universität des Saarlandes | Thesis - Masters thesis | ![]() | ||||
![]() | 13:47:48 | [Library] | Neumann, Adrian | 2011 | Implementation of Schmidt's algorithm for certifying triconnectivity testing Universität des Saarlandes | Thesis - Masters thesis | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 13:42:16 | [Library] | Elbassioni, Khaled [Rauf, Imran] Ray, Saurabh | [Collette, Sebastien] | 2011 | Enumerating Minimal Transversals of Geometric Hypergraphs In: 23rd Canadian Conference on Computational Geometry (CCCG 2011), 437-442 | Electronic Proceedings Article | ![]() | ||||
35 |
|
| ![]() | ||||||||||||
![]() | ![]() | ![]() | ![]() | 10:25:25 | Benjamin Doerr,Mahmoud Fouz,Tobias Friedrich,[Library],[Department],Jarik Nešetřil,Ervin Győri,Attila Sali | Doerr, Benjamin [Fouz, Mahmoud] Friedrich, Tobias | [Nešetřil, Jarik] [Győri, Ervin] [Sali, Attila] | 2011 | 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 | Electronic Proceedings Article | ![]() | ||||
![]() | 11:39:39 | Administrators,LocalDomainServers,[AGEditors] | Doerr, Benjamin [Fouz, Mahmoud] | 2011 | Asymptotically optimal randomized rumor spreading In: Electronic Notes in Discrete Mathematics [38], 297-302 | Electronic Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 12:20:14 | Administrators,LocalDomainServers,[AGEditors] | Bonifaci, Vincenzo [Marchetti-Spaccamela, Alberto] [Stiller, Sebastian] | ![]() | 2012 | ![]() | A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling In: Algorithmica [62], 1034-1049 | Journal Article | ![]() | |||
![]() | 17:22:40 | [Library] | Sagraloff, Michael | 2011 | When Newton meets Descartes: A Simple and Fast Algorithm to Isolate the Real Roots of a Polynomial In: arXiv [abs/1109.6279v1], 1-21 | Electronic Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 17:18:22 | Administrators,LocalDomainServers,[AGEditors] | Berberich, Eric Emeliyanenko, Pavel Kobel, Alexander Sagraloff, Michael | ![]() | 2012 | Exact Symbolic-Numeric Computation of Planar Algebraic Curves In: arXiv [abs/1201.1548v1], 1-46 | Electronic Journal Article | ![]() | ||||
![]() | 18:38:36 | Administrators,LocalDomainServers,[AGEditors] | [Mütze, Torsten] Spöhel, Reto | 2011 | On the path-avoidance vertex-coloring game In: The Electronic Journal of Combinatorics [18], 1-33 | Electronic Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 18:17:54 | Konstantinos Panagiotou,Reto Spöhel,Angelika Steger,Henning Thomas,Jarik Nešetřil,Ervin Győri,Attila Sali,[Library],[Department] | Panagiotou, Konstantinos Spöhel, Reto [Steger, Angelika] [Thomas, Henning] | [Nešetřil, Jarik] [Győri, Ervin] [Sali, Attila] | 2011 | 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 | Electronic Proceedings Article | ![]() | ||||
![]() | 18:15:07 | Torsten Mütze,Reto Spöhel,Jarik Nešetřil,Ervin Győri,Attila Sali,[Library],[Department] | [Mütze, Torsten] Spöhel, Reto | [Nešetřil, Jarik] [Győri, Ervin] [Sali, Attila] | 2011 | On the path-avoidance vertex-coloring game In: The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, 657-662 | Electronic Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 18:09:00 | Luca Gugelmann,Reto Spöhel,Jarik Nešetřil,Ervin Győri,Attila Sali,[Library],[Department] | [Gugelmann, Luca] Spöhel, Reto | [Nešetřil, Jarik] [Győri, Ervin] [Sali, Attila] | 2011 | On balanced coloring games in random graphs In: The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, 425-430 | Electronic Proceedings Article | ![]() | ||||
![]() | 18:22:37 | Administrators,LocalDomainServers,[AGEditors] | [Canzar, Stefan] [El-Kebir, Mohammed] [Pool, Rene] Elbassioni, Khaled [Malde, Alpeshkumar K.] [Mark, Alan E.] [Geerke, Daan P.] [Stougie, Leen] [Klau, Gunnar W.] | [Chor, Benny] | 2012 | Charge Group Partitioning in Biomolecular Simulation In: Research in Computational Molecular Biology : 16th Annual International Conference, RECOMB 2012, 29-43 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 18:05:52 | Administrators,LocalDomainServers,[AGEditors] | Elbassioni, Khaled [Tiwary, Hans Raj] | ![]() | 2012 | Complexity of Approximating the Vertex Centroid of a Polyhedron In: Theoretical Computer Science [421], 56-61 | Journal Article | ![]() | ||||
![]() | 17:59:27 | [Library] | [Boros, Endre] Elbassioni, Khaled [Gurvich, Vladimir] [Makino, Kazuhisa] | 2012 | 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 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 17:45:14 | Administrators,LocalDomainServers,[AGEditors] | Doerr, Benjamin Friedrich, Tobias [Künnemann, Marvin] Sauerwald, Thomas | ![]() | 2011 | Quasirandom Rumor Spreading: An Experimental Analysis In: ACM Journal of Experimental Algorithmics [16], Article No. 3.3 | Journal Article | ![]() | ||||
![]() | 17:38:41 | Administrators,LocalDomainServers,[AGEditors] | Doerr, Benjamin [Goldberg, Leslie Ann] | 2013 | Adaptive Drift Analysis In: Algorithmica [65], 224-250 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 17:38:36 | Administrators,LocalDomainServers,[AGEditors] | Elbassioni, Khaled [Krohn, Erik] [Matijevic, Domagoj] Mestre, Julian [Severdija, Domagoj] | ![]() | 2011 | Improved Approximations for Guarding 1.5-Dimensional Terrains In: Algorithmica [60], 451-463 | Journal Article | ![]() | ||||
![]() | 17:35:17 | Administrators,LocalDomainServers,[AGEditors] | [Althaus, Ernst] [Canzar, Stefan] Elbassioni, Khaled [Karrenbauer, Andreas] [Mestre, Julian] | 2011 | Approximation Algorithms for the Interval Constrained Coloring Problem In: Algorithmica [61], 342-361 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 17:32:42 | Administrators,LocalDomainServers,[AGEditors] | [Boros, Endre] Elbassioni, Khaled [Gurvich, Vladimir] [Tiwary, Hans Raj] | ![]() | 2011 | The negative cycles polyhedron and hardness of checking some polyhedral properties In: Annals of Operations Research [188], 63-76 | Journal Article | ![]() | ||||
![]() | 17:31:17 | Administrators,LocalDomainServers,[AGEditors] | Doerr, Benjamin [Fouz, Mahmoud] Friedrich, Tobias | 2012 | Why Rumors Spread Fast in Social Networks In: Communications of the ACM [55], 70-75 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 17:29:46 | Administrators,LocalDomainServers,[AGEditors] | Chan, T.-H. Hubert Elbassioni, Khaled | ![]() | 2011 | A QPTAS for TSP with Fat Weakly Disjoint Neighborhoods in Doubling Metrics In: Discrete & Computational Geometry [46], 704-723 | Journal Article | ![]() | ||||
![]() | 17:26:37 | Administrators,LocalDomainServers,[AGEditors] | Elbassioni, Khaled Elmasry, Amr [Makino, Kazuhisa] | 2011 | Finding Simplices containing the Origin in Two and Three Dimensions In: International Journal of Computational Geometry & Applications [21], 495-506 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 17:22:27 | Endre Boros,Khaled Elbassioni,Vladimir Gurvich,Kazuhisa Makino,[Library],[Department] | [Boros, Endre] Elbassioni, Khaled [Gurvich, Vladimir] [Makino, Kazuhisa] | ![]() | 2012 | Every Stochastic Game with Perfect Information Admits a Canonical Form In: 2nd International ICST Conference on Game Theory for Networks (GameNets 2011), | Unpublished/Draft | ![]() | ||||
![]() | 17:02:54 | Administrators,LocalDomainServers,[AGEditors] | [Canzar,Stefan] Elbassioni, Khaled [Klau, Gunnar W.] [Mestre, Julian] | [Aceto, Luca] [Henzinger, Monika] [Sgall, Jiri] | 2011 | On Tree-Constrained Matchings and Generalizations In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 98-109 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 16:58:37 | Administrators,LocalDomainServers,[AGEditors] | [Boros, Endre] Elbassioni, Khaled [Fouz, Mahmoud] [Gurvich, Vladimir] [Makino, Kazuhisa] [Manthey, Bodo] | [Aceto, Luca] [Henzinger, Monika] [Sgall, Jiri] | 2011 | Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 147-158 | Proceedings Article | ![]() | ||||
![]() | 15:23:26 | [Library] | Bringmann, Karl Friedrich, Tobias [Neumann, Frank] [Wagner, Markus] | [Walsh, Toby] | 2011 | Approximation-guided evolutionary multi-objective optimization In: Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (IJCAI 2011), 1198-1203 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 15:07:41 | [Library] | Bringmann, Karl Friedrich, Tobias | [Krasnogor, Natalio] [Lanzim, Pier Luca] | 2011 | Convergence of Hypervolume-Based Archiving Algorithms I: Effectiveness In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 745-752 | Proceedings Article | ![]() | ||||
![]() | 22:44:19 | Administrators,LocalDomainServers,[AGEditors] | [Mainberger, Markus] [Hoffmann, Sebastian] [Weickert, Joachim] Tang, Ching Hoo [Johannsen, Daniel] [Neumann, Frank] Doerr, Benjamin | [Bruckstein, Alfred M.] [ter Haar Romeny, Bart M.] [Bronstein, Alexander M.] [Bronstein, Michael M.] | 2011 | 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 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 13:55:21 | [Library] | [Soranzo, Nicola] Ramezani, Fahimeh [Iacono, Giovanni] [Altafini, Claudio] | ![]() | 2012 | Decompositions of large-scale biological systems based on dynamical properties In: Bioinformatics [28], 76-83 | Journal Article | ![]() | ||||
![]() | 13:43:20 | Alexander Kobel | Kobel, Alexander | 2008 | Automated Generation of Kempe Linkages for Algebraic Curves in a Dynamic Geometry System Universität des Saarlandes | Thesis - Bachelor thesis | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 13:39:46 | Administrators,LocalDomainServers,[AGEditors] | Kobel, Alexander | ![]() | 2011 | Certified numerical root finding Universität des Saarlandes | Thesis - Masters thesis | ![]() | ||||
![]() | 15:58:56 | Administrators,LocalDomainServers,[AGEditors] | [Auger, Anne] Doerr, Benjamin | 2011 | Theory of Randomized Search Heuristics | Book | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 11:43:08 | [Library] | Berberich, Eric [Halperin, Dan] [Kerber, Michael] [Pogalnikova, Roza] | ![]() | 2011 | Deconstructing Approximate Offsets In: arXiv [abs/1109.2158], | Electronic Journal Article | ![]() | ||||
![]() | 18:48:17 | [Library] | [Baruah, Sanjoy] Bonifaci, Vincenzo [D'Angelo, Gianlorenzo] [Marchetti-Spaccamela, Alberto] [van der Ster, Suzanne] [Stougie, Leen] | [Demetrescu, Camil] [Halldórsson, Magnús M.] | 2011 | ![]() | Mixed-criticality scheduling of sporadic task systems In: Algorithms - ESA 2011 : 19th Annual European Symposium, 555-566 | Proceedings Article | ![]() | ||||||
![]() | ![]() | ![]() | ![]() | 18:25:10 | Administrators,LocalDomainServers,[AGEditors] | Bonifaci, Vincenzo [Korteweg, Peter] [Marchetti-Spaccamela, Alberto] [Stougie, Leen] | ![]() | 2011 | ![]() | Minimizing Flow Time in the Wireless Gathering Problem In: ACM Transactions on Algorithms [7], 33:1-33:20 | Journal Article | ![]() | |||
![]() | 18:13:31 | Administrators,LocalDomainServers,[AGEditors] | Bonifaci, Vincenzo [Korteweg, Peter] [Marchetti-Spaccamela, Alberto] [Stougie, Leen] | 2011 | ![]() | The Distributed Wireless Gathering Problem In: Theoretical Computer Science [412], 633-641 | Journal Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 15:00:06 | [Library] | Doerr, Benjamin Johannsen, Daniel Kötzing, Timo [Lehre, Per Christian] Wagner, Markus Winzen, Carola | [Beyer, Hans- Georg] [Langdon, William] | 2011 | Faster black-box algorithms through higher arity operators In: Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI (FOGA 2011), 163-172 | Proceedings Article | ![]() | ||||
163 |
| ![]() | |||||||||||||
19 |
|
| ![]() | ||||||||||||
![]() | 17:16:23 | Administrators,LocalDomainServers,[AGEditors] | van Zuylen, Anke | [Solis-Oba, Roberto] [Persiano, Pino] | 2012 | Simpler 3/4-approximation algorithms for MAX SAT In: Approximation and Online Algorithms : 9th International Workshop, WAOA 2011, 188-197 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 16:32:03 | Administrators,LocalDomainServers,[AGEditors] | van Zuylen, Anke | ![]() | 2011 | Linear programming based approximation algorithms for feedback set problems in bipartite tournaments. In: Theoretical Computer Science [412], 2556-2561 | Journal Article | ![]() | ||||
![]() | 16:29:38 | Administrators,LocalDomainServers,[AGEditors] | van Zuylen, Anke | 2011 | An improved monotone algorithm for scheduling related machines with precedence constraints In: Operations Research Letters [39], 423-427 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 15:40:40 | Administrators,LocalDomainServers,[AGEditors] | van Zuylen, Anke | ![]() | 2011 | Deterministic Sampling Algorithms for Network Design In: Algorithmica [60], 110-151 | Journal Article | ![]() | ||||
![]() | 15:37:15 | [Library] | [Ailon, Nir] [Avigdor-Elgrabli, Noa] [Liberty, Noa] van Zuylen, Anke | [Demetrescu, Camil] [Halldórsson, Magnús M.] | 2011 | Improved Approximation Algorithms for Bipartite Correlation Clustering In: Algorithms - ESA 2011 : 19th Annual European Symposium, 25-36 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 15:29:50 | [Library] | van Zuylen, Anke [Schalekamp, Frans] [Williamson, David P.] | [Adacher, Ludovica] [Flamini, Marta] [Leo, Gianmaria] [Nicosia, Gaia] [Pacifici, Andrea] [Piccialli, Veronica] | 2011 | Popular Ranking In: 10th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2011, 267-270 | Electronic Proceedings Article | ![]() | ||||
![]() | 17:01:54 | Administrators,LocalDomainServers,[AGEditors] | Kötzing, Timo | [Kivinen, Jyrki] [Szepesvári, Csaba] [Ukkonen, Esko] [Zeugmann, Thomas] | 2011 | Iterative Learning from Positive Data and Counters In: Algorithmic Learning Theory : 22nd International Conference, ALT 2011, 40-54 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 16:55:32 | [Library] | Kötzing, Timo [Sudholt, Dirk] [Theile, Madeleine] | [Krasnogor, Natalio] [Lanzi, Pier Luca] | 2011 | How crossover helps in pseudo-Boolean optimization In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 989-996 | Proceedings Article | ![]() | ||||
![]() | 16:51:51 | [Library] | Kötzing, Timo [Neumann, Frank] Spöhel, Reto | [Krasnogor, Natalio] [Lanzi, Pier Luca] | 2011 | PAC learning and genetic programming In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 2091-2096 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 14:42:02 | [Library] | Hermelin, Danny [Mnich, Matthias] [van Leeuwen, Erik Jan] [Woeginger, Gerhard J.] | [Aceto, Luca] [Henzinger, Monika] [Sgall, Jiri] | 2011 | Domination When the Stars Are Out In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 462-473 | Proceedings Article | ![]() | ||||
![]() | 14:38:44 | Administrators,LocalDomainServers,[AGEditors] | Hermelin, Danny [Levy, Avivit] [Weimann, Oren] [Yuster, Raphael] | [Aceto, Luca] [Henzinger, Monika] [Sgall, Jiri] | 2011 | Distance Oracles for Vertex-Labeled Graphs In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 490-501 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 14:35:38 | [Library] | [Fellows, Michael R.] Friedrich, Tobias Hermelin, Danny [Narodytska, Nina] [Rosamond, Frances A.] | [Walsh, Toby] | 2011 | 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 | Proceedings Article | ![]() | ||||
![]() | 14:22:52 | [Library] | Hermelin, Danny [Huang, Chien-Chung] [Kratsch, Stefan] Wahlström, Magnus | [Kolman, Petr] [Kratochvíl, Jan] | 2011 | Parameterized Two-Player Nash Equilibrium In: Graph-Theoretic Concepts in Computer Science : 37th International Workshop, WG 2011, 215-226 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 11:59:05 | Administrators,LocalDomainServers,[AGEditors] | [Bar-Yehuda, Reuven] Hermelin, Danny [Rawitz, Dror] | ![]() | 2011 | Minimum vertex cover in rectangle graphs In: Computational Geometry [44], 356-364 | Journal Article | ![]() | ||||
![]() | 11:56:49 | Administrators,LocalDomainServers,[AGEditors] | Hermelin, Danny [Rawitz, Dror] | 2011 | Optimization problems in multiple subtree graphs In: Discrete Applied Mathematics [159], 588-594 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 11:54:33 | Administrators,LocalDomainServers,[AGEditors] | [Ben-Zwi, Oren] Hermelin, Danny [Lokshtanov, Daniel] [Newman, Ilan] | ![]() | 2011 | Treewidth governs the complexity of target set selection In: Discrete Optimization [8], 87-96 | Journal Article | ![]() | ||||
![]() | 11:49:46 | Administrators,LocalDomainServers,[AGEditors] | [Fellows, Michael R.] [Hartman, Tzvika] Hermelin, Danny [Landau, Gad M.] [Rosamond, Frances A.] [Rozenberg, Liat] | 2011 | Haplotype Inference Constrained by Plausible Haplotype Data In: IEEE/ACM Transactions on Computational Biology and Bioinformatics [8], 1692-1699 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 11:44:05 | Administrators,LocalDomainServers,[AGEditors] | [Fellows, Michael R.] [Fertin, Guillaume] Hermelin, Danny [Vialette, Stephane] | ![]() | 2011 | Upper and lower bounds for finding connected motifs in vertex-colored graphs In: Journal of Computer and System Sciences [77], 799-811 | Journal Article | ![]() | ||||
![]() | 16:14:26 | Administrators,LocalDomainServers,[AGEditors] | Harren, Rolf [Jansen, Klaus] [Prädel, Lars] van Stee, Rob | [Dehne, Frank] [Iacono, John] [Sack, Jörg-Rüdiger] | 2011 | ![]() | A (5/3 + ε)-Approximation for Strip Packing In: Algorithms and Data Structures : 12th International Symposium, WADS 2011, 475-487 | Proceedings Article | ![]() | ||||||
12 |
|
| ![]() | ||||||||||||
![]() | 11:13:47 | Administrators,LocalDomainServers,[AGEditors] | Doerr, Benjamin | [Krasnogor, Natalio] [Lanzi, Pier Luca] | 2011 | Drift analysis In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 1311-1320 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 10:56:16 | Administrators,LocalDomainServers,[AGEditors] | Doerr, Benjamin Kötzing, Timo Winzen, Carola | [Krasnogor, Natalio] [Lanzi, Pier Luca] | 2011 | Too fast unbiased black-box algorithms In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 2043-2050 | Proceedings Article | ![]() | ||||
![]() | 10:46:03 | Administrators,LocalDomainServers,[AGEditors] | Doerr, Benjamin [Fouz, Mahmoud] [Witt, Carsten] | [Krasnogor, Natalio] [Lanzi, Pier Luca] | 2011 | Sharp bounds by probability-generating functions and variable drift In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 2083-2090 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 09:29:21 | Administrators,LocalDomainServers,[AGEditors] | Doerr, Benjamin [Fouz, Mahmoud] | [Aceto, Luca] [Henzinger, Monika] [Sgall, Jiri] | 2011 | Asymptotically Optimal Randomized Rumor Spreading In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 502-513 | Proceedings Article | ![]() | ||||
![]() | 09:10:40 | Administrators,LocalDomainServers,[AGEditors] | Doerr, Benjamin [Lengler, Johannes] Kötzing, Timo Winzen, Carola | [Krasnogor, Natalio] [Lanzi, Pier Luca] | 2011 | Black-box complexities of combinatorial problems In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 981-988 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 22:25:58 | Administrators,LocalDomainServers,[AGEditors] | Doerr, Benjamin [Goldberg, Leslie Ann] [Minder, Lorenz] Sauerwald, Thomas [Scheideler, Christian] | ![]() | 2011 | Stabilizing consensus with the power of two choices In: 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA-11), 149-158 | Proceedings Article | ![]() | ||||
![]() | 11:35:45 | [Library] | Doerr, Benjamin Johannsen, Daniel [Schmidt, Martin] | [Beyer, Hans- Georg] [Langdon, William] | 2011 | ![]() | 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 | Proceedings Article | ![]() | ||||||
![]() | ![]() | ![]() | ![]() | 11:12:18 | [Library] | Doerr, Benjamin Happ, Edda Klein, Christian | ![]() | 2011 | Tight Analysis of the (1+1)-EA for the Single Source Shortest Path Problem In: Evolutionary Computation [19], 673-691 | Journal Article | ![]() | ||||
![]() | 11:03:03 | Administrators,LocalDomainServers,[AGEditors] | Doerr, Benjamin Winzen, Carola | 2012 | Memory-restricted black-box complexity of OneMax In: Information Processing Letters [112], 32-34 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 10:57:45 | Administrators,LocalDomainServers,[AGEditors] | Doerr, Benjamin [Jansen, Thomas] | ![]() | 2011 | Theory of Evolutionary Computation In: Algorithmica [59], 299-300 | Journal Article | ![]() | ||||
![]() | 10:42:40 | [Library] | Doerr, Benjamin [Neumann, Frank] [Sudholt, Dirk] [Witt, Carsten] | 2011 | Runtime analysis of the 1-ANT ant colony optimizer In: Theoretical Computer Science [412], 1629-1644 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 10:37:45 | Administrators,LocalDomainServers,[AGEditors] | Doerr, Benjamin [Eremeev, Anton] Neumann, Frank [Theile, Madeleine] [Thyssen, Christian] | ![]() | 2011 | Evolutionary algorithms and dynamic programming In: Theoretical Computer Science [412], 6020-6035 | Journal Article | ![]() | ||||
2 |
|
| ![]() | ||||||||||||
![]() | ![]() | ![]() | ![]() | 15:20:53 | [Library] | [Höhn, Wiebke] [Jacobs, Tobias] Megow, Nicole | ![]() | 2012 | On Eulerian extensions and their application to no-wait flowshop scheduling In: Journal of Scheduling [15], 295-309 | Journal Article | ![]() | ||||
![]() | 15:19:15 | Administrators,LocalDomainServers,[AGEditors] | [Baruah, Sanjoy] [Bonifaci, Vincenzo] [D'Angelo, Gianlorenzo] [Li, Haohan] [Marchetti-Spaccamela, Alberto] Megow, Nicole [Stougie, Leen] | 2012 | Scheduling Real-Time Mixed-Criticality Jobs In: IEEE Transactions on Computers [61], 1140-1152 | Journal Article | ![]() | ||||||||
2 |
|
| ![]() | ||||||||||||
![]() | 17:12:37 | [Library] | Emeliyanenko, Pavel | [Smari, Waleed W.] [McIntire, John P.] | 2011 | ![]() | High-performance polynomial GCD computations on graphics processors In: Proceedings of the 2011 International Conference on High Performance Computing & Simulation (HPCS 2011), 215-224 | Proceedings Article | ![]() | ||||||
![]() | ![]() | ![]() | ![]() | 16:15:48 | Eric Berberich | Berberich, Eric Emeliyanenko, Pavel Kobel, Alexander Sagraloff, Michael | [Moreno Maza, Marc] | 2011 | Arrangement Computation for Planar Algebraic Curves In: Proceedings of the 4th Internal Workshop on Symbolic-Numeric Computation, 88-98 | Proceedings Article | ![]() | ||||
3 |
|
| ![]() | ||||||||||||
![]() | ![]() | ![]() | ![]() | 08:47:36 | [Library] | Megow, Nicole Mehlhorn, Kurt Schweitzer, Pascal | [Aceto, Luca] [Henzinger, Monika] [Sgall, Jiří] | 2011 | Online Graph Exploration: New Results on Old and New Algorithms In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 478-489 | Proceedings Article | ![]() | ||||
![]() | 08:44:50 | Administrators,LocalDomainServers,[AGEditors] | [Anand, S.] [Garg, Naveen] Megow, Nicole | [Aceto, Luca] [Henzinger, Monika] [Sgall, Jiří] | 2011 | Meeting deadlines: How much speed suffices? In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011. - Pt. I, 232-243 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 01:18:02 | Administrators,LocalDomainServers,[AGEditors] | Elbassioni, Khaled [Tiwary, Hans Raj] | ![]() | 2009 | Complexity of Approximating the Vertex Centroid of a Polyhedron In: Algorithms and Computation, 20th International Symposium (ISAAC), 413-422 | Proceedings Article | ![]() | ||||
21 |
|
| ![]() | ||||||||||||
![]() | ![]() | ![]() | ![]() | 16:45:15 | [Library] | Berberich, Eric Emeliyanenko, Pavel Kobel, Alexander Sagraloff, Michael | ![]() | 2011 | Arrangement Computation for Planar Algebraic Curves In: arXiv [abs/1103.4697], | Electronic Journal Article | ![]() | ||||
![]() | 12:53:50 | [Library] | Sagraloff, Michael [Yap, Chee] | [Leykin, Anton] | 2011 | 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 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 12:51:01 | Administrators,LocalDomainServers,[AGEditors] | Mehlhorn, Kurt Osbild, Ralf Sagraloff, Michael | ![]() | 2011 | A General Approach to the Analysis of Controlled Perturbation Algorithms In: Computational Geometry [44], 507-528 | Journal Article | ![]() | ||||
![]() | 12:48:16 | [Library] | [Kerber, Michael] Sagraloff, Michael | [Leykin, Anton] | 2011 | Efficient Real Root Approximation In: ISSAC 2011 : Proceedings of the 36th International Symposium on Symbolic and Algebraic Computation, 209-216 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 12:42:46 | [Library] | [Kerber, Michael] Sagraloff, Michael | ![]() | 2011 | A Note on the Complexity of Real Algebraic Hypersurfaces In: Graphs and Combinatorics [27], 419-430 | Journal Article | ![]() | ||||
![]() | 12:38:02 | Administrators,LocalDomainServers,[AGEditors] | Sagraloff, Michael | 2010 | A General Approach to Isolating Roots of a Bitstream Polynomial In: Mathematics in Computer Science [4], 481-506 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 10:30:27 | [Library] | Wagner, Markus [Veeramachaneni, Kalyan] [Neumann, Frank] [O'Reilly, Una-May] | ![]() | 2011 | ![]() | Optimizing the Layout of 1000 Wind Turbines In: European Wind Energy Association Annual Event, 1-10 | Proceedings Article | ![]() | |||
![]() | 09:50:40 | Administrators,LocalDomainServers,[AGEditors] | [Alkassar, Eyad] [Böhme, Sascha] Mehlhorn, Kurt Rizkallah, Christine | [Gopalakrishnan, Ganesh] [Qadeer, Shaz] | 2011 | Verification of Certifying Computations In: Computer Aided Verification : 23rd International Conference, CAV 2011, 67-82 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 21:53:12 | [Library] | Milosavljevic, Nikola [Morozov, Dmitriy] [Skraba, Primoz] | ![]() | 2011 | Zigzag Persistent Homology in Matrix Multiplication Time In: Proceedings of the 27th Annual Symposium on Computational Geometry (SCG'11), 216-225 | Proceedings Article | ![]() | ||||
![]() | 19:32:42 | Administrators,LocalDomainServers,[AGEditors] | [Althaus, Ernst] Kupilas, Joschka Naujoks, Rouven | [Ogihara, Mitsunori] [Tarui, Jun] | 2011 | 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 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 19:25:46 | Administrators,LocalDomainServers,[AGEditors] | Schweitzer, Pascal | ![]() | 2009 | Problems of Unknown Complexity: Graph isomorphism and Ramsey theoretic numbers Universität des Saarlandes | Thesis - PhD thesis | ![]() | ||||
![]() | 18:46:15 | Thomas Sauerwald | De Sterck, Hans [Henson, Van Emden] [Sanders, Geoff] | 2011 | Multilevel Aggregation Methods for Small-World Graphs with Application to Random-Walk Ranking | Unpublished/Draft | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 18:41:43 | [Library] | De Sterck, Hans [Miller, Killian] [Sanders, Geoff] [Winlaw, Manda] | ![]() | 2011 | Recursively accelerated multilevel aggregation for Markov chains In: SIAM Journal on Scientific Computing [32], 1652-1671 | Journal Article | ![]() | ||||
![]() | 13:26:43 | Carola Winzen | Winzen, Carola | 2011 | Direction-Reversing Quasi-Random Rumor Spreading with Restarts | Unpublished/Draft | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 13:13:07 | Administrators,LocalDomainServers,[AGEditors] | Doerr, Benjamin Winzen, Carola | [Kulikov, Alexande] [Vereshchagin, Nikolay] | 2011 | Towards a Complexity Theory of Randomized Search Heuristics: Ranking-Based Black-Box Complexity In: Computer Science - Theory and Applications : 6th International Computer Science Symposium in Russia (CSR 2011), 15-28 | Proceedings Article | ![]() | ||||
![]() | 12:26:42 | [Library] | Farzan, Arash [Munro, J. Ian] | 2011 | Succinct representation of dynamic trees In: Theoretical Computer Science [412], 2668-2678 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 21:56:06 | [Library] | Kötzing, Timo [Neumann, Frank] [Sudholt, Dirk] [Wagner, Markus] | [Beyer, Hans- Georg] [Langdon, William] | 2011 | 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 | Proceedings Article | ![]() | ||||
![]() | 16:32:33 | [Library] | [Case, John] Kötzing, Timo | [Schwentick, Thomas] [Dürr, Christoph] | 2011 | Measuring Learning Complexity with Criteria Epitomizers In: 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011), 320-331 | Electronic Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 04:54:07 | Tobias Friedrich | Fountoulakis, Nikolaos Friedrich, Tobias Hermelin, Danny | ![]() | 2011 | Average Case Parameterized Complexity | Unpublished/Draft | ![]() | ||||
![]() | 12:32:41 | [Library] | Elmasry, Amr Mehlhorn, Kurt [Schmidt, Jens M.] | 2010 | An $O(m+n)$ Certifying Triconnectivity Algorithm for Hamiltonian Graphs In: Algorithmica [Online First], 1-13 | Electronic Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 11:51:29 | Administrators,LocalDomainServers,[AGEditors] | McConnella, Ross M. Mehlhorn, Kurt [Näher, Stefan] [Schweitzer, Pascal] | ![]() | 2010 | Certifying algorithms In: Computer Science Review [Article in Press], 1-43 | Electronic Journal Article | ![]() | ||||
36 |
|
| ![]() | ||||||||||||
![]() | ![]() | ![]() | ![]() | 16:58:38 | Administrators,LocalDomainServers,[AGEditors] | Berberich, Eric [Hemmer, Michael] [Kerber, Michael] | [Hurtado, Ferran] [van Krefeld, Marc] | 2011 | A Generic Algebraic Kernel for Non-linear Geometric Applications In: Proceedings of the 27th Annual Symposium on Computational Geometry (SCG'11), 179-186 | Proceedings Article | ![]() | ||||
![]() | 16:53:00 | Administrators,LocalDomainServers,[AGEditors] | Berberich, Eric [Halperin, Dan] [Kerber, Michael] [Pogalnikova, Roza] | [Hurtado, Ferran] [van Krefeld, Marc] | 2011 | Deconstructing Approximate Offsets In: Proceedings of the 27th Annual Symposium on Computational Geometry (SCG'11), 187-196 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 18:27:11 | Khaled Elbassioni | Elbassioni, Khaled [Rauf, Imran] Ray, Saurabh | ![]() | ?? | On Enumerating Minimal Transversals of Geometric Hypergraphs | Unpublished/Draft | ![]() | ||||
![]() | 18:29:26 | Administrators,LocalDomainServers,[AGEditors] | [Nor, Igor] Hermelin, Danny [Charlat, Sylvain] [Engelstadter, Jan] [Reuter, Max] [Duron, Olivier Sagot, Marie-France] | [Amir, Amihood] [Parida, Laxmi] | 2010 | Mod/Resc Parsimony Inference In: Combinatorial Pattern Matching : 21st Annual Symposium, CPM 2010, 202-213 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 18:25:05 | Danny Hermelin | [Gotthilf, Zvi] [Hermelin, Danny] [Landau, Gad M.] [Lewenstein, Moshe] | ![]() | 2010 | Restricted LCS In: 17th International Symposium on String Processing and Information Retrieval, 250-257 | Proceedings Article | ![]() | ||||
![]() | 16:18:13 | Administrators,LocalDomainServers,[AGEditors] | Harren, Rolf | 2010 | Two-dimensional packing problems Universität des Saarlandes | Thesis - PhD thesis | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 16:13:46 | Administrators,LocalDomainServers,[AGEditors] | Huber, Anna | ![]() | 2010 | Randomized rounding and rumor spreading with stochastic dependencies Universität des Saarlandes | Thesis - PhD thesis | ![]() | ||||
![]() | 16:07:23 | Administrators,LocalDomainServers,[AGEditors] | Kratsch, Stefan | 2010 | Kernelization of generic problems : upper and lower bounds Universität des Saarlandes | Thesis - PhD thesis | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 13:37:13 | Administrators,LocalDomainServers,[AGEditors] | Johannsen, Daniel | ![]() | 2010 | ![]() | Random combinatorial structures and randomized search heuristics Universität des Saarlandes | Thesis - PhD thesis | ![]() | |||
![]() | 11:38:01 | Administrators,LocalDomainServers,[AGEditors] | Pyrga, Evangelia | 2010 | Algorithmic Game Theory and Networks Universität des Saarlandes | Thesis - PhD thesis | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 21:52:14 | [Library] | Doerr, Benjamin [Fouz, Mahmoud] Friedrich, Tobias | ![]() | 2011 | Social Networks Spread Rumors in Sublogarithmic Time In: STOC'11 : Proceedings of the 43rd ACM Symposium on Theory of Computing, 21-30 | Proceedings Article | ![]() | ||||
![]() | 03:11:59 | Administrators,LocalDomainServers,[AGEditors] | [Chan, Sze-Hang] [Lam, Tak-Wah] Lee, Lap-Kei | [Schwentick, Thomas] [Dürr, Christoph] | 2011 | Scheduling for weighted flow time and energy with rejection penalty In: 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011), 392-403 | Electronic Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 03:00:53 | Administrators,LocalDomainServers,[AGEditors] | [Chan, Ho-Leung] [Edmonds, Jeff] [Lam, Tak-Wah] Lee, Lap-Kei [Marchetti-Spaccamela, Alberto] [Pruhs, Kirk] | ![]() | 2011 | Nonclairvoyant speed scaling for flow and energy In: Algorithmica [61], 507-517 | Journal Article | ![]() | ||||
![]() | 13:58:27 | [Library] | [Rusinov, Momchil] Schweitzer, Pascal | 2010 | Homomorphism -- homogeneous graphs In: Journal of Graph Theory [65], 253-262 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 12:30:29 | Administrators,LocalDomainServers,[AGEditors] | Neumann, Frank [Witt, Carsten] | ![]() | 2010 | Ant Colony Optimization and the minimum spanning tree problem In: Theoretical Computer Science [411], 2406-2413 | Journal Article | ![]() | ||||
![]() | 11:59:19 | Administrators,LocalDomainServers,[AGEditors] | Mustafa, Nabil H. Ray, Saurabh | 2010 | Improved Results on Geometric Hitting Set Problems In: Discrete & Computational Geometry [44], 883-895 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 11:52:38 | Administrators,LocalDomainServers,[AGEditors] | Mestre, Julian | ![]() | 2010 | Adaptive local ratio In: SIAM Journal on Computing [39], 3038-3057 | Journal Article | ![]() | ||||
![]() | 11:29:25 | [Library] | [Jansen, Thomas] Neumann, Frank | 2010 | Editorial for the Special Issue on Theoretical Aspects of Evolutionary Multi-Objective Optimization In: Evolutionary Computation [18], 333-334 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 01:34:03 | Administrators,LocalDomainServers,[AGEditors] | Schweitzer, Pascal [Schweitzer, Patrick] | ![]() | 2010 | Connecting face hitting sets in planar graphs In: Information Processing Letters [111], 11-15 | Journal Article | ![]() | ||||
![]() | 11:16:04 | Jane Gao | Gao, Pu (Jane) | 2011 | Distribution of spanning regular subgraphs in random graphs | Unpublished/Draft | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 11:10:57 | Jane Gao | Gao, Pu (Jane) [Wormald, Nicholas] [Su, Yi] | ![]() | 2010 | ![]() | Induced subgraphs in sparse random graphs with given degree sequence | Unpublished/Draft | ![]() | |||
![]() | 14:16:54 | Administrators,LocalDomainServers,[AGEditors] | [Iacono, G.] Ramezani, Fahimeh [Soranzo, N.] [Altafani, C.] | 2010 | Determining the distance to monotonicity of a biological network: a graph-theoretical approach In: IET Systems Biology [4], 223-235 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 13:50:17 | Administrators,LocalDomainServers,[AGEditors] | Huang, Chien-Chung | ![]() | 2010 | Circular stable matching and 3-way kidney transplant In: Algorithmica [58], 137-150 | Journal Article | ![]() | ||||
![]() | 13:38:02 | Administrators,LocalDomainServers,[AGEditors] | Huang, Chien-Chung | Charikar, Moses | 2010 | Classified stable matching In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1235-1253 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 13:24:43 | [Library] | Gidenstam, Anders [Papatriantafilou, Marina] [Tsigas, Philippas] | ![]() | 2010 | NBmalloc: Allocating Memory in a Lock-Free Manner In: Algorithmica [58], 304-338 | Journal Article | ![]() | ||||
![]() | 13:10:11 | Administrators,LocalDomainServers,[AGEditors] | [Giannopoulos, Panos] [Klein, Rolf] Kutz, Martin [Marx, Daniel] | 2010 | Computing geometric minimum-dilation graphs is NP-hard In: International Journal of Computational Geometry & Applications [20], 147-173 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 09:04:55 | Konstantinos Panagiotou | Fountoulakis, Nikolaos Huber, Anna Panagiotou, Konstantinos | ![]() | 2009 | The Speed of Broadcasting in Random Networks: Density Does Not Matter In: 23rd International Symposium on Distributed Computing (DISC '09), 529-530 | Proceedings Article | ![]() | ||||
![]() | 08:59:12 | Administrators,LocalDomainServers,[AGEditors] | Panagiotou, Konstantinos | 2009 | Vertices of Degree k in Random Unlabeled Trees In: European Conference on Combinatorics, Graph Theory and Applications (EuroComb '09), 41-45 | Proceedings Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 14:40:23 | [Library] | Elmasry, Amr [Jensen, Claus] [Katajainen, Jyrki] | [Boldi, Paolo] [Gargano, Luisa] | 2010 | The Magic of a Number System In: Fun with Algorithms : 5th International Conference, FUN 2010, 156-165 | Proceedings Article | ![]() | ||||
![]() | 14:35:24 | [Library] | Elmasry, Amr [Jensen, Claus] [Katajainen, Jyrki] | [Kaplan, Haim] | 2010 | Strictly-regular number system and data structures In: Algorithm Theory - SWAT 2010 : 12th Scandinavian Symposium and Workshops on Algorithm Theory, 26-37 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 14:32:27 | [Library] | Elmasry, Amr | ![]() | 2010 | The longest almost-increasing subsequence In: Information Processing Letters [110], 655-658 | Journal Article | ![]() | ||||
![]() | 14:25:40 | [Library] | Elmasry, Amr | 2010 | Pairing heaps, scrambled pairing and square-root trees In: International Journal of Computer Mathematics [87], 3096-3110 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 14:11:24 | [Library] | [Batra, Prashant] Sharma, Vikram | ![]() | 2010 | Bounds on absolute positiveness of multivariate polynomials In: Journal of Symbolic Computation [45], 617-628 | Journal Article | ![]() | ||||
![]() | 14:02:22 | Administrators,LocalDomainServers,[AGEditors] | [Basit, Abdul] [Mustafa, Nabil H.] Ray, Saurabh [Raza, Sarfraz] | 2010 | Centerpoints and Tverberg's technique In: Computational Geometry [43], 593-600 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 19:52:54 | Administrators,LocalDomainServers,[AGEditors] | Friedrich, Tobias Sauerwald, Thomas | ![]() | 2010 | The Cover Time of Deterministic Random Walks In: The Electronic Journal of Combinatorics [17], R167,1-R167,30 | Electronic Journal Article | ![]() | ||||
![]() | 16:29:53 | Administrators,LocalDomainServers,[AGEditors] | [Kao, Ming-Yang] [Leung, Henry C. M.] Sun, He [Zhang, Yong] | [Kratchovil, Jan] [Li, Angsheng] [Fiala, Jiri] [Kolman, Petr] | 2010 | Deterministic Polynomial-Time Algorithms for Designing Short DNA Words In: Theory and Applications of Models of Computation : 7th Annual Conference, TAMC 2010, 308-319 | Proceedings Article | ![]() | |||||||
68 |
|
| ![]() | ||||||||||||
![]() | 04:06:30 | Frank Neumann | [Durrett, Greg] [Neumann, Frank] [O'Reilly, Una-May] | [Beyer, Hans- Georg] [Langdon, William] | 2011 | 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 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 10:45:45 | Administrators,LocalDomainServers,[AGEditors] | Kratsch, Stefan [Lehre, Per Kristian] [Neumann, Frank] [Oliveto, Pietro Simone] | [Schaefer, Robert] [Cotta, Carlos] [Kolodziej, Joanna] [Rudolph, Günter] | 2010 | 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 | Proceedings Article | ![]() | ||||
![]() | 10:40:49 | Administrators,LocalDomainServers,[AGEditors] | Kratsch, Stefan Schweitzer, Pascal | [Kaplan, Haim] | 2010 | Isomorphism for Graphs of Bounded Feedback Vertex Set Number In: Algorithm Theory - SWAT 2010 : 12th Scandinavian Symposium and Workshops on Algorithm Theory, 81-92 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 10:36:04 | Administrators,LocalDomainServers,[AGEditors] | [Jansen, Klaus] Kratsch, Stefan [Marx, Dániel] [Schlotter, Ildikó] | [Kaplan, Haim] | 2010 | Bin Packing with Fixed Number of Bins Revisited In: Algorithm Theory - SWAT 2010 : 12th Scandinavian Symposium and Workshops on Algorithm Theory, 260-272 | Proceedings Article | ![]() | ||||
![]() | 19:14:50 | Administrators,LocalDomainServers,[AGEditors] | Bringmann, Karl Friedrich, Tobias | 2010 | Approximating the volume of unions and intersections of high-dimensional geometric objects In: Computational Geometry [43], 601-610 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 19:13:30 | [Library] | Friedrich, Tobias [Sauerwald, Thomas] [Vilenchik, Dan] | ![]() | 2010 | Smoothed Analysis of Balancing Networks In: Random Structures and Algorithms [Early View], 1-24 | Electronic Journal Article | ![]() | ||||
![]() | 19:12:02 | Administrators,LocalDomainServers,[AGEditors] | [Bringmann, Karl] Friedrich, Tobias | 2010 | An Efficient Algorithm for Computing Hypervolume Contributions In: Evolutionary Computation [18], 383-402 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 19:09:23 | Administrators,LocalDomainServers,[AGEditors] | [Berghammer, Rudolf] Friedrich, Tobias Neumann, Frank | [Pelikan, Martin] [Branke, Jürgen] | 2010 | Set-based Multi-Objective Optimization, Indicators, and Deteriorative Cycles In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 495-502 | Proceedings Article | ![]() | ||||
![]() | 19:07:21 | Administrators,LocalDomainServers,[AGEditors] | [Bringmann, Karl] Friedrich, Tobias | 2010 | The Maximum Hypervolume Set Yields Near-optimal Approximation In: 12th annual conference on Genetic and evolutionary computation (GECCO 2010), 511-518 | Proceedings Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 19:05:26 | [Library] | Friedrich, Tobias [Sauerwald, Thomas] | [Thai, My T.] [Sahni, Sartaj] | 2010 | The Cover Time of Deterministic Random Walks In: Computing and Combinatorics : 16th Annual International Conference, COCOON 2010, 130-139 | Proceedings Article | ![]() | ||||
![]() | 03:39:03 | [Library] | Friedrich, Tobias [Bringmann, Karl] [Voss, Thomas] [Igel, Christian] | [Beyer, Hans- Georg] [Langdon, William] | 2011 | The Logarithmic Hypervolume Indicator In: FOGA'11 : Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, 81-92 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 03:35:50 | Administrators,LocalDomainServers,[AGEditors] | [Bringmann, Karl] Friedrich, Tobias | [Schaefer, Robert] [Cotta, Carlos] [Kolodziej, Joanna] [Rudolph, Günter] | 2010 | Tight Bounds for the Approximation Ratio of the Hypervolume Indicator In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 607-616 | Proceedings Article | ![]() | ||||
![]() | 14:31:22 | Khaled Elbassioni | [Boros, Endre] Elbassioni, Khaled [Gurvich, Vladimir] [Makino, Kazuhisa] | 2010 | On Nash Equilibria and Improvement Cycles in Pure Positional Strategies for Chess-like and Backgammon-like $n$-person Games | Unpublished/Draft | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 01:28:13 | [Library] | [Hajiaghayi, MohammadTaghi] [Khandekar, Rohit] [Kortsarz, Guy] Mestre, Julian | [Serna, Maria] [Shaltiel, Ronen] [Jansen, Klaus] [Rolim, José] | 2010 | 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 | Proceedings Article | ![]() | ||||
![]() | 19:01:47 | Administrators,LocalDomainServers,[AGEditors] | Berberich, Eric Emeliyanenko, Pavel Sagraloff, Michael | [Müller-Hannemann, Matthias] [Werneck, Renato] | 2011 | An Elimination Method for Solving Bivariate Polynomial Systems: Eliminating the Usual Drawbacks In: 2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX), 35-47 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 14:39:38 | Administrators,LocalDomainServers,[AGEditors] | Angelopoulos, Spyros [Borodin, Allan] | ![]() | 2010 | Randomized Priority Algorithms In: Theoretical Computer Science [411], 2542-2558 | Journal Article | ![]() | ||||
![]() | 02:32:12 | Administrators,LocalDomainServers,[AGEditors] | Panagiotou, Konstantinos [Steger, Angelika] | 2010 | Maximal Biconnected Subgraphs of Random Planar Graphs In: ACM Transactions on Algorithms [6], 31,1-31,21 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 02:29:46 | Administrators,LocalDomainServers,[AGEditors] | Panagiotou, Konstantinos | ![]() | 2009 | The Degree Sequence of Random Graphs from Subcritical Classes In: Combinatorics, Probability and Computing [18], 647-681 | Journal Article | ![]() | ||||
![]() | 02:25:43 | Administrators,LocalDomainServers,[AGEditors] | [Kuhn, Fabian] Panagiotou, Konstantinos [Spencer, Joel] [Steger, Angelika] | [Charikar, Moses] | 2010 | Synchrony and Asynchrony in Neural Networks In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 949-964 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 02:18:29 | [Library] | Fountoulakis, Nikolaos Khosla, Megha Panagiotou, Konstantinos | [Randall, Dana] | 2011 | The Multiple-orientability Thresholds for Random Hypergraphs In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), 1222-1236 | Proceedings Article | ![]() | ||||
![]() | 19:21:59 | Administrators,LocalDomainServers,[AGEditors] | Panagiotou, Konstantinos [Steger, Angelika] | [Randall, Dana] | 2011 | 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 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 18:13:31 | Administrators,LocalDomainServers,[AGEditors] | Emeliyanenko, Pavel | ![]() | 2010 | Accelerating Symbolic Computations on NVIDIA Fermi In: Poster presentation at GTC'10 (NVIDIA research summit), - | Poster | ![]() | ||||
![]() | 13:24:17 | Administrators,LocalDomainServers,[AGEditors] | [Christodoulou, Giorgos] [Ligett, Katrina] Pyrga, Evangelia | [Abramsky, Samson] [Gavoille, Cyril] [Kirchner, Claude] [Meyer auf der Heide, Friedhelm] [Spirakis, Paul] | 2010 | Contention Resolution under Selfishness In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010. - Pt. II, 430-441 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 09:53:39 | [Library] | Sagraloff, Michael | ![]() | 2010 | On the Complexity of Real Root Isolation In: CoRR [abs/1011.0344], 1-33 | Electronic Journal Article | ![]() | ||||
![]() | 12:20:42 | Administrators,LocalDomainServers,[AGEditors] | Mehlhorn, Kurt Sagraloff, Michael | 2011 | A deterministic algorithm for isolating real roots of a real polynomial In: Journal of Symbolic Computation [46], 70-90 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 12:15:58 | Administrators,LocalDomainServers,[AGEditors] | Mehlhorn, Kurt Sagraloff, Michael | ![]() | 2009 | Isolating real roots of real polynomials In: Proceedings of the 2009 international symposium on Symbolic and algebraic computation (ISSAC), 247-254 | Proceedings Article | ![]() | ||||
![]() | 13:03:28 | [Library] | [Pountourakis, Emmanouil] Vidali, Angelina | [de Berg, Mark] [Meyer, Ulrich] | 2010 | A complete characterization of group-strategyproof mechanisms of cost-sharing. In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. I, 146-157 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 07:45:49 | Administrators,LocalDomainServers,[AGEditors] | Neumann, Frank [Witt, Carsten] | ![]() | 2010 | Bioinspired Computation in Combinatorial Optimization : Algorithms and Their Computational Complexity | Book | ![]() | ||||
![]() | 17:13:15 | Khaled Elbassioni | [Boros, Endre] Elbassioni, Khaled [Gurvich, Vladimir] [Makino, Kazuhisa] | 2011 | A lower bound for discounting algorithms solving two-person zero-sum limit average payoff stochastic games | Unpublished/Draft | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 17:05:42 | Khaled Elbassioni | [Canzar, Stefan] Elbassioni, Khaled [Klau, Gunnar W.] [Mestre, Julian] | ![]() | 2011 | On Tree-Constrained Matchings and Generalizations | Unpublished/Draft | ![]() | ||||
![]() | 16:45:18 | Administrators,LocalDomainServers,[AGEditors] | Elbassioni, Khaled [Fouz, Mahmoud] [Swamy, Chaitanya] | [Saberi, Amin] | 2010 | Approximation Algorithms for Non-single-minded Profit-Maximization Problems with Limited Supply In: Internet and Network Economics : 6th International Workshop, WINE 2010, 462-472 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 16:42:07 | Administrators,LocalDomainServers,[AGEditors] | [Christodoulou, George] Elbassioni, Khaled [Fouz, Mahmoud] | [Saberi, Amin] | 2010 | Truthful Mechanisms for Exhibitions In: Internet and Network Economics : 6th International Workshop, WINE 2010, 170-181 | Proceedings Article | ![]() | ||||
![]() | 16:23:49 | [Library] | [Canzar, Stefan] Elbassioni, Khaled [Elmasry, Amr] [Raman, Rajiv] | [Cheong, Otfried] [Chwa, Kyung-Yong] [Park, Kunsoo] | 2010 | On the Approximability of the Maximum Interval Constrained Coloring Problem In: Algorithms and Computation : 21st International Symposium, ISAAC 2010. - Pt. II, 168-179 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 16:13:40 | Administrators,LocalDomainServers,[AGEditors] | Elbassioni, Khaled [Tiwary, Hans Raj] | ![]() | 2011 | On a cone covering problem In: Computational Geometry [44], 129-134 | Journal Article | ![]() | ||||
![]() | 19:45:59 | Administrators,LocalDomainServers,[AGEditors] | [Mütze, Torsten] [Rast, Thomas] Spöhel, Reto | [Randall, Dana] | 2011 | 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 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 16:20:56 | Administrators,LocalDomainServers,[AGEditors] | [Butman, Ayelet] Hermelin, Danny [Lewenstein, Moshe] [Rawitz, Dror] | ![]() | 2010 | Optimization problems in multiple-interval graphs In: ACM Transactions on Algorithms [6], 40,1-40,18 | Journal Article | ![]() | ||||
![]() | 16:14:07 | [Library] | Bansal, Nikhil [Gupta, Anupam] [Li, Jian] Mestre, Julián [Nagarajan, Viswanath] [Rudra, Atri] | [de Berg, Mark] [Meyer, Ulrich] | 2010 | 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 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 16:13:41 | [Library] | [Bar-Yehuda, Reuven] Hermelin, Danny [Rawitz, Dror] | [de Berg, Mark] [Meyer, Ulrich] | 2010 | Minimum Vertex Cover in Rectangle Graphs In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. I, 255-266 | Proceedings Article | ![]() | ||||
![]() | 14:44:23 | Administrators,LocalDomainServers,[AGEditors] | Doerr, Benjamin [Gnewuch, Michael] Wahlström, Magnus | [L'Ecuyer, P.] [Owen, A. B.] | 2009 | Implementation of a component-by-component algorithm to generate small low-discrepancy samples In: Monte Carlo and Quasi-Monte Carlo Methods 2008, 323-338 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 14:24:33 | Administrators,LocalDomainServers,[AGEditors] | Doerr, Benjamin [Johannsen, Daniel] | [Pelikan, Martin] [Branke, Jürgen] | 2010 | ![]() | 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 | Proceedings Article | ![]() | |||
![]() | 14:19:30 | Administrators,LocalDomainServers,[AGEditors] | Doerr, Benjamin Fouz, Mahmoud [Witt, Carsten] | [Pelikan, Martin] [Branke, Jürgen] | 2010 | Quasirandom Evolutionary Algorithms In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 1457-1464 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 14:07:28 | [Library] | Doerr, Benjamin [Goldberg, Leslie Ann] | [Schaefer, Robert] [Cotta, Carlos] [Kolodziej, Joanna] [Rudolph, Günter] | 2010 | Drift Analysis with Tail Bounds In: Parallel Problem Solving from Nature – PPSN XI. - Pt. 1, 174-183 | Proceedings Article | ![]() | ||||
![]() | 14:07:22 | Administrators,LocalDomainServers,[AGEditors] | [Böttcher, Süntje] Doerr, Benjamin Neumann, Frank | [Schaefer, Robert] [Cotta, Carlos] [Kolodziej, Joanna] [Rudolph, Günter] | 2010 | Optimal fixed and adaptive mutation rates for the LeadingOnes problem In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 1-10 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 14:00:26 | [Library] | Doerr, Benjamin [Goldberg, Leslie Ann] | [Schaefer, Robert] [Cotta, Carlos] [Kolodziej, Joanna] [Rudolph, Günter] | 2010 | Adaptive Drift Analysis In: Parallel Problem Solving from Nature -- PPSN XI. -- Pt. 1, 32-41 | Proceedings Article | ![]() | ||||
![]() | 13:47:25 | Administrators,LocalDomainServers,[AGEditors] | Doerr, Benjamin [Goldberg, Leslie Ann] [Minder, Lorenz] [Sauerwald, Thomas] [Scheideler, Christian] | [Lynch, Nancy A.] [Shvartsman, Alexander A.] | 2010 | Brief Announcement: Stabilizing Consensus with the Power of Two Choices In: Distributed Computing : 24th International Symposium, DISC 2010, 528-530 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 12:50:16 | [Library] | Doerr, Benjamin [Künnemann, Marvin] Wahlström, Magnus | [Müller-Hannemann, Matthias] [Werneck, Renato] | 2011 | Dependent Randomized Rounding: The Bipartite Case In: 2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX), 96-106 | Proceedings Article | ![]() | ||||
![]() | 11:29:49 | [Library] | Doerr, Benjamin [Fouz, Mahmoud] | 2011 | Quasi-random rumor spreading: Reducing randomness can be costly In: Information Processing Letters [111], 227-230 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 11:29:44 | [Library] | Wahlström, Magnus | ![]() | 2011 | New Plain-Exponential Time Classes for Graph Homomorphism In: Theory of Computing Systems [49], 273-282 | Journal Article | ![]() | ||||
![]() | 11:24:33 | Administrators,LocalDomainServers,[AGEditors] | Kratsch, Stefan [Marx, Dániel] Wahlström, Magnus | [Hlinený, Petr] [Kucera, Antonín] | 2010 | 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 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 11:16:00 | Administrators,LocalDomainServers,[AGEditors] | Kratsch, Stefan Wahlström, Magnus | [Abramsky, Samson] [Gavoille, Cyril] [Kirchner, Claude] [Meyer auf der Heide, Friedhelm] [Spirakis, Paul G.] | 2010 | Preprocessing of Min Ones Problems: A Dichotomy In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010, 653-665 | Proceedings Article | ![]() | ||||
![]() | 11:15:12 | [Library] | Mehlhorn, Kurt Ray, Saurabh | 2010 | Faster algorithms for computing Hong's bound on absolute positiveness In: Journal of Symbolic Computation [45], 677-683 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 11:04:20 | Administrators,LocalDomainServers,[AGEditors] | Mehlhorn, Kurt Schweitzer, Pascal | [Lee, Der-Tsai] [Chen, Danny Z.] [Ying, Shi] | 2010 | Progress on Certifying Algorithms In: Frontiers in Algorithmics : 4th International Workshop, FAW 2010, 1-5 | Proceedings Article | ![]() | ||||
![]() | 10:16:18 | Administrators,LocalDomainServers,[AGEditors] | Elbassioni, Khaled [Rauf, Imran] | 2010 | Polynomial-time dualization of r-exact hypergraphs with applications in geometry In: Discrete Mathematics [310], 2356-2363 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 10:06:11 | Administrators,LocalDomainServers,[AGEditors] | Doerr, Benjamin Neumann, Frank [Wegener, Ingo] | ![]() | 2010 | Editorial In: Algorithmica [57], 119-120 | Journal Article | ![]() | ||||
![]() | 09:59:25 | [Library] | Doerr, Benjamin [Künnemann, Marvin] Wahlström, Magnus | [Festa, Paola] | 2010 | Randomized Rounding for Routing and Covering Problems: Experiments and Improvements In: Experimental Algorithms : 9th International Symposium, SEA 2010, 190-201 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 09:41:44 | [Library] | Doerr, Benjamin Neumann, Frank | ![]() | 2010 | In Memoriam: Ingo Wegener In: Algorithmica [58], 541-542 | Journal Article | ![]() | ||||
![]() | 09:31:05 | [Library] | Doerr, Benjamin [Fouz, Mahmoud] | 2010 | Hereditary Discrepancies in Different Numbers of Colors II In: SIAM Journal on Discrete Mathematics [24], 1205-1213 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 09:14:03 | [Library] | Christodoulou, George [Kovács, Annamária] | [Charikar, Moses] | 2010 | A deterministic truthful PTAS for scheduling related machines In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1005-1016 | Proceedings Article | ![]() | ||||
![]() | 08:57:10 | Administrators,LocalDomainServers,[AGEditors] | [Berenbrink, Petra] [Cooper, Colin] [Friedetzky, Tom] Friedrich, Tobias Sauerwald, Thomas | [Randall, Dana] | 2011 | Randomized Diffusion for Indivisible Loads In: 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA-11), 429-439 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 08:49:29 | Administrators,LocalDomainServers,[AGEditors] | Sauerwald, Thomas [Stauffer, Alexandre] | [Randall, Dana] | 2011 | Rumor Spreading and Vertex Expansion on Regular Graphs In: 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA-11), 462-475 | Proceedings Article | ![]() | ||||
![]() | 08:46:23 | [Library] | [Berenbrink, Petra] [Hoefer, Martin] Sauerwald, Thomas | [Randall, Dana] | 2011 | Distributed Selfish Load Balancing on Networks In: 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA-11), 1487-1497 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 16:59:29 | [Library] | [Boros, Endre] Elbassioni, Khaled [Gurvich, Vladimir] [Makino, Kazuhisa] | ![]() | 2010 | On effectivity functions of game forms In: Games and Economic Behavior [68], 512-531 | Journal Article | ![]() | ||||
![]() | 16:53:52 | [Library] | [Boros, Endre] Elbassioni, Khaled [Makino, Kazuhisa] | 2010 | Left-to-right multiplication for monotone Boolean dualization In: SIAM Journal on Computing [39], 3424-3439 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 13:26:02 | [Library] | Mehlhorn, Kurt | [Fukuda, Komei] [Van der Hoeven, Joris] [Joswig, Michael] [Takayama, Nobuki] | 2010 | Reliable and Efficient Geometric Computing In: Mathematical Software, ICMS 2010 : Third International Congress on Mathematical Software, 10-11 | Proceedings Article | ![]() | ||||
![]() | 01:17:27 | [Library] | [Blelloch, Guy E.] Farzan, Arash | [Amir, Amihood] [Parida, Laxmi] | 2010 | Succinct Representations of Separable Graphs In: Combinatorial Pattern Matching : 21st Annual Symposium, CPM 2010, 138-150 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 01:12:13 | Administrators,LocalDomainServers,[AGEditors] | Farzan, Arash [Gagie, Travis] [Navarro, Gonzalo] | [Cheong, Otfried] [Chwa, Kyung-Yong] [Park, Kunsoo] | 2010 | Entropy-Bounded Representation of Point Grids In: Algorithms and Computation : 21st International Symposium, ISAAC 2010. - Pt. II, 327-338 | Proceedings Article | ![]() | ||||
![]() | 15:45:36 | Administrators,LocalDomainServers,[AGEditors] | Doerr, Benjamin [Gnewuch, Michael] Wahlström, Magnus | 2010 | Algorithmic construction of low-discrepancy point sets via dependent randomized rounding In: Journal of Complexity [26], 490-507 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 14:00:46 | Administrators,LocalDomainServers,[AGEditors] | [Althaus, Ernst] [Altmeyer, Sebastian] Naujoks, Rouven | [Becker, Bernd] [Damm, Werner] [Fränzle, Martin] [Olderog, Ernst-Rüdiger] [Podelski, Andreas] [Wilhelm, Reinhard] | 2010 | A New Combinatorial Approach to Parametric Path Analysis | Report | ![]() | ||||
111 |
| ![]() | |||||||||||||
33 |
|
| ![]() | ||||||||||||
![]() | 19:41:25 | [Library] | Fountoulakis, Nikolaos [Kang, Ross] [McDiarmid, Colin] | 2010 | The t-stability number of a random graph In: The Electronic Journal of Combinatorics [17], R59,1-R59,29 | Electronic Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 19:35:31 | Administrators,LocalDomainServers,[AGEditors] | Fountoulakis, Nikolaos Panagiotou, Konstantinos | [Serna, Maria] [Shaltiel, Ronen] [Jansen, Klaus] [Rolim, José] | 2010 | Rumor spreading on random regular graphs and expanders In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 13th Internationa lWorkshop, APPROX 2010 and 14th International Workshop, RANDOM 2010, 560-573 | Proceedings Article | ![]() | ||||
![]() | 19:33:29 | Administrators,LocalDomainServers,[AGEditors] | Fountoulakis, Nikolaos Panagiotou, Konstantinos | [Abramsky, Samson] [Gavoille, Cyril] [Kirchner, Claude] [Meyer auf der Heide, Friedhelm] [Spirakis, Paul G.] | 2010 | Orientability of random hypergraphs and the power of multiple choices In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010. - Pt. 1, 348-359 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 19:29:10 | Administrators,LocalDomainServers,[AGEditors] | Fountoulakis, Nikolaos Huber, Anna Panagiotou, Konstantinos | ![]() | 2010 | Reliable broadcasting in random networks and the effect of density In: 2010 Proceedings IEEE INFOCOM, 2552-2560 | Proceedings Article | ![]() | ||||
![]() | 15:11:46 | [Library] | Bonifaci, Vincenzo [Marchetti-Spaccamela, Alberto] | [de Berg, Mark] [Meyer, Ulrich] | 2010 | ![]() | Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. II, 230-241 | Proceedings Article | ![]() | ||||||
![]() | ![]() | ![]() | ![]() | 18:32:16 | Administrators,LocalDomainServers,[AGEditors] | Bonifaci, Vincenzo [Harks, Tobias] [Schäfer, Guido] | ![]() | 2010 | ![]() | Stackelberg Routing in Arbitrary Networks In: Mathematics of Operations Research [35], 330 - 346 | Journal Article | ![]() | |||
![]() | 18:15:09 | Administrators,LocalDomainServers,[AGEditors] | [Baruah, Sanjoy] Bonifaci, Vincenzo [Marchetti-Spaccamela, Alberto] [Stiller, Sebastian] | 2010 | ![]() | Improved Multiprocessor Global Schedulability Analysis In: Real-Time Systems [46], 3-24 | Journal Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 17:20:45 | [Library] | [Baruah, Sanjoy] Bonifaci, Vincenzo [D'Angelo, Gianlorenzo] [Li, Haohan] [Marchetti-Spaccamela, Alberto] Megow, Nicole [Stougie, Leen] | [Hlinen{\'y}, Petr] [Kucera, Anton\'{\i}n] | 2010 | ![]() | Scheduling Real-Time Mixed-Criticality Jobs In: Mathematical Foundations of Computer Science 2010 : 35th International Symposium, MFCS 2010, 90-101 | Proceedings Article | ![]() | |||
![]() | 10:34:00 | [Library] | Berberich, Eric [Hemmer, Michael] [Kerber, Michael] | 2010 | A Generic Algebraic Kernel for Non-linear Geometric Applications | Report | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 10:25:44 | Administrators,LocalDomainServers,[AGEditors] | Berberich, Eric Emeliyanenko, Pavel Sagraloff, Michael | ![]() | 2010 | An Elimination Method for Solving Bivariate Polynomial Systems: Eliminating the Usual Drawbacks In: CoRR [abs/1010.1386], 1-16 | Electronic Journal Article | ![]() | ||||
![]() | 09:25:11 | [Library] | Berberich, Eric [Fogel, Efi] [Halperin, Dan] [Kerber, Michael] [Setter, Ophir] | 2010 | Arrangements on Parametric Surfaces II: Concretizations and Applications In: Mathematics in Computer Science [4], 67-91 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 09:21:18 | Administrators,LocalDomainServers,[AGEditors] | Berberich, Eric [Fogel, Efi] [Halperin, Dan] Mehlhorn, Kurt [Wein, Ron] | ![]() | 2010 | Arrangements on Parametric Surfaces I: General Framework and Infrastructure In: Mathematics in Computer Science [4], 45-66 | Journal Article | ![]() | ||||
![]() | 09:00:22 | [Library] | Berberich, Eric [Hagen, Matthias] [Hiller, Benjamin] [Moser, Hannes] | [Müller-Hannemann, Matthias] [Schirra, Stefan] | 2010 | Experiments In: Algorithm Engineering : Bridging the Gap between Algorithm Theory and Practice, 325-388 | Part of a Book | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 08:56:49 | Administrators,LocalDomainServers,[AGEditors] | [Mörig, Marc] [Scholz, Sven] [Tscheuschner, Tobias] Berberich, Eric | [Müller-Hannemann, Matthias] [Schirra, Stefan] | 2010 | Implementation aspects In: Algorithm Engineering : Bridging the Gap between Algorithm Theory and Practice, 237-289 | Part of a Book | ![]() | ||||
![]() | 16:14:49 | [Library] | [Guibas, Leonidas] Milosavljevic, Nikola [Motskin, Arik] | 2010 | ![]() | Connected Dominating Sets on Dynamic Geometric Graphs In: Proceedings of the 22nd Canadian Conference on Computational Geometry (CCCG2010), 27-30 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 12:05:31 | [Library] | Doerr, Benjamin Johannsen, Daniel Kötzing, Timo Neumann, Frank [Theile, Madeleine] | [Schaefer, Robert] [Cotta, Carlos] [Kolodziej, Joanna] [Rudolph, Günter] | 2010 | More Effective Crossover Operators for the All-Pairs Shortest Path Problem In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 184-193 | Proceedings Article | ![]() | ||||
![]() | 11:54:47 | Administrators,LocalDomainServers,[AGEditors] | Kötzing, Timo Neumann, Frank [Röglin, Heiko] [Witt, Carsten] | [Dorigo, Marco] [Birattari, Mauro] [Di Caro, Gianni A.] [Doursat, René] [Engelbrecht, Andries P.] [Floreano, Dario] [Gambardella, Luca Maria] [Groß, Roderich] [Sahin, Erol] [Sayama, Hiroki] [Stützle, Thomas] | 2010 | Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem In: Swarm Intelligence : 7th International Conference, ANTS 2010, 324-335 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 11:45:23 | [Library] | Kötzing, Timo [Lehre, Per Kristian] Neumann, Frank [Oliveto, Pietro S.] | [Pelikan, Martin] [Branke, Jürgen] | 2010 | Ant Colony Optimization and the Minimum Cut Problem In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 1393-1400 | Proceedings Article | ![]() | ||||
![]() | 16:10:08 | [Library] | [Case, John] Kötzing, Timo | [Hutter, Marcus] [Stephan, Frank] [Vovk, Vladimir] [Zeugmann, Thomas] | 2010 | Solutions to Open Questions for Non-U-Shaped Learning with Memory Limitations In: Algorithmic Learning Theory : 21st International Conference, ALT 2010, 285-299 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 15:55:00 | [Library] | [Case, John] Kötzing, Timo | [Kalai, Adam Tauman] [Mohri, Mehryar] | 2010 | Strongly Non-U-Shaped Learning Results by General Techniques In: COLT 2010 : The 23rd Conference on Learning Theory, 181-193 | Proceedings Article | ![]() | ||||
![]() | 15:46:23 | Administrators,LocalDomainServers,[AGEditors] | [Kasprzik, Anna] Kötzing, Timo | [Martin-Vide, Carlos] [Fernau, Henning] [Dediu, Adrian Horia] | 2010 | String Extension Learning Using Lattices In: Language and Automata Theory and Applications : 4th International Conference, LATA 2010, 380-391 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 15:55:47 | Administrators,LocalDomainServers,[AGEditors] | [Christodoulou, George] [Kovacs, Annamaria] van Stee, Rob | [Saberi, Amin] | 2010 | A truthful constant approximation for maximizing the minimum load on related machines In: Internet and Network Economics : 6th International Workshop, WINE 2010, 182-193 | Proceedings Article | ![]() | ||||
![]() | 15:52:59 | Administrators,LocalDomainServers,[AGEditors] | van Stee, Rob | [Jansen, Klaus] [Solis-Oba, Roberto] | 2011 | ![]() | An improved algorithm for online rectangle filling In: Approximation and Online Algorithms : 8th International Workshop, WAOA 2010, 249-260 | Proceedings Article | ![]() | ||||||
![]() | ![]() | ![]() | ![]() | 15:48:54 | [Library] | [Epstein, Leah] [Levin, Asaf] van Stee, Rob | [Abramsky, Samson] [Gavoille, Cyril] [Kirchner, Claude] [Meyer auf der Heide, Friedhelm] [Spirakis, Paul G.] | 2010 | ![]() | Max-min online allocations with a reordering buffer In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010, 336-347 | Proceedings Article | ![]() | |||
![]() | 15:41:48 | Administrators,LocalDomainServers,[AGEditors] | Christodoulou, George [Chung, Christine] [Ligett, Katrina] Pyrga, Evangelia van Stee, Rob | [Bampis, Evripidis] [Jansen, Klaus] | 2010 | ![]() | On the price of stability for undirected network design In: Approximation and Online Algorithms : 7th International Workshop, WAOA 2009, 86-97 | Proceedings Article | ![]() | ||||||
![]() | ![]() | ![]() | ![]() | 15:26:04 | Administrators,LocalDomainServers,[AGEditors] | [Epstein, Leah] [Levin, Asaf] van Stee, Rob | ![]() | 2011 | ![]() | Max-min online allocations with a reordering buffer In: SIAM Journal on Discrete Mathematics [25], 1230-1250 | Journal Article | ![]() | |||
![]() | 15:20:53 | [Library] | [Epstein, Leah] [Levin, Asaf] van Stee, Rob | 2012 | ![]() | Approximation Schemes for Packing Splittable Items with Cardinality Constraints In: Algorithmica [62], 102-129 | Journal Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 15:15:46 | Administrators,LocalDomainServers,[AGEditors] | [Epstein, Leah] van Stee, Rob | ![]() | 2011 | ![]() | Improved results for a memory allocation problem In: Theory of Computing Systems [48], 79-92 | Journal Article | ![]() | |||
![]() | 15:04:39 | Tomasz Jurkiewicz | Jurkiewicz, Tomasz Danilewski, Piotr | 2011 | Efficient Quicksort and 2D Convex Hull for CUDA, and MSIMD as a Realistic Model of Massively Parallel Computations. | Unpublished/Draft | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 14:16:28 | Administrators,LocalDomainServers,[AGEditors] | [Han, Xin] [Lam, Tak-Wah] Lee, Lap-Kei [To, Isaac K. K.] [Wong, Prudence W. H.] | ![]() | 2010 | Deadline scheduling and power management for speed bounded processors In: Theoretical Computer Science [411], 3587-3600 | Journal Article | ![]() | ||||
![]() | 14:06:16 | [Library] | [Chan, Sze-Hang] [Lam, Tak-Wah] Lee, Lap-Kei | [de Berg, Mark] [Meyer, Ulrich] | 2010 | Non-clairvoyant speed scaling for weighted flow time In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. I, 23-35 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 13:42:52 | Ho-Leung Chan,Tak-Wah Lam,Lap-Kei Lee,Hing-Fung Ting,Jean-Yves Marion,Thomas Schwentick,[Library],[Department] | [Chan, Ho-Leung] [Lam, Tak-Wah] Lee, Lap-Kei [Ting, Hing-Fung] | [Marion, Jean-Yves] [Schwentick, Thomas] | 2010 | 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 | Electronic Proceedings Article | ![]() | ||||
![]() | 15:00:55 | [Library] | Doerr, Benjamin Johannsen, Daniel Winzen, Carola | 2010 | Drift Analysis and Linear Functions Revisited In: Proceedings of the IEEE Congress on Evolutionary Computation (CEC 2010). - Pt. 3, 1967-1974 | Proceedings Article | ![]() | ||||||||
2 |
|
| ![]() | ||||||||||||
![]() | 14:48:47 | [Library] | Doerr, Benjamin [Jansen, Thomas] [Sudholt, Dirk] Winzen, Carola [Zarges, Christine] | [Schaefer, Robert] [Cotta, Carlos] [Kolodziej, Joanna] [Rudolph, Günter] | 2010 | Optimizing Monotone Functions Can Be Difficult In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 42-51 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 14:00:12 | [Library] | [Amini, Omid] Manjunath, Madhusudan | ![]() | 2010 | Riemann-Roch for sublattices of the root lattice $A\_n$ In: Electronic Journal of Combinatorics [17], R124,1-R124,50 | Electronic Journal Article | ![]() | ||||
1 |
|
| ![]() | ||||||||||||
![]() | ![]() | ![]() | ![]() | 18:16:21 | Administrators,LocalDomainServers,[AGEditors] | Doerr, Benjamin Johannsen, Daniel Winzen, Carola | [Pelikan, Martin] [Branke, Jürgen] | 2010 | Multiplicative Drift Analysis In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 1449-1456 | Proceedings Article | ![]() | ||||
1 |
|
| ![]() | ||||||||||||
![]() | ![]() | ![]() | ![]() | 15:41:53 | Administrators,LocalDomainServers,[AGEditors] | Emeliyanenko, Pavel | [Moreno Maza, Marc] [Roch, Jean-Louis] | 2010 | ![]() | A complete modular resultant algorithm targeted for realization on graphics hardware In: PASCO '10 : Proceedings of the 4th International Workshop on Parallel and Symbolic Computation, 35-43 | Proceedings Article | ![]() | |||
22 |
|
| ![]() | ||||||||||||
![]() | ![]() | ![]() | ![]() | 11:08:28 | Anja Becker | Happ, Edda | ![]() | 2009 | Analyses of Evolutionary Algorithms Universität des Saarlandes | Thesis - PhD thesis | ![]() | ||||
![]() | 10:58:47 | Anja Becker | Kerber, Michael | 2009 | Geometric Algorithms for Algebraic Curves and Surfaces Universität des Saarlandes | Thesis - PhD thesis | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 11:46:16 | Eric Berberich,Dan Halperin,Michael Kerber,Roza Pogalnikova,Jan Vahrenhold,[Library],[Department] | Berberich, Eric [Halperin, Dan] [Kerber, Michael] [Pogalnikova, Roza] | [Vahrenhold, Jan] | 2010 | Polygonal Reconstruction from Approximate Offsets In: 26th European Workshop on Computational Geometry : Workshop Proceedings, 65-68 | Electronic Proceedings Article | ![]() | ||||
![]() | 10:37:11 | Anja Becker | [Schwarz, Karsten] Karrenbauer, Andreas [Schehr, Gregory] [Rieger, H.] | 2009 | Domain walls and chaos in the disordered SOS model In: Journal of statistical mechanics : theory and experiment [P08022], 1-23 | Electronic Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 10:04:15 | Anja Becker | [Sanders, Peter] Sivadasan, Naveen [Skutella, Martin] | ![]() | 2009 | Online scheduling with bounded migration In: Mathematics of Operations Research [34], 481-498 | Journal Article | ![]() | ||||
![]() | 16:52:46 | Anja Becker | Kowalik, Lukasz | 2009 | Improved edge-coloring with three colors In: Theoretical Computer Science [410], 3733-3742 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 16:39:27 | Anja Becker | Gärtner, Tobias [Hotz, Günter] | [Ambos-Spies, Klaus] [Löwe, Benedikt] [Merkle, Wolfgang] | 2009 | Computability of Analytic Functions with Analytic Machines In: Mathematical Theory and Computational Practice : 5th Conference on Computability in Europe, CiE 2009, 250-259 | Proceedings Article | ![]() | ||||
![]() | 16:33:29 | Anja Becker | Elmasry, Amr | 2009 | Computing the subset partial order for dense families of sets In: Information Processing Letters [109], 1082-1086 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 16:25:40 | Anja Becker | Elbassioni, Khaled [Fishkin, Aleksei V.] [Sitters, René] | ![]() | 2009 | Approximation algorithms for the Euclidean traveling salesman problem with discrete and continuous neighborhoods In: International Journal of Computational Geometry & Applications [19], 173-193 | Journal Article | ![]() | ||||
![]() | 16:20:33 | Anja Becker | Cilleruelo, Javier Hebbinghaus, Nils | 2009 | Discrepancy in generalized arithmetic progressions In: European Journal of Combinatorics [30], 1607-1611 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 16:12:28 | Anja Becker | Chan, Ho-Leung [Edmonds, Jeff] [Pruhs, Kirk] | ![]() | 2009 | 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 | Proceedings Article | ![]() | ||||
![]() | 16:05:13 | Anja Becker | [Burnikel, Christoph] [Funke, Stefan] Mehlhorn, Kurt [Schirra, Stefan] Schmitt, Susanne | 2009 | A Separation Bound for Real Algebraic Expressions In: Algorithmica [55], 14-28 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 15:49:49 | Anja Becker | Bast, Holger Funke, Stefan Matijevic, Domagoj | [Demetrescu, Camil] [Goldberg, Andrew V.] [Johnson, David S.] | 2009 | Ultrafast shortest-path queries via transit nodes In: The shortest path problem : ninth DIMACS implemenation challenge, 175-192 | Part of a Book | ![]() | ||||
![]() | 15:41:43 | Anja Becker | Amini, Omid [Peleg, David] [Pérennes, Stéphane] [Sau, Ignasi] [Saurabh, Saket] | [Bampis, Evripidis] [Skutella, Martin] | 2009 | Degree-Constrained Subgraph Problems: Hardness and Approximation Results In: Approximation and Online Algorithms : 6th International Workshop, WAOA 2008, 29-42 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 15:37:23 | Anja Becker | Amini, Omid [Pérennes, Stéphane] [Sau, Ignasi] | ![]() | 2009 | Hardness and approximation of traffic grooming In: Theoretical Computer Science [410], 3751-3760 | Journal Article | ![]() | ||||
![]() | 15:20:07 | Anja Becker | Ajwani, Deepak [Meyer, Ulrich] [Osipov, Vitaly] | [Demetrescu, Camil] [Goldberg, Andrew V.] [Johnson, David S.] | 2009 | Breadth first search on massive graphs In: The shortest path problem : ninth DIMACS implemenation challenge, 291-307 | Part of a Book | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 11:25:39 | [Library] | Megow, Nicole [Möhring, Rolf H.] [Schulz, Jens] | ![]() | 2011 | Decision Support and Optimization in Shutdown and Turnaround Scheduling In: INFORMS Journal on Computing [23], 189 - 204 | Journal Article | ![]() | ||||
![]() | 20:54:03 | Tomasz Jurkiewicz | [Amaldi, Edoardo] [Iuliano, Claudio] Jurkiewicz, Tomasz Mehlhorn, Kurt [Rizzi, Romeo] | [Fiat, Amos] [Sanders, Peter] | 2009 | 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 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 15:38:05 | [Library] | Jurkiewicz, Tomasz | ![]() | 2009 | Cycle Bases in Graphs Universität des Saarlandes | Thesis - Masters thesis | ![]() | ||||
![]() | 12:47:37 | [Library] | [Amaldi, Edoardo] [Iuliano, Claudio] Jurkiewicz, Tomasz Mehlhorn, Kurt [Rizzi, Romeo] | [Fiat, Amos] [Sanders, Peter] | 2009 | Breaking the $O(m^2n)$ Barrier for Minimum Cycle Bases In: Algorithms - ESA 2009 : 17th Annual European Symposium, 301-312 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 13:59:39 | [Library] | Bast, Hannah | Albers, Susanne Alt, Helmut Näher, Stefan | 2009 | Car or Public Transport -- Two Worlds In: Efficient Algorithms : Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday, 355-367 | Part of a Book | ![]() | ||||
![]() | 17:13:15 | Administrators,LocalDomainServers,[AGEditors] | Emeliyanenko, Pavel | [Hsu, Ching-Hsien] [Yang, Laurence T.] [Park, Jong Hyuk] [Yeo, Sang-Soo] | 2010 | ![]() | Modular Resultant Algorithm for Graphics Processors In: Algorithms and Architectures for Parallel Processing : 10th International Conference, ICA3PP 2010. - Pt. 1, 427-440 | Proceedings Article | ![]() | ||||||
24 |
|
| ![]() | ||||||||||||
![]() | 02:25:09 | [Library] | Elbassioni, Khaled [Makino, Kazuhisa] Rauf, Imran | 2011 | On the readability of monotone Boolean formulae In: Journal of Combinatorial Optimization [22], 293-304 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 02:16:06 | Administrators,LocalDomainServers,[AGEditors] | Elbassioni, Khaled [Makino, Kazuhisa] Rauf, Imran | [Fiat, Amos] [Sanders, Peter] | 2009 | ![]() | Output-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs In: Algorithms - ESA 2009 : 17th Annual European Symposium, 143-154 | Proceedings Article | ![]() | |||
![]() | 02:05:57 | Administrators,LocalDomainServers,[AGEditors] | Elbassioni, Khaled [Makino, Kazuhisa] Rauf, Imran | [Ngo, Hung Q.] | 2009 | ![]() | On the Readability of Monotone Boolean Formulae In: Computing and Combinatorics :15th Annual International Conference, COCOON 2009, 496-505 | Proceedings Article | ![]() | ||||||
![]() | ![]() | ![]() | ![]() | 15:43:05 | Administrators,LocalDomainServers,[AGEditors] | [Boros, Endre] Elbassioni, Khaled [Gurvich, Vladimir] [Makino, Kazuhisa] | [Eisenbrand, Friedrich] [Shepherd, F. Bruce] | 2010 | 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 | Proceedings Article | ![]() | ||||
![]() | 11:00:50 | Administrators,LocalDomainServers,[AGEditors] | Elbassioni, Khaled [Matijevic, Domagoj] [Severdija, Domagoj] | [Vahrenhold, Jan] | 2010 | Guarding 1.5-Dimensional with Demands In: 26th European Workshop on Computational Geometry (EuroCG 2010), 133-136 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 10:57:00 | [Library] | Elbassioni, Khaled [Chan, Hubert] | [Charikar, Moses] | 2010 | 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 | Proceedings Article | ![]() | ||||
![]() | 17:36:34 | Administrators,LocalDomainServers,[AGEditors] | Doerr, Benjamin Huber, Anna Levavi, Ariel | [Dong, Yingfei] [Du, Ding-Zhu] [Ibarra, Oscar] | 2009 | Strong robustness of randomized rumor spreading protocols In: Algorithms and Computation : 20th International Symposium, ISAAC 2009, 812-821 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 17:25:54 | Administrators,LocalDomainServers,[AGEditors] | Fountoulakis, Nikolaos Huber, Anna Panagiotou, Konstantinos | [Keidar, Idit] | 2009 | Brief Announcement: The Speed of Broadcasting in Random Networks - Density Does Not Matter In: Distributed Computing : 23rd International Symposium, DISC 2009, 529-530 | Proceedings Article | ![]() | ||||
![]() | 17:02:47 | [Library] | Fountoulakis, Nikolaos Huber, Anna | 2009 | Quasirandom rumor spreading on the complete graph is as fast as randomized rumor spreading In: SIAM Journal on Discrete Mathematics [23], 1964-1991 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 16:52:47 | Administrators,LocalDomainServers,[AGEditors] | Angelopoulos, Spyros Doerr, Benjamin Huber, Anna Panagiotou, Konstantinos | ![]() | 2009 | Tight bounds for quasirandom rumor spreading In: The Electronic Journal of Combinatorics [16], R102,1-R102,19 | Electronic Journal Article | ![]() | ||||
![]() | 00:24:20 | Administrators,LocalDomainServers,[AGEditors] | [Böcker, Sebastian] [Hüffner, Falk] [Truss, Anke] Wahlström, Magnus | [Chen, Jianer] [Fomin, Fedor V.] | 2009 | A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams In: Parameterized and Exact Computation : 4th International Workshop, IWPEC 2009, 38-49 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 16:00:25 | Administrators,LocalDomainServers,[AGEditors] | [Epstein, Leah] [Kleiman, Elena] van Stee, Rob | [Leonardi, Stefano] | 2009 | Maximizing the Minimum Load: The Cost of Selfishness In: Internet and Network Economics : 5th International Workshop, WINE 2009, 232-243 | Proceedings Article | ![]() | ||||
![]() | 15:49:00 | Administrators,LocalDomainServers,[AGEditors] | [Epstein, Leah] van Stee, Rob | 2010 | Maximizing the minimum load for selfish agents In: Theoretical Computer Science [411], 44-57 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 15:46:38 | [Library] | [Epstein, Leah] van Stee, Rob [Tamir, Tami] | ![]() | 2009 | ![]() | Paging with request sets In: Theory of Computing Systems [44], 67-81 | Journal Article | ![]() | |||
![]() | 15:38:06 | Administrators,LocalDomainServers,[AGEditors] | [Krumke, Sven] van Stee, Rob [Westphal, Stefan] | [Ravi, S.S.] [Shukla, Sandeep K.] | 2009 | ![]() | Online job admissions In: Fundamental Problems in Computing : Essays in Honor of Professor Daniel J. Rosenkrantz, 435-454 | Part of a Book | ![]() | ||||||
![]() | ![]() | ![]() | ![]() | 09:07:36 | Administrators,LocalDomainServers,[AGEditors] | Neumann, Frank [Sudholt, Dirk] [Witt, Carsten] | [Lim, Chee Peng] [Jain, Lakhmi C.] [Dehuri, Satchidananda] | 2009 | Computational Complexity of Ant Colony Optimization and Its Hybridization with Local Search In: Innovations in Swarm Intelligence, 91-120 | Part of a Book | ![]() | ||||
![]() | 15:01:46 | [Library] | Pyrga, Evangelia [Chung, Christine] | [Mavronicolas, Marios] [Papadopoulou, Vicky G.] | 2009 | Stochastic Stability in Internet Router Congestion Games In: Algorithmic Game Theory : Second International Symposium, SAGT 2009, 183-195 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 13:28:25 | [Library] | Angelopoulos, Spyros | [Bampis, Evripidis] [Jansen, Klaus] | 2010 | On the Competitiveness of the Online Asymmetric and Euclidean Steiner Tree Problems In: Approximation and Online Algorithms : 7th International Workshop, WAOA 2009, 1-12 | Proceedings Article | ![]() | ||||
![]() | 13:23:47 | Administrators,LocalDomainServers,[AGEditors] | Angelopoulos, Spyros | [Dehne, Frank] [Gavrilova, Marina] [Sack, Jörg-Rüdiger] [Tóth, Csaba D.] | 2009 | Online Priority Steiner Tree Problems In: Algorithms and Data Structures : 11th International Symposium, WADS 2009, 37-48 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 13:18:05 | Administrators,LocalDomainServers,[AGEditors] | Angelopoulos, Spyros [Lopez-Ortiz, Alejandro] | ![]() | 2009 | Intertruptible Algorithms for Multi Problem Solving In: Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI 09), 380-386 | Proceedings Article | ![]() | ||||
![]() | 17:03:52 | [Library] | [Garg, Naveen] [Kavitha, T.] [Kumar, Amit] Mehlhorn, Kurt Mestre, Julián | 2010 | Assigning Papers to Referees In: Algorithmica [58], 119-136 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 17:01:26 | Administrators,LocalDomainServers,[AGEditors] | [Kavitha, Telikepalli] Mestre, Julian | ![]() | 2010 | Max-coloring paths: Tight bounds and extensions In: Journal of Combinatorial Optimization [Online First], 1 - 14 | Electronic Journal Article | ![]() | ||||
![]() | 22:11:30 | Administrators,LocalDomainServers,[AGEditors] | [Epstein, Leah] [Levin, Asaf] [Marchetti-Spaccamela, Alberto] Megow, Nicole Mestre, Julian Skutella, Martin [Stougie, Leen] | [Eisenbrand, Friedrich] [Shepherd, F. Bruce] | 2010 | Universal sequencing on a single machine In: Integer Programming and Combinatorial Optimization : 14th International Conference, IPCO 2010, 230-243 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 12:35:13 | Administrators,LocalDomainServers,[AGEditors] | Kratsch, Stefan Wahlström, Magnus | [Chen, Jianer] [Fomin, Fedor V.] | 2009 | Two Edge Modification Problems without Polynomial Kernels In: Parameterized and Exact Computation : 4th International Workshop, IWPEC 2009, 264-275 | Proceedings Article | ![]() | ||||
28 |
|
| ![]() | ||||||||||||
![]() | ![]() | ![]() | ![]() | 18:18:25 | Administrators,LocalDomainServers,[AGEditors] | Vidali, Angelina | [Leonardi, Stefano] | 2009 | The Geometry of Truthfulness In: Internet and Network Economics : 5th International Workshop, WINE 2009, 340-350 | Proceedings Article | ![]() | ||||
![]() | 15:54:26 | Administrators,LocalDomainServers,[AGEditors] | Doerr, Benjamin Friedrich, Tobias [Sauerwald, Thomas] | 2009 | Quasirandom Rumor Spreading on Expanders In: Electronic Notes in Discrete Mathematics [34], 243 - 247 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 15:51:03 | Administrators,LocalDomainServers,[AGEditors] | Doerr, Benjamin [Fouz, Mahmoud] | ![]() | 2009 | A Time-Randomness Tradeoff for Quasi-Random Rumour Spreading In: Electronic Notes in Discrete Mathematics [34], 335 - 339 | Journal Article | ![]() | ||||
![]() | 15:46:42 | Administrators,LocalDomainServers,[AGEditors] | [Raidl, Günther R.] [Alba, Enrique] [Bacardit, Jaume] [Beyer, Hans-Georg] [Birattari, Mauro] [Blum, Christian] [Bosman, Peter A.N.] [Congdon, Clare B.] [Corne, David W.] [Cotta, Carlos] [Di Penta, Massimiliano] Doerr, Benjamin [Drechsle, Rolf] [Ebner, Marc] [Grahl, Jörn] [Jansen, Thomas] [Knowles, Joshua D.] [Lenaerts, Tom] [Middendorf, Martin] [Miller, Julian F.] [O'Neill, Michael] [Poli, Riccardo] [Squillero, Giovanni] [Stanley, Kenneth O.] [Stützle, Thomas] [van Hemert, Jano] | 2009 | GECCO 2009: Proceedings of the 11th Annual conference on Genetic and evolutionary computation. | Proceedings | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 15:20:14 | Administrators,LocalDomainServers,[AGEditors] | Hemmer, Michael [Tsigaridas, Elias P.] [Zafeirakopoulos, Zafeirakis] [Emiris, Ioannis Z.] [Karavelas, Menelaos I.] [Mourrain, Bernard] | ![]() | 2009 | Experimental evaluation and cross-benchmarking of univariate real solvers In: Symbolic Numeric Computation 2009 (SNC 2009), 45-54 | Proceedings Article | ![]() | ||||
![]() | 15:02:07 | Administrators,LocalDomainServers,[AGEditors] | Sagraloff, Michael Kerber, Michael Hemmer, Michael | [Suzuki, Masakazu] [Hong, Hoon] [Anai, Hirokazu] [Yap, Chee] [Sato, Yosuke] [Yoshida, Hiroshi] | 2009 | Certified Complex Root Isolation via Adaptive Root Separation Bounds In: The Joint Conference of ASCM 2009 and MACIS 2009, 151-166 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 10:19:26 | Administrators,LocalDomainServers,[AGEditors] | Doerr, Benjamin Fouz, Mahmoud [Schmidt, Martin] Wahlström, Magnus | [Rothlauf, Franz] | 2009 | 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 | Proceedings Article | ![]() | ||||
![]() | 10:04:42 | Administrators,LocalDomainServers,[AGEditors] | Doerr, Benjamin | [Albers, Susanne] [Alt, Helmut] [Näher, Stefan] | 2009 | Introducing Quasirandomness to Computer Science In: Efficient Algorithms : Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday, 99-111 In: Lecture Notes in Computer Science [5760], 99-111 | Part of a Book | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 12:30:41 | Administrators,LocalDomainServers,[AGEditors] | Berberich, Eric Sagraloff, Michael | ![]() | 2009 | A Generic and Flexible Framework for the Geometrical and Topological Analysis of (Algebraic) Surfaces In: Computer Aided Geometric Design (CAGD) [26], 627-647 | Journal Article | ![]() | ||||
![]() | 13:06:32 | Administrators,LocalDomainServers,[AGEditors] | Harren, Rolf van Stee, Rob | [Dinur, Irit] [Jansen, Klaus] [Naor, Joseph] [Rolim, José] | 2009 | Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 12th International Workshop, APPROX 2009 and 13th International Workshop, RANDOM 2009, 177-189 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 20:11:29 | Madhusudan Manjunath | Manjunath, Madhusudan | ![]() | 2008 | Two topics in Geometry: Minimizing absolute Gaussian Curvature over meshes and Solution Path of the Slab Support Vector Machine Universität des Saarlandes | Thesis - Masters thesis | ![]() | ||||
![]() | 20:06:41 | Madhusudan Manjunath | Elmasry, Amr Manjunath, Madhusudan | Asano, Tetsuo | 2009 | Enumerating Trichromatic Triangles Containing the Origin in Linear Time In: Japanese Conference in Computational Geometry and Graphs 2009, 101-103 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 19:54:29 | Administrators,LocalDomainServers,[AGEditors] | [Giesen, Joachim] Manjunath, Madhusudan | [Agarwal, Pankaj Kumar] [Alt, Helmut] [Teillaud, Monique] | 2009 | Minimizing Absolute Gaussian Curvature over Meshes In: Computational Geometry, 1-16 | Electronic Proceedings Article | ![]() | ||||
![]() | 17:05:23 | Administrators,LocalDomainServers,[AGEditors] | Megow, Nicole | [Biermann, Katja] [Götschel, Martin] [Lutz-Westphal, Brigitte] | 2010 | Keller oder Dach zuerst In: Besser als Mathe, 111-116 | Part of a Book | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 16:57:19 | [Library] | Bonifaci, Vincenzo Chan, Ho-Leung [Marchetti-Spaccamela, Alberto] Megow, Nicole | [Charikar, Moses] | 2010 | ![]() | Algorithms and Complexity for Periodic Real-Time Scheduling In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1350-1359 | Proceedings Article | ![]() | |||
![]() | 16:49:08 | Administrators,LocalDomainServers,[AGEditors] | [Günther, Elisabeth] [König, Felix] Megow, Nicole | [Bampis, Evripidis] [Jansen, Klaus] | 2010 | Scheduling and Packing Malleable Tasks with Precedence Constraints of Bounded Width In: Approximation and Online Algorithms : 7th International Workshop, WAOA 2009, 170-181 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 16:42:31 | Administrators,LocalDomainServers,[AGEditors] | [Correa, Jose R.] Megow, Nicole Raman, Rajiv [Suchan, Karol] | [Cafieri, Sonia] [Mucherino, Antonio] [Nannicini, Giacomo] [Tarissan, Fabien] [Liberti, Leo] | 2009 | Cardinality Constrained Graph Partitioning into Cliques with Submodular Costs In: 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2009), 347-350 | Proceedings Article | ![]() | ||||
![]() | 16:18:16 | Tobias Friedrich | Ajwani, Deepak Friedrich, Tobias Meyer, Ulrich | 2008 | An $O(n^2.75)$ algorithm for incremental topological ordering In: ACM Transactions on Algorithms [4], 1-14 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 16:15:46 | [Library] | Ajwani, Deepak Friedrich, Tobias | ![]() | 2010 | Average-case Analysis of Incremental Topological Ordering In: Discrete Applied Mathematics [158], 240-250 | Journal Article | ![]() | ||||
![]() | 16:14:58 | [Library] | Friedrich, Tobias Hebbinhaus, Nils Neumann, Frank | 2010 | Plateaus Can Be Harder in Multi-Objective Optimization In: Theoretical Computer Science [411], 854-864 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 16:13:58 | [Library] | Friedrich, Tobias [He, Jun] Hebbinghaus, Nils Neumann, Frank [Witt, Carsten] | ![]() | 2010 | Approximating Covering Problems by Randomized Search Heuristics using Multi-Objective Models In: Evolutionary Computation [18], 617 - 633 | Journal Article | ![]() | ||||
![]() | 16:12:50 | [Library] | [Cooper, Joshua] Doerr, Benjamin Friedrich, Tobias [Spencer, Joel] | 2010 | Deterministic Random Walks on Regular Trees In: Random Structures and Algorithms [37], 353-366 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 16:11:26 | Administrators,LocalDomainServers,[AGEditors] | [Friedrich, Tobias] [Oliveto, Pietro] [Sudholt, Dirk] [Witt, Carsten] | ![]() | 2009 | Analysis of Diversity-Preserving Mechanisms for Global Exploration In: Evolutionary Computation [17], 455-476 | Journal Article | ![]() | ||||
![]() | 16:07:59 | [Library] | [Bradonjić, Milan] [Elsässer, Robert] Friedrich, Tobias [Sauerwald, Thomas] [Stauffer, Alexandre] | [Charikar, Moses] | 2010 | Efficient Broadcast on Random Geometric Graphs In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1412-1421 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 16:06:22 | Administrators,LocalDomainServers,[AGEditors] | Friedrich, Tobias [Gairing, Martin] [Sauerwald, Thomas] | [Charikar, Moses] | 2010 | Quasirandom Load Balancing In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1620-1629 | Proceedings Article | ![]() | ||||
![]() | 10:46:55 | Administrators,LocalDomainServers,[AGEditors] | Berberich, Eric Kerber, Michael Sagraloff, Michael | 2010 | An efficient algorithm for the stratification and triangulation of an algebraic surface In: Computational Geometry: Theory and Applications (CGTA) [43], 257-278 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 10:33:47 | Administrators,LocalDomainServers,[AGEditors] | Kerber, Michael | [Gerdt, Vladimir] [Mayr, Ernst] [Vorozhtsov, Evgenii] | 2009 | ![]() | On the Complexity of Reliable Root Approximation In: Computer Algebra in Scientific Computing : 11th International Workshop, CASC 2009, 155-167 | Proceedings Article | ![]() | |||
![]() | 10:20:31 | Administrators,LocalDomainServers,[AGEditors] | Kerber, Michael | 2009 | Division-Free Computation of Subresultants Using Bezout Matrices In: International Journal of Computer Mathematics [86], 2186-2200 | Journal Article | ![]() | ||||||||
193 |
| ![]() | |||||||||||||
2 |
|
| ![]() | ||||||||||||
![]() | ![]() | ![]() | ![]() | 09:42:53 | [Library] | [Epstein, Leah] [Levin, Asaf] Mestre, Julian [Segev, Danny] | [Marion, Jean-Yves] [Schwentick, Thomas] | 2010 | 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 | Electronic Proceedings Article | ![]() | ||||
![]() | 09:39:14 | Administrators,LocalDomainServers,[AGEditors] | [Canzar, Stefan] Elbassioni, Khaled Mestre, Julian | 2010 | A polynomial delay algorithm for enumerating approximate solutions to the interval coloring problem In: Workshop on Algorithm Engineering and Experiments 2010 (ALENEX10), 23-33 | Proceedings Article | ![]() | ||||||||
1 |
|
| ![]() | ||||||||||||
![]() | 15:08:04 | Administrators,LocalDomainServers,[AGEditors] | Johannsen, Daniel Panagiotou, Konstantinos | [Charikar, Moses] | 2010 | ![]() | Vertices of Degree k in Random Maps In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1436-1447 | Proceedings Article | ![]() | ||||||
1 |
|
| ![]() | ||||||||||||
![]() | 14:07:27 | Administrators,LocalDomainServers,[AGEditors] | [Helwig, Sabine] Neumann, Frank [Wanka, Rolf] | [Bouchachia, Abdelhamid] [Nedjah, Nadia] [de Macedo Mourelle, Luiza] [Pedrycz, Witold] | 2009 | Particle Swarm Optimization with Velocity Adaptation In: 2009 International Conference on Adaptive and Intelligent Systems ICAIS 2009 : proceedings, 146-151 | Proceedings Article | ![]() | |||||||
5 |
|
| ![]() | ||||||||||||
![]() | 15:06:10 | Administrators,LocalDomainServers,[AGEditors] | Emeliyanenko, Pavel Berberich, Eric Sagraloff, Michael | [Bebis, George] [Boyle, Richard] [Parvin, Bahram] [Koracin, Darko] [Kuno, Yoshinori] [Wang, Junxian] [Pajarola, Renato] [Lindstrom, Peter] [Hinkenjann, André] [Encarnação, Miguel L.] [Silva, Cláudio T.] [Coming, Daniel] | 2009 | ![]() | Visualizing Arcs of Implicit Algebraic Curves, Exactly and Fast In: Advances in Visual Computing : 5th International Symposium, ISVC 2009, 608-619 | Proceedings Article | ![]() | ||||||
![]() | ![]() | ![]() | ![]() | 14:29:44 | Administrators,LocalDomainServers,[AGEditors] | Emeliyanenko, Pavel | [Dou, Yong] [Gruber, Ralf] [Joller, Josef] | 2009 | ![]() | Efficient Multiplication of Polynomials on Graphics Hardware In: Advanced Parallel Processing Technologies : 8th International Symposium, APPT 2009, 134-149 | Proceedings Article | ![]() | |||
![]() | 08:56:43 | Administrators,LocalDomainServers,[AGEditors] | [Kavitha, Telikepalli] Mestre, Julian | [Dong, Yingfei] [Du, Ding-Zhu] [Ibarra, Oscar] | 2009 | Max-coloring paths: Tight bounds and extensions In: Algorithms and Computation : 20th International Symposium, ISAAC 2009, 87-96 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 08:54:57 | Administrators,LocalDomainServers,[AGEditors] | [Epstein, Leah] [Kleiman, Elena] Mestre, Julian | [Leonardi, Stefano] | 2009 | Parametric Packing of Selfish Items and the Subset Sum Algorithm In: Internet and Network Economics : 5th International Workshop, WINE 2009, 67-78 | Proceedings Article | ![]() | ||||
![]() | 08:51:43 | Administrators,LocalDomainServers,[AGEditors] | Elbassioni, Khaled M. [Krohn, Erik] [Matijevic, Domagoj] Mestre, Julián [Severdija, Domagoj] | 2009 | Improved Approximations for Guarding 1.5-Dimensional Terrains In: Algorithmica [Online First], 1-13 | Electronic Journal Article | ![]() | ||||||||
1 |
|
| ![]() | ||||||||||||
![]() | 12:08:54 | [Library] | [Dumitriu, Daniel] [Funke, Stefan] [Kutz, Martin] [Milosavljevic, Nikola] | 2009 | 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 | Electronic Journal Article | ![]() | ||||||||
2 |
|
| ![]() | ||||||||||||
![]() | 17:16:48 | Administrators,LocalDomainServers,[AGEditors] | Celikik, Marjan Bast, Hannah | [Karlgren, Jussi] [Tarhio, Jorma] [Hyyrö, Heikki] | 2009 | Fast Single-Pass Construction of a Half-Inverted Index In: String processing and information retrieval : 16th International Symposium, SPIRE 2009, 194-205 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 21:52:53 | [Library] | Johannsen, Daniel [Razgon, Igor] Wahlström, Magnus | [Kullmann, Oliver] | 2009 | ![]() | 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 | Proceedings Article | ![]() | |||
11 |
|
| ![]() | ||||||||||||
![]() | ![]() | ![]() | ![]() | 03:07:43 | [Library] | Friedrich, Tobias [Sauerwald, Thomas] [Vilenchik, Dan] | [Albers, Susanne] [Marchetti-Spaccamela, Alberto] [Matias, Yossi] [Nikoletseas, Sotiris] [Thomas, Wolfgang] | 2009 | Smoothed Analysis of Balancing Networks In: Automata, Languages and Programming : 36th International Colloquium, ICALP 2009, 472-483 | Proceedings Article | ![]() | ||||
![]() | 03:07:13 | [Library] | Doerr, Benjamin Friedrich, Tobias [Sauerwald, Thomas] | [Albers, Susanne] [Marchetti-Spaccamela, Alberto] [Matias, Yossi] [Nikoletseas, Sotiris] [Thomas, Wolfgang] | 2009 | Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness In: Automata, Languages and Programming : 36th International Colloquium, ICALP 2009, 366-377 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 08:44:21 | Administrators,LocalDomainServers,[AGEditors] | [Kavitha, T.] Mestre, Julián [Nasre, M.] | [Albers, Susanne] [Marchetti-Spaccamela, Alberto] [Matias, Yossi] [Nikoletseas, Sotiris] [Thomas, Wolfgang] | 2009 | Popular Mixed Matchings In: Automata, Languages and Programming : 36th International Colloquium, ICALP 2009, 574-584 | Proceedings Article | ![]() | ||||
![]() | 14:07:05 | Administrators,LocalDomainServers,[AGEditors] | Gidenstam, Anders [Papatriantafilou, Marina] [Tsigas, Phillipas] | 2009 | NBmalloc : Allocating Memory in a Lock-Free Manner In: Algorithmica [Online First], 1-35 | Electronic Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 14:01:32 | Administrators,LocalDomainServers,[AGEditors] | Gidenstam, Anders [Papatriantafilou, Marina] [Sundell, Håkan] [Tsigas, Philippas] | ![]() | 2009 | Efficient and Reliable Lock-Free Memory Reclamation Based on Reference Counting In: IEEE Transactions on Parallel and Distributed Systems [20], 1173-1187 | Journal Article | ![]() | ||||
![]() | 13:48:22 | Administrators,LocalDomainServers,[AGEditors] | [Larsson, Andreas] Gidenstam, Anders [Ha, Phuong H.] [Papatriantafilou, Marina] [Tsigas, Philippas] | 2009 | Multiword Atomic Read/Write Registers on Multiprocessor Systems In: Journal of experimental algorithmics [13], 7:1-7:30 | Electronic Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 12:11:20 | Andreas Karrenbauer | [Xu, Chihao] [Wahl, Jürgen] [Eeisenbrand, Friedrich] Karrenbauer, Andreas [Soh, Kian Min] [Hitzelberger, Christoph] | ![]() | 2005 | Verfahren zur Ansteuerung von Matrixanzeigen | Miscellaneous | ![]() | ||||
![]() | 14:28:15 | Kavitha Telikepalli | Kavitha, Telikepalli [Nasre, Meghana] | 2008 | Optimal Popular Matchings | Miscellaneous | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 14:22:27 | Kavitha Telikepalli | Kavitha, Telikepalli | ![]() | 2008 | On a Special Co-cycle Basis of Graphs In: 11th Scandinavian Workshop on Algorithm Theory (SWAT), 343-354 | Proceedings Article | ![]() | ||||
![]() | 14:18:42 | Kavitha Telikepalli | [Huang, Chien-Chung] Kavitha, Telikepalli [Michail, Dimitrios] [Nasre, Meghana] | 2008 | Bounded Unpopularity Matchings In: 11th Scandinavian Workshop on Algorithm Theory (SWAT), 127-137 | Proceedings Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 13:08:27 | [Library] | Doerr, Benjamin [Theile, Madeleine] | [Raidl, Günther] [Rothlauf, Frank] | 2009 | Improved Analysis Methods for Crossover-Based Algorithms In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 247-254 | Proceedings Article | ![]() | ||||
37 |
|
| ![]() | ||||||||||||
![]() | ![]() | ![]() | ![]() | 10:51:31 | Pavel Emeliyanenko | Berberich, Eric Emeliyanenko, Pavel | ![]() | 2008 | CGAL's Curved Kernel via Analysis | Report | ![]() | ||||
![]() | 10:43:02 | Michael Sagraloff | Eigenwillig, Arno | 2008 | Real Root Isolation for Exact and Approximate Polynomials Using Descartes' Rule of Signs Universität des Saarlandes | Thesis - PhD thesis | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 10:38:05 | Michael Sagraloff | Mehlhorn, Kurt Osbild, Ralf Sagraloff, Michael | ![]() | 2008 | A General Approach to the Analysis of Controlled Perturbation Algorithms | Report | ![]() | ||||
![]() | 10:31:01 | Michael Sagraloff | Mehlhorn, Kurt Sagraloff, Michael | 2008 | A deterministic Bitstream Descartes Algorithm | Report | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 20:02:00 | Administrators,LocalDomainServers,[AGEditors] | Elbassioni, Khaled | ![]() | 2009 | Algorithms for Dualization over Products of Partially Ordered Sets In: SIAM Journal on Discrete Mathematics [23], 487-510 | Journal Article | ![]() | ||||
![]() | 17:53:27 | [Library] | Mehlhorn, K. Michail, D. | 2009 | ![]() | Minimum Cycle Bases: Faster and Simpler In: ACM Transactions on Algorithms [6], 8:1-8:13 | Electronic Journal Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 17:45:08 | Administrators,LocalDomainServers,[AGEditors] | [Kavitha, T.] [Liebchen, Ch.] Mehlhorn, K. Michail, D. [Rizzi, R.] [Ueckerdt, T.] [Zweig, K.] | ![]() | 2009 | ![]() | Cycle Bases in Graphs: Characterization, Algorithms, Complexity, and Applications In: Computer Science Review [3], 199-243 | Journal Article | ![]() | |||
![]() | 17:36:52 | Administrators,LocalDomainServers,[AGEditors] | [Shervashidze, Nino] Vishwanathan, S .V. N. [Petri, Tobias H.] Mehlhorn, Kurt [Borgwardt, Karsten M.] | [van Dyk, David] [Welling, Max] | 2009 | ![]() | Efficient Graphlet Kernels for Large Graph Comparison In: Proceedings of the Twelfth International Conference on Artificial Intelligence and Statistics (AISTATS), 488-495 | Electronic Proceedings Article | ![]() | ||||||
![]() | ![]() | ![]() | ![]() | 17:21:47 | Michael Hemmer | [Emiris, Ioannis Z.] Hemmer, Michael [Karavelas, Menelaos] [Mourrain, Bernard] [Tsigaridas, Elias P.] [Zafeirakopoulos, Zafeirakis] | ![]() | 2008 | ![]() | Experimental evaluation and cross-benchmarking of univariate real solvers | Report | ![]() | |||
![]() | 14:26:46 | Administrators,LocalDomainServers,[AGEditors] | [Althaus, Ernst] [Dumitriu, Daniel] | [Vahrenhold, Jan] | 2009 | Fast and Accurate Bounds on Linear Programs In: Experimental Algorithms : 8th International Symposium on Experimental Algorithms (SEA 2009), 40-50 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 13:16:06 | Kurt Mehlhorn | Mehlhorn, Kurt [Sanders, Peter] | ![]() | 2008 | Algorithms and Data Structures: The Basic Toolbox | Book | ![]() | ||||
![]() | 17:43:07 | Michael Hemmer | Hemmer, Michael | 2009 | Polynomials, CGAL - Computational Geometry Algorithms Library, release 3.4 | Manual | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 17:37:56 | Michael Hemmer | Hemmer, Michael | ![]() | 2009 | Modular Arithmetic, CGAL - Computational Geometry Algorithms Library, release 3.4 | Manual | ![]() | ||||
![]() | 17:36:52 | Michael Hemmer | Hemmer, Michael [Hert, Susan] [Kettner, Lutz] [Pion, Sylvain] [Schirra, Stefan] | 2007 | Number Types, CGAL - Computational Geometry Algorithms Library, release 3.3 | Manual | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 17:23:13 | Michael Hemmer | Hemmer, Michael | ![]() | 2007 | Algebraic Foundations, CGAL - Computational Geometry Algorithms Library, release 3.3 | Manual | ![]() | ||||
![]() | 17:18:34 | Andreas Karrenbauer | [Xu, Chihao] Karrenbauer, Andreas [Soh, Kian Min] [Codrea, Cosmin] | 2008 | Consecutive multiline addressing: A scheme for addressing PMOLEDs In: Journal of the Society for Information Display [16], 211-219 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 10:27:09 | Andreas Karrenbauer | [Xu, Chihao] Karrenbauer, Andreas [Soh, Kian Min] [Wahl, Jürgen] | [Morreale, Jay] | 2007 | A New Addressing Scheme for PM OLED Display In: SID 2007 International Symposium Digest of Technical Papers, 97-100 | Proceedings Article | ![]() | ||||
![]() | 10:27:09 | Andreas Karrenbauer | [Eisenbrand, Friedrich] Karrenbauer, Andreas [Xu, Chihao] | [Camil Demetrescu] | 2007 | Algorithms for longer OLED Lifetime In: WEA 2007, 338-351 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 10:27:09 | Ellen Fries | [Eisenbrand, Friedrich] Karrenbauer, Andreas [Skutella, Martin] [Xu, Chihao] | [Azar, Yossi] [Erlebach, Thomas] | 2006 | Multiline Addressing by Network Flow In: Algorithms - ESA 2006 : 14th Annual European Symposium, 744-755 | Proceedings Article | ![]() | ||||
![]() | 10:27:09 | Administrators,LocalDomainServers,[AGEditors] | Karrenbauer, Andreas | 2004 | Packing Boxes with Arbitrary Rotations Universität des Saarlandes | Thesis - other | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 16:34:38 | Ho-Leung Chan,Jeff Edmonds,Tak-Wah Lam,Lap-Kei Lee,Alberto Marchetti-Spaccamela,Kirk Pruhs,Susanne Albers,Jean-Yves Marion,[Library],[Department] | Chan, Ho-Leung [Edmonds, Jeff] [Lam, Tak-Wah] [Lee, Lap-Kei] [Marchetti-Spaccamela, Alberto] [Pruhs, Kirk] | [Albers, Susanne] [Marion, Jean-Yves] | 2009 | Nonclairvoyant Speed Scaling for Flow and Energy In: Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS), 255-264 | Electronic Proceedings Article | ![]() | ||||
![]() | 10:57:09 | Eric Berberich | Berberich, Eric | 2008 | Robust and Efficient Software for Problems in 2.5-Dimensional Non-Linear Geometry - Algorithms and Implementations Universität des Saarlandes | Thesis - PhD thesis | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 06:39:03 | Administrators,LocalDomainServers,[AGEditors] | Doerr, Benjamin Friedrich, Tobias | ![]() | 2009 | Deterministic Random Walks on the Two-Dimensional Grid In: Combinatorics, Probability and Computing [18], 123-144 | Journal Article | ![]() | ||||
![]() | 15:53:34 | Konstantinos Panagiotou,[Library],[Department],Christian Krattenthaler,Volker Strehl,Manuel Kauers | Panagiotou, Konstantinos | [Krattenthaler, Christian] [Strehl, Volker] [Kauers, Manuel] | 2009 | Blocks In Constrained Random Graphs with Fixed Average Degree In: 21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009), 733-744 | Electronic Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 15:34:49 | Administrators,LocalDomainServers,[AGEditors] | [Fredman, Michael] [Khachiyan, Leonid] | ![]() | 1996 | On the Complexity of Dualization of Monotone Disjunctive Normal Forms In: J. Algorithms [21], 618-628 | Journal Article | ![]() | ||||
![]() | 08:48:38 | Administrators,LocalDomainServers,[AGEditors] | Kratsch, Stefan Neumann, Frank | [Raidl, Günther] [Rothlauf, Franz] | 2009 | Fixed-Parameter Evolutionary Algorithms and the Vertex Cover Problem In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 293-300 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 08:46:06 | Administrators,LocalDomainServers,[AGEditors] | Neumann, Frank [Oliveto, Pietro Simone] [Witt, Carsten] | [Raidl, Günther] [Rothlauf, Franz] | 2009 | 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 | Proceedings Article | ![]() | ||||
![]() | 08:42:31 | Administrators,LocalDomainServers,[AGEditors] | Doerr, Benjamin [Eremeev, Anton] [Horoba, Christian] Neumann, Frank [Theile, Madeleine] | [Raidl, Günther] [Rothlauf, Frank] | 2009 | Evolutionary Algorithms and Dynamic Programming In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 771-777 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 08:36:36 | Administrators,LocalDomainServers,[AGEditors] | Friedrich, Tobias [Horoba, Christian] Neumann, Frank | [Raidl, Günther] [Rothlauf, Franz] | 2009 | Multiplicative Approximations and the Hypervolume Indicator In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 571-578 | Proceedings Article | ![]() | ||||
![]() | 14:49:48 | Administrators,LocalDomainServers,[AGEditors] | Chan, T-H. Hubert [Dhamdhere, Kedar] [Gupta, Anupam] [Kleinberg, Jon] [Slivkins, Aleksandrs] | 2009 | Metric Embeddings with Relaxed Guarantees In: SIAM Journal on Computing [38], 2303-2329 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 14:59:06 | Imran Rauf | [Golumbic, Martin Charles] [Mintz, Aviad] [Rotics, Udi] | ![]() | 2006 | Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial k-trees In: Discrete Applied Mathematics [154], 1465-1477 | Journal Article | ![]() | ||||
![]() | 14:45:12 | Administrators,LocalDomainServers,[AGEditors] | [Gurvich, Vladimir] | 1991 | Criteria for repetition-freeness of functions in the algebra of logic In: Soviet Math. Dokl. [43], 721-726 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 14:42:46 | Imran Rauf | [Gurvich, Vladimir] | ![]() | 1977 | On repetition-free Boolean functions In: Uspekhi Mat. Nauk. (Russian Math. Surveys) [32], 183-184 | Journal Article | ![]() | ||||
![]() | 15:02:19 | Imran Rauf | Elbassioni, Khaled Rauf, Imran | 2010 | Polynomial-time Dualization of $r$-Exact Hypergraphs with Applications in Geometry | Unpublished/Draft | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 13:36:23 | Frank Neumann | Friedrich, Tobias Neumann, Frank | ![]() | 2008 | When to Use Bit-wise Neutrality In: IEEE Congress on Evolutionary Computation 2008, 997-1003 | Proceedings Article | ![]() | ||||
![]() | 13:33:36 | Frank Neumann | [Diedrich, Florian] Neumann, Frank | 2008 | Using Fast Matrix Multiplication in Bio-Inspired Computation for Complex Optimization Problems In: IEEE Congress on Evolutionary Computation 2008, 3828-3833 | Proceedings Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 13:28:50 | Administrators,LocalDomainServers,[AGEditors] | [Oliveto, Pietro Simone] [Lehre, Per Kristian] Neumann, Frank | ![]() | 2009 | Theoretical Analysis of Rank-Based Mutation - Combining Exploration and Exploitation In: 2009 IEEE Congress on Evolutionary Computation : CEC, 1455-1462 | Proceedings Article | ![]() | ||||
91 |
|
| ![]() | ||||||||||||
![]() | ![]() | ![]() | ![]() | 16:34:19 | [Library] | Elbassioni, Khaled Raman, Rajiv Ray, Saurabh [Sitters, Rene] | [Mavronicolas, Marios] [Papadopoulou, Vicky G.] | 2009 | ![]() | 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 | Proceedings Article | ![]() | |||
![]() | 12:49:26 | Administrators,LocalDomainServers,[AGEditors] | Harren, Rolf van Stee, Rob | 2012 | Absolute Approximation Ratios for Packing Rectangles into Bins In: Journal of Scheduling [15], 63-75 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 20:52:00 | Amr Elmassry | Elmasry, Amr | Elmasry, Amr | 2008 | ![]() | Violation Heaps: A Better Substitute for Fibonacci Heaps | Report | ![]() | |||
![]() | 20:28:40 | Amr Elmassry | Elmasry, Amr [Jensen, Claus] [Katajainen, Jyrki] | 2008 | ![]() | Two New Methods for Constructing Double-Ended Priority Queues from Priority Queues In: Computing [83], 193-204 | Journal Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 19:44:13 | Amr Elmassry | Elmasry, Amr [Hammad, Abdelrahman] | ![]() | 2008 | ![]() | Inversion-Sensitive Sorting Algorithms in Practice In: ACM Journal of Experimental Algorithmics [13], 1-18 | Journal Article | ![]() | |||
![]() | 19:15:14 | Amr Elmassry | Elmasry, Amr [Jensen, Claus] [Katajainen, Jyrki] | 2008 | ![]() | Multipartite Priority Queues In: ACM Transactions on Algorithms [5], 1-19 | Journal Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 18:48:58 | Administrators,LocalDomainServers,[AGEditors] | Elmasry, Amr | [Matthieu, Claire] | 2009 | ![]() | Pairing Heaps with O(log log n) decrease Cost In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 471-476 | Proceedings Article | ![]() | |||
![]() | 11:29:18 | Administrators,LocalDomainServers,[AGEditors] | Hemmer, Michael Limbach, Sebastian [Schömer, Elmar] | 2009 | ![]() | Continued Work on the Computation of an Exact Arrangement of Quadrics In: EuroCG'09 : 25th European Workshop on Computational Geometry, 313-316 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 09:49:32 | Andreas Karrenbauer | Eisenbrand, Friedrich Funke, Stefan Karrenbauer, Andreas Matijevic, Domagoj | ![]() | 2008 | Energy-Aware Stage Illumination In: International Journal of Computational Geometry and Applications [18], 107-129 | Journal Article | ![]() | ||||
![]() | 09:36:15 | Administrators,LocalDomainServers,[AGEditors] | [Eisenbrand, Friedrich] Karrenbauer, Andreas [Skutella, Martin] [Xu, Chihao] | 2009 | Multiline Addressing by Network Flow In: Algorithmica [53], 583-596 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 09:28:49 | Andreas Karrenbauer | [Albrecht, Marc] Karrenbauer, Andreas [Xu, Chihao] | ![]() | 2008 | 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 | Proceedings Article | ![]() | ||||
![]() | 20:28:37 | Daniel Johannsen | [Cameron, Peter] Johannsen, Daniel [Prellberg, Thomas] Schweitzer, Pascal | 2008 | ![]() | Counting Defective Parking Functions In: Electronic Journal of Combinatorics [15], R92 | Electronic Journal Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 21:22:42 | Stefan Canzar | Althaus, Ernst Canzar, Stefan | ![]() | 2008 | A Lagrangian relaxation approach for the multiple sequence alignment problem In: Journal of Combinatorial Optimization [16], 127-154 | Journal Article | ![]() | ||||
![]() | 21:17:38 | Stefan Canzar | Althaus, Ernst Canzar, Stefan [Emmett, Mark] Karrenbauer, Andreas [Marshall, Alan] [Meyer-Bäse, Anke] [Zhang, Huimin] | 2008 | Computing H/D-exchange speeds of single residues from data of peptic fragments In: 23rd Annual ACM Symposium on Applied Computing (SAC), 1273-1277 | Proceedings Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 21:04:32 | Stefan Canzar | Althaus, Ernst Canzar, Stefan | ![]() | 2008 | LASA: A tool for non-heuristic alignment of multiple sequences In: Bioinformatics Research and Development (BIRD’08), 489-498 | Proceedings Article | ![]() | ||||
![]() | 17:41:22 | Madhusudan Manjunath | [Eigensatz, Michael] [Giesen, Joachim] Manjunath, Madhusudan | [Morin, Pat] | 2008 | The Solution Path of the Slab Support Vector Machine In: The 20th Canadian Conference on Computational Geometry, 211-214 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 17:18:09 | Administrators,LocalDomainServers,[AGEditors] | [Bhaskar, Umang] [Fleischer, Lisa] [Hoy, Darrell] Huang, Chien-Chung | [Mathieu, Claire] | 2009 | ![]() | Equilibria of Atomic Flow Games are not Unique In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 748-757 | Proceedings Article | ![]() | |||
![]() | 12:24:01 | [Library] | [Epstein, Leah] van Stee, Rob | 2010 | ![]() | On the online unit clustering problem In: ACM Transactions on Algorithms [7], 1-18 | Journal Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 11:33:05 | Administrators,LocalDomainServers,[AGEditors] | Christodoulou, George [Koutsoupias, Elias] [Nanavati, Akash] | ![]() | 2009 | Coordination Mechanisms In: Theoretical Computer Science [410], 3327-3336 | Journal Article | ![]() | ||||
![]() | 11:31:21 | Administrators,LocalDomainServers,[AGEditors] | Christodoulou, George [Koutsoupias, Elias] [Kovács, Annamária] | 2010 | Mechanism Design for Fractional Scheduling on Unrelated Machines In: ACM Transactions on Algorithms [6], 38:1-38:18 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 11:26:36 | Administrators,LocalDomainServers,[AGEditors] | Christodoulou, George [Koutsoupias, Elias] [Vidali, Angelina] | ![]() | 2009 | A lower bound for scheduling mechanisms In: Algorithmica [85], 729-740 | Journal Article | ![]() | ||||
![]() | 11:21:37 | Administrators,LocalDomainServers,[AGEditors] | Christodoulou, George [Koutsoupias, Elias] | 2009 | Mechanism Design for Scheduling In: Bulletin of European Association for Theoretical Computer Science [97], 40-59 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 10:58:56 | Michael Hemmer | Limbach, Sebastian | ![]() | 2008 | ![]() | Continued Work on the Computation of an Exact Arrangement of Quadrics Universität des Saarlandes | Thesis - Masters thesis | ![]() | |||
![]() | 10:44:46 | Nikolaos Fountoulakis | Fountoulakis, Nikolaos [Kühn, Daniela] [Osthus, Deryk] | 2009 | Minors in random regular graphs In: Random Structures and Algorithms [35], 444-463 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 10:42:44 | Nikolaos Fountoulakis | [Fountoulakis, Nikolaos] | ![]() | 2007 | Percolation on sparse random graphs with given degree sequence In: Internet Mathematics [4], 329-356 | Journal Article | ![]() | ||||
![]() | 10:40:29 | Administrators,LocalDomainServers,[AGEditors] | [Cooley, Oliver] [Fountoulakis, Nikolaos] [Kühn, Daniela] [Osthus, Deryk] | 2009 | Embeddings and Ramsey numbers of sparse k-uniform hypergraphs In: Combinatorica [29], 263-297 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 10:37:18 | Nikolaos Fountoulakis | Fountoulakis, Nikolaos [Kühn, Daniela] [Osthus, Deryk] | ![]() | 2008 | The order of the largest complete minor in a random graph In: Random Structures and Algorithms [33], 127-141 | Journal Article | ![]() | ||||
![]() | 10:34:58 | Nikolaos Fountoulakis | [Cooley, Oliver] Fountoulakis, Nikolaos [Kühn, Daniela] [Osthus, Deryk] | 2008 | 3-Uniform hypergraphs of bounded degree have linear Ramsey numbers In: Journal of Combinatorial Theory B [98], 484-505 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 10:31:27 | Nikolaos Fountoulakis | Fountoulakis, Nikolaos [Reed, Bruce] | ![]() | 2008 | The evolution of the mixing rate of a simple random walk on the giant component of a random graph In: Random Structures and Algorithms [33], 68-86 | Journal Article | ![]() | ||||
![]() | 10:26:52 | Nikolaos Fountoulakis | Fountoulakis, Nikolaos [Reed, Bruce] | 2007 | Faster Mixing and Small Bottlenecks In: Probability Theory and Related Fields [137], 475-486 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 19:45:12 | Administrators,LocalDomainServers,[AGEditors] | Panagiotou, Konstantinos [Steger, Angelika] | [Matthieu, Claire] | 2009 | Maximal Biconnected Subgraphs of Random Planar Graphs In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 432-440 | Proceedings Article | ![]() | ||||
![]() | 18:27:18 | [Library] | Wahlström, Magnus | [Frid, Anna] [Morozov, Andrey] [Rybalchenko, Andrey] [Wagner, Klaus W.] | 2009 | New Plain-Exponential Time Classes for Graph Homomorphism In: Computer Science – Theory and Applications : 4th International Computer Science Symposium in Russia, CSR 2009, 346-355 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 18:19:20 | Administrators,LocalDomainServers,[AGEditors] | Doerr, Benjamin Wahlström, Magnus | [Finocchi, Irene] [Hershberger, John] | 2009 | Randomized Rounding in the Presence of a Cardinality Constraint In: 2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX), 162-174 | Proceedings Article | ![]() | ||||
![]() | 16:44:02 | Administrators,LocalDomainServers,[AGEditors] | Hemmer, Michael [Hülse, Dominik] | 2009 | ![]() | Generic implementation of a modular GCD over Algebraic Extension Fields In: EuroCG'09 : 25th European Workshop on Computational Geometry, 321-324 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 15:07:55 | Christina Fries | Mehlhorn, Kurt [Kavitha, T.] [Hariharan, R.] | ![]() | 2008 | ![]() | Faster Deterministic and Randomized Algorithms for Minimum Cycle Basis in Directed Graphs In: SIAM Journal of Computing [38], 1430-1447 | Journal Article | ![]() | |||
![]() | 15:02:14 | Christina Fries | [Garg, Naveen] [Kavitha, T.] [Kumar, Amit] Mehlhorn, Kurt Mestre, Julián | 2008 | ![]() | Assigning Papers to Referees | Unpublished/Draft | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 12:55:25 | Rouven Naujoks | Naujoks, Rouven | ![]() | 2008 | NP-hard Networking Problems - Exact and Approximate Algorithms Universität des Saarlandes | Thesis - PhD thesis | ![]() | ||||
![]() | 12:51:07 | Rouven Naujoks | Althaus, Ernst Naujoks, Rouven | [McGeoch, Catherine C.] | 2008 | Reconstructing Phylogenetic Networks with One Recombination In: Experimental Algorithms, 7th International Workshop, WEA 2008, 275-288 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 12:42:33 | Rouven Naujoks | Funke, Stefan Laue, Sören Naujoks, Rouven [Lotker, Zvi] | [Sotiris E. Nikoletseas] [Bogdan S. Chlebus] [David B. Johnson] [Bhaskar Krishnamachari] | 2008 | Power Assignment Problems in Wireless Communication: Covering Points by Disks, Reaching few Receivers Quickly, and Energy-Efficient Travelling Salesman Tours In: Distributed Computing in Sensor Systems, 4th IEEE International Conference, DCOSS 2008, 282-295 | Proceedings Article | ![]() | ||||
![]() | 12:38:11 | Evangelia Pyrga | Pyrga, Evangelia [Ray, Saurabh] | 2008 | New existence Proofs for epsilon-nets In: Proceedings of the twenty-fourth annual symposium on Computational geometry, 199-207 | Proceedings Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 09:25:40 | Administrators,LocalDomainServers,[AGEditors] | Kratsch, Stefan | [Albers, Susanne] [Marion, Jean-Yves] | 2009 | Polynomial Kernelizations For MIN F+Pi1 And MAX NP In: Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS), 601-612 | Electronic Proceedings Article | ![]() | ||||
![]() | 15:30:25 | Süntje Böttcher | Friedrich, Tobias [Oliveto, Pietro] [Sudholt, Dirk] [Witt, Carsten] | [Keijzer, Maarten] | 2008 | Theoretical Analysis of Diversity Mechanisms for Global Exploration In: Proceedings of the 10th annual conference on Genetic and evolutionary computation (GECCO 2008), 945-952 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 15:26:57 | Süntje Böttcher | Bringmann, Karl Friedrich, Tobias | [Hong, Seok-Hee] [Nagamochi, Hiroshi] [Fukunaga, Takuro] | 2008 | Approximating the volume of unions and intersections of high-dimensional geometric objects. In: Proceedings of the 19th International Symposium on Algorithms and Computation (ISAAC 2008), 436-447 | Proceedings Article | ![]() | ||||
![]() | 14:57:53 | Süntje Böttcher | Friedrich, Tobias Hebbinghaus, Nils | [Hong, Seok-Hee] [Nagamochi, Hiroshi] [Fukunaga, Takuro] | 2008 | Average Update Times for Fully-Dynamic All-Pairs Shortest Paths. In: Proceedings of the 19th International Symposium on Algorithms and Computation (ISAAC 2008), 693-704 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 14:54:11 | Administrators,LocalDomainServers,[AGEditors] | Doerr, Benjamin [Friedrich, Tobias] [Künnemann, Marvin] [Sauerwald, Thomas] | [Finocchi, Irene] [Hershberger, John] | 2009 | Quasirandom Rumor Spreading: An Experimental Analysis In: 2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX), 145-153 | Proceedings Article | ![]() | ||||
![]() | 14:49:29 | [Library] | [Bringmann, Karl] [Friedrich, Tobias] | [Jansen, Thomas] [Garibay, Ivan] [Paul, Wiegand R.] [Wu, Annie S.] | 2009 | Don't be greedy when calculating hypervolume contributions In: FOGA'09 : revised selected papers from ACM SIGEVO Foundations of Genetic Algorithms X, 103-112 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 14:46:53 | [Library] | [Baswana, Surender] [Biswas, Somenath] Doerr, Benjamin [Friedrich, Tobias] [Kurur, Piyush P.] Neumann, Frank | [Jansen, Thomas] [Garibay, Ivan] [Wiegand, R.Paul] [Wu, Annie S.] | 2009 | 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 | Proceedings Article | ![]() | ||||
![]() | 14:42:09 | [Library] | [Bringmann, Karl] [Friedrich, Tobias] | [Ehrgott, Matthias] [Fonseca, Carlos M.] [Gandibleux, Xavier] [Hao, Kin-Kao] [Sevaux, Marc] | 2009 | 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 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 14:37:40 | [Library] | [Friedrich, Tobias] [Sauerwald, Thomas] | ![]() | 2009 | Near-Perfect Load Balancing by Randomized Rounding In: STOC09 : Proceedings of the 2009 ACM International Symposium on Theory of Computing, 121-130 | Proceedings Article | ![]() | ||||
![]() | 12:06:48 | Administrators,LocalDomainServers,[AGEditors] | Harren, Rolf | 2009 | ![]() | Approximation Algorithms for Orthogonal Packing Problems for Hypercubes In: Theoretical Computer Science [410], 4504-4532 | Journal Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 11:25:36 | Administrators,LocalDomainServers,[AGEditors] | Schweitzer, Pascal | ![]() | 2009 | Using the Incompressibility Method to obtain Local Lemma results for Ramsey-type Problems In: Information Processing Letters [109], 229-232 | Journal Article | ![]() | ||||
![]() | 09:28:56 | [Library] | [Horoba, Chrisitian] Neumann, Frank | 2009 | 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 | Proceedings Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 09:24:50 | Administrators,LocalDomainServers,[AGEditors] | Neumann, Frank [Sudholt, Dirk] [Witt, Carsten] | ![]() | 2009 | Analysis of Different MMAS ACO Algorithms on Unimodal Functions and Plateaus In: Swarm Intelligence [3], 35-68 | Journal Article | ![]() | ||||
![]() | 09:22:24 | [Library] | Friedrich, Tobias Neumann, Frank | 2010 | When to Use Bit-Wise Neutrality In: Natural Computing [9], 283 - 294 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 09:19:19 | Administrators,LocalDomainServers,[AGEditors] | [Brockhoff, Dimo] [Friedrich, Tobias] Hebbinghaus, Nils Klein, Christian Neumann, Frank [Zitzler, Eckart] | ![]() | 2009 | On the Effects of Adding Objectives to Plateau Functions In: IEEE Transactions on Evolutionary Computation [13], 591-603 | Journal Article | ![]() | ||||
![]() | 09:16:12 | Administrators,LocalDomainServers,[AGEditors] | Friedrich, Tobias Hebbinghaus, Nils Neumann, Frank | 2009 | Comparison of Simple Diversity Mechanisms on Plateau Functions In: Theoretical Computer Science [410], 2455-2462 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 09:13:08 | Administrators,LocalDomainServers,[AGEditors] | Neumann, Frank [Witt, Carsten] | ![]() | 2009 | Runtime Analysis of a Simple Ant Colony Optimization Algorithm In: Algorithmica [54], 243-255 | Journal Article | ![]() | ||||
![]() | 09:10:44 | Administrators,LocalDomainServers,[AGEditors] | Friedrich, Tobias [He, Jun] Hebbinghaus, Nils Neumann, Frank [Witt, Carsten] | 2009 | Analyses of Simple Hybrid Algorithms for the Vertex Cover Problem In: Evolutionary Computation, [17], 3-19 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 11:18:43 | Khaled Elbassioni | Elbassioni, Khaled Elmasry, Amr [Kamel, Ibrahim] | ![]() | 2008 | Indexing Schemes for Multi-dimensional Moving Objects In: Encyclopedia of GIS, 523-529 | Part of a Book | ![]() | ||||
![]() | 11:16:05 | Khaled Elbassioni | [Khachiyan, Leonid] [Boros, Endre] Elbassioni, Khaled [Gurvich, Vladimir] | 2008 | On Enumerating Minimal Dicuts and Strongly Connected Subgraphs In: Algorithmica [50], 159-172 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 11:14:32 | Khaled Elbassioni | [Khachiyan, Leonid] [Boros, Endre] [Borys, Konrad] Elbassioni, Khaled [Gurvich, Vladimir] [Makino, Kazuhisa] | ![]() | 2008 | Generating Cut Conjunctions in Graphs and Related Problems In: Algorithmica [51], 239-263 | Journal Article | ![]() | ||||
![]() | 15:11:27 | Khaled Elbassioni | Elbassioni, Khaled [Tiwary, Hans Raj] | 2008 | On Computing the Vertex Centroid of a Polyhedron In: CoRR [abs/0806.3456], x-x | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 15:09:14 | Khaled Elbassioni | [Boros, Endre] Elbassioni, Khaled [Gurvich, Vladimir] [Tiwary, Hans Raj] | ![]() | 2008 | 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 | Journal Article | ![]() | ||||
![]() | 15:06:10 | Khaled Elbassioni | [Khachiyan, Leonid] [Boros, Endre] [Borys, Konrad] Elbassioni, Khaled [Gurvich, Vladimir] | 2008 | Generating All Vertices of a Polyhedron Is Hard In: Discrete & Computational Geometry [39], 174-190 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 15:04:19 | Khaled Elbassioni | [Khachiyan, Leonid] [Boros, Endre] Elbassioni, Khaled [Gurvich, Vladimir] | ![]() | 2008 | Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions In: Discrete Applied Mathematics [156], 2020-2034 | Journal Article | ![]() | ||||
![]() | 15:02:27 | Khaled Elbassioni | Elbassioni, Khaled | 2008 | On the complexity of monotone dualization and generating minimal hypergraph transversals In: Discrete Applied Mathematics [156], 2109-2123 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 15:00:39 | Khaled Elbassioni | Elbassioni, Khaled | ![]() | 2008 | A note on systems with max-min and max-product constraints In: Fuzzy Sets and Systems [159], 2272-2277 | Journal Article | ![]() | ||||
![]() | 14:59:24 | Khaled Elbassioni | [Kutz, Martin] Elbassioni, Khaled [Katriel, Irit] [Mahajan, Meena] | 2008 | Simultaneous matchings: Hardness and approximation In: J. Comput. Syst. Sci. [74], 884-897 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 14:55:26 | Khaled Elbassioni | [Khachiyan, Leonid] [Boros, Endre] [Borys, Konrad] Elbassioni, Khaled [Gurvich, Vladimir] [Rudolf, Gabor] [Zhao, Jihui] | ![]() | 2008 | On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction In: Theory Comput. Syst. [43], 204-233 | Journal Article | ![]() | ||||
![]() | 14:48:46 | Administrators,LocalDomainServers,[AGEditors] | Elbassioni, Khaled Raman, Rajiv [Ray, Saurabh] [Sitters, Rene] | [Matthieu, Claire] | 2009 | 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 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 14:45:47 | Khaled Elbassioni | Elbassioni, Khaled [Tiwary, Hans Raj] | ![]() | 2008 | On a Cone Covering Problem In: Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 171-174 | Proceedings Article | ![]() | ||||
![]() | 14:41:47 | Khaled Elbassioni | [Boros, Endre] Elbassioni, Khaled Gurvich, Vladimir [Makino, Kazuhisa] [Oudalov, Vladimir] | 2008 | 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 | Proceedings Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 14:36:37 | Khaled Elbassioni | [Boros, Endre] Elbassioni, Khaled [Makino, Kazuhisa] | ![]() | 2008 | On Berge Multiplication for Monotone Boolean Dualization In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, 48-59 | Proceedings Article | ![]() | ||||
![]() | 14:33:07 | Khaled Elbassioni | Elbassioni, Khaled [Hagen, Matthias] Rauf, Imran | 2008 | Some Fixed-Parameter Tractable Classes of Hypergraph Duality and Related Problems In: Parameterized and Exact Computation, Third International Workshop, IWPEC 2008, 91-102 | Proceedings Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 12:31:36 | Khaled Elbassioni | [Tiwary, Hans Raj] Elbassioni, Khaled | ![]() | 2008 | On the complexity of checking self-duality of polytopes and its relations to vertex enumeration and graph isomorphism In: Symposium on Computational Geometry 2008, 192-198 | Proceedings Article | ![]() | ||||
![]() | 16:05:10 | Marjan Celikik | Celikik, Marjan Bast, Holger Manolache, Gabriel | 2011 | ![]() | Efficient Index-Based Snippet Generation | Unpublished/Draft | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 15:57:27 | Administrators,LocalDomainServers,[AGEditors] | Celikik, Marjan Bast, Holger | [Shin, Dongwan] | 2009 | ![]() | Fast Error-Tolerant Search on Very Large Texts In: The 24th Annual ACM Symposium on Applied Computing, 1724-1731 | Proceedings Article | ![]() | |||
![]() | 17:43:29 | Magnus Wahlström | Wahlström, Magnus | [Grohe, Martin] [Niedermeier, Rolf] | 2008 | A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances In: 3rd International Workshop on Parameterized and Exact Computation (IWPEC 2008), 202-213 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 14:42:35 | Spyros Angelopoulos | Angelopoulos, Spyros [Lopez-Ortiz, Alejandro] [Hamel,Angele] | ![]() | 2008 | Optimal Scheduling of Contract Algorithms with Soft Deadlines In: 23rd National Conference on Artificial Intelligence (AAAI 2008), 868-873 | Proceedings Article | ![]() | ||||
![]() | 14:37:34 | Spyros Angelopoulos | Angelopoulos, Spyros | 2008 | A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry In: 16th Annual European Symposium on Algorithms (ESA 2008), 76-87 | Proceedings Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 14:35:00 | Spyros Angelopoulos | Angelopoulos, Spyros [Dorrigiv, Reza] [Lopez-Ortiz, Alejandro] | ![]() | 2008 | List Update with Locality of Reference In: 8th Latin American Symposium on Theoretical Informatics (LATIN 2008), 399-410 | Proceedings Article | ![]() | ||||
![]() | 14:29:42 | Administrators,LocalDomainServers,[AGEditors] | Angelopoulos, Spyros Schweitzer, Pascal | [Mathieu, Claire] | 2009 | Paging and List Update under Bijective Analysis In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 1136-1145 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 13:59:16 | Frank Neumann | Neumann, Frank [Reichel, Joachim] | [Rudolph, Günter] [Jansen, Thomas] [Lucas, Simon M.] [Poloni, Carlo] [Beume, Nicola] | 2008 | Approximating Minimum Multicuts by Evolutionary Multi-Objective Algorithms In: Parallel Problem Solving from Nature (PPSN X), 72-81 | Proceedings Article | ![]() | ||||
![]() | 13:55:44 | Frank Neumann | [Brockhoff, Dimo] Friedrich, Tobias Neumann, Frank | [Rudolph, Günter] [Jansen, Thomas] [Lucas, Simon M.] [Poloni, Carlo] [Beume, Nicola] | 2008 | Analyzing Hypervolume Indicator Based Algorithms In: Parallel Problem Solving from Nature (PPSN X), 651-660 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 13:52:04 | Frank Neumann | [Kroeske, Jense] [Ghandar, Adam] [Michalewicz, Zbigniew] Neumann, Frank | [Rudolph, Günter] [Jansen, Thomas] [Lucas, Simon M.] [Poloni, Carlo] [Beume, Nicola] | 2008 | Learning Fuzzy Rules with Evolutionary Algorithms - An Analytic Approach In: Parallel Problem Solving from Nature (PPSN X), 1051-1060 | Proceedings Article | ![]() | ||||
![]() | 13:48:12 | Frank Neumann | Friedrich, Tobias [Horoba, Christian] Neumann, Frank | [Rudolph, Günter] [Jansen, Thomas] [Lucas, Simon M.] [Poloni, Carlo] [Beume, Nicola] | 2008 | Runtime Analyses for Using Fairness in Evolutionary Multi-Objective Optimization In: Parallel Problem Solving from Nature (PPSN X), 671-680 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 11:14:11 | Frank Neumann | Neumann, Frank [Sudholt, Dirk] [Witt, Carsten] | [Dorigo, Marco] [Birattari, Mauro] [Blum, Christian] [Clerc, Maurice] [Stützle, Thomas] [Winfield, Alan F. T.] | 2008 | Rigorous Analyses for the Combination of Ant Colony Optimization and Local Search In: International Conference on Ant Colony Optimization and Swarm Intelligence 2008, 132-143 | Proceedings Article | ![]() | ||||
![]() | 11:06:39 | Frank Neumann | [Horoba, Christian] Neumann, Frank | [Ryan, Conor] [Keijzer, Maarten] | 2008 | Benefits and Drawbacks for the Use of epsilon-Dominance in Evolutionary Multi-Objective Optimization In: Genetic and Evolutionary Computation Conference 2008, 641-680 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 11:02:01 | Frank Neumann | Neumann, Frank [Reichel, Joachim] [Skutella, Martin] | [Ryan, Conor] [Keijzer, Maarten] | 2008 | Computing Minimum Cuts by Randomized Search Heuristics In: Genetic and Evolutionary Computation Conference 2008, 779-786 | Proceedings Article | ![]() | ||||
![]() | 10:42:51 | Frank Neumann | [Diedrich, Florian] [Kehden, Britta] Neumann, Frank | [Berghammer, Rudolf] [Möller, Bernhard] [Struth, Georg] | 2008 | Multi-objective Problems in Terms of Relational Algebra In: Relations and Kleene Algebra in Computer Science 2008, 84-98 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 10:31:55 | Frank Neumann | Neumann, Frank [Witt, Carsten] | [Maniezzo, Vittorio] [Battiti, Roberto and] [Watson, Jean-Paul] | 2008 | Ant Colony Optimization and the Minimum Spanning Tree Problem In: International Conference on Learning and Intelligent Optimization 2007, 153-166 | Proceedings Article | ![]() | ||||
42 |
|
| ![]() | ||||||||||||
![]() | ![]() | ![]() | ![]() | 15:57:19 | Benjamin Doerr | ![]() | [Keizer, Marten] [Antoniol, Giulio] [Congdon, Clare] [Deb, Kalyanmoy] Doerr, Benjamin [Hansen, Nikolaus] [Holmes, John] [Hornby, Gergory] [Howard, Daniel] [Kennedy, John] [Kumar, Sanjeev] [Lobo, Ferdinando] [Miller, Julian] [Moore, Jason] Neumann, Frank [Pelikan, Martin] [Pollack, Jordan] [Sastry, Kumara] [Stanley, Ken] [Stoica, Adrian] [Talbi, El Ghazli] [Wegener, Ingo] | 2008 | GECCO 2008: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation | Proceedings | ![]() | ||||
![]() | 15:41:42 | Benjamin Doerr | [Thierens, Dirk] [Beyer, Hans-Georg] [Bongard, Joshua] [Branke, Juergen] [Clark, John] [Cliff, Dave] [Congdon, Clare] [Deb, Kalyanmoy] Doerr, Benjamin [Kovacs, Tim] [Kumar, Sanjeev] [Miller, Julian] [Moore, Jason] Neumann, Frank [Pelikan, Martin] [Poli, Ricardo] [Sastry, Kumara] [Stanley, Ken] [Stützle, Thomas] [Watson, Richard] [Wegener, Ingo] | 2007 | GECCO 2007: Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation | Proceedings | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 11:08:50 | Administrators,LocalDomainServers,[AGEditors] | [Bansal, Nikhil] Chan, Ho-Leung [Pruhs, Kirk] | [Mathieu, Claire] | 2009 | Speed Scaling with an Arbitrary Power Function In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 693-701 | Proceedings Article | ![]() | ||||
![]() | 11:04:07 | Administrators,LocalDomainServers,[AGEditors] | [Bansal, Nikhil] Chan, Ho-Leung | [Mathieu, Claire] | 2009 | 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 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 15:05:29 | Michael Hemmer | Hemmer, Michael | ![]() | 2008 | ![]() | Exact Computation of the Adjacency Graph of an Arrangement of Quadrics Johannes Gutenberg-Universität Mainz | Thesis - PhD thesis | ![]() | |||
![]() | 14:43:57 | Michael Hemmer | [Emiris, Ioannis] Hemmer, Michael [Tsigaridas, Elias] [Tzoumas, Georg] | 2008 | Voronoi diagram of ellipses: CGAL-based implementation | Report | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 14:37:43 | Michael Hemmer | Hemmer, Michael [Limbach, Sebastian] | ![]() | 2008 | Arrangements of quadrics in 3D: continued work on experimental implementation | Report | ![]() | ||||
![]() | 14:31:32 | Michael Hemmer | [Emiris,Ioannis] Hemmer, Michael [Karavelas, Menelaos] [Limbach, Sebastian] [Mourrain, Bernard] [Tsigaridas, Elias] [Zafeirakopoulos,Zafeirakis] | 2008 | Cross-benchmarks of univariate algebraic kernels | Report | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 14:28:45 | Michael Hemmer | Hemmer, Michael | ![]() | 2008 | Evaluation of different approaches in 3D curved kernel for arrangements of quadrics | Report | ![]() | ||||
![]() | 14:21:13 | Michael Hemmer | Hemmer, Michael | 2008 | CGAL package for modular arithmetic operations | Report | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 14:18:30 | Michael Hemmer | Hemmer, Michael | ![]() | 2008 | CGAL package: Algebraic Foundations | Report | ![]() | ||||
![]() | 14:11:58 | Michael Hemmer | Hemmer, Michael [Limbach, Sebastian] | 2007 | Benchmarks on a generic univariate algebraic kernel | Report | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 14:07:07 | Michael Hemmer | Hemmer, Michael [Hülse, Dominik] | ![]() | 2007 | Traits classes for polynomial gcd computation over algebraic extensions | Report | ![]() | ||||
![]() | 13:59:55 | Administrators,LocalDomainServers,[AGEditors] | Berberich, Eric Hemmer, Michael [Karavelas, Menelaos] [Pion, Sylvain] [Teillaud, Monique] [Tsigaridas, Elias] | 2008 | Prototype implementation of the algebraic kernel | Report | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 13:56:14 | Michael Hemmer | Hemmer, Michael [Dupont, Laurent] [Petitjean, Sylvain] [Schömer, Elmar] | ![]() | 2008 | Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangment of Quadrics | Report | ![]() | ||||
![]() | 13:40:52 | Michael Hemmer | [Dupont, Laurent] Hemmer, Michael [Petitjean, Sylvain] [Schömer, Elmar] | [Arge, Lars] [Hoffmann, Michael] [Welzl, Emo] | 2007 | ![]() | Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics In: 15th Annual European Symposium on Algorithms, 633-644 | Proceedings Article | ![]() | ||||||
![]() | ![]() | ![]() | ![]() | 09:19:46 | Süntje Böttcher | Doerr, Benjamin [Gnewuch, Michael] [Kritzer, Peter] [Pillichshammer, Friedrich] | ![]() | 2008 | Component-by-component construction of low-discrepancy point sets of small size In: Monte Carlo Methods and Applications [14], 129-149 | Journal Article | ![]() | ||||
![]() | 08:52:09 | Süntje Böttcher | Doerr, Benjamin [Gnewuch, Michael] | [Keller, Alexander] [Heinrich, Stefan] [Niederreiter, Harald] | 2008 | 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 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 14:34:22 | Süntje Böttcher | Doerr, Benjamin Happ, Edda | ![]() | 2008 | Directed trees: A Powerful Representation for Sorting and Ordering Problems In: Proceedings of CEC 2008, 3606-3613 | Proceedings Article | ![]() | ||||
![]() | 13:43:23 | Süntje Böttcher | Doerr, Benjamin [Jansen, Thomas] [Klein, Christian] | [Ryan, Conor] [Keijzer, Maarten] | 2008 | Comparing local and global mutations on bit-strings. In: Genetic and Evolutionary Computation Conference 2008, 929-936 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 11:33:31 | Edda Happ | Happ, Edda Johannsen, Daniel Klein, Christian Neumann, Frank | [Ryan, Conor] [Keijzer, Maarten] | 2008 | ![]() | Rigorous Analyses of Fitness-Proportional Selection for Optimizing Linear Functions In: Genetic and Evolutionary Computation Conference 2008, 953-960 | Proceedings Article | ![]() | |||
![]() | 11:24:08 | Edda Happ | Doerr, Benjamin Happ, Edda Klein, Christian | [Ryan, Conor] [Keijzer, Maarten] | 2008 | Crossover Can Provably be Useful in Evolutionary Computation In: Genetic and Evolutionary Computation Conference 2008, 539-546 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 16:53:50 | Administrators,LocalDomainServers,[AGEditors] | Chan, T.-H. Hubert [Gupta, Anupam] | ![]() | 2009 | Small Hop-diameter Sparse Spanners for Doubling Metrics In: Discrete and Computational Geometry [41], 28-44 | Journal Article | ![]() | ||||
![]() | 14:38:32 | Khaled Elbassioni,Erik Krohn,Domagoj Matijevic,Julián Mestre,Domagoj Severdija,[Library],[Department],Susanne Albers,Jean-Yves Marion | Elbassioni, Khaled [Krohn, Erik] [Matijevic, Domagoj] Mestre, Julián [Severdija, Domagoj] | [Albers, Susanne] [Marion, Jean-Yves] | 2009 | Improved Approximation Algorithms for 1.5D Terrain Guarding In: Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS), 361-371 | Electronic Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 12:32:13 | Daniel Dumitriu | Dumitriu, Daniel [Funke, Stefan] Kutz, Martin [Milosavljevic, Nikola] | [Petitjean, Sylvain] | 2008 | On the Locality of Extracting a 2-Manifold in $R^3$ In: Collection of abstracts of the 24th European Workshop on Computational Geometry, 205-208 | Proceedings Article | ![]() | ||||
![]() | 13:44:41 | Rob van Stee | [Epstein, Leah] van Stee, Rob | [Kaklamanis, Christos] [Skutella, Martin] | 2008 | ![]() | On the Online Unit Clustering Problem In: Approximation and Online Algorithms, 5th International Workshop, WAOA 2007, 193-206 | Proceedings Article | ![]() | ||||||
![]() | ![]() | ![]() | ![]() | 13:40:55 | Rob van Stee | [Epstein, Leah] van Stee, Rob | [Kaklamanis, Christos] [Skutella, Martin] | 2008 | ![]() | Approximation schemes for packing splittable items with cardinality constraints In: Approximation and Online Algorithms, 5th International Workshop, WAOA 2007, 232-245 | Proceedings Article | ![]() | |||
![]() | 13:33:32 | Rob van Stee | van Stee, Rob | 2008 | ![]() | Combinatorial algorithms for packing and scheduling problems Universität Karlsruhe | Thesis - Habilitation thesis | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 13:25:46 | Rob van Stee | [Pruhs, Kirk] van Stee, Rob [Uthaisombut, Patchrawat] | ![]() | 2008 | ![]() | Speed Scaling of Tasks with Precedence Constraints In: Theory of Computing Systems [43], 67-80 | Journal Article | ![]() | |||
![]() | 13:20:45 | Rob van Stee | [Epstein, Leah] [Levin, Asaf] van Stee, Rob | 2008 | ![]() | Online unit clustering: Variations on a theme In: Theoretical Computer Science [407], 85-96 | Journal Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 13:15:46 | Rob van Stee | [Krumke, Sven Oliver] [Schwahn, Anne] van Stee, Rob [Westphal, Stephan] | ![]() | 2008 | ![]() | A monotone approximation algorithm for scheduling with precedence constraints In: Operations Research Letters [36], 247-249 | Journal Article | ![]() | |||
![]() | 13:03:13 | Rob van Stee | [Epstein, Leah] [Levin, Asaf] van Stee, Rob | 2008 | ![]() | Two-dimensional packing with conflicts In: Acta Informatica [45], 155-175 | Journal Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 12:55:53 | Rob van Stee | van Stee, Rob | [Kao, Ming-Yang] | 2008 | ![]() | Paging In: Encyclopedia of Algorithms, 1-99 | Part of a Book | ![]() | |||
![]() | 12:53:47 | Rob van Stee | van Stee, Rob | [Kao, Ming-Yang] | 2008 | ![]() | Packet Switching in Single Buffer In: Encyclopedia of Algorithms, 1-99 | Part of a Book | ![]() | ||||||
![]() | ![]() | ![]() | ![]() | 12:48:03 | Rob van Stee | [Epstein, Leah] van Stee, Rob | [Laber, Eduardo Sany] [Bornstein, Claudson] [Noguiera, Loana Tito] [Faria, Luerbio] | 2008 | ![]() | Maximizing the minimum load for selfish agents In: LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, 264-275 | Proceedings Article | ![]() | |||
![]() | 12:39:52 | Rob van Stee | [Epstein, Leah] van Stee, Rob | [Monien, Burkhard] [Schroeder, Ulf-Peter] | 2008 | ![]() | The price of anarchy on uniformly related machines revisited In: Algorithmic Game Theory, First International Symposium, SAGT 2008, 46-57 | Proceedings Article | ![]() | ||||||
![]() | ![]() | ![]() | ![]() | 20:56:16 | Giorgos Christodoulou | Christodoulou, George | [Kao, Ming-Yang] | 2008 | Price of Anarchy In: Encyclopedia of Algorithms, 1-99 | Part of a Book | ![]() | ||||
![]() | 20:42:04 | Giorgos Christodoulou | Christodoulou, George [Koutsoupias, Elias] [Vidali, Angelina] | [Halperin, Dan] Mehlhorn, Kurt | 2008 | 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 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 20:34:09 | Giorgos Christodoulou | Christodoulou, George [Kovács, Annamária] [Schapira, Michael] | [Aceto, Luca] [Damg{\aa}rd, Ivan] [Goldberg, Leslie Ann] [Halldórsson, Magnús M.] [Ingólfsdóttir, Anna] [Walukiewicz, Igor] | 2008 | Bayesian Combinatorial Auctions In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I, 820-832 | Proceedings Article | ![]() | ||||
![]() | 06:03:57 | Rolf Harren | [Diedrich, Florian] Harren, Rolf [Jansen, Klaus] [Thöle, Ralf] [Thomas, Henning] | 2008 | ![]() | Approximation Algorithms for 3D Orthogonal Knapsack In: Journal of Science and Technology [23], 749-762 | Journal Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 05:48:23 | Rolf Harren | Harren, Rolf van Stee, Rob | [Gudmundsson, Joachim] | 2008 | ![]() | Packing Rectangles into 2 OPT Bins using Rotations In: 11th Scandinavian Workshop on Algorithm Theory, 306-318 | Proceedings Article | ![]() | |||
![]() | 16:57:53 | Vikram Sharma | Sharma, Vikram | 2008 | Complexity of real root isolation using continued fractions In: Theoretical Computer Science [409], 292-310 | Electronic Journal Article | ![]() | ||||||||
105 |
| ![]() | |||||||||||||
4 |
|
| ![]() | ||||||||||||
![]() | ![]() | ![]() | ![]() | 12:13:36 | Administrators,LocalDomainServers,[AGEditors] | [Kaufmann, Michael] [Mehlhorn, Kurt] | ![]() | 1984 | ![]() | Local routing of two-terminal nets is easy | Report | ![]() | |||
![]() | 12:06:29 | Anja Becker | [Hertel, Stefan] [Mehlhorn, Kurt] [Mäntylä, Martti] [Nievergelt, Jurg] | 1984 | ![]() | Space sweep solves intersection of two convex polyhedra elegantly | Report | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 09:51:16 | Administrators,LocalDomainServers,[AGEditors] | [Alt, Helmut] Mehlhorn, Kurt [Wagener, Hubert] [Welzl, Emo] | ![]() | 1987 | ![]() | Congruence, similarity and symmetries of geometric objects | Report | ![]() | |||
![]() | 09:45:05 | Administrators,LocalDomainServers,[AGEditors] | [Klein, R.] Mehlhorn, Kurt [Meiser, Stefan] | 1989 | ![]() | On the construction of abstract Voronoi diagrams, II. | Report | ![]() | |||||||
2 |
|
| ![]() | ||||||||||||
![]() | 11:08:17 | Daniel Dumitriu | Dumitriu, Daniel [Funke, Stefan] [Kutz, Martin] [Milosavljevic, Nikola] | [Gudmundsson, Joachim] | 2008 | On the Locality of Extracting a 2-Manifold in $R^3$ In: 11th Scandinavian Workshop on Algorithm Theory (SWAT-2008), 270-281 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 20:35:36 | Nicole Megow | [Froyland, Gary] [Koch, Thorsten] Megow, Nicole [Duane, Emily] [Wren, Howard] | ![]() | 2008 | Optimizing the Landside Operation of a Container Terminal In: OR Spectrum [30], 53-75 | Journal Article | ![]() | ||||
15 |
|
| ![]() | ||||||||||||
![]() | ![]() | ![]() | ![]() | 16:20:29 | Michael Kerber | Emeliyanenko, Pavel Kerber, Michael | ![]() | 2008 | ![]() | Visualizing and Exploring Planar Algebraic Arrangements - a Web Application | Report | ![]() | |||
![]() | 16:16:51 | Michael Kerber | Emeliyanenko, Pavel Kerber, Michael | 2008 | ![]() | An implementation of the 2D Algebraic Kernel | Report | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 16:11:31 | Michael Kerber | Kerber, Michael | ![]() | 2008 | ![]() | On filter methods in CGAL's 2D curved kernel | Report | ![]() | |||
![]() | 16:03:35 | Michael Kerber | Berberich, Eric Kerber, Michael | [Petitjean, Sylvain] | 2008 | ![]() | Arrangements on Surfaces of Genus One: Tori and Dupin Cyclides In: 24th European Workshop on Computational Geometry - Collection of Abstracts, 209-212 | Proceedings Article | ![]() | ||||||
![]() | ![]() | ![]() | ![]() | 15:55:56 | Michael Kerber | Berberich, Eric Kerber, Michael Sagraloff, Michael | [Petitjean, Sylvain] | 2008 | ![]() | Geometric Analysis of Algebraic Surfaces Based on Planar Arrangements In: 24th European Workshop on Computational Geometry - Collection of Abstracts, 29-32 | Proceedings Article | ![]() | |||
![]() | 15:42:14 | Michael Kerber | Emeliyanenko, Pavel Kerber, Michael | [Teillaud, Monique] [Welzl, Emo] | 2008 | ![]() | Visualizing and Exploring Planar Algebraic Arrangements -- a Web Application In: Proceedings of the 24th ACM Symposium on Computational Geometry, 224-225 | Proceedings Article | ![]() | ||||||
![]() | ![]() | ![]() | ![]() | 18:35:06 | Eric Berberich | Berberich, Eric Sagraloff, Michael | [Haines, Eric] [McGuire, Morgan] | 2008 | ![]() | A Generic and Flexible Framework for the Geometrical and Topological Analysis of (Algebraic) Surfaces In: Proceedings of the 2008 ACM Symposium on Solid and Physical Modeling, 171-182 | Proceedings Article | ![]() | |||
![]() | 18:32:10 | Eric Berberich | Berberich, Eric Kerber, Michael Sagraloff, Michael | [Teillaud, Monique] [Welzl, Emo] | 2008 | ![]() | Exact Geometric-Topological Analysis of Algebraic Surfaces In: Proceedings of the 24th ACM Symposium on Computational Geometry, 164-173 | Proceedings Article | ![]() | ||||||
![]() | ![]() | ![]() | ![]() | 18:23:00 | Eric Berberich | Berberich, Eric Kerber, Michael | [Haines, Eric] [McGuire, Morgan] | 2008 | ![]() | Exact Arrangements on Tori and Dupin Cyclides In: Proceedings of the 2008 ACM Symposium on Solid and Physical Modeling, 59-66 | Proceedings Article | ![]() | |||
![]() | 14:58:56 | Julian Mestre | Zotenko, Elena Mestre, Julián O'Leary, Dianne Przytyzka, Teresa | 2008 | Essential Complex Biological Modules Explain the Centrality-Lethality Rule In: PLoS Computational Biology [x], x-x | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 14:54:47 | Julian Mestre | [Khuller, Samir] Mestre, Julián | ![]() | 2008 | An Optimal Incremental Algorithm for Minimizing Lateness with Rejection In: 16th Annual European Symposium on Algorithms (ESA), 601-610 | Proceedings Article | ![]() | ||||
![]() | 14:52:31 | Julian Mestre | Althaus, Ernst Canzar, Stefan Elbassioni, Khaled Karrenbauer, Andreas Mestre, Julián | 2008 | Approximating the Interval Constrained Coloring Problem In: 11th Scandinavian Workshop on Algorithm Theory (SWAT), 210-221 | Proceedings Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 14:43:38 | Julian Mestre | Mestre, Julián | ![]() | 2008 | Lagrangian Relaxation and Partial Cover (Extended Abstract) In: 25th International Symposium on Theoretical Aspects of Computer Science (STACS), 539-550 | Proceedings Article | ![]() | ||||
![]() | 14:40:19 | Julian Mestre | Mestre, Julián | 2008 | Adaptive Local Ratio In: 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 152-160 | Proceedings Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 14:32:15 | Administrators,LocalDomainServers,[AGEditors] | [Gandhi, Rajiv] Mestre, Julián | ![]() | 2009 | Combinatorial Algorithms for Data Migration to Minimize Average Completion Time In: Algorithmica [54], 54-71 | Journal Article | ![]() | ||||
5 |
|
| ![]() | ||||||||||||
![]() | ![]() | ![]() | ![]() | 12:56:20 | Daniel Johannsen | Doerr, Benjamin Johannsen, Daniel [Tang, Ching Hoo] | [Günter Rudolph] [Thomas Jansen] [Simon M. Lucas] [Carlo Poloni] [Nicola Beume] | 2008 | ![]() | How Single Ant ACO Systems Optimize Pseudo-Boolean Functions In: Parallel Problem Solving from Nature – PPSN X, 378-388 | Proceedings Article | ![]() | |||
![]() | 16:38:50 | Ulrich Meyer | Ajwani, Deepak [Malinger, Itay] [Meyer, Ulrich] [Toledo, Sivan] | [McGeoch, Catherine] | 2008 | 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 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 16:30:10 | Ulrich Meyer | [Meyer, Ulrich] | ![]() | 2008 | On Trade-Offs in External-Memory Diameter Approximation In: Proc. 11th Scandinavian Workshop on Algorithm Theory (SWAT), xxx-yyyy | Proceedings Article | ![]() | ||||
![]() | 16:15:21 | Ulrich Meyer | [Meyer, Ulrich] | [Albers, Susanne] [Weil, Pascal] [Rochange, Christine] | 2008 | On Dynamic Breadth-First Search in External-Memory In: Proc. 25th Annual Symposium on Theoretical Aspects (STACS), 551-560 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 11:14:19 | Kevin Chang | Chang, Kevin [Johnson, Aaron] | ![]() | 2008 | ![]() | Online and offline selling in limit order markets In: 4th International Workshop on Internet and Network Economics (WINE 2008), 41-52 | Proceedings Article | ![]() | |||
3 |
|
| ![]() | ||||||||||||
![]() | ![]() | ![]() | ![]() | 13:58:18 | Anja Becker | Karrenbauer, Andreas | ![]() | 2007 | ![]() | Engineering combinatorial optimization algorithms to improve the lifetime of OLED displays Universität des Saarlandes | Thesis - PhD thesis | ![]() | |||
![]() | 13:21:12 | Anja Becker | Weber, Ingmar | 2007 | ![]() | Efficient Index Structures for and Applications of the CompleteSearch Engine Universität des Saarlandes | Thesis - PhD thesis | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 13:09:49 | Anja Becker | Matijevic, Domagoj | ![]() | 2007 | ![]() | Geometric Optimization and Querying - Exact and Approximate Universität des Saarlandes | Thesis - PhD thesis | ![]() | |||
18 |
|
| ![]() | ||||||||||||
![]() | ![]() | ![]() | ![]() | 09:55:24 | Anja Becker | Mehlhorn, Kurt | [Dress, Andreas] [Xu, Yinfeng] [Zhu, Binhai] | 2007 | ![]() | Matchings in Graphs Variations of the Problem In: Combinatorial Optimization and Applications : First International Conference, COCOA 2007, 1-2 | Proceedings Article | ![]() | |||
![]() | 09:44:14 | Anja Becker | Mehlhorn, Kurt | Kucera, Ludek Kucera, Antonín | 2007 | ![]() | Minimum Cycle Bases in Graphs Algorithms and Applications In: Mathematical Foundations of Computer Science 2007 : 32nd International Symposium, MFCS 2007, 13-14 | Proceedings Article | ![]() | ||||||
![]() | ![]() | ![]() | ![]() | 11:28:59 | Anja Becker | Christodoulou, George [Gourves, Laurent] [Pascual, Fanny] | [Lin, Guohui] | 2007 | ![]() | Scheduling Selfish Tasks: About the Performance of Truthful Algorithms In: Computing and Combinatorics : 13th Annual International Conference, COCOON 2007, 187-197 | Proceedings Article | ![]() | |||
![]() | 10:55:58 | Anja Becker | Behle, Markus [Jünger, Michael] [Liers, Frauke] | [Demetrescu, Camil] | 2007 | ![]() | A Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem In: Experimental Algorithms : 6th International Workshop, WEA 2007, 379-392 | Proceedings Article | ![]() | ||||||
![]() | ![]() | ![]() | ![]() | 10:38:01 | Anja Becker | Behle, Markus | [Dress, Andreas] [Xu, Yinfeng] [Zhu, Binhai] | 2007 | ![]() | On threshold BDDs and the optimal variable ordering problem In: Combinatorial Optimization and Applications : First International Conference, COCOA 2007, 124-135 | Proceedings Article | ![]() | |||
![]() | 12:27:24 | Anja Becker | Michail, Dimitrios | 2007 | Reducing rank-maximal to maximum weight matching In: Theoretical Computer Science [389], 125-132 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 11:21:59 | Anja Becker | Govindarajan, Sathish [Dietze, Michael C.] [Agarwal, Pankaj K.] [Clark, James S.] | ![]() | 2008 | ![]() | A scalable algorithm for dispersing population In: Journal of Intellingent Information Systems [29], 39-61 | Journal Article | ![]() | |||
![]() | 14:46:36 | Anja Becker | [Epstein, Leah] Kesselman, Alexander | 2006 | On the remote server problem or more about TCP acknowledgments In: Theoretical Computer Science [369], 285 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 14:24:27 | Anja Becker | Eisenbrand, Friedrich [Funke, Stefan] Karrenbauer, Andreas Reichel, Joachim [Schömer, Elmar] | ![]() | 2007 | Packing a truck - Now with a twist! In: International Journal of Computational Geometry & Applications [17], 505-527 | Journal Article | ![]() | ||||
![]() | 14:07:58 | Anja Becker | Doerr, Benjamin | 2007 | Roundings respecting hard constraints In: Theory of Computing Systems [40], 467-483 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 13:27:51 | Anja Becker | [Chrobak, Marek] [Gasieniec, Leszek] Kowalski, Dariusz R. | ![]() | 2007 | The wake-up problem in multihop radio networks In: SIAM Journal on Computing [36], 1453-1471 | Journal Article | ![]() | ||||
![]() | 15:08:21 | Anja Becker | [Caragiannis, Ioannis] Fishkin, Aleksei V. [Kaklamanis, Christos] [Papaioannou, Evi] | [Kratochvíl, Jan] [Díaz, Josep] [Fiala , Jiří] | 2007 | Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs In: 29th Symposium on Mathematical Foundations of Computer Science MFCS 2004, 119-136 | Proceedings Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 15:00:39 | Anja Becker | [Caragiannis, Ioannis] Fishkin, Aleksei V. [Kaklamanis, Christos] [Papaioannou, Evi] | ![]() | 2007 | A tight bound for online colouring of disk graphs In: Theoretical Computer Science [384], 152-160 | Journal Article | ![]() | ||||
![]() | 14:50:45 | Anja Becker | [Bodirsky, Manuel] Kutz, Martin | 2007 | Determining the consistency of partial tree descriptions In: Artificial Intelligence [171], 185-196 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 12:20:19 | Anja Becker | Baswana, Surender [Sen, Sandeep] | ![]() | 2007 | A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs In: Random Structures & Algorithms [30], 532-563 | Journal Article | ![]() | ||||
![]() | 10:04:50 | Anja Becker | [Abraham, David J.] [Irving, Robert W.] [Kavitha, Telikepalli] Mehlhorn, Kurt | 2007 | ![]() | Popular Matchings In: SIAM Journal on Computing [37], 1030-1045 | Journal Article | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 14:36:43 | Anja Becker | Kavitha, Telikepalli Mehlhorn, Kurt | ![]() | 2007 | ![]() | Algorithms to compute minimum cycle basis in directed graphs In: Theory of Computing Systems [40], 485-505 | Journal Article | ![]() | |||
![]() | 13:37:45 | Anja Becker | Kettner, Lutz Mehlhorn, Kurt [Pion, Sylvain] [Schirra, Stefan] [Yap, Chee] | 2008 | ![]() | Classroom Examples of Robustness Problems in Geometric Computations In: Computational Geometry: Theory and Applications [40], 61-78 | Journal Article | ![]() | |||||||
58 |
|
| ![]() | ||||||||||||
![]() | 22:11:28 | Daniel Dumitriu | Dumitriu, Daniel [Funke, Stefan] [Kutz, Martin] [Milosavljevic, Nikola] | 2008 | How much Geometry it takes to Reconstruct a 2-Manifold in $R^3$ In: 10th Workshop on Algorithm Engineering and Experiments (ALENEX-2008), 65-74 | Proceedings Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 17:19:25 | Holger Bast | Bast, Holger [Majumdar, Debapriyo] Weber, Ingmar | [Mário J. Silva] [Alberto H. F. Laender] [Ricardo A. Baeza-Yates] [Deborah L. McGuinness] [Bj{\o}rn Olstad] [{\O}ystein Haug Olsen] [André O. Falc{\~a}o] | 2007 | Efficient interactive query expansion with CompleteSearch In: 16th Conference on Information and Knowledge Management (CIKM'07), 857-860 | Proceedings Article | ![]() | ||||
![]() | 16:33:44 | Joachim Giesen | Giesen, Joachim | 2008 | The Flow Complex: A Data Structure for Geometric Modeling In: Computational Geometry - Theory and Applications [39], 178-190 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 16:30:54 | Joachim Giesen | Giesen, Joachim | ![]() | 2007 | Medial Axis Approximation from Inner Voronoi Balls: A Demo of the Mesecina Tool In: 23d Annual ACM Symposium on Computational Geometry, 123-124 | Proceedings Article | ![]() | ||||
![]() | 16:27:30 | Joachim Giesen | Giesen, Joachim [Mitsche, Dieter] [Schuberth, Eva] | [Kao, Ming-Yang] [Li, Xiang-Yang] | 2007 | ![]() | Collaborative Ranking: an aggregation algorithm for individuals' preference estimation In: Algorithmic Aspects in Information and Management : Third International Conference, AAIM 2007, 58-67 | Proceedings Article | ![]() | ||||||
![]() | ![]() | ![]() | ![]() | 16:20:35 | Joachim Giesen | Giesen, Joachim | ![]() | 2008 | Conjoint Analysis for Measuring the Perceived Quality in Volume Rendering In: IEEE Transactions on Visualization and Computer Graphics [13], 1664-1671 | Journal Article | ![]() | ||||
![]() | 16:18:18 | Joachim Giesen | Giesen, Joachim | 2008 | Delaunay Triangulation Approximates Anchor Hull In: Computational Geometry - Theory and Applications [36], 131-143 | Journal Article | ![]() | ||||||||
![]() | ![]() | ![]() | ![]() | 16:16:09 | Joachim Giesen | Giesen, Joachim [Schuberth, Eva] [Simon, Klaus] [Zolliker, Peter] [Zweifel, Oliver] | ![]() | 2007 | Image-Dependent Gamut Mapping as Optimization Problem In: IEEE Transactions on Image Processing [16], 2401-2410 | Journal Article | ![]() | ||||
![]() | 16:13:36 | Joachim Giesen | Giesen, Joachim | [A. Gustafsson] [A. Herrmann] [F. Huber] | 2007 | The Combinatorial Structure of Polyhedral Choice Based Conjoint Analysis In: Conjoint Measurement: Methods and Applications, 259-271 | Part of a Book | ![]() | |||||||
![]() | ![]() | ![]() | ![]() | 11:22:57 | Khaled Elbassioni | [Khachiyan, Leonid] [Boros, Endre] Elbassioni, Khaled [Gurvich, Vladimir] | ![]() | 2007 | On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs In: Theoretical Computer Science [382], 139-150 | Journal Article | ![]() | ||||
![]() |