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

#		Year	edoc	Lck	Author(s) [non member]	Editor(s) [non member]			Title	Type	edoc identifier
2049	Veröffentlichungen der Mitarbeiter
		??			Elbassioni, Khaled [Rauf, Imran] Ray, Saurabh				On Enumerating Minimal Transversals of Geometric Hypergraphs	Unpublished/Draft	1DCBA4F223D558D0C125783B005FDF6E-Elbassioni2012d
		2015			Bei, Xiaohui	[Halldórsson, Magnús M.] [Iwama, Kazuo] [Kobayashi, Naoki] [Speckmann, Bettina]			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	4FB88AA6E668C99CC1257EAB003C8656-Bei2015
		2015			Heydrich, Sandy [van Stee, Rob]				Dividing Connected Chores Fairly In: Theoretical Computer Science [593], 51-61	Journal Article	84C1ABFA4840CFE7C125807C004E9B4A-Heydrich2015
		2015			Issac, Davis	[Xu, Dachuan] [Du, Donglei] [Du, Dingzhu]			Sampling in Space Restricted Settings In: Computing and Combinatorics 2015,	Proceedings Article	DE76CDA0D188B19EC1257EA7005D5DAA-Issac2015Sampling
		2014			[Babenko, Maxim A.] [Gawrychowski, Pawel] [Kociumaka, Tomasz] [Starikovskaya, Tatiana A.]	[Kulikov, Alexander S.] [Kuznetsov, Sergei O.] [Pevzner, Pavel A.]			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	1EB35564068B5D62C1257D7F004BCCF3-Gawrychowski2014d
		2014			Bringmann, Karl [Sauerwald, Thomas] [Stauffer, Alexandre] Sun, He				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	A1B6FCFD9FF36BCCC1257C63005E6E67-BringmannSSS14
		2014			Croitoru, Cosmina Kötzing, Timo				A Normal Form for Argumentation Frameworks In: Theory and Applications of Formal Argumentation (TAFA'13), 32-45	Proceedings Article	58C203815D4A239AC1257C6900836289-croikotzi13
		2014			[Diekert, Volker] Jez, Artur [Plandowski, Wojciech]	[Hirsch, Edward] [Kuznetsov, Sergei] [Pin, Jean-Eric] [Vereshchagin, Nikolai]			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	06EAEEE68D65008FC1257D9A00496BC1-Jez2014CSR
		2014			Doerr, Benjamin Winzen, Carola				Ranking-Based Black-Box Complexity In: Algorithmica [?], ?	Journal Article	9AEA2B67A0E46252C1257ACD003FECFD-DoerrW12Ranking
		2014			[Fekete, Sándor P.] [Fiethe, Björn] [Friedrichs, Stephan] [Michalik, Harald] [Orlis, Christos]				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	5D1D1DF68DB7BC0EC1257D6B00477D47-fffmo-eropmoffsi-14
		2014			[Friedrichs, Stephan] [Kulau, Ulf] [Wolf, Lars]				Energy-efficient voltage scheduling of peripheral components on wireless sensor nodes In: Communications Workshops (ICC), 2014 IEEE International Conference on, 860-865	Proceedings Article	D258C4C70A73E96FC1257D6B004DDE1E-fkw-eevsopcowsn-14
		2014			[Gagie, Travis] Gawrychowski, Pawel [Kärkkäinen, Juha] [Nekrich, Yakov] [Puglisi, Simon J.]	[Parso, Alberto] [Viola, Alfredo]			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	E9BAFC799FFC8D45C1257D7F004A5D42-Gawrychowski2014a
		2014			Gawrychowski, Pawel				Simple and efficient LZW-compressed multiple pattern matching In: Journal of Discrete Algorithms [25], 34-41	Journal Article	048173F8FDC78C94C1257D7F004C3A76-Gawrychowski2014e
		2014			Gawrychowski, Pawel Jez, Artur [Jez, Lukasz]				Validating the Knuth-Morris-Pratt Failure Function, Fast and Online In: Theory of Computing Systems [54], 337-372	Journal Article	9B59AC753832E05EC1257D9A005FDD85-GawrychowskiJez2014
		2014			Gawrychowski, Pawel [Manea, Florin] [Nowotka, Dirk]	Mayr, Ernst W. [Portier, Natacha]			Testing Generalised Freeness of Words In: 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 337-349	Proceedings Article	89EED2F93CF7F380C1257D7F004956C6-Gawrychowski2014
		2014			Gawrychowski, Pawel [Mozes, Shay] [Weimann, Oren]	[Esparza, Javier] [Fraigniaud, Pierre] [Husfeldt, Thore] [Koutsoupias, Elias]			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	D3FD4378F508C089C1257D7F004B2B42-Gawrychowski2014b
		2014			Gawrychowski, Pawel [Uznanski, Przemyslaw]	[Kulikov, Alexander S.] [Kuznetsov, Sergei O.] [Pevzner, Pavel A.]			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	97E715B4DE9B9E5EC1257D7F004B77C8-Gawrychowski2014c
		2014			Jez, Artur				The Complexity of Compressed Membership Problems for Finite Automata In: Theory of Computing Systems [55], 685-718	Journal Article	879B51F9F2941CC5C1257D9A00553D49-Jez2012STACS
		2014			Jez, Artur	[Esparza, Javier] [Fraigniaud, Pierre] [Husfeldt, Thore] [Koutsoupia, Elias]			Context Unification is in PSPACE In: 41st International Colloquium on Automata, Languages, and Programming (ICALP 2014), 244-255	Proceedings Article	872247DA813C188AC1257D9A0048AF12-Jez2014ICALP
		2014			Jez, Artur	[Kulikov, Alexander] [Kuznetsov, Sergei] [Pevzner, Pavel]			A really Simple Approximation of Smallest Grammar In: 25th Annual Symposium on Combinatorial Pattern Matching (CPM 2014), 182-191	Proceedings Article	58F096F72C3A9029C1257D9A004D74F5-Jez2014CPM
		2014			Jez, Artur [Lohrey, Markus]	[Mayr, Ernst] [Portier, Natacha]			Approximation of smallest linear tree grammar In: 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 445-457	Proceedings Article	C3006D9A6067E32BC1257D9A0047D034-Jez2014STACS
		2014			Jez, Artur [Okhotin, Alexander]				Computational completeness of equations over sets of natural numbers In: Information and Computation [237], 56-94	Journal Article	571BB963F75896E7C1257D9A005F50B3-Jez2008ICALP
		2013			Adamaszek, Anna Wiese, Andreas				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	A2DBA4029356B423C1257C6A0055E848-AdamaszekWiese2013
		2013			[Afshani, Peyman] [Agrawal, Manindra] Doerr, Benjamin Doerr, Carola [Larsen, Kasper Green] Mehlhorn, Kurt	[Brodnik, Andrej] [López-Ortiz, Alejandro] [Raman, Venkatesh] [Viola, Alfredo]			The Query Complexity of Finding a Hidden Permutation In: Space-Efficient Data Structures, Streams, and Algorithms, 1-11	Part of a Book	20EA14F7E5BB5FE7C1257C53007A351B-Afshani2013
		2013			[Agrawal, Manindra] Saha, Chandan [Saxena, Nitin]				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	99186A05A3B58639C1257B0A006132FF-SSS13
		2013			[Alkassar, Eyad] [Böhme, Sascha] Mehlhorn, Kurt Rizkallah, Christine				A Framework for the Verification of Certifying Computations	Unpublished/Draft	8753D8F9EE253A4EC1257AEC00545A6F-VerificationCertComp12
		2013			[Alvarez, Victor] Bringmann, Karl [Ray, Saurabh] [Seidel, Raimund]				Counting Triangulations Approximately In: 25th Canadian Conference on Computational Geometry (CCCG-13), 85-89	Proceedings Article	8A105E596E0D7BB4C1257C63005E1763-AlvarezBRS13
		2013			[Anagnostopoulos, Aris] [Grandoni, Fabrizio] [Leonardi, Stefano] Wiese, Andreas				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	D472234BE6673DC0C1257C6A00553417-Anagnostopoulos2013
		2013			Anand, S Bringmann, Karl [Friedrich, Tobias] [Garg, Naveen] [Kumar, Amit]	[Fomin, Fedor V.] [Freivalds, Rūsiņš] [Kwiatkowska, Marta] [Peleg, David]			Minimizing maximum (weighted) flow-time on related and unrelated machines In: Automata, Languages, and Programming - 40th International Colloquium (ICALP-13), 13-24	Proceedings Article	5725F9EB73AB8D2BC1257C630059B812-AnandBFGK13
		2013			[Anshelevich, Elliot] [Bhardwaj, Onkar] Hoefer, Martin	[Bodlaender, Hans] [Italiano, Giuseppe]			Friendship and Stable Matching. In: 21st European Symposium on Algorithms (ESA-13), 49-60	Proceedings Article	C1F6FA480448150DC1257C6900624B41-AnshelevichBH2013
		2013			[Antoniadis, Antonios] [Huang, Chien-Chung] Ott, Sebastian [Verschae, José]	[Chatterjee, Krishnendu] [Sgall, Jiri]			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	932795468740665CC1257C600053E9EA-Ott2013
		2013			[Bannai, Hideo] Gawrychowski, Pawel [Inenaga, Shunsuke] [Takeda, Masayuki]	[Fischer, Johannes] [Sanders, Peter]			Converting SLP to LZ78 in almost Linear Time In: Combinatorial Pattern Matching, 24th Annual Symposium (CPM 2013), 38-49	Proceedings Article	4C54E1111438BCD7C1257C6A0052F8BE-Gawrychowski2013converting
		2013			Berberich, Eric Emeliyanenko, Pavel Kobel, Alexander Sagraloff, Michael				Exact symbolic–numeric computation of planar algebraic curves In: Theoretical Computer Science [491], 1-32	Journal Article	FBA5865E6C876B20C1257C6000518688-Berberich20131
		2013			[Bonifaci, Vincenzo] [Marchetti-Spaccamela, Alberto] Megow, Nicole Wiese, Andreas				Polynomial-Time Exact Schedulability Tests for Harmonic Real-Time Tasks In: Proceedings of the 34th IEEE Real-Time Systems Symposium (RTSS 2013),	Proceedings Article	3A7E4E1F2212DA18C1257C6A00561143-Bonifaci2013b
		2013			[Bonifaci, Vincenzo] [Marchetti-Spaccamela, Alberto] [Stiller, Sebastian] Wiese, Andreas				Feasibility Analysis in the Sporadic DAG Task Model In: Proceedings of the 25th Euromicro Conference on Real-Time Systems (ECRTS 2013),	Proceedings Article	7DAF2265BDC2BA6EC1257C6A0055B6C5-Bonifaci2013
		2013			Bringmann, Karl	[Chatterjee, Krishnendu] [Sgall, Jirí]			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	67CCE8C96EF2A3BCC1257C63005D2CF5-Bringmann13
		2013			Bringmann, Karl Doerr, Benjamin Neumann, Adrian [Sliacan, Jakub]	[Fomin, Fedor V.] [Freivalds, Rūsiņš] [Kwiatkowska, Marta] [Peleg, David]			Online Checkpointing with Improved Worst-Case Guarantees In: Automata, Languages, and Programming - 40th International Colloquium (ICALP 2013), 255-266	Proceedings Article	BB61EAD3E470681BC1257C5C003870CB-BringmannDoerrNeumannSliacan2013
		2013			Bringmann, Karl [Engels, Christian] [Manthey, Bodo] [Raghavendra Rao, B. V.]	[Chatterjee, Krishnendu] [Sgall, Jirí]			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	668CC45372505137C1257C63005CEBF7-BringmannEMR13
		2013			Bringmann, Karl [Friedrich, Tobias]				Approximation Quality of the Hypervolume Indicator In: Artificial Intelligence [195], 265–290	Journal Article	D0EDAA3A44A164B5C1257C63005ED497-BringmannFjournal13
		2013			Bringmann, Karl [Friedrich, Tobias]				Parameterized Average-Case Complexity of the Hypervolume Indicator In: 15th Annual Conference on Genetic and Evolutionary Computation (GECCO-13), 575-582	Proceedings Article	2781A9BD66C93660C1257C63005932A4-BringmannF13
		2013			Bringmann, Karl [Friedrich, Tobias]	[Fomin, Fedor V.] [Freivalds, Rūsiņš] [Kwiatkowska, Marta] [Peleg, David]			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	1BCC0A43E12C31ABC1257C63005A31EC-BringmannF13-2
		2013			Bringmann, Karl [Friedrich, Tobias] [Igel, Christian] [Voß, Thomas]				Speeding Up Many-Objective Optimization by Monte Carlo Approximations In: Artificial Intelligence [204], 22–29	Journal Article	763653A79EED520AC1257C6300600BB9-BringmannFIV13
		2013			Bringmann, Karl [Green Larsen, Kasper]				Succinct Sampling from Discrete Distributions In: 45th ACM Symposium on Theory of Computing (STOC-13), 775-782	Proceedings Article	E271DD01C0D95601C1257B17004BB405-BringmannGL
		2013			[Cai, Jin-Yi] [Lu, Pinyan] Xia, Mingji				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	FDC5AB73FD748103C1257B09002746A5-Xia2013-soda-clx
		2013			[Chen, Xujin] [Epstein, Leah] [Kleiman, Elena] van Stee, Rob				Maximizing the minimum load: The cost of selfishness In: Theoretical Computer Science [482], 9-19	Journal Article	E0342BBB606EC47FC1257C600051E860-ChEpKS13
		2013			[Christodoulou, George] [Kovacs, Annamaria] van Stee, Rob				A truthful constant approximation for maximizing the minimum load on related machines In: Theoretical Computer Science [489-490], 88-98	Journal Article	9CD70DF21115C1C0C1257C6000519706-ChKoSt2013
		2013			[Clementi, Andrea] [Crescenzi, Pierluigi] Doerr, Carola [Fraigniaud, Pierre] [Isopi, Marc] [Panconesi, Alessandro] [Pasquale, Francesco] [Silvestri, Riccardo]				Rumor Spreading in Random Evolving Graphs In: Proc. of the 21st European Symposium on Algorithms (ESA 2013), 325-336	Proceedings Article	3683279B57173DB3C1257C600052E59B-Winzen2013z
		2013			[Clementi, Andrea] [Crescenzi, Pierluigi] Doerr, Carola [Fraigniaud, Pierre] [Pasquale, Francesco] [Silvestri, Riccardo]				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	867E6724F096D4EBC1257C600072444D-DynamicGraphRumor
		2013			Croitoru, Cosmina				Abstract Debates In: IEEE International Conference on Tools with Artificial Intelligence (ICTAI) - 2013,	Proceedings Article	6EDDE5B2DE06F2E0C1257C6A00020C12-croi13
		2013			[Curticapean, Radu] Künnemann, Marvin	[Bodlaender, Hans L.] [Italiano, Giuseppe F.]			A Quantization Framework for Smoothed Analysis of Euclidean Optimization Problems In: 21st Annual European Symposium on Algorithms (ESA 2013), 349-360	Proceedings Article	A71CF031B5078233C1257C69004C023A-CurticapeanK2013
		2013			[Dams, Johannes] Hoefer, Martin [Kesselheim, Thomas]	[Afek, Yehuda]			Sleeping Experts in Wireless Networks In: 27th International Symposium on Distributed Computing (DISC-13), 344-357	Proceedings Article	0663F94A1C31D0F9C1257C690062A6F6-DamsHK2013
		2013			Doerr, Benjamin				Improved approximation algorithms for the Min-Max Selecting Items problem In: Information Processing Letters [113], 747-749	Journal Article	4C7BC0DB27536794C1257C5300776916-Doerr2013AppAlg
		2013			Doerr, Benjamin Doerr, Carola Ebel, Franziska				Lessons From the Black-Box: Fast Crossover-Based Genetic Algorithms In: Proc. of Genetic and Evolutionary Computation Conference (GECCO 2013), 781-788	Proceedings Article	CD2505F4E52101DBC1257C6000716FB1-DoerrDE13
		2013			Doerr, Benjamin [Goldberg, Leslie Ann]				Adaptive Drift Analysis In: Algorithmica [65], 224-250	Journal Article	EEEDAB9AEE90AFC8C1257984005B6EC8-DoerrG13algo
		2013			Doerr, Benjamin [Huber, Anna] [Levavi, Ariel]				Strong robustness of randomized rumor spreading protocols In: Discrete Applied Mathematics [161], 778-793	Journal Article	3EC1B7E39D5D1D05C1257AD0004507E9-DoerrHL13
		2013			Doerr, Benjamin [Jansen, Thomas] [Sudholt, Dirk] Winzen, Carola [Zarges, Christine]				Mutation rate matters even when optimizing monotonic functions In: Evolutionary Computation [21], 1-27	Journal Article	6C2BC07CAFCB2F51C1257AD00045B45C-DoerrJSWZ13EvCo
		2013			Doerr, Benjamin [Johannsen, Daniel] Kötzing, Timo [Neumann, Frank] [Theile, Madeleine]				More effective crossover operators for the all-pairs shortest path problem In: Theoretical Computer Science [471], 12-26	Journal Article	39E06A3D747E8472C1257AD000448E13-DoerrJKNT13
		2013			Doerr, Benjamin Kodric, Bojana Voigt, Marco				Lower bounds for the runtime of a global multi-objective evolutionary algorithm In: IEEE Congress on Evolutionary Computation, 432-439	Proceedings Article	B0B967840AB41FE8C1257C53007BFF9A-Doerr2013CECemo
		2013			Doerr, Benjamin Kötzing, Timo [Lengler, Johannes] Winzen, Carola				Black-Box Complexities of Combinatorial Problems In: Theoretical Computer Science [471], 84-106	Journal Article	635EA60BE46EBBB9C1257ACD0040C0FB-DoerrKLW13
		2013			Doerr, Benjamin Künnemann, Marvin				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	647FC8AD949A0F8FC1257C5900241CA0-DoerrK2013a
		2013			Doerr, Benjamin Künnemann, Marvin	[Blum, Christian]			How the (1+λ) Evolutionary Algorithm Optimizes Linear Functions In: 15th Annual Conference on Genetic and Evolutionary Computation Conference (GECCO '13), 1589-1596	Proceedings Article	B99C65DF116D4137C1257C5A0020AE7A-DoerrK2013b
		2013			Doerr, Benjamin Spöhel, Reto [Thomas, Henning] Winzen, Carola				Playing Mastermind with many colors In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013), 695-704	Proceedings Article	D782B05150717126C1257ACD0042784D-DoerrSTW13
		2013			Doerr, Benjamin [Sudholt, Dirk] [Witt, Carsten]				When Do Evolutionary Algorithms Optimize Separable Functions in Parallel? In: ACM/SIGEVO Foundations of Genetic Algorithms (FOGA 2013), 51-63	Proceedings Article	46FD99F393716B9FC1257AD2005C8A49-DoerrSW2013FOGA
		2013			Doerr, Carola [De Rainville, François-Michel]				Constructing Low Star Discrepancy Point Sets with Genetic Algorithms In: Proc. of Genetic and Evolutionary Computation Conference (GECCO 2013), 789-796	Proceedings Article	33AADAC322A2C7E6C1257C600052979B-DoerrDR2013
		2013			Doerr, Carola [Gnewuch, Michael] Wahlström, Magnus	[Chen, W.W.L.] [Srivastav, A.] [Travaglini, G.]			Calculation of Discrepancy Measures and Applications In: A Panorama of Discrepancy Theory, 1-55	Part of a Book	43D6DE28F67C287EC1257AF5006669F0-GnewuchWW13
		2013			Doerr, C. Schmidt, Jens M. Ramakrishna, G.				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	A841EFACC5FAA6FBC1257C60005B25E2-Doerr2013z
		2013			Duan, Ran				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	BFE7035295CDA850C1257AD900645A84-Duan2013
		2013			Elbassioni, Khaled [Chalermsook, Parinya] [Nanongkai, Danupon] Sun, He				Multi-Attribute Profit-Maximizing Pricing	Unpublished/Draft	B95BF1F23657EEFBC1257AF50064D296-Elbassioni2013a
		2013			Elbassioni, Khaled M. Makino, Kazuhisa Mehlhorn, Kurt Ramezani, Fahimeh	Du, Ding-Zhu Zhang, Guochuan			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	462364EE2334C4A9C1257C60005317D1-Ramezani2013
		2013			Elmasry, Amr Mehlhorn, Kurt Schmidt, Jens M.				Every DFS tree of a 3-connected graph contains a contractible edge In: Journal of Graph Theory [72], 112-121	Journal Article	4FE50A6D333665B3C1257AC200498D2D-Elmasry2013
		2013			[Epstein, Leah] [Levin, Asaf] van Stee, Rob	[Sanjeev Khanna]			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	B278696172DF5485C1257AB60047F733-EpLeSt13
		2013			[Fanghänel, Alexander] [Geulen, Sascha] Hoefer, Martin [Vöcking, Berthold]				Online Capacity Maximization in Wireless Networks In: Journal of Scheduling [16], 81-91	Journal Article	503E679810B6B888C1257C6900634A6A-FanghaenelGHV2013
		2013			[Fekete, Sándor P.] [Friedrichs, Stephan] [Kröller, Alexander] [Schmidt, Christiane]	[Du, Ding-Zhu] [Zhang, Guochuan]			Facets for Art Gallery Problems In: Computing and Combinatorics, 208-220	Proceedings Article	693D3028BF913216C1257D6B0044B7AE-ffks-ffagp-13
		2013			Fountoulakis, Nikolaos Panagiotou, Konstantinos				On the Insertion Time of Cuckoo Hashing In: SIAM Journal on Computing [?], ?-?	Journal Article	BA9C91C2BAA65051C1257AD400768921-FPSSICOMP2013
		2013			[Gagie, Travis] Gawrychowski, Pawel [Nekrich, Yakov]				Heaviest Induced Ancestors and Longest Common Substrings In: 25th Canadian Conference on Computational Geometry (CCCG 13), 145-150	Proceedings Article	BE3BFAFCFA3E785AC1257C6A00564B38-Gawrychowski2013ancestors
		2013			Gawrychowski, Pawel	[Bulatov, Andrei A.] [Shur, Arseny M.]			Alphabetic Minimax Trees in Linear Time In: 8th International Computer Science Symposium in Russia (CSR 2013), 36-48	Proceedings Article	E46BC80CCCD2DBCCC1257C6A0051EC25-Gawrychowski2013alphabetic
		2013			Gawrychowski, Pawel [Kucherov, Gregory] [Nekrich, Yakov] [Starikovskaya, Tatiana]	[Kurland, Oren] [Lewenstein, Moshe] [Porat, Ely]			Minimal Discriminating Words Problem Revisited In: String Processing and Information Retrieval - 20th International Symposium (SPIRE 2013),	Proceedings Article	5404B013224146AEC1257C6A00537794-Gawrychowski2013discriminating
		2013			Gawrychowski, Pawel [Manea, Florin] [Mercas, Robert] [Nowotka, Dirk] [Tiseanu, Catalin]	[Portier, Natacha] [Wilke, Thomas]			Finding Pseudo-repetitions In: 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), 257-268	Proceedings Article	56DF9B757276A653C1257C6A00506655-Gawrychowski2013
		2013			Gawrychowski, Pawel [Manea, Florin] [Nowotka, Dirk]	[Bonizzoni, Paola] [Brattka, Vasco] [Lowe, Benedikt]			Discovering Hidden Repetitions in Words In: 9th Conference on Computability in Europe (CiE 2013), 210-219	Proceedings Article	8F3945230BB78F32C1257C6A00527457-Gawrychowski2013discovering
		2013			Gawrychowski, Pawel [Straszak, Damian]	[Cai, Leizhen] [Cheng, Siu-Wing] [Lam, Tak Wah]			Beating O(nm) in Approximate LZW-Compressed Pattern Matching In: Algorithms and Computation - 24th International Symposium (ISAAC 2013), 78-88	Proceedings Article	FD2D21680E15434EC1257C6A0055C831-Gawrychowski2013beating
		2013			[Günther, Elisabeth] [Maurer, Olaf] Megow, Nicole Wiese, Andreas				A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio In: 24st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013),	Proceedings Article	44C35A19C560F0F3C1257AC5007DB018-MegowWiese-SODA2013
		2013			[Harks, Tobias] Hoefer, Martin [Klimm, Max] [Skopalik, Alexander]				Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games In: Mathematical Programming [141], 193-215	Journal Article	6F373C2487669FC5C1257C6900639975-HarksHKS2013
		2013			[Heydrich, Sandy] van Stee, Rob	[Voecking, Berthold]			Dividing connected chores fairly In: 6th International Symposium on Algorithmic Game Theory, 420-433	Proceedings Article	9B9A5BC84C3D15F5C1257C600052A71C-HeySte13
		2013			Hoefer, Martin				Local Matching Dynamics in Social Networks In: Information & Computation [222], 20-35	Journal Article	E9AF65F1E241DD20C1257C6900630AA3-Hoefer2013
		2013			Hoefer, Martin				Strategic Cooperation in Cost Sharing Games In: International Journal of Game Theory [42], 29-53	Journal Article	52A47D264C7983DBC1257C69006320FC-Hoefer-IJGT-2013
		2013			Hoefer, Martin [Kesselheim, Thomas]				Brief Announcement: Universally Truthful Secondary Spectrum Auctions In: 25th Symposium on Parallelism in Algorithms and Architectures (SPAA-13), 99-101	Proceedings Article	EF6195CBD2A68C5AC1257C690061B07A-HoeferK2013
		2013			Hoefer, Martin [Kesselheim, Thomas] [Vöcking, Berthold]				Truthfulness and Stochastic Dominance with Monetary Transfers. In: 14th Conf. Electronic Commerce (EC-13), 567-582	Proceedings Article	84EEB0CB39C78197C1257C6900606903-HoeferKV2013
		2013			Hoefer, Martin Sauerwald, Thomas				Brief Announcement: Threshold Load Balancing in Networks In: 32nd Symposium on Principles of Distributed Computing (PODC-13), 54-56	Proceedings Article	1A2139C45FD38458C1257C690061FB6B-HoeferS2013
		2013			Hoefer, Martin [Skopalik, Alexander]				Altruism in Atomic Congestion Games In: ACM Transactions on Economics and Computation [1], 21	Journal Article	0345A57FF01DF0A2C1257C690063B068-HoeferS-TEAC-2013
		2013			Hoefer, Martin [Skopalik, Alexander]				On the Complexity of Pareto-optimal Nash and Strong Equilibria In: Theory of Computing Systems [53], 441-453	Journal Article	153B84C4801787A3C1257C6900636C6E-HoeferS-TOCS-2013
		2013			Hoefer, Martin [Wagner, Lisa]	[Chen, Yiling] [Immorlica, Nicole]			Designing Profit Shares in Matching and Coalition Formation Games In: 9th Conference on Web and Internet Economics (WINE-13), 249-262	Proceedings Article	BF50DEADB01252D1C1257C690062E6F0-HoeferW-WINE-2013
		2013			Hoefer, Martin [Wagner, Lisa]	[Fomin, Fedor] [Freivalds, Rusins] [Kwiatkowska, Marta] [Peleg, David]			Locally Stable Marriage with Strict Preferences In: 40th International Colloquium on Automata, Languages and Programming (ICALP-13), 620-631	Proceedings Article	D91B938CECC154C5C1257C6900614949-HoeferW2013
		2013			Jez, Artur	[Beal, Marie-Pierre] [Carton, Olivier]			Recompression: Word Equations and Beyond In: 17th International Conference on Developments in Language Theory (DLT 2013), 12-26	Proceedings Article	836DB038AE110EFEC1257C67004F0785-Jez2013DLTII
		2013			Jez, Artur	[Fischer, Johannes] [Sanders, Peter]			Approximation of Grammar-Based Compression via Recompression In: 24th Annual Symposium on Combinatorial Pattern Matching (CPM 2013), 165-176	Proceedings Article	B144EE3C8FD0E4EDC1257C67004E4DA8-Jez2013CPM
		2013			Jez, Artur	[Fomin, Fedor V.] [Freivalds, Rusins] [Kwiatkowska, Marta Z.] [Peleg, David]			One-Variable Word Equations in Linear Time In: 40th International Colloquium on Automata, Languages, and Programming (ICALP 2013), 324-335	Proceedings Article	A1BEC266D007CE81C1257C670050C4BF-Jez2013ICALP
		2013			Jez, Artur [Maletti, Andreas]				Hyper-minimization for deterministic tree automata In: International Journal of Foundations of Computer Science [24], 815-830	Journal Article	B86363CD269250B4C1257C670052B8DE-JezMaletti2013
		2013			Jez, Artur [Okhotin, Alexander]	[Beal, Marie-Pierre] [Carton, Olivier]			Unambiguous Conjunctive Grammars over a One-Letter Alphabet In: 17th International Conference on Developments in Language Theory (DLT 2013), 277-288	Proceedings Article	BA41F25B8ECBF249C1257C67004F96D7-Jez2013DLT
		2013			Jez, Artur	[Portier, Natacha] [Wilke, Thomas]			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	46A2F9168BACE6DEC1257B1D0053AE6C-Jez2013STACS
		2013			Jurkiewicz, Tomasz Mehlhorn, Kurt				The cost of address translation In: Proceedings of the Meeting on Algorithm Engineering & Experiments,	Proceedings Article	8547751BA6E798C6C1257AD20051B773-VAT2013
		2013			Khosla, Megha	[Bodlaender, Hans L.] [Italiano, Giuseppe F.]			Balls into Bins Made Faster In: Algorithms - ESA 2013,	Proceedings Article	77B7AEB704F83AC5C1257C6900525970-Khosla2013
		2013			Megow, Nicole [Mestre, Julian]				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	2CEE80588FA75A9EC1257AC5007D5A9A-MegowMestre2013
		2013			Megow, Nicole [Verschae, Jose]				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	C606E1DF85611CE1C1257C670001929B-MegowV2013
		2013			Mehlhorn, Kurt Neumann, A. Schmidt, Jens M.				Certifying 3-Edge-Connectivity In: 39th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'13), 358-369	Proceedings Article	4F92E1F5C7C3C345C1257C60005AF081-Mehlhorn2013
		2013			Panagiotou, Konstantinos Pourmiri, Ali Sauerwald, Thomas	Leizhen Cai, Siu-Wing Cheng, Tak Wah Lam			Faster Rumor Spreading with Multiple Calls In: 24th International Symposium on Algorithms and Computation (ISAAC-13), 446-456	Proceedings Article	4BD20AFC6147368EC1257C600051B5A7-Pourmiri2013
		2013			Panagiotou, Konstantinos Spöhel, Reto [Steger, Angelika] [Thomas, Henning]				Explosive percolation in Erdös-Rényi-like random graph processes In: Combinatorics, Probability and Computing [22], 133-145	Journal Article	1C565636F6E3B7F4C1257ACE00624AEF-SpoehelPST2013
		2013			[Sanders, Peter] [Singler, Johannes] van Stee, Rob				Real-time prefetching and caching In: Journal of Scheduling [16], 47-58	Journal Article	4C305E1770C9FEA3C1257B2000507C64-SaSiSt13
		2013			Schmidt, Jens M.				A Planarity Test via Construction Sequences In: 38th International Symposium on Mathematical Foundations of Computer Science (MFCS'13), 765-776	Proceedings Article	2EFE230883E959E3C1257C6000584C56-Schmidt2013b
		2013			Schmidt, Jens M.				A Simple Test on 2-Vertex- and 2-Edge-Connectivity In: Information Processing Letters [113], 241-244	Journal Article	BEEF022C0726F3F9C1257C60005734B2-Schmidt2013a
		2013			Schmidt, Jens M.				Contractions, Removals and Certifying 3-Connectivity in Linear Time In: SIAM Journal on Computing [42], 494-535	Journal Article	F1F9E67361AC7FF6C1257C60005710DE-Schmidt2013
		2013			Schmidt, Jens M.				Contractions, Removals and How to Certify 3-Connectivity in Linear Time	Unpublished/Draft	6C5EACE1C844FD72C1257AF0006144A2-Schmidt2013
		2013			[Sviridenko, Maxim] Wiese, Andreas	[Goemans, Michel]			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	56F6AEF322B11592C1257AD30034D756-SviridenkoWiese2013
		2013			van Stee, Rob				SIGACT News Online Algorithms Column 22 In: SIGACT News [44], 125	Journal Article	5619B8EC28D32848C1257C60005964A4-vanStee2013
		2013			Winzen, Carola				Direction-Reversing Quasi-Random Rumor Spreading with Restarts In: Information Processing Letters [113], 921-926	Journal Article	208E43C2CF9FD497C1257C60005240F9-Winzen2013
		2013			[Yap, Chee] Sagraloff, Michael [Sharma, Vikram]				Analytic Root Clustering: A Complete Algorithm using Soft Zero Tests	Unpublished/Draft	285F7D331C20EF4DC1257AFB00642AEE-YSSSoftpredicates2013
		2012			Abed, Fidaa [Huang, Chien-Chung]	[Epstein, Leah] [Ferragina, Paolo]			Preemptive Coordination Mechanisms for Unrelated Machines In: Algorithms - ESA 2012 : 20th Annual European Symposium, 12-23	Proceedings Article	2BE99EABC97881F4C1257AD4003DC662-Abed2012
		2012			[Agrawal, Manindra] Saha, Chandan [Saptharishi, Ramprasad] [Saxena, Nitin]				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	45A73FD0672C77D5C1257AF6002A5602-ASSS12
		2012			[Ailon, Nir] [Avigdor-Elgrabli, Noa] [Liberty, Edo] van Zuylen, Anke				Improved Approximation Algorithms for Bipartite Correlation Clustering In: SIAM Journal on Computing [41], 1110-1121	Journal Article	80AC4692AB2B3752C1257B280031DF11-Ailon2012
		2012			[Ajwani, Deepak] Elbassioni, Khaled [Govindarajan, Sathish] Ray, Saurabh				Conflict-free coloring for rectangle ranges using O(n .382) colors In: Discrete & Computational Geometry [48], 39-52	Journal Article	34171A59180CD95CC1257B28003263DA-Ajwani2012
		2012			[Akbari, Hoda] [Berenbrink, Petra] Sauerwald, Thomas	[Kowalski, Darek] [Panconesi, Alessandro]			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	9F853A13318B3307C1257AD60073C145-AkbariBS2012
		2012			Alcaraz, Nicolas Friedrich, Tobias Kötzing, Timo [Krohmer, Anton] Müller, Joachim Pauling, Josch Baumbach, Jan				Efficient key pathway mining: combining networks and OMICS data In: Integrative Biology [4], 756-764	Journal Article	838EF16B927A5642C1257AC6004F073E-AlcarayFKKMPB2012
		2012			[Alvarez, Victor] Bringmann, Karl [Curticapean, Radu] Ray, Saurabh	[Dey, Tamal K.] [Whitesides, Sue]			Counting Crossing Free Structures In: Proceedings of the Twenty-Eight Annual Symposium on Computational Geometry (SCG'12), 61-68	Proceedings Article	4863DD9DCFE958F4C1257AD30033BB38-AlvarezBCS12
		2012			[Baruah, Sanjoy] [Bonifaci, Vincenzo] [D'Angelo, Gianlorenzo] [Li, Haohan] [Marchetti-Spaccamela, Alberto] Megow, Nicole [Stougie, Leen]				Scheduling Real-Time Mixed-Criticality Jobs In: IEEE Transactions on Computers [61], 1140-1152	Journal Article	A2D2930B11B86FF6C12578EE00492CC6-Megow2011-MCsched
		2012			Baumbach, Jan Friedrich, Tobias Kötzing, Timo [Krohmer, Anton] Müller, Joachim Pauling, Josch				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	AA1A2CBB406CE65DC1257AC6004CAB27-BaumbachFKKMP2011
		2012			Becker, Ruben				The Bolzano Method to Isolate the Roots of a Bitstream Polynomial Universität des Saarlandes	Thesis - Bachelor thesis	B04116F76E2072F1C1257AFB0061A415-BachBecker2012
		2012			[Belfrage, Michael] [Mütze, Torsten] Spöhel, Reto				Probabilistic one-player Ramsey games via deterministic two-player games In: SIAM Journal on Discrete Mathematics [26], 1031-1049	Journal Article	426C7DB47FCCD9D4C1257ACE00682784-SpoehelBM2012
		2012			Berberich, Eric [Halperin, Dan] [Kerber, Michael] [Pogalnikova, Roza]				Deconstructing Approximate Offsets In: Discrete & Computational Geometry [48], 964-989	Journal Article	77D0F090EC84FD7BC1257AC800788266-bhkp-deconstruct-journal-2012
		2012			[Bonifaci, Vincenzo] [Chan, Ho-Leung] [Marchetti-Spaccamela, Alberto] Megow, Nicole				Algorithms and Complexity for Periodic Real-Time Scheduling In: ACM Transactions on Algorithms [9], 601-619	Journal Article	08F570DA0A4777C7C1257C6700024B91-BonifaciCMM2012
		2012			Bonifaci, Vincenzo [Marchetti-Spaccamela, Alberto]				Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems In: Algorithmica [63], 763-780	Journal Article	B700B8BFE0FED1C7C12579F600462BF2-Bonifaci2011:b
		2012			Bonifaci, Vincenzo [Marchetti-Spaccamela, Alberto] [Stiller, Sebastian]				A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling In: Algorithmica [62], 1034-1049	Journal Article	9C8C807006E27956C125798E003E4706-Bonifaci2012b
		2012			Bonifaci, Vincenzo Mehlhorn, Kurt [Varma, Girish]				Physarum Can Compute Shortest Paths In: Journal of Theoretical Biology [309], 121-133	Journal Article	2E63427366C2D939C1257AC2005DC800-Bonifaci2012c
		2012			Bonifaci, Vincenzo Mehlhorn, Kurt [Varma, Girish]	[Ravani, Yuval]			Physarum Can Compute Shortest Paths In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 233-240	Proceedings Article	CA211EE0A1B815F8C1257AC200545CEC-Bonifaci2012a
		2012			[Boros, Endre] Elbassioni, Khaled [Gurvich, Vladimir] [Makino, Kazuhisa]				Every Stochastic Game with Perfect Information Admits a Canonical Form In: 2nd International ICST Conference on Game Theory for Networks (GameNets 2011),	Unpublished/Draft	5DC0627B3D51C7AAC12579840059F27C-Elbassioni2011h
		2012			[Boros, Endre] Elbassioni, Khaled [Gurvich, Vladimir] [Makino, Kazuhisa]				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	1155DBB58A145154C1257984005D5586-Elbassioni2011n
		2012			[Brightwell, Graham] Panagiotou, Konstantinos [Steger, Angelika]				Extremal subgraphs of random graphs In: Random Structures & Algorithms [41], 147-178	Journal Article	EAE0B8C2CE407673C1257B2800360E49-Brightwell2012
		2012			Bringmann, Karl				An improved algorithm for Klee's measure problem on fat boxes In: Computational Geometry: Theory and Applications [45], 225-233	Journal Article	A577DF29BADFB45DC1257AD2005C3BA1-BringmannCGTA12
		2012			Bringmann, Karl Friedrich, Tobias				Approximating the least hypervolume contributor: NP-hard in general, but fast in practice In: Theoretical Computer Science [425], 104-116	Journal Article	2016E88472935692C1257B12003B2439-Bringmann2012d
		2012			Bringmann, Karl Friedrich, Tobias				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	3CFCD4AF1F43FE47C1257AD300340FE6-BringmannF12
		2012			Bringmann, Karl Mehlhorn, Kurt Neumann, Adrian				Remarks on Category-Based Routing in Social Networks	Unpublished/Draft	76C2DAB15149B214C1257AD7004ADA1A-category_based_routing_2012
		2012			Bringmann, Karl [Panagiotou, Konstantinos]	[Czumaj, Artur] Mehlhorn, Kurt [Pitts, Andrew M.] [Wattenhofer, Roger]			Efficient Sampling Methods for Discrete Distributions In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 133-144	Proceedings Article	76C613922FECC644C1257AD300348137-BringmannP12
		2012			[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]			Charge Group Partitioning in Biomolecular Simulation In: Research in Computational Molecular Biology : 16th Annual International Conference, RECOMB 2012, 29-43	Proceedings Article	B7A9084E299ACC78C1257984005F7489-Elbassioni2012c
		2012			[Case, John] Kötzing, Timo				Computability-theoretic learning complexity In: Philosophical Transaction of the Royal Society A [370], 3570-3596	Journal Article	48D1776D2F21DF0CC1257AC6004FE3C8-CaseKoetzing2012:PhilTrans
		2012			[Case, John] Kötzing, Timo				Learning secrets interactively. Dynamic modeling in inductive inference In: Information and Computation [220-221], 60-73	Journal Article	EF874079664A6110C1257AC600501B8C-CaseKoetzing2012:DynMod
		2012			[Chan, Ho-Leung] [Lam, Tak-Wah] Lee, Lap-Kei [Ting, Hing-Fung]				Continuous Monitoring of Distributed Data Streams over a Time-Based Sliding Window In: Algorithmica [62], 1088-1111	Journal Article	999EE8619525E27FC1257B020043DF3B-LeeLK2012
		2012			[Chan, Ho-Leung] Megow, Nicole [Sitters, René] van Stee, Rob				A note on sorting buffers offline In: Theoretical Computer Science [423], 11-18	Journal Article	026BEA38862FD8A5C1257AB6003B2BE9-ChMeSS12
		2012			[Chen, Xujin] Doerr, Benjamin [Hu, Xiaodong] [Ma, Weidong] van Stee, Rob Winzen, Carola	[Goldberg, Paul W.]			The Price of Anarchy for Selfish Ring Routing is Two In: Internet and Network Economics : 8th International Workshop, WINE 2012, 420-433	Proceedings Article	BA88AE79BCEAEE5DC1257AB600459979-CDHMSW12
		2012			[Croitoru, Cosmina] Kötzing, Timo	[Kersting, Kristian] [Toussaint, Marc]			Deliberative Acceptability of Arguments In: STAIRS 2012 - Proceedings of the Sixth Starting AI Researchers' Symposium, 71-82	Proceedings Article	A1058EDFC160E136C1257AD400592D61-croikotzi12
		2012			[Cygan, Marek] [Dell, Holger] [Lokshtanov, Daniel] [Marx, Daniel] [Nederlof, Jesper] [Okamoto, Yoshio] [Paturi, Ramamohan] [Saurabh, Saket] Wahlström, Magnus				On Problems as Hard as CNF-SAT In: 2012 IEEE 27th Conference on Computational Complexity (CCC 2012), 74-84	Proceedings Article	969957873EE5E29EC1257AD4004F2DE8-DLMNOPSW2012
		2012			[Cygan, Marek] [Kratsch, Stefan] [Pilipczuk, Marcin] [Pilipczuk, Michał] Wahlström, Magnus	[Czumaj, Artur] Mehlhorn, Kurt [Pitts, Andrew M.] [Wattenhofer, Roger]			Clique Cover and Graph Separation: New Incompressibility Results In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 254-265	Proceedings Article	5A998CDCF7D0A3FCC1257AD4004D05AF-CyganKratschPilipczukPilipczukWahlstroem2012
		2012			De Sterck, Hans				A Nonlinear GMRES Optimization Algorithm for Canonical Tensor Decomposition In: SIAM Journal on Scientific Computing [34], A1351-A1379	Journal Article	DD06CD10145CF365C1257AD90045CC41-DeSterckNGMRES
		2012			De Sterck, Hans				A Self-learning Algebraic Multigrid Method for Extremal Singular Triplets and Eigenpairs In: SIAM Journal on Scientific Computing [34], A2092-A2117	Journal Article	3ED08D2534FF0E02C1257AD90045B4A6-DeSterckSVD
		2012			De Sterck, Hans				Steepest Descent Preconditioning for Nonlinear GMRES Optimization	Unpublished/Draft	140908147D42CB37C1257AD90045E4CA-DeSterckDescent
		2012			Doerr, Benjamin [Fouz, Mahmoud] Friedrich, Tobias				Why Rumors Spread Fast in Social Networks In: Communications of the ACM [55], 70-75	Journal Article	8D94791B0719257DC1257984005AC13F-DoerrFF12CACM
		2012			Doerr, Benjamin [Fouz, Mahmoud] [Friedrich, Tobias]	[Even, Guy] [Rawitz, Dror]			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	B3DFDB4DC8037846C1257AD100536350-DoerrFF12MedAlg
		2012			Doerr, Benjamin [Fouz, Mahmoud] [Friedrich, Tobias]	[Fomin, Fedor V.] [Kaski, Petteri]			Asynchronous rumor spreading in preferential attachment graphs In: Algorithm Theory - SWAT 2012 : 13th Scandinavian Symposium and Workshops, 307-315	Proceedings Article	CC7EFC2E319B625EC1257AD1005656EE-DoerrFF12SWAT
		2012			Doerr, Benjamin Happ, Edda Klein, Christian				Crossover can provably be useful in evolutionary computation In: Theoretical Computer Science [425], 17-33	Journal Article	C273EBC7D9D23FFBC1257AD2004C43D3-DoerrHK2012TCS
		2012			Doerr, Benjamin [Hota, Ashish] Kötzing, Timo	[Soule, Terence] [Moore, Jason H.]			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	EFF24854E39E0ECFC1257AC6004CEB29-DoerrHK2012GECCO
		2012			Doerr, Benjamin [Johannsen, Daniel] Winzen, Carola				Multiplicative Drift Analysis In: Algorithmica [64], 673-697	Journal Article	2CFCFE782727C478C1257ACD003F74DC-DoerrJW12Multi
		2012			Doerr, Benjamin [Johannsen, Daniel] Winzen, Carola				Non-existence of linear universal drift functions In: Theoretical Computer Science [436], 71-86	Journal Article	0E1DC0A37581F761C12579FA0033BF9B-DoerrJW12
		2012			Doerr, Benjamin Pohl, Sebastian	[Soule, Terence] [Moore, Jason H.]			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	5C98FBE76A4EEAF7C1257AD10052D31B-DoerrP12GECCO
		2012			Doerr, Benjamin	[Soule, Terence] [Moore, Jason H.]			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	A234A281B4838E40C1257AD10054500D-Doerr12GECCO
		2012			Doerr, Benjamin Spöhel, Reto [Thomas, Henning] Winzen, Carola				Playing Mastermind with Many Colors In: Proc. of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2012),	Proceedings Article	E0F91324FC729EECC1257C600071C29B-DoerrSTW12
		2012			Doerr, Benjamin Winzen, Carola				Memory-restricted black-box complexity of OneMax In: Information Processing Letters [112], 32-34	Journal Article	9EF86FB49626CA64C125793C00373628-DoerrW12
		2012			Doerr, Benjamin Winzen, Carola	[Hao, Jin-Kao] [Legrand, Pierrick] [Collet, Pierre] [Monmarché, Nicolas] [Lutton, Evelyne] [Schoenauer, Marc]			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	6D5BE71804B8D03CC1257AD30045104D-DoerrW12EA
		2012			Doerr, Benjamin Winzen, Carola	[Soule, Terence] [Moore, Jason H.]			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	F43640574DFB1172C1257ACD004205B2-DoerrW12GECCO
		2012			Elbassioni, Khaled	[Czumaj, Artur] Mehlhorn, Kurt [Pitts, Andrew M.] [Wattenhofer, Roger]			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	140EF868CCF427F9C1257AD40047FB11-Elbassioni2012e
		2012			Elbassioni, Khaled [Fouad, Mohamed] [Bertino, Elisa]				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	16B7101B89AB1F66C1257AD5005535F0-Elbassioni2012f
		2012			Elbassioni, Khaled [Jeli´c, Slobodan] [Matijevi`c, Domagoj]				The relation of Connected Set Cover and Group Steiner Tree In: Theoretical Computer Science [438], 96-101	Journal Article	45121A1FE8C086A1C1257B0500427FD6-Elbassioni2012i
		2012			Elbassioni, Khaled [Matijevic, Domagoj] [Severdija, Domagoj]				Guarding 1.5D terrains with demands In: International Journal of Computer Mathematics [89], 2143-2151	Journal Article	3344BC1CB8402CADC1257B12003C4890-Elbassioni2012z
		2012			Elbassioni, Khaled [Raman, Rajiv] Ray, Saurabh [Sitters, René]				On the complexity of the highway problem In: Theoretical Computer Science [460], 70-77	Journal Article	FDD4B4A3E195CFBCC1257B050041FB7F-Elbassioni2012h
		2012			Elbassioni, Khaled [Tiwary, Hans Raj]				Complexity of Approximating the Vertex Centroid of a Polyhedron In: Theoretical Computer Science [421], 56-61	Journal Article	D6D0668F1BE15B85C1257984005DEC11-Elbassioni2012b
		2012			[Elmasry, Amr] Mehlhorn, Kurt Schmidt, Jens M.				An O(n+m) Certifying Triconnnectivity Algorithm for Hamiltonian Graphs In: Algorithmica [62], 754-766	Journal Article	8981DDDAF83E06E2C1257B04003680D1-Elmasry2012
		2012			Emeliyanenko, Pavel Sagraloff, Michael	[van der Hoeven, Joris] [van Hoeij, Mark]			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	941547BF22A857B9C1257A55003EEA8E-ES-complexity-12
		2012			[Epstein, Leah] [Jez, Lukasz] [Sgall, Jiri] van Stee, Rob	[Gupta, Anupam] [Jansen, Klaus] [Rolim, José] [Servedio, Rocco]			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	CA0E53116309F933C1257AB6003C51EB-EpJeSS12
		2012			[Epstein, Leah] [Levin, Asaf] [Marchetti-Spaccamela, Alberto] Megow, Nicole Mestre, Julian Skutella, Martin [Stougie, Leen]				Universal sequencing on an unreliable machine In: SIAM Journal on Computing [41], 565-586	Journal Article	AC7FEA1C5AE69C13C1257AC5007EB641-Megow2012-universal
		2012			[Epstein, Leah] [Levin, Asaf] van Stee, Rob				Approximation Schemes for Packing Splittable Items with Cardinality Constraints In: Algorithmica [62], 102-129	Journal Article	B865B264D937FC6DC12577F4004ED10E-EpLeSt12
		2012			[Epstein, Leah] van Stee, Rob				The price of anarchy on uniformly related machines revisited In: Information and Computation [212], 37-54	Journal Article	58B69B93A50C225BC1257AB6003A58BE-EpsSte12
		2012			Feldmann, Matthias				Stochastic optimization with fitness proportional ant systems Universität des Saarlandes	Thesis - Bachelor thesis	A290A5C0684271EFC1257B160045C1E7-FeldmannBachelor2012
		2012			[Fellows, Michael R.] Hermelin, Danny [Rosamond, Fraces A.]				Well Quasi Orders in Subclasses of Bounded Treewidth Graphs and Their Algorithmic Applications In: Algorithmica [64], 3-18	Journal Article	30F08FC9BFAB0197C1257B28003882A4-Fellows2012
		2012			Fountoulakis, Nikolaos Panagiotou, Konstantinos				Tight Load Thresholds for Cuckoo Hashing In: Random Structures and Algorithms [41], 306-333	Journal Article	2E2458F97D6E5646C1257AD40075A385-FP12RSA
		2012			Fountoulakis, Nikolaos [Panagiotou, Konstantinos] [Sauerwald, Thomas]	[Rabani, Yuval]			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	C1E91478C424C019C1257AD60076560D-FountoulakisPS12
		2012			Friedrich, Tobias [Gairing, Martin] Sauerwald, Thomas				Quasirandom Load Balancing In: SIAM Journal on Computing [41], 747-771	Journal Article	C9BE794E73471979C1257AD60073045F-FriedrichGS2012
		2012			Gawrychowski, Pawel	[Calderón-Benavides, Liliana] [González-Caro, Cristina N.] [Chávez, Edgar] [Ziviani, Nivio]			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	748A513ADB56BB53C1257AD30055F7F8-Gawrychowski2012c
		2012			Gawrychowski, Pawel	[Kärkkäinen, Juha] [Stoye, Jens]			Simple and efficient LZW-compressed multiple pattern matching In: Combinatorial Pattern Matching : 23rd Annual Symposium, CPM 2012, 232-242	Proceedings Article	AE64E37A8CF12F96C1257AD300557FC2-Gawrychowski2012b
		2012			[Giakkoupis, George] Sauerwald, Thomas	[Rabani, Yuval]			Rumor spreading and vertex expansion In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 1623-1641	Proceedings Article	3C7CB97E238F728EC1257AD6007586CF-GiakkoupisS12
		2012			[Giannopoulos, Panos] [Knauer, Christian] Wahlström, Magnus [Werner, Daniel]				Hardness of discrepancy computation and ε-net verification in high dimension In: Journal of Complexity [28], 162-176	Journal Article	6507A5AC689A128DC1257AD40050A4F1-GKWahlstroemW2012
		2012			[Gnewuch, Michael] Wahlström, Magnus Winzen, Carola				A New Randomized Algorithm to Approximate the Star Discrepancy Based on Threshold Accepting In: SIAM Journal on Numerical Analysis [50], 781-807	Journal Article	FCFA30DDA88EE1F0C1257AB6005A77F4-GnewuchWW12
		2012			Harren, Rolf [Kern, Walter]	[Solis-Oba, Roberto] [Persiano, Giuseppe]			Improved Lower Bound for Online Strip Packing In: Approximation and Online Algorithms : 9th International Workshop ,WAOA 2011, 211-218	Proceedings Article	7497BAF36270852AC1257ABF003F9A39-HarKer11
		2012			Harren, Rolf van Stee, Rob				Absolute Approximation Ratios for Packing Rectangles into Bins In: Journal of Scheduling [15], 63-75	Journal Article	FFB439DE6E089C8BC12575630040F387-HarSte12
		2012			[Heinz, Jeffrey] [Kasprzik, Anna] Kötzing, Timo				Learning in the limit with lattice-structured hypothesis spaces In: Theoretical Computer Science [457], 111 - 127	Journal Article	50B10C29A2823E46C1257AC6004F575D-HeinyKasprzikKoetzing2012
		2012			Hermelin, Danny [Mestre, Julian] [Rawitz, Dror]	[Golumbic, Martin Charles] [Stern, Michal] [Levy, Avivit] [Morgenstern, Gila]			Optimization Problems in Dotted Interval Graphs In: Graph-Theoretic Concepts in Computer Science : 38th InternationalWorkshop, WG 2012, 46-56	Proceedings Article	F168E1AF93EF96D1C1257ADC004F455D-HermelinMestreRawitz2012
		2012			Hermelin, Danny [Mnich, Matthias] [van Leeuwen, Erik Jan]	[Epstein, Leah] [Ferragina, Paolo]			Parameterized complexity of induced H-matching on claw-free graphs In: Algorithms - ESA 2012 : 20th Annual European Symposium, 624-635	Proceedings Article	17328925BDC02DFAC1257ADC004FFD21-HermelinMnichvanLeeuwen2012
		2012			Hermelin, Danny [Rizzi, Romeo] [Vialette, Stephane]	[Chao, Kun-Mao] [Hsu, Tsan-sheng] [Lee, Der-Tsai]			Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph In: Algorithms and Computation : 23rd International Symposium, ISAAC 2012, 465-474	Proceedings Article	E8CDF637D877FC7BC1257B0400421CC6-Hermelin2012
		2012			Hermelin, Danny [Wu, Xi]	[Rabani, Yuval]			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	0726B8BE65BFF3B2C1257ADC004FAB8B-HermelinWu2012
		2012			Heydrich, Sandy				Dividing connected chores fairly Universität des Saarlandes	Thesis - Bachelor thesis	5580BFB38554D223C1257B160045F15A-HeidrichBachelor2012
		2012			[Höhn, Wiebke] [Jacobs, Tobias] Megow, Nicole				On Eulerian extensions and their application to no-wait flowshop scheduling In: Journal of Scheduling [15], 295-309	Journal Article	E3D5C0E173283CA7C12578EE00495314-Megow2012-eulerian
		2012			Huang, Chien-Chung	[Fomin, Fedor V.] [Kaski, Petteri]			Non-preemptive Speed Scaling In: Algorithm Theory - SWAT 2012 : 13th Scandinavian Symposium and Workshops, 249-260	Proceedings Article	543A53FD1478F014C1257B08005BA869-Huang2012a
		2012			[Jain, Sanjay] Kötzing, Timo [Stephan, Frank]	[Bshouty, Nader] [Stoltz, Gilles] [Vayatis, Nicolas] [Zeugmann, Thomas]			Enlarging Learnable Classes In: Algorithmic Learning Theory : 23rd International Conference, ALT 2012, 36-50	Proceedings Article	50C143C9E78EB067C1257AC6004E27C3-JainKoetzingStephan2011
		2012			[Kane, Daniel] Mehlhorn, Kurt Sauerwald, Thomas Sun, He	[Czumaj, Artur] Mehlhorn, Kurt [Pitts, Andrew M.] [Wattenhofer, Roger]			Counting Arbitrary Subgraphs in Data Streams In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 598-609	Proceedings Article	D59F81728CEDD0B9C1257AD000568326-Sun2012b
		2012			Kavitha, Telikepalli [Mestre, Julián]				Max-coloring paths: tight bounds and extensions In: Journal of Combinatiorial Optimization [24], 1-14	Journal Article	B82F0CD227278BA5C1257B0C0042678B-Kavitha2012
		2012			[Kayal, Neeraj] Saha, Chandan				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	EE43464ED8EB2015C1257AF60024A50E-KS12
		2012			[Kerber, Michael] Sagraloff, Michael				A worst-case bound for topology computation of algebraic curves In: Journal of Symbolic Computation [47], 239-258	Journal Article	23C0A896C80231A5C1257AD00077BE9A-KerberSagraloff_JSC_2012
		2012			[Kim, Eun Jung] [Paul, Christophe] Philip, Geevarghese	[Fomin, Fedor V.] [Kaski, Petteri]			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	B5AB1D87757A6B6EC1257ACE0013F370-KimPaulPhilip2012
		2012			[Knauer, Christian] [Schlipf, Lena] Schmidt, Jens M. [Tiwary, Hans Raj]				Largest Inscribed Rectangles in Convex Polygons In: Journal of Discrete Algorithms [13], 78-85	Journal Article	ADE76D8AEA08C370C1257AC200473CEB-Knauer2012
		2012			Kötzing, Timo [Molter, Hendrik]	[Coello Coello, Carlos A.] [Cutello, Vincenzo] [Deb, Kalyanmoy] [Forrest, Stephanie] [Nicosia, Giuseppe] [Pavone, Mario]			ACO beats EA on a dynamic pseudo-Boolean function In: Parallel Problem Solving from Nature - PPSN XII : 12th International Conference, 113-122	Proceedings Article	25146C0B80144A62C1257AC6004DD064-KoetzingMolter2012
		2012			Kötzing, Timo [Neumann, Frank] [Röglin, Heiko] [Witt, Carsten]				Theoretical analysis of two ACO approaches for the traveling salesman problem In: Swarm Intelligence [6], 1-21	Journal Article	84537223439F8777C1257AC6004EAF4C-KoetzingNRW2012
		2012			Kötzing, Timo [Sutton, Andrew M.] [Neumann, Frank] [O'Reilly, Una-May]	[Soule, Terence] [Moore, Jason H.]			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	569B142839762836C1257AC6004D4EB3-KoetzingSNO2011
		2012			[Kratsch, Stefan] [Pilipczuk, Marcin] [Pilipczuk, Michał] Wahlström, Magnus	[Czumaj, Artur] Mehlhorn, Kurt [Pitts, Andrew M.] [Wattenhofer, Roger]			Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs In: Automata, Languages, and Programming ; 39th International Colloquium, ICALP 2012, 581-593	Proceedings Article	E10E3826E7217AEBC1257AD4004D690C-KratschPilipczukPilipczukWahlstroem2012
		2012			[Kratsch, Stefan] Wahlström, Magnus	[Rabani, Yuval]			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	7F455BB0C3E436B9C1257AD4004FBBCC-KratschWahlstroem2012a
		2012			[Kratsch, Stefan] Wahlström, Magnus	[Roughgarden, Tim]			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	08E0AD13212035DCC1257AD4004BCC0F-KratschWahlstroem2012b
		2012			[Krivelevich, Michael] Spöhel, Reto				Creating small subgraphs in Achlioptas processes with growing parameter In: SIAM Journal on Discrete Mathematics [26], 670-686	Journal Article	8B9543B4955F23F1C1257A480070A9A9-SpoehelK2012
		2012			Megow, Nicole Mehlhorn, Kurt [Schweitzer, Pascal]				Online Graph Exploration: New Results on Old and New Algorithms In: Theoretical Computer Science [463], 62-72	Journal Article	18D093BE87A59A63C1257AC5007EF50F-MegowMehlhornSchweitzer2012
		2012			Megow, Nicole [Skutella, Martin] [Verschae, Jose] Wiese, Andreas	[Czumaj, Artur] Mehlhorn, Kurt [Pitts, Andrew M.] [Wattenhofer, Roger]			The Power of Recourse for Online MST and TSP In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 689-700	Proceedings Article	F9D0FE85F8D1AF2FC1257AC5007D0CF8-MegowSVW2012
		2012			Mehlhorn, Kurt Neumann, Adrian Schmidt, Jens M.				Certifying 3-Edge-Connectivity	Unpublished/Draft	BE94590BB6183CBDC1257AD7004DFA01-Certifying3EdgeConnectivity2012
		2012			[Meyerhenke, Henning] Sauerwald, Thomas				Beyond Good Partition Shapes: An Analysis of Diffusive Graph Partitioning In: Algorithmica [64], 329-361	Journal Article	EE08F65850CD07E7C1257AD600733027-MeyerhenkeS2012
		2012			[Misra, Neeldhara] Philip, Geevarghese [Raman, Venkatesh] [Saurabh, Saket]				On Parameterized Independent Feedback Vertex Set In: Theoretical Computer Science [461], 65-75	Journal Article	3901B0C12E705D2BC12579E80052C60A-MisraPhilipRamanSaurabh2012
		2012			[Misra, Neeldhara] Philip, Geevarghese [Raman, Venkatesh] [Saurabh, Saket] [Sikdar, Somnath]				FPT Algorithms for Connected Feedback Vertex Set In: Journal of Combinatorial Optimization [24], 131-146	Journal Article	7BA4AC53C100ECFDC12579E7005EA6E0-MisraPhilipRamanSaurabhSikdar2012
		2012			[Nor, Igor] Hermlin, Danny [Charlat, Sylvain] [Engelstadter, Jan] [Reuter, Max] [Duron, Olivier] [Sagot, Marie-France]				Mod/Resc Parsimony Inference: Theory and application In: Information and Computation [213], 23-32	Journal Article	D2B26EEBE829DBEFC1257B28004E102B-Nor2012
		2012			Panagiotou, Konstantinos [Coja-Oghlan, Amin]				Catching the k-NAESAT Threshold In: STOC’12 : Proceedings of the 2012 ACM Symposium on Theory of Computing, 899-907	Proceedings Article	19FE722E23BE4145C1257ACD0051823E-ACO-P2012
		2012			Panagiotou, Konstantinos [Sinha, Makrand]				Vertices of degree k in random unlabeled trees In: Journal of Graph Theory [69], 114-130	Journal Article	7D7404F7902F3500C1257B0C00485387-Panagiotou2012b
		2012			Philip, Geevarghese [Raman, Venkatesh] [Sikdar, Somnath]				Polynomial kernels for dominating set in graphs of bounded degeneracy and beyond In: ACM Transactions on Algorithms [9], 23	Journal Article	13A5E59BC9B814A9C1257B260042BD30-PhilipRamanSikdar2012
		2012			P. Gao				Distribution of the number of spanning regular subgraphs in random graphs	Unpublished/Draft	93F47DD163BAD67EC1257AD900468597-G6
		2012			P. Gao				Distributions of sparse spanning subgraphs in random graphs	Unpublished/Draft	0E2F25709B36B3B1C1257AD9004669C6-G4
		2012			P. Gao				Uniform generation of d-factors in dense host graphs	Unpublished/Draft	392B5E84EEDE26ABC1257AD90046A293-G7
		2012			[Qian, Jiawei] [Schalekamp, Frans] [Williamson, David P.] van Zuylen, Anke	[Fernández-Baca, David]			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	44750D89E335749AC1257A5200405204-QianSWvZ12
		2012			Sagraloff, Michael				Exaktes geometrisches Rechnen	Miscellaneous	41AA7C3F34DAD09AC1257AFB006311C7-SagraloffMPGJahrbuch2012
		2012			Sagraloff, Michael	[van der Hoeven, Joris] [van Hoeij, Mark]			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	0EE0BCAD6033F40DC1257AD00079C63A-Sagraloff_ISSAC_2012
		2012			Sauerwald, Thomas Sun, He	[Roughgarden, Tim]			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	A3E081AE7BD1BEA3C1257AD0005A89BF-Sun2012c
		2012			[Schalekamp, Frans] [Williamson, David P.] van Zuylen, Anke	[Rabani, Yuval]			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	BBB0715587A16A3DC1257A52003FADF2-SchalekampWvZ12
		2012			Schmidt, Jens M.				Construction Sequences and Certifying 3-Connectivity In: Algorithmica [62], 192-208	Journal Article	4F4FB8A8CDEF781FC1257AC2005325EF-Schmidt2012
		2012			Schmidt, Jens M.	[Czumaj, Artur] Mehlhorn, Kurt [Pitts, Andrew] [Wattenhofer, Roger]			Certifying 3-Connectivity in Linear Time In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 786-797	Proceedings Article	9F99A9B8CE9D07A0C1257AC2004AE457-Schmidt2012b
		2012			Schmidt, Jens M. [Valtr, Pavel]				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	8BDE814A09A62FB2C1257AC2004A5DB1-Schmidt2012a
		2012			[Soranzo, Nicola] Ramezani, Fahimeh [Iacono, Giovanni] [Altafini, Claudio]				Decompositions of large-scale biological systems based on dynamical properties In: Bioinformatics [28], 76-83	Journal Article	1C5323967AC00E3FC125797C0046FC8C-Ramezani2011
		2012			van Stee, Rob				An improved algorithm for online rectangle filling In: Theoretical Computer Science [423], 59-74	Journal Article	AF40C0BF97FB50ACC1257AB6003B77F7-Stee12
		2012			van Stee, Rob				SIGACT News Online Algorithms Column 20: The Power of Harmony In: SIGACT News [43], 127-136	Journal Article	EF4F9CB0F7C600D5C1257AB60046D1E1-Stee12a
		2012			van Stee, Rob				SIGACT News Online Algorithms Column 21: APPROX and ALGO In: SIGACT News [43], 123-129	Journal Article	37A4C512543CB811C1257AB600470ED7-Stee12b
		2012			van Zuylen, Anke	[Solis-Oba, Roberto] [Persiano, Pino]			Simpler 3/4-approximation algorithms for MAX SAT In: Approximation and Online Algorithms : 9th International Workshop, WAOA 2011, 188-197	Proceedings Article	111D4D9820CA47A2C125796B00596403-vanZuylenWAOA2011
		2011			[Ailon, Nir] [Avigdor-Elgrabli, Noa] [Liberty, Noa] van Zuylen, Anke	[Demetrescu, Camil] [Halldórsson, Magnús M.]			Improved Approximation Algorithms for Bipartite Correlation Clustering In: Algorithms - ESA 2011 : 19th Annual European Symposium, 25-36	Proceedings Article	30A0220DAA8B51E3C125796B005050B1-AilonESA2011
		2011			[Alkassar, Eyad] [Böhme, Sascha] Mehlhorn, Kurt Rizkallah, Christine	[Gopalakrishnan, Ganesh] [Qadeer, Shaz]			Verification of Certifying Computations In: Computer Aided Verification : 23rd International Conference, CAV 2011, 67-82	Proceedings Article	5C01AA7BBEAB7C26C125785C003095BF-FormalVerificationofCertifyingComputations
		2011			[Althaus, Ernst] [Canzar, Stefan] Elbassioni, Khaled [Karrenbauer, Andreas] [Mestre, Julian]				Approximation Algorithms for the Interval Constrained Coloring Problem In: Algorithmica [61], 342-361	Journal Article	8A8CF81C3F3099D9C1257984005B1F14-Elbassioni2011l
		2011			[Althaus, Ernst] Kupilas, Joschka Naujoks, Rouven	[Ogihara, Mitsunori] [Tarui, Jun]			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	40E74892A34B3B7AC125785B0065DF06-Althaus2011
		2011			[Anand, S.] [Garg, Naveen] Megow, Nicole	[Aceto, Luca] [Henzinger, Monika] [Sgall, Jiří]			Meeting deadlines: How much speed suffices? In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011. - Pt. I, 232-243	Proceedings Article	DF905AC79CD6ACA5C12578810025104D-Megow2011-speed
		2011			[Arumugam, S.] [Chandrasekar, K. Raja] [Misra, Neeldhara] Philip, Geevarghese [Saurabh, Saket]	[Iliopoulos, Costas S.] [Smyth, William F.]			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	173EA3C306F59AD9C12579E80041C749-arumugamchandrasekarmisraphilipsaurabh2011
		2011			[Asano, Tetsuo] Doerr, Benjamin				Memory-constrained algorithms for shortest path problem In: 23rd Annual Canadian Conference on Computational Geometry (CCCG 2011), 315-319	Proceedings Article	0AFC258C33E5C776C1257AD10057D3A8-DoerrA11CCCG
		2011				[Auger, Anne] Doerr, Benjamin			Theory of Randomized Search Heuristics	Book	0ECBB492B5D40A6DC125797A00524CE7-AugerD11
		2011			[Bansal, Nikhil] Chan, Ho-Leung [Pruhs, KIrk]				Competitive Algorithms for Due Date Schedulin In: Algorithmica [59], 569-582	Journal Article	4D7F8CC751349A60C12579C90051877A-Chan2011
		2011			[Bar-Yehuda, Reuven] Hermelin, Danny [Rawitz, Dror]				Minimum vertex cover in rectangle graphs In: Computational Geometry [44], 356-364	Journal Article	B4FDF69B05D8279EC1257965003C574A-Bar-YehudaHermelinRawitz2011
		2011			[Baruah, Sanjoy] Bonifaci, Vincenzo [D'Angelo, Gianlorenzo] [Marchetti-Spaccamela, Alberto] [van der Ster, Suzanne] [Stougie, Leen]	[Demetrescu, Camil] [Halldórsson, Magnús M.]			Mixed-criticality scheduling of sporadic task systems In: Algorithms - ESA 2011 : 19th Annual European Symposium, 555-566	Proceedings Article	66B483FE686CF648C12579790061CE13-Bonifaci:2011:c
		2011			[Baswana, Surender] [Kavitha, Telikepalli] Mehlhorn, Kurt [Pettie, Seth]				Additive Spanners and (α, β)-Spanners In: ACM Transactions on Algorithms [7], 5:1-5:26	Journal Article	150FC93C5EEE2627C12579C90051FFA8-MehlhornTALG2011
		2011			Beier, Rene Funke, Stefan Matijevic, Domagoj [Sanders, Peter]				Energy-Efficient Paths in Radio Networks In: Algorithmica [61], 298-319	Journal Article	606C1973C781AC1FC12579C90052B53F-Beier2011
		2011			[Ben-Zwi, Oren] Hermelin, Danny [Lokshtanov, Daniel] [Newman, Ilan]				Treewidth governs the complexity of target set selection In: Discrete Optimization [8], 87-96	Journal Article	315C0D9EFC180B2DC1257965003BED1E-BenZwiHermelinLokshtanovNewman2011
		2011			Berberich, Eric Emeliyanenko, Pavel Kobel, Alexander Sagraloff, Michael	[Moreno Maza, Marc]			Arrangement Computation for Planar Algebraic Curves In: Proceedings of the 4th Internal Workshop on Symbolic-Numeric Computation, 88-98	Proceedings Article	D4060C38A3004920C1257886004E59D8-beks:snc:2011
		2011			Berberich, Eric Emeliyanenko, Pavel Sagraloff, Michael	[Müller-Hannemann, Matthias] [Werneck, Renato]			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	F38A47FB7C81876CC125782200630A63-bes-bisolve-2011
		2011			Berberich, Eric [Halperin, Dan] [Kerber, Michael] [Pogalnikova, Roza]	[Hurtado, Ferran] [van Krefeld, Marc]			Deconstructing Approximate Offsets In: Proceedings of the 27th Annual Symposium on Computational Geometry (SCG'11), 187-196	Proceedings Article	E651AF2DDBF2B8EDC125783F00574021-bhkp-minkowksideconstruction-2011
		2011			Berberich, Eric [Hemmer, Michael] [Kerber, Michael]	[Hurtado, Ferran] [van Krefeld, Marc]			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	0CA66DD5A9206687C125783F0057C3FA-bhk-ak2-2011
		2011			[Berenbrink, Petra] [Cooper, Colin] [Friedetzky, Tom] Friedrich, Tobias Sauerwald, Thomas	[Randall, Dana]			Randomized Diffusion for Indivisible Loads In: 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA-11), 429-439	Proceedings Article	40C198271D0D7BECC1257818002BAFD1-Berenbrink2011b
		2011			[Berenbrink, Petra] [Friedetzky, Tom] [Elsaesser, Robert] [Nagel, Lars] Sauerwald, Thomas	[Murlak, Filip] [Sankowski, Piotr]			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	717FCB02CB7E0E2AC1257AD60077764C-BerenbrinkEFNS11
		2011			[Berenbrink, Petra] [Hoefer, Martin] Sauerwald, Thomas	[Randall, Dana]			Distributed Selfish Load Balancing on Networks In: 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA-11), 1487-1497	Proceedings Article	54B5A54BEA548C27C1257818002AB33E-Berenbrink2011
		2011			Bonifaci, Vincenzo [Korteweg, Peter] [Marchetti-Spaccamela, Alberto] [Stougie, Leen]				Minimizing Flow Time in the Wireless Gathering Problem In: ACM Transactions on Algorithms [7], 33:1-33:20	Journal Article	AE0CC65BAC8BF1D3C1257979005FB068-Bonifaci:2011:b
		2011			Bonifaci, Vincenzo [Korteweg, Peter] [Marchetti-Spaccamela, Alberto] [Stougie, Leen]				The Distributed Wireless Gathering Problem In: Theoretical Computer Science [412], 633-641	Journal Article	BB5831F0111C9588C1257979005E9F30-Bonifaci:2011:a
		2011			[Boros, Endre] Elbassioni, Khaled [Fouz, Mahmoud] [Gurvich, Vladimir] [Makino, Kazuhisa] [Manthey, Bodo]	[Aceto, Luca] [Henzinger, Monika] [Sgall, Jiri]			Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 147-158	Proceedings Article	279DD40DD13D6B8BC12579840057C3CA-Elbassioni2011e
		2011			[Boros, Endre] Elbassioni, Khaled [Gurvich, Vladimir] [Makino, Kazuhisa]				A lower bound for discounting algorithms solving two-person zero-sum limit average payoff stochastic games	Unpublished/Draft	EAACA3B71AF53D2BC125781900591AEC-Elbassioni2011d
		2011			[Boros, Endre] Elbassioni, Khaled [Gurvich, Vladimir] [Tiwary, Hans Raj]				The negative cycles polyhedron and hardness of checking some polyhedral properties In: Annals of Operations Research [188], 63-76	Journal Article	DC11F9CEF02B8277C1257984005AE283-Elbassioni2011k
		2011			[Bredereck, Robert] [Nichterlein, Andr{\'e}] [Niedermeier, Rolf] Philip, Geevarghese	[Murlak, Filip] [Sankowski, Piotr]			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	88C3EF0D3B15E115C12579E8003F2AD1-brederecknichterleinniedermeierphilip2011a
		2011			[Bredereck, Robert] [Nichterlein, Andr{\'e}] [Niedermeier, Rolf] Philip, Geevarghese	[Owe, Olaf] [Steffen, Martin] [Telle, Jan Arne]			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	7E83050F745F9637C12579E8004895A6-BredereckNichterleinNiedermeierPhilip2011b
		2011			Bringmann, Karl Friedrich, Tobias	[Krasnogor, Natalio] [Lanzim, Pier Luca]			Convergence of Hypervolume-Based Archiving Algorithms I: Effectiveness In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 745-752	Proceedings Article	3DED5E5BC5A335DEC1257984004D9BA0-BringmannF2011
		2011			Bringmann, Karl Friedrich, Tobias [Neumann, Frank] [Wagner, Markus]	[Walsh, Toby]			Approximation-guided evolutionary multi-objective optimization In: Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (IJCAI 2011), 1198-1203	Proceedings Article	99E628BF57FF45BBC1257984004F0CF0-BringmannFNW2011
		2011			Busch, Philip Johannes				Analysis of the KIT email graph, with an application of randomized rumour spreading protocols Universität des Saarlandes	Thesis - Bachelor thesis	38D2223A970F3755C12579A3003A0DEC-BuschBach2011
		2011			[Canzar, Stefan] Elbassioni, Khaled [Klau, Gunnar W.] [Mestre, Julian]				On Tree-Constrained Matchings and Generalizations	Unpublished/Draft	81DEB15D64A077E7C1257819005869FB-Elbassioni2012j
		2011			[Canzar,Stefan] Elbassioni, Khaled [Klau, Gunnar W.] [Mestre, Julian]	[Aceto, Luca] [Henzinger, Monika] [Sgall, Jiri]			On Tree-Constrained Matchings and Generalizations In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 98-109	Proceedings Article	E07E21891360F99AC125798400582859-Elbassioni2011f
		2011			Celikik, Marjan Bast, Holger Manolache, Gabriel				Efficient Index-Based Snippet Generation	Unpublished/Draft	EF9BBC883EC66310C12575520052DF35-bastcelikikmanolache2009-snippets
		2011			[Chan, Ho-Leung] [Edmonds, Jeff] [Lam, Tak-Wah] Lee, Lap-Kei [Marchetti-Spaccamela, Alberto] [Pruhs, Kirk]				Nonclairvoyant speed scaling for flow and energy In: Algorithmica [61], 507-517	Journal Article	081821E46DEA6125C1257838000B1146-Lee2010d
		2011			Chan, T.-H. Hubert Elbassioni, Khaled				A QPTAS for TSP with Fat Weakly Disjoint Neighborhoods in Doubling Metrics In: Discrete & Computational Geometry [46], 704-723	Journal Article	F3DED80B9C09EFD2C1257984005A9DDA-Elbassioni2011j
		2011			[Chin, Francis Y. L.] [Guo, Zeyu] Sun, He				Minimum Manhattan Network is NP-Complete In: Discrete & Computational Geometry [45], 701-722	Journal Article	37376E0F583A89AEC1257AD0005AE5BB-Sun2011b
		2011			[Christodoulou, George] Mehlhorn, Kurt [Pyrga, Evangelia]	[Demetrescu, Camil] [Halldórsson, Magnús M.]			Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms In: Algorithms - ESA 2011 : 19th Annual European Symposium, 119-130	Proceedings Article	D203A9C35EF58BBAC12579A3004010FD-Becker2011
		2011			[Cygan, Marek] Philip, Geevarghese [Pilipczuk, Marcin] [Pilipczuk, Micha\l{}] [Wojtaszczyk, Jakub Onufry]				Dominating set is fixed parameter tractable in claw-free graphs In: Theoretical Computer Science [412], 6982-7000	Journal Article	7F1D711B70C807CFC12579E7005BA647-CyganPhilipPilipczukPilipczukWojtaszczyk2011
		2011			De Sterck, Hans [Henson, Van Emden] [Sanders, Geoff]				Multilevel Aggregation Methods for Small-World Graphs with Application to Random-Walk Ranking	Unpublished/Draft	CEAD85A94CE23540C125785B00619E66-DHS2011
		2011			De Sterck, Hans [Miller, Killian] [Sanders, Geoff] [Winlaw, Manda]				Recursively accelerated multilevel aggregation for Markov chains In: SIAM Journal on Scientific Computing [32], 1652-1671	Journal Article	570BCEACCC8AAE32C125785B0061340B-DMSW2010
		2011			Doerr, Benjamin [Eremeev, Anton] Neumann, Frank [Theile, Madeleine] [Thyssen, Christian]				Evolutionary algorithms and dynamic programming In: Theoretical Computer Science [412], 6020-6035	Journal Article	EE4B03C6CB17BA23C125793C0034E53A-DoerrENTT11
		2011			Doerr, Benjamin [Fouz, Mahmoud]				Quasi-random rumor spreading: Reducing randomness can be costly In: Information Processing Letters [111], 227-230	Journal Article	CC6E2D0B80F7BDF7C12578180039A97C-DF2010b
		2011			Doerr, Benjamin [Fouz, Mahmoud]	[Aceto, Luca] [Henzinger, Monika] [Sgall, Jiri]			Asymptotically Optimal Randomized Rumor Spreading In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 502-513	Proceedings Article	8C1ABE585C0AD6F0C125793D002EA1F9-DoerrM11
		2011			Doerr, Benjamin [Fouz, Mahmoud] Friedrich, Tobias				Social Networks Spread Rumors in Sublogarithmic Time In: STOC'11 : Proceedings of the 43rd ACM Symposium on Theory of Computing, 21-30	Proceedings Article	EAC871169FC8ECD6C12578380072A594-2011STOC
		2011			Doerr, Benjamin [Fouz, Mahmoud] [Witt, Carsten]	[Krasnogor, Natalio] [Lanzi, Pier Luca]			Sharp bounds by probability-generating functions and variable drift In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 2083-2090	Proceedings Article	6680D1997E6D2DFDC12579420035A792-DoerrFW11
		2011			Doerr, Benjamin Friedrich, Tobias [Künnemann, Marvin] Sauerwald, Thomas				Quasirandom Rumor Spreading: An Experimental Analysis In: ACM Journal of Experimental Algorithmics [16], Article No. 3.3	Journal Article	99D8FEB43F1CC010C1257984005C0879-DoerrFKS12
		2011			Doerr, Benjamin [Goldberg, Leslie Ann] [Minder, Lorenz] Sauerwald, Thomas [Scheideler, Christian]				Stabilizing consensus with the power of two choices In: 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA-11), 149-158	Proceedings Article	303EAB8CE2336D03C125793C0075BC1D-DoerrGMSS11
		2011			Doerr, Benjamin Happ, Edda Klein, Christian				Tight Analysis of the (1+1)-EA for the Single Source Shortest Path Problem In: Evolutionary Computation [19], 673-691	Journal Article	FA4ACE04ECB183AFC125793C00380F07-DoerrHK11
		2011			Doerr, Benjamin [Jansen, Thomas]				Theory of Evolutionary Computation In: Algorithmica [59], 299-300	Journal Article	86EB902D87B05EE5C125793C0036B9CD-DoerrJ11
		2011			Doerr, Benjamin Johannsen, Daniel Kötzing, Timo [Lehre, Per Christian] Wagner, Markus Winzen, Carola	[Beyer, Hans- Georg] [Langdon, William]			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	DF701387AB3B998CC1257979004CE9D9-Doerr2011
		2011			Doerr, Benjamin Johannsen, Daniel [Schmidt, Martin]	[Beyer, Hans- Georg] [Langdon, William]			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	2D8FB91C251169EFC125793C003A346E-DoerrMJ11
		2011			Doerr, Benjamin Kötzing, Timo Winzen, Carola	[Krasnogor, Natalio] [Lanzi, Pier Luca]			Too fast unbiased black-box algorithms In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 2043-2050	Proceedings Article	2EB20D785767FFCDC125794200369713-DoerrKW11
		2011			Doerr, Benjamin	[Krasnogor, Natalio] [Lanzi, Pier Luca]			Drift analysis In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 1311-1320	Proceedings Article	8613FBFAE53E1DB0C1257942003831A6-Doerr11
		2011			Doerr, Benjamin [Künnemann, Marvin] Wahlström, Magnus	[Müller-Hannemann, Matthias] [Werneck, Renato]			Dependent Randomized Rounding: The Bipartite Case In: 2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX), 96-106	Proceedings Article	6E21D98FD25D4E01C125781800410717-DKW2011
		2011			Doerr, Benjamin [Lengler, Johannes] Kötzing, Timo Winzen, Carola	[Krasnogor, Natalio] [Lanzi, Pier Luca]			Black-box complexities of combinatorial problems In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 981-988	Proceedings Article	D3DF5AF59EF3758DC125793D002CEC0E-DoerrLKW11
		2011			Doerr, Benjamin [Neumann, Frank] [Sudholt, Dirk] [Witt, Carsten]				Runtime analysis of the 1-ANT ant colony optimizer In: Theoretical Computer Science [412], 1629-1644	Journal Article	FA221A4594A3FA37C125793C00355858-DoerrNSW11
		2011			Doerr, Benjamin Winzen, Carola	[Kulikov, Alexande] [Vereshchagin, Nikolay]			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	F1A9AEB158F74307C125785A00431ECA-DoerrW10
		2011			[Durrett, Greg] [Neumann, Frank] [O'Reilly, Una-May]	[Beyer, Hans- Georg] [Langdon, William]			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	7C10E79B95086613C12578290011131E-GPFOGA11
		2011			Elbassioni, Khaled Elmasry, Amr [Makino, Kazuhisa]				Finding Simplices containing the Origin in Two and Three Dimensions In: International Journal of Computational Geometry & Applications [21], 495-506	Journal Article	E8695E621A46B386C1257984005A5429-Elbassioni2011i
		2011			Elbassioni, Khaled [Krohn, Erik] [Matijevic, Domagoj] Mestre, Julian [Severdija, Domagoj]				Improved Approximations for Guarding 1.5-Dimensional Terrains In: Algorithmica [60], 451-463	Journal Article	956F5247482FB868C1257984005B6CF8-Elbassioni2011m
		2011			Elbassioni, Khaled [Makino, Kazuhisa] Rauf, Imran				On the readability of monotone Boolean formulae In: Journal of Combinatorial Optimization [22], 293-304	Journal Article	A8E2DC1A23B8098CC12576CD0007CBC5-JOCO:EMR10
		2011			Elbassioni, Khaled [Tiwary, Hans Raj]				On a cone covering problem In: Computational Geometry [44], 129-134	Journal Article	4D94F714DF3B6E52C12578190053A627-Elbassioni2011a
		2011			[Elsaesser, Robert] Sauerwald, Thomas				Tight bounds for the cover time of multiple random walks In: Theoretical Computer Science [412], 2623-2641	Journal Article	CC48249374D11A8EC1257AD60076A755-ElsaesserS2011
		2011			Emeliyanenko, Pavel	[Smari, Waleed W.] [McIntire, John P.]			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	4C78B0F12389E4E8C125788600538D92-emel-gcd-11
		2011			[Epstein, Leah] [Levin, Asaf] van Stee, Rob				Max-min online allocations with a reordering buffer In: SIAM Journal on Discrete Mathematics [25], 1230-1250	Journal Article	066036EC69FA5143C12577F4004F4A70-EpLeSt11a
		2011			[Epstein, Leah] van Stee, Rob				Improved results for a memory allocation problem In: Theory of Computing Systems [48], 79-92	Journal Article	D4285FA8B979BEB2C12577F4004E594F-EpsSte11
		2011			[Epstein, Leah] van Stee, Rob				On the online unit clustering problem In: ACM Transactions on Algorithms [7], 7:1-7:1	Journal Article	9E466F144E7FBE14C12579CA00351373-vanSteeTALG2011
		2011			Farzan, Arash [Munro, J. Ian]				Succinct representation of dynamic trees In: Theoretical Computer Science [412], 2668-2678	Journal Article	AE1969F01B291A01C125785A003EDED5-FarzanDynamic2011
		2011			[Fellows, Michael R.] [Fertin, Guillaume] Hermelin, Danny [Vialette, Stephane]				Upper and lower bounds for finding connected motifs in vertex-colored graphs In: Journal of Computer and System Sciences [77], 799-811	Journal Article	CBCF4F1DC0B9CA3AC1257965003AF7C7-FellowsFertinHermelinVialette2011
		2011			[Fellows, Michael R.] Friedrich, Tobias Hermelin, Danny [Narodytska, Nina] [Rosamond, Frances A.]	[Walsh, Toby]			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	DE31037BA4B2C9F1C1257965004AACC6-FellowsFriedrichHermelinEtAL2011
		2011			[Fellows, Michael R.] [Hartman, Tzvika] Hermelin, Danny [Landau, Gad M.] [Rosamond, Frances A.] [Rozenberg, Liat]				Haplotype Inference Constrained by Plausible Haplotype Data In: IEEE/ACM Transactions on Computational Biology and Bioinformatics [8], 1692-1699	Journal Article	F45C7F1C896A94F7C1257965003B7D34-FellowsHatrmanHermelinEtAl2011
		2011			[Fernau, Henning] [Fomin, Fedor V.] [Lokshtanov, Daniel] [Mnich, Matthias] Philip, Geevarghese [Saurabh, Saket]	[Iliopoulos, Costas S.] [F. Smyth, William]			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	7BC013916ADCAAE5C12579E70053B367-FernauFominLokshtanovMnichPhilipSaurabh2010
		2011			[Fomin, Fedor V.] [Lokshtanov, Daniel] [Misra, Neeldhara] Philip, Geevarghese [Saurabh, Saket]	[Schwentick, Thomas] [D{\"u}rr, Christoph]			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	F212FCF3266C8AA6C12579E8003D4AD3-FominLokshtanovMisraPhilipSaurabh2011
		2011			[Fomin, Fedor V.] Philip, Geevarghese [Villanger, Yngve]	[Chakraborty, Supratik] [Kumar, Amit]			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	3687810C4C42DDF2C12579E80044B890-FominPhilipVillanger2011
		2011			Fountoulakis, Nikolaos Friedrich, Tobias Hermelin, Danny				Average Case Parameterized Complexity	Unpublished/Draft	1E369A1B9B3C14FCC125784700156F54-avgFPTsubmitted
		2011			Fountoulakis, Nikolaos Khosla, Megha Panagiotou, Konstantinos	[Randall, Dana]			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	2348F75969F43463C125782100072FBC-FountoulakisKhoslaPanagiotou2010
		2011			Fountoulakis, Nikolaos [Panagiotou, Konstantinos]				3-Connected Cores In Random Planar Graphs In: Combinatorics, Probability & Computing [20], 381-412	Journal Article	7DD8C568F1602054C12579CA0035DDEF-Fountoulakis2011
		2011			Friedrich, Tobias [Bringmann, Karl] [Voss, Thomas] [Igel, Christian]	[Beyer, Hans- Georg] [Langdon, William]			The Logarithmic Hypervolume Indicator In: FOGA'11 : Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, 81-92	Proceedings Article	DED363B78B082B28C1257824000E8FBE-FBVI2011
		2011			Friedrich, Tobias Hebbinghaus, Nils				Average update times for fully-dynamic all-pairs shortest paths In: Discrete Applied Mathematics [159], 1751-1758	Journal Article	D0D49A4F9FF543E8C12579CA00370D93-FriedrichDAM2011
		2011			Friedrich, Tobias [Horoba, Christian] Neumann, Frank				Illustration of fairness in evolutionary multi-objective optimization In: Theoretical Computer Science [412], 1546-1556	Journal Article	94EE0DA7283E379DC12579CA0036426D-FriedrichTCS2011
		2011			Friedrich, Tobias Sauerwald, Thomas [Stauffer, Alexandre]	[Asano, Takao] [Nakano, Shin-Ichi] [Okamoto, Yoshio] [Watanabe, Osamu]			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	E029905C580D18EBC1257AD600771136-FriedrichSS11
		2011			Friedrich, Tobias [Sauerwald, Thomas] [Vilenchik, Dan]				Smoothed analysis of balancing networks In: Random Structures & Algorithms [39], 115-138	Journal Article	99FB662D533B1529C12579CA0036BB9F-FriedrichRSA2011
		2011			[Funke, Stefan] [Laue, Soeren] [Lotker, Zvi] Naujoks, Rouven				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	0E5BC38F0E973795C12579CA00377A79-Naujoks2011
		2011			Gao, Pu (Jane)				Distribution of spanning regular subgraphs in random graphs	Unpublished/Draft	FAA0215AAC8F0181C125783300386721-Gao2012dFactor
		2011			[Guo, Zeyu] Sun, He [Zhu, Hong]				Greedy Construction of 2-Approximate Minimum Manhattan Networks In: International Journal of Computational Geometry and Applications [21], 331-350	Journal Article	F33CC87AF4885E34C1257AD0005B486D-Sun2011c
		2011			Harren, Rolf [Jansen, Klaus] [Prädel, Lars] van Stee, Rob	[Dehne, Frank] [Iacono, John] [Sack, Jörg-Rüdiger]			A (5/3 + ε)-Approximation for Strip Packing In: Algorithms and Data Structures : 12th International Symposium, WADS 2011, 475-487	Proceedings Article	E21A303AE7CE9CA1C12579640053B847-HaJaPS11
		2011			Hemmer, Michael [Dupon, Laurent] [Petitjean, Sylvain] [Schomer, Elmar]				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	21BB4C6D0F148A48C12579CA003A5CC7-Hemmer2011
		2011			Hermelin, Danny [Huang, Chien-Chung] [Kratsch, Stefan] Wahlström, Magnus	[Kolman, Petr] [Kratochvíl, Jan]			Parameterized Two-Player Nash Equilibrium In: Graph-Theoretic Concepts in Computer Science : 37th International Workshop, WG 2011, 215-226	Proceedings Article	702F7DBDE76E6942C125796500498142-HermelinHuangKratschWahlstrom2011
		2011			Hermelin, Danny [Levy, Avivit] [Weimann, Oren] [Yuster, Raphael]	[Aceto, Luca] [Henzinger, Monika] [Sgall, Jiri]			Distance Oracles for Vertex-Labeled Graphs In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 490-501	Proceedings Article	918166B667040CC8C1257965004AF558-HermelinLevyWeimanYuster2011
		2011			Hermelin, Danny [Mnich, Matthias] [van Leeuwen, Erik Jan] [Woeginger, Gerhard J.]	[Aceto, Luca] [Henzinger, Monika] [Sgall, Jiri]			Domination When the Stars Are Out In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 462-473	Proceedings Article	83599A2433A76A66C1257965004B4283-HermelinMnichVanLeeuwenWoeginger2011
		2011			Hermelin, Danny [Rawitz, Dror]				Optimization problems in multiple subtree graphs In: Discrete Applied Mathematics [159], 588-594	Journal Article	3A8CBB57C97B7DBAC1257965003C227D-HermelinRawitz2011
		2011			Huang, Chien-Chung [Kavitha, Telikepalli]				Near-popular matchings in the Roommates problem In: 19th European Symposium on Algorithms (ESA),	Proceedings Article	0315E89D6632738DC1257B08005C287A-Huang2011b
		2011			Huang, Chien-Chung [Kavitha, Telikepalli]				Popular Matchings in the Stable Marriage Problem In: 38th International Colloquium on Automata, Languages and Programming (ICALP),	Proceedings Article	1E3A81267B061813C1257B08005BEE68-Huang2011a
		2011			Huang, Chien-Chung [Kavitha, Telikepalli] [Michael, Dimitrios] [Nasr, Meghana]				Bounded Unpopularity Matchings In: Algorithmica [61], 738-757	Journal Article	5DE1D6F21281B693C12579CA0042F6F1-Huang2011
		2011			Jurkiewicz, Tomasz Danilewski, Piotr				Efficient Quicksort and 2D Convex Hull for CUDA, and MSIMD as a Realistic Model of Massively Parallel Computations.	Unpublished/Draft	91CC84BFBFCD729EC12577F4004D549C-JurkiewiczDanilewski2011
		2011			[Kavitha, Telikepalli] Mehlhorn, Kurt Michail, Dimitrios				New Approximation Algorithms for Minimum Cycle Bases of Graphs In: Algorithmica [59], 471-488	Journal Article	9DF47B615A95B3B9C12579CA0043E5C0-KavithaALG2011
		2011			[Kavitha, Telikepalli] Mestre, Julian [Nasre, Meghana]				Popular mixed matchings In: Theoretical Computer Science [412], 2679-2690	Journal Article	F89BA01D8F0DFCCCC12579CA004368D5-KavithaTCS2011
		2011			[Kayal, Neeraj] Saha, Chandan				On the Sum of Square Roots of Polynomials and Related Problems In: 26th IEEE Conference on Computational Complexity (CCC), 292-299	Proceedings Article	2C716AE1496979CBC1257AF600235E07-KS11
		2011			[Kerber, Michael] Sagraloff, Michael				A Note on the Complexity of Real Algebraic Hypersurfaces In: Graphs and Combinatorics [27], 419-430	Journal Article	7783104F3979A92CC1257861003AD917-ks-ncrah-10
		2011			[Kerber, Michael] Sagraloff, Michael	[Leykin, Anton]			Efficient Real Root Approximation In: ISSAC 2011 : Proceedings of the 36th International Symposium on Symbolic and Algebraic Computation, 209-216	Proceedings Article	252F4D664DF83684C1257861003B5A08-KerberSagraloff:RootApprox:2011
		2011			Kötzing, Timo	[Kivinen, Jyrki] [Szepesvári, Csaba] [Ukkonen, Esko] [Zeugmann, Thomas]			Iterative Learning from Positive Data and Counters In: Algorithmic Learning Theory : 22nd International Conference, ALT 2011, 40-54	Proceedings Article	AADE520539DE8E1AC1257965005810A9-KoetzingALT2011
		2011			Kötzing, Timo [Neumann, Frank] Spöhel, Reto	[Krasnogor, Natalio] [Lanzi, Pier Luca]			PAC learning and genetic programming In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 2091-2096	Proceedings Article	EC125C93CBBAACC8C12579650057251D-KoetzingNS11GP
		2011			Kötzing, Timo [Neumann, Frank] [Sudholt, Dirk] [Wagner, Markus]	[Beyer, Hans- Georg] [Langdon, William]			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	0FAC83F420476B89C125785600730001-Koe-Neu-Sud-Wag:c:Foga11AcoLinFun
		2011			Kötzing, Timo [Sudholt, Dirk] [Theile, Madeleine]	[Krasnogor, Natalio] [Lanzi, Pier Luca]			How crossover helps in pseudo-Boolean optimization In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 989-996	Proceedings Article	585283C59D56B1EAC125796500577B89-KoetzingST2011
		2011			[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.]			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	DA83FFABAE4DAD09C125798300776A3D-MainbergerWTJND11
		2011			Manjunath, Madhusudan Mehlhorn, Kurt Panagiotou, Konstantinos Sun, He	[Demetrescu, Camil] [M. Halldórsson, Magnús]			Approximate Counting of Cycles in Streams In: 19th Annual European Symposium on Algorithms (ESA-11), 677-688	Proceedings Article	299D98382B58DBC6C1257AD00058EE5F-Sun2011
		2011			Manjunath, Madhusudan [Sharma, Vikram]				Applications of dimensionality reduction and exponential sums to graph automorphism In: Theoretical Computer Science [412], 3639-3649	Journal Article	7FF470FEA0BA1DADC12579CA00456900-Manjunath2011
		2011			Megow, Nicole Mehlhorn, Kurt Schweitzer, Pascal	[Aceto, Luca] [Henzinger, Monika] [Sgall, Jiří]			Online Graph Exploration: New Results on Old and New Algorithms In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 478-489	Proceedings Article	19606035D4D26455C12578810025513C-Megow2011-explore
		2011			Megow, Nicole [Möhring, Rolf H.] [Schulz, Jens]				Decision Support and Optimization in Shutdown and Turnaround Scheduling In: INFORMS Journal on Computing [23], 189 - 204	Journal Article	17FD9D71FCD1EC46C12576EE003947BF-MegowMS10-turnaround
		2011			Mehlhorn, Kurt Näher, Stefan Schweitzer, Pascal				Certifying algorithms In: Computer Science Review [5], 119-161	Journal Article	8B8E7D3103F923B7C1257AF40045C76B-McConnell2010
		2011			Mehlhorn, Kurt Osbild, Ralf Sagraloff, Michael				A General Approach to the Analysis of Controlled Perturbation Algorithms In: Computational Geometry [44], 507-528	Journal Article	2A5C0FDF3B7C1B18C1257861003B9A82-MOS-CP2011
		2011			Mehlhorn, Kurt Sagraloff, Michael				A deterministic algorithm for isolating real roots of a real polynomial In: Journal of Symbolic Computation [46], 70-90	Journal Article	A0FD28893140854AC125781C003E51F3-MS:Bistream:2011
		2011			Milosavljevic, Nikola [Morozov, Dmitriy] [Skraba, Primoz]				Zigzag Persistent Homology in Matrix Multiplication Time In: Proceedings of the 27th Annual Symposium on Computational Geometry (SCG'11), 216-225	Proceedings Article	3593268046281E88C125785B0072BC23-Milosavljevic2011Zigzag
		2011			[Misra, Neeldhara] Philip, Geevarghese [Raman, Venkatesh] [Saurabh, Saket]	[Fu, Bin] [Du, Ding-Zhu]			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	741DAE625E0BD086C12579E80049B26C-MisraPhilipRamanSaurabh2011
		2011			[Müller, Tobias] Perez-Gimenez, Xavier [Wormald, Nicholas]				Disjoint Hamilton cycles in the random geometric graph In: Journal of Graph Theory [68], 299-322	Journal Article	45625AAD6F63AC19C12579CA00465372-PerezGimenez2011
		2011			[Mütze, Torsten] [Rast, Thomas] Spöhel, Reto	[Randall, Dana]			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	756C48B4DC6ED7CDC12578180067169E-Spoehel2011
		2011			Neumann, Frank [Reichel, Joachim] [Skutella, Martin]				Computing Minimum Cuts by Randomized Search Heuristics In: Algorithmica [59], 323-342	Journal Article	5DF4DDB28E072D87C12579CA0046D764-Neumann2011
		2011			Panagiotou, Konstantinos [Steger, Angelika]	[Randall, Dana]			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	719753CF10771276C12578200064E400-PanagiotouSteger2011
		2011			[Pemmaraju, Sriram V.] Raman, Rajiv [Varadarajan, Kasturi]				Max-coloring and online coloring with bandwidths on interval graphs In: ACM Transactions on Algorithms [7], 35:1-35:21	Journal Article	8E7C69BD5593BC73C12579CA00474806-Pemmaraju2011
		2011			Rizkallah, Christine				Glivenko and Kuroda for Simple Type Theory	Unpublished/Draft	D63DC757AC75CDDBC125799F004F5691-BrownRizkallah2011
		2011			Sagraloff, Michael [Yap, Chee]	[Leykin, Anton]			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	FDC2F7ABB4FB9CB3C1257861003BDC4D-SagraloffYap:CEVAL:2011
		2011			Sauerwald, Thomas [Stauffer, Alexandre]	[Randall, Dana]			Rumor Spreading and Vertex Expansion on Regular Graphs In: 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA-11), 462-475	Proceedings Article	3F0F022A15857AC3C1257818002AFBE4-Sauerwald2010
		2011			[Shervashidze, Nino] Schweitzer, Pascal [van Leeuwen, Erik Jan] Mehlhorn, Kurt [Borgwardt, Karsten M.]				Weisfeiler-Lehman graph kernels In: Journal of Machine Learning Research [12], 2539-2561	Journal Article	11F8B9324866AC60C12579CA004E38AC-Shervashidze2011
		2011			van Stee, Rob	[Jansen, Klaus] [Solis-Oba, Roberto]			An improved algorithm for online rectangle filling In: Approximation and Online Algorithms : 8th International Workshop, WAOA 2010, 249-260	Proceedings Article	2C2ACFEA812FE38AC12577F40051C18E-vanStee2010
		2011			van Zuylen, Anke				An improved monotone algorithm for scheduling related machines with precedence constraints In: Operations Research Letters [39], 423-427	Journal Article	6AFD3B3383308DE8C125796B00551CA9-vanZuylenORL2011
		2011			van Zuylen, Anke				Deterministic Sampling Algorithms for Network Design In: Algorithmica [60], 110-151	Journal Article	ACBF844C7F8D05F7C125796B0050A0DE-vanZuylenALG2011
		2011			van Zuylen, Anke				Linear programming based approximation algorithms for feedback set problems in bipartite tournaments. In: Theoretical Computer Science [412], 2556-2561	Journal Article	27AAD53E081C236AC125796B00555513-vanZuylenTCS2011
		2011			Wagner, Markus [Veeramachaneni, Kalyan] [Neumann, Frank] [O'Reilly, Una-May]				Optimizing the Layout of 1000 Wind Turbines In: European Wind Energy Association Annual Event, 1-10	Proceedings Article	08F2E8F1D20AB7FEC125785D00343A1B-Wagner2011EWEA
		2011			Wahlström, Magnus				New Plain-Exponential Time Classes for Graph Homomorphism In: Theory of Computing Systems [49], 273-282	Journal Article	F276466B56FE6F94C12578180039A767-Wahl2010
		2011			Winzen, Carola				Direction-Reversing Quasi-Random Rumor Spreading with Restarts	Unpublished/Draft	8466A3A45DA6505DC125785A00445D67-Winzen2011b
		2010			Ajwani, Deepak Friedrich, Tobias				Average-case Analysis of Incremental Topological Ordering In: Discrete Applied Mathematics [158], 240-250	Journal Article	9CEC82A28A3AF944C12576A70053D761-AF10
		2010			[Althaus, Ernst] [Altmeyer, Sebastian] Naujoks, Rouven	[Becker, Bernd] [Damm, Werner] [Fränzle, Martin] [Olderog, Ernst-Rüdiger] [Podelski, Andreas] [Wilhelm, Reinhard]			A New Combinatorial Approach to Parametric Path Analysis	Report	7741AE14A57A7C00C125781100477B84-Naujoks10a
		2010			[Ambalath, Abhimanyu M.] [Balasundaram, Radheshyam] [H., Chintan Rao] [Koppula, Venkata] [Misra, Neeldhara] Philip, Geevarghese [Ramanujan, M. S.]	[Raman, Venkatesh] [Saurabh, Saket]			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	D558C5669BD4F498C12579E700554A6D-AmbalathBalasundaramHKoppulaMisraPhilipRamanujan2010
		2010			Angelopoulos, Spyros	[Bampis, Evripidis] [Jansen, Klaus]			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	8F2385D13F0A6BB4C12576C600448558-Angelopoulos:waoa2009
		2010			Angelopoulos, Spyros [Borodin, Allan]				Randomized Priority Algorithms In: Theoretical Computer Science [411], 2542-2558	Journal Article	1B91BC8C3527AD3BC1257822004B0A71-Angelopoulos.Borodin:randomized.2010
		2010			Bansal, Nikhil [Gupta, Anupam] [Li, Jian] Mestre, Julián [Nagarajan, Viswanath] [Rudra, Atri]	[de Berg, Mark] [Meyer, Ulrich]			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	CBC6857D9FA96711C12578180053B0C6-Bansal2010
		2010			[Bar-Yehuda, Reuven] Hermelin, Danny [Rawitz, Dror]	[de Berg, Mark] [Meyer, Ulrich]			Minimum Vertex Cover in Rectangle Graphs In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. I, 255-266	Proceedings Article	D46FA9984C7C4EE7C12578180053A69E-Hermelin2010
		2010			[Baruah, Sanjoy] Bonifaci, Vincenzo [D'Angelo, Gianlorenzo] [Li, Haohan] [Marchetti-Spaccamela, Alberto] Megow, Nicole [Stougie, Leen]	[Hlinen{\'y}, Petr] [Kucera, Anton\'{\i}n]			Scheduling Real-Time Mixed-Criticality Jobs In: Mathematical Foundations of Computer Science 2010 : 35th International Symposium, MFCS 2010, 90-101	Proceedings Article	2286C7D71CA98070C12577FF0059CA54-Bonifaci:2010:c
		2010			[Baruah, Sanjoy] Bonifaci, Vincenzo [Marchetti-Spaccamela, Alberto] [Stiller, Sebastian]				Improved Multiprocessor Global Schedulability Analysis In: Real-Time Systems [46], 3-24	Journal Article	E1118AD400D9D901C12577FF005EC573-Baruah:2010
		2010			[Basit, Abdul] [Mustafa, Nabil H.] Ray, Saurabh [Raza, Sarfraz]				Centerpoints and Tverberg's technique In: Computational Geometry [43], 593-600	Journal Article	0AF6C57189751CE2C12578300047A10F-Basit2010
		2010			[Batra, Prashant] Sharma, Vikram				Bounds on absolute positiveness of multivariate polynomials In: Journal of Symbolic Computation [45], 617-628	Journal Article	8E19451B627CB774C1257830004874CA-BatraSharma2010
		2010			Berberich, Eric [Fogel, Efi] [Halperin, Dan] [Kerber, Michael] [Setter, Ophir]				Arrangements on Parametric Surfaces II: Concretizations and Applications In: Mathematics in Computer Science [4], 67-91	Journal Article	D629FAA0B366572BC12577FB002E405B-bfhks-aos2-2010
		2010			Berberich, Eric [Fogel, Efi] [Halperin, Dan] Mehlhorn, Kurt [Wein, Ron]				Arrangements on Parametric Surfaces I: General Framework and Infrastructure In: Mathematics in Computer Science [4], 45-66	Journal Article	745F1A8BE751371AC12577FB002DE576-bfhmw-aos1-2010
		2010			Berberich, Eric [Hagen, Matthias] [Hiller, Benjamin] [Moser, Hannes]	[Müller-Hannemann, Matthias] [Schirra, Stefan]			Experiments In: Algorithm Engineering : Bridging the Gap between Algorithm Theory and Practice, 325-388	Part of a Book	D87CB35967903CF9C12577FB002BFAFA-bhhm-giae-exp-2010
		2010			Berberich, Eric [Hemmer, Michael] [Kerber, Michael]				A Generic Algebraic Kernel for Non-linear Geometric Applications	Report	4DF2B1DAA1910721C12577FB00348D67-bhk-ak2-inria-2010
		2010			Berberich, Eric Kerber, Michael Sagraloff, Michael				An efficient algorithm for the stratification and triangulation of an algebraic surface In: Computational Geometry: Theory and Applications (CGTA) [43], 257-278	Journal Article	B63B3D0867D2A371C12576A20035BC34-bks-cgta-2009
		2010			[Berghammer, Rudolf] Friedrich, Tobias Neumann, Frank	[Pelikan, Martin] [Branke, Jürgen]			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	01941B842D4A068FC12578240063BC9E-BFN2010
		2010			[Blelloch, Guy E.] Farzan, Arash	[Amir, Amihood] [Parida, Laxmi]			Succinct Representations of Separable Graphs In: Combinatorial Pattern Matching : 21st Annual Symposium, CPM 2010, 138-150	Proceedings Article	D6865F434DFCB112C1257816000198FF-Farzan2010a
		2010			Bonifaci, Vincenzo Chan, Ho-Leung [Marchetti-Spaccamela, Alberto] Megow, Nicole	[Charikar, Moses]			Algorithms and Complexity for Periodic Real-Time Scheduling In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1350-1359	Proceedings Article	589EFB7CE4CE25C1C12576A70057A553-Bonifaci:2010:b
		2010			Bonifaci, Vincenzo [Harks, Tobias] [Schäfer, Guido]				Stackelberg Routing in Arbitrary Networks In: Mathematics of Operations Research [35], 330 - 346	Journal Article	9CA118DFF9513FF6C12577FF006056B0-Bonifaci:2009:a
		2010			Bonifaci, Vincenzo [Marchetti-Spaccamela, Alberto]	[de Berg, Mark] [Meyer, Ulrich]			Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. II, 230-241	Proceedings Article	5BD671C7840ABF55C1257806004DFB99-Bonifaci:2010:d
		2010			[Boros, Endre] Elbassioni, Khaled [Gurvich, Vladimir] [Makino, Kazuhisa]				On effectivity functions of game forms In: Games and Economic Behavior [68], 512-531	Journal Article	458165DC43262CFBC12578170057D83B-BorosElbassioniGurvich2010
		2010			[Boros, Endre] Elbassioni, Khaled [Gurvich, Vladimir] [Makino, Kazuhisa]				On Nash Equilibria and Improvement Cycles in Pure Positional Strategies for Chess-like and Backgammon-like $n$-person Games	Unpublished/Draft	D132B734EC2F3565C1257823004A4879-Elbassioni2010h
		2010			[Boros, Endre] Elbassioni, Khaled [Gurvich, Vladimir] [Makino, Kazuhisa]	[Eisenbrand, Friedrich] [Shepherd, F. Bruce]			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	76C08CFCB8142574C12576CC0050D956-Elbassioni2009d
		2010			[Boros, Endre] Elbassioni, Khaled [Makino, Kazuhisa]				Left-to-right multiplication for monotone Boolean dualization In: SIAM Journal on Computing [39], 3424-3439	Journal Article	3A46EC9FF9152184C12578170057547D-BorosElabassioniMakino2010
		2010			[Böttcher, Süntje] Doerr, Benjamin Neumann, Frank	[Schaefer, Robert] [Cotta, Carlos] [Kolodziej, Joanna] [Rudolph, Günter]			Optimal fixed and adaptive mutation rates for the LeadingOnes problem In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 1-10	Proceedings Article	391D24C355E1AF79C125781800481640-BDN2010
		2010			[Bradonjić, Milan] [Elsässer, Robert] Friedrich, Tobias [Sauerwald, Thomas] [Stauffer, Alexandre]	[Charikar, Moses]			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	370EBD653C6186FEC12576A700532133-FriedrichRGG2010
		2010			[Bringmann, Karl] Friedrich, Tobias				An Efficient Algorithm for Computing Hypervolume Contributions In: Evolutionary Computation [18], 383-402	Journal Article	FB3455447F3C0EA8C12578240063FA8D-TF_ECJ4
		2010			Bringmann, Karl Friedrich, Tobias				Approximating the volume of unions and intersections of high-dimensional geometric objects In: Computational Geometry [43], 601-610	Journal Article	E6942297C7268C45C125782400643C2D-TF_CGTA1
		2010			[Bringmann, Karl] Friedrich, Tobias				The Maximum Hypervolume Set Yields Near-optimal Approximation In: 12th annual conference on Genetic and evolutionary computation (GECCO 2010), 511-518	Proceedings Article	8B2CF5828A2CA39AC125782400638D26-BF2010GECCO
		2010			[Bringmann, Karl] Friedrich, Tobias	[Schaefer, Robert] [Cotta, Carlos] [Kolodziej, Joanna] [Rudolph, Günter]			Tight Bounds for the Approximation Ratio of the Hypervolume Indicator In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 607-616	Proceedings Article	48D09E356DD4F730C1257824000E4475-BF2010PPSN
		2010			[Butman, Ayelet] Hermelin, Danny [Lewenstein, Moshe] [Rawitz, Dror]				Optimization problems in multiple-interval graphs In: ACM Transactions on Algorithms [6], 40,1-40,18	Journal Article	80FB59574616BD14C1257818005450AD-Hermelin2010b
		2010			[Canzar, Stefan] Elbassioni, Khaled [Elmasry, Amr] [Raman, Rajiv]	[Cheong, Otfried] [Chwa, Kyung-Yong] [Park, Kunsoo]			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	5F33EABB31899F8DC125781900549418-Elbassioni2010
		2010			[Canzar, Stefan] Elbassioni, Khaled Mestre, Julian				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	947E450D8ADD2C6FC1257682002F89AB-Mestre2010a
		2010			[Case, John] Kötzing, Timo	[Hutter, Marcus] [Stephan, Frank] [Vovk, Vladimir] [Zeugmann, Thomas]			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	62C151E58D79F70FC12577F80053535A-Koetzing2010NUMemLimited
		2010			[Case, John] Kötzing, Timo	[Kalai, Adam Tauman] [Mohri, Mehryar]			Strongly Non-U-Shaped Learning Results by General Techniques In: COLT 2010 : The 23rd Conference on Learning Theory, 181-193	Proceedings Article	BC477E1171D758CAC12577F80051F0BA-Koetzing2010NUTechniques
		2010			[Chan, Sze-Hang] [Lam, Tak-Wah] Lee, Lap-Kei	[de Berg, Mark] [Meyer, Ulrich]			Non-clairvoyant speed scaling for weighted flow time In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. I, 23-35	Proceedings Article	146629A6E1D25BF6C12577F40047FC64-Lee2010b
		2010			Christodoulou, George [Chung, Christine] [Ligett, Katrina] Pyrga, Evangelia van Stee, Rob	[Bampis, Evripidis] [Jansen, Klaus]			On the price of stability for undirected network design In: Approximation and Online Algorithms : 7th International Workshop, WAOA 2009, 86-97	Proceedings Article	15740B661D36E848C12577F40050BB78-CCLPS2009
		2010			[Christodoulou, George] Elbassioni, Khaled [Fouz, Mahmoud]	[Saberi, Amin]			Truthful Mechanisms for Exhibitions In: Internet and Network Economics : 6th International Workshop, WINE 2010, 170-181	Proceedings Article	C2AE407E8C0D7885C1257819005640E6-Elbassioni2010i
		2010			Christodoulou, George [Koutsoupias, Elias] [Kovács, Annamária]				Mechanism Design for Fractional Scheduling on Unrelated Machines In: ACM Transactions on Algorithms [6], 38:1-38:18	Journal Article	70E7CA17771957E4C125755C0039CD71-CKK2009
		2010			Christodoulou, George [Kovács, Annamária]	[Charikar, Moses]			A deterministic truthful PTAS for scheduling related machines In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1005-1016	Proceedings Article	B9B46BAAB3CA9D47C1257818002D3B8B-ChristodoulouKavacs2010
		2010			[Christodoulou, George] [Kovacs, Annamaria] van Stee, Rob	[Saberi, Amin]			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	0F8E6D7392675EDAC12577F400520301-ChKoSt10
		2010			[Christodoulou, Giorgos] [Ligett, Katrina] Pyrga, Evangelia	[Abramsky, Samson] [Gavoille, Cyril] [Kirchner, Claude] [Meyer auf der Heide, Friedhelm] [Spirakis, Paul]			Contention Resolution under Selfishness In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010. - Pt. II, 430-441	Proceedings Article	30945EFEF69FAA0BC125781F0044245C-CPL2010
		2010			[Cooper, Joshua] Doerr, Benjamin Friedrich, Tobias [Spencer, Joel]				Deterministic Random Walks on Regular Trees In: Random Structures and Algorithms [37], 353-366	Journal Article	E6176FFCBC98E3B2C12576A7005392C2-DCFS2010
		2010			Doerr, Benjamin [Fouz, Mahmoud]				Hereditary Discrepancies in Different Numbers of Colors II In: SIAM Journal on Discrete Mathematics [24], 1205-1213	Journal Article	E4D0144138E27271C1257818002ECAC9-DoerrFouz2010
		2010			Doerr, Benjamin Fouz, Mahmoud [Witt, Carsten]	[Pelikan, Martin] [Branke, Jürgen]			Quasirandom Evolutionary Algorithms In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 1457-1464	Proceedings Article	5619919E2314E155C12578180049325F-DoerrFW2010
		2010			Doerr, Benjamin [Gnewuch, Michael] Wahlström, Magnus				Algorithmic construction of low-discrepancy point sets via dependent randomized rounding In: Journal of Complexity [26], 490-507	Journal Article	7BD5CB3333B17C08C125781500511480-DGW10
		2010			Doerr, Benjamin [Goldberg, Leslie Ann] [Minder, Lorenz] [Sauerwald, Thomas] [Scheideler, Christian]	[Lynch, Nancy A.] [Shvartsman, Alexander A.]			Brief Announcement: Stabilizing Consensus with the Power of Two Choices In: Distributed Computing : 24th International Symposium, DISC 2010, 528-530	Proceedings Article	52FBF47A0A49DCF5C125781800464286-Doerretal2010b
		2010			Doerr, Benjamin [Goldberg, Leslie Ann]	[Schaefer, Robert] [Cotta, Carlos] [Kolodziej, Joanna] [Rudolph, Günter]			Adaptive Drift Analysis In: Parallel Problem Solving from Nature -- PPSN XI. -- Pt. 1, 32-41	Proceedings Article	A47AEE651FDEB83AC125781800477393-DG2010b
		2010			Doerr, Benjamin [Goldberg, Leslie Ann]	[Schaefer, Robert] [Cotta, Carlos] [Kolodziej, Joanna] [Rudolph, Günter]			Drift Analysis with Tail Bounds In: Parallel Problem Solving from Nature – PPSN XI. - Pt. 1, 174-183	Proceedings Article	A327019CDF132919C12578180048185A-DG2010a
		2010			Doerr, Benjamin [Jansen, Thomas] [Sudholt, Dirk] Winzen, Carola [Zarges, Christine]	[Schaefer, Robert] [Cotta, Carlos] [Kolodziej, Joanna] [Rudolph, Günter]			Optimizing Monotone Functions Can Be Difficult In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 42-51	Proceedings Article	FDE717515D9BDB45C12577AC00466269-DoerrJSWZ10
		2010			Doerr, Benjamin Johannsen, Daniel Kötzing, Timo Neumann, Frank [Theile, Madeleine]	[Schaefer, Robert] [Cotta, Carlos] [Kolodziej, Joanna] [Rudolph, Günter]			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	DAF9F353F1E3426CC12577FA003CEE2F-Doe-Joh-Koe-Neu-The:c:10:APSPCrossover
		2010			Doerr, Benjamin [Johannsen, Daniel]	[Pelikan, Martin] [Branke, Jürgen]			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	3EB4D21F761F151BC12578180049A8CF-DoerrJ2010
		2010			Doerr, Benjamin Johannsen, Daniel Winzen, Carola				Drift Analysis and Linear Functions Revisited In: Proceedings of the IEEE Congress on Evolutionary Computation (CEC 2010). - Pt. 3, 1967-1974	Proceedings Article	3E0EA953EA3E3516C12577F2004CFD3F-DoerrJW10b
		2010			Doerr, Benjamin Johannsen, Daniel Winzen, Carola	[Pelikan, Martin] [Branke, Jürgen]			Multiplicative Drift Analysis In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 1449-1456	Proceedings Article	B350C4BA1F99698EC125776500596364-DoerrJW10a
		2010			Doerr, Benjamin [Künnemann, Marvin] Wahlström, Magnus	[Festa, Paola]			Randomized Rounding for Routing and Covering Problems: Experiments and Improvements In: Experimental Algorithms : 9th International Symposium, SEA 2010, 190-201	Proceedings Article	8EE8DD242C1290DFC125781800316299-DoerrKuennemann2010
		2010			Doerr, Benjamin Neumann, Frank				In Memoriam: Ingo Wegener In: Algorithmica [58], 541-542	Journal Article	9EB8D7FCADB9E07AC1257818002FC465-DoerrNeumann
		2010			Doerr, Benjamin Neumann, Frank [Wegener, Ingo]				Editorial In: Algorithmica [57], 119-120	Journal Article	4E317040E9A1BB22C12578180032014D-DoerrNeumannWegener2010
		2010			Elbassioni, Khaled [Chan, Hubert]	[Charikar, Moses]			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	7DDE7C21E69540D8C12576CC0036A890-Elbassioni2010a
		2010			Elbassioni, Khaled [Fouz, Mahmoud] [Swamy, Chaitanya]	[Saberi, Amin]			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	AE30AD3899722E46C125781900568B92-Elbassioni2010g
		2010			Elbassioni, Khaled [Matijevic, Domagoj] [Severdija, Domagoj]	[Vahrenhold, Jan]			Guarding 1.5-Dimensional with Demands In: 26th European Workshop on Computational Geometry (EuroCG 2010), 133-136	Proceedings Article	54412721AE742706C12576CC00370235-Elbassioni2010b
		2010			Elbassioni, Khaled [Rauf, Imran]				Polynomial-time dualization of r-exact hypergraphs with applications in geometry In: Discrete Mathematics [310], 2356-2363	Journal Article	F59CE9A4412A6F7DC12578180032EE53-ElbassioniRauf2010
		2010			Elbassioni, Khaled Rauf, Imran				Polynomial-time Dualization of $r$-Exact Hypergraphs with Applications in Geometry	Unpublished/Draft	F9C5B1613714FC32C1257571004D1E1B-ElbRau09a
		2010			Elmasry, Amr				Pairing heaps, scrambled pairing and square-root trees In: International Journal of Computer Mathematics [87], 3096-3110	Journal Article	53382861E47D8561C12578300049C322-Elmasry2010
		2010			Elmasry, Amr				The longest almost-increasing subsequence In: Information Processing Letters [110], 655-658	Journal Article	3E05E11DB8A6128DC1257830004A61F2-Elmasry2010a
		2010			Elmasry, Amr [Jensen, Claus] [Katajainen, Jyrki]	[Boldi, Paolo] [Gargano, Luisa]			The Magic of a Number System In: Fun with Algorithms : 5th International Conference, FUN 2010, 156-165	Proceedings Article	AB447071D867DFA2C1257830004B1BC1-Elmasry2010c
		2010			Elmasry, Amr [Jensen, Claus] [Katajainen, Jyrki]	[Kaplan, Haim]			Strictly-regular number system and data structures In: Algorithm Theory - SWAT 2010 : 12th Scandinavian Symposium and Workshops on Algorithm Theory, 26-37	Proceedings Article	FB8E5DF4FC61464AC1257830004AA73E-Elmasry2010b
		2010			Emeliyanenko, Pavel				Accelerating Symbolic Computations on NVIDIA Fermi In: Poster presentation at GTC'10 (NVIDIA research summit), -	Poster	03DA2533D561E790C125781F005E9F6C-Emel-gtc-10
		2010			Emeliyanenko, Pavel	[Hsu, Ching-Hsien] [Yang, Laurence T.] [Park, Jong Hyuk] [Yeo, Sang-Soo]			Modular Resultant Algorithm for Graphics Processors In: Algorithms and Architectures for Parallel Processing : 10th International Conference, ICA3PP 2010. - Pt. 1, 427-440	Proceedings Article	D5EE15589E975335C12576DB00591AB7-emel_gpures_2010
		2010			Emeliyanenko, Pavel	[Moreno Maza, Marc] [Roch, Jean-Louis]			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	914FA0CEEC2697F1C1257709004B3F27-res_2010
		2010			[Epstein, Leah] [Levin, Asaf] [Marchetti-Spaccamela, Alberto] Megow, Nicole Mestre, Julian Skutella, Martin [Stougie, Leen]	[Eisenbrand, Friedrich] [Shepherd, F. Bruce]			Universal sequencing on a single machine In: Integer Programming and Combinatorial Optimization : 14th International Conference, IPCO 2010, 230-243	Proceedings Article	42F352C13B1996CBC12576C0007468FC-EpsteinAMMMSS2010
		2010			[Epstein, Leah] [Levin, Asaf] van Stee, Rob	[Abramsky, Samson] [Gavoille, Cyril] [Kirchner, Claude] [Meyer auf der Heide, Friedhelm] [Spirakis, Paul G.]			Max-min online allocations with a reordering buffer In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010, 336-347	Proceedings Article	2603A794E779C386C12577F4005161E8-EpLeSt10
		2010			[Epstein, Leah] van Stee, Rob				Maximizing the minimum load for selfish agents In: Theoretical Computer Science [411], 44-57	Journal Article	6ABBCF3CD615DFC4C12576C8005163F0-EpsSte2009
		2010			[Epstein, Leah] van Stee, Rob				On the online unit clustering problem In: ACM Transactions on Algorithms [7], 1-18	Journal Article	715D6553B941E64FC125755C003E9FD9-vanStee2009a
		2010			Farzan, Arash [Gagie, Travis] [Navarro, Gonzalo]	[Cheong, Otfried] [Chwa, Kyung-Yong] [Park, Kunsoo]			Entropy-Bounded Representation of Point Grids In: Algorithms and Computation : 21st International Symposium, ISAAC 2010. - Pt. II, 327-338	Proceedings Article	1D263E7FF89D9A3AC125781600011E81-Farzan2010
		2010			[Fernau, Henning] [Fomin, Fedor V.] Philip, Geevarghese [Saurabh, Saket]	[Thai, My T.] [Sahni, Sartaj]			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	3612E39760E9A1BEC12579E70058311E-FernauFominPhilipSaurabh2010
		2010			Fountoulakis, Nikolaos Huber, Anna Panagiotou, Konstantinos				Reliable broadcasting in random networks and the effect of density In: 2010 Proceedings IEEE INFOCOM, 2552-2560	Proceedings Article	97EF45E9B7C8D0ACC125780A00658C4F-FHPInfocom10
		2010			Fountoulakis, Nikolaos Panagiotou, Konstantinos	[Abramsky, Samson] [Gavoille, Cyril] [Kirchner, Claude] [Meyer auf der Heide, Friedhelm] [Spirakis, Paul G.]			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	DDB6708D6670BEE0C125780A0065F179-FPIcalp2010
		2010			Fountoulakis, Nikolaos Panagiotou, Konstantinos	[Serna, Maria] [Shaltiel, Ronen] [Jansen, Klaus] [Rolim, José]			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	B8BCAA20B41EDE51C125780A00662135-FPRandom10
		2010			Friedrich, Tobias [Gairing, Martin] [Sauerwald, Thomas]	[Charikar, Moses]			Quasirandom Load Balancing In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1620-1629	Proceedings Article	D71D5B37C9F51578C12576A70052FB2F-Friedrich2009
		2010			Friedrich, Tobias Hebbinhaus, Nils Neumann, Frank				Plateaus Can Be Harder in Multi-Objective Optimization In: Theoretical Computer Science [411], 854-864	Journal Article	BD82BA48FCBC30BDC12576A70053C4B9-FHN10
		2010			Friedrich, Tobias [He, Jun] Hebbinghaus, Nils Neumann, Frank [Witt, Carsten]				Approximating Covering Problems by Randomized Search Heuristics using Multi-Objective Models In: Evolutionary Computation [18], 617 - 633	Journal Article	7BB1F28734D0480EC12576A70053AD46-FHHNW10
		2010			Friedrich, Tobias Neumann, Frank				When to Use Bit-Wise Neutrality In: Natural Computing [9], 283 - 294	Journal Article	38E09C4C7299DDECC1257555002DFF14-FriNeuNat2009
		2010			Friedrich, Tobias [Sauerwald, Thomas]	[Thai, My T.] [Sahni, Sartaj]			The Cover Time of Deterministic Random Walks In: Computing and Combinatorics : 16th Annual International Conference, COCOON 2010, 130-139	Proceedings Article	B19783D54E31DC81C125782400636026-FriedrichSauerwald2010
		2010			Gao, Pu (Jane) [Wormald, Nicholas] [Su, Yi]				Induced subgraphs in sparse random graphs with given degree sequence	Unpublished/Draft	A556630FB0563343C12578330037EF67-Gao2010DegSub
		2010			[Garg, Naveen] [Kavitha, T.] [Kumar, Amit] Mehlhorn, Kurt Mestre, Julián				Assigning Papers to Referees In: Algorithmica [58], 119-136	Journal Article	213E0759D254F459C12576C500583EE4-MehlhonMestre2009
		2010			[Giannopoulos, Panos] [Klein, Rolf] Kutz, Martin [Marx, Daniel]				Computing geometric minimum-dilation graphs is NP-hard In: International Journal of Computational Geometry & Applications [20], 147-173	Journal Article	1CA6566A9621EFC2C12578310042D9F7-Giannopoulos2010
		2010			Gidenstam, Anders [Papatriantafilou, Marina] [Tsigas, Philippas]				NBmalloc: Allocating Memory in a Lock-Free Manner In: Algorithmica [58], 304-338	Journal Article	DFFF680552E3AFB5C125783100442EA8-Gidenstam2010
		2010			[Gotthilf, Zvi] [Hermelin, Danny] [Landau, Gad M.] [Lewenstein, Moshe]				Restricted LCS In: 17th International Symposium on String Processing and Information Retrieval, 250-257	Proceedings Article	3867310EABDEB731C125783A005FAE64-HermelinLCS2010
		2010			[Guibas, Leonidas] Milosavljevic, Nikola [Motskin, Arik]				Connected Dominating Sets on Dynamic Geometric Graphs In: Proceedings of the 22nd Canadian Conference on Computational Geometry (CCCG2010), 27-30	Proceedings Article	8620459737084BBEC12577FA0053C12E-Milosavljevic2009
		2010			[Günther, Elisabeth] [König, Felix] Megow, Nicole	[Bampis, Evripidis] [Jansen, Klaus]			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	3EE994B44B34924FC12576A70056E593-GuentherKM2010
		2010			[Hajiaghayi, MohammadTaghi] [Khandekar, Rohit] [Kortsarz, Guy] Mestre, Julian	[Serna, Maria] [Shaltiel, Ronen] [Jansen, Klaus] [Rolim, José]			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	51B3B0AA2C929C55C125782300029576-approxMestre2010
		2010			[Han, Xin] [Lam, Tak-Wah] Lee, Lap-Kei [To, Isaac K. K.] [Wong, Prudence W. H.]				Deadline scheduling and power management for speed bounded processors In: Theoretical Computer Science [411], 3587-3600	Journal Article	A947AC600E40EB25C12577F40048EB52-Lee2010c
		2010			Huang, Chien-Chung				Circular stable matching and 3-way kidney transplant In: Algorithmica [58], 137-150	Journal Article	F0398C7AD6E90C77C1257831004685C7-Huang2010a
		2010			Huang, Chien-Chung	Charikar, Moses			Classified stable matching In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1235-1253	Proceedings Article	8119BC8E80609EB5C1257831004566AF-Huang2010
		2010			[Iacono, G.] Ramezani, Fahimeh [Soranzo, N.] [Altafani, C.]				Determining the distance to monotonicity of a biological network: a graph-theoretical approach In: IET Systems Biology [4], 223-235	Journal Article	90B2350DCC1BBB4BC12578310048F5A2-Ramezani2010
		2010			[Jansen, Klaus] Kratsch, Stefan [Marx, Dániel] [Schlotter, Ildikó]	[Kaplan, Haim]			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	1CABAF65328148DEC12578260034BDD2-JansenKMS2010
		2010			[Jansen, Thomas] Neumann, Frank				Editorial for the Special Issue on Theoretical Aspects of Evolutionary Multi-Objective Optimization In: Evolutionary Computation [18], 333-334	Journal Article	47F225BFEDF7C8A0C12578340039A036-JansenNeumann2010
		2010			Johannsen, Daniel Lengler, Johannes	[Pelikan, Martin] [Branke, Jürgen]			Can Quantum Search Accelerate Evolutionary Algorithms? In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 1433-1440	Proceedings Article	0BF697A0750717A9C1257A4B0065A8FA-JohannsenLK2010
		2010			Johannsen, Daniel Panagiotou, Konstantinos	[Charikar, Moses]			Vertices of Degree k in Random Maps In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1436-1447	Proceedings Article	62B79C020E77204CC1257671004DA4D8-JohannsenPanagiotou2010
		2010			[Kao, Ming-Yang] [Leung, Henry C. M.] Sun, He [Zhang, Yong]	[Kratchovil, Jan] [Li, Angsheng] [Fiala, Jiri] [Kolman, Petr]			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	1B9A65E3FA51029CC125782A00552231-Sun2010
		2010			[Kasprzik, Anna] Kötzing, Timo	[Martin-Vide, Carlos] [Fernau, Henning] [Dediu, Adrian Horia]			String Extension Learning Using Lattices In: Language and Automata Theory and Applications : 4th International Conference, LATA 2010, 380-391	Proceedings Article	5FEDD4619F6CF932C12577F8005126C6-Koetzing2010LatticeLearning
		2010			Kötzing, Timo [Lehre, Per Kristian] Neumann, Frank [Oliveto, Pietro S.]	[Pelikan, Martin] [Branke, Jürgen]			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	C042CD9C35F8A1EEC12577FA003B1657-Koe-Leh-Neu-Oli:c:10:AcoMinCut
		2010			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]			Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem In: Swarm Intelligence : 7th International Conference, ANTS 2010, 324-335	Proceedings Article	0A9161A58B6F3EF9C12577FA003BF2A4-Koe-Neu-Roe-Wit:c:10:ACOTSP
		2010			Kratsch, Stefan [Lehre, Per Kristian] [Neumann, Frank] [Oliveto, Pietro Simone]	[Schaefer, Robert] [Cotta, Carlos] [Kolodziej, Joanna] [Rudolph, Günter]			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	DB47583C9CB9B59CC12578260035A084-KratschLNO2010
		2010			Kratsch, Stefan [Marx, Dániel] Wahlström, Magnus	[Hlinený, Petr] [Kucera, Antonín]			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	844882560F95E66DC125781800392DEF-KMW2010
		2010			Kratsch, Stefan Schweitzer, Pascal	[Kaplan, Haim]			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	E088F7857847D85CC125782600352D01-KratschS2010
		2010			Kratsch, Stefan Wahlström, Magnus	[Abramsky, Samson] [Gavoille, Cyril] [Kirchner, Claude] [Meyer auf der Heide, Friedhelm] [Spirakis, Paul G.]			Preprocessing of Min Ones Problems: A Dichotomy In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010, 653-665	Proceedings Article	920AF7B5945110B1C125781800386591-KW2010b
		2010			[Kuhn, Fabian] Panagiotou, Konstantinos [Spencer, Joel] [Steger, Angelika]	[Charikar, Moses]			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	C5902D6956018858C12578210007D951-KPSS2010
		2010			Megow, Nicole	[Biermann, Katja] [Götschel, Martin] [Lutz-Westphal, Brigitte]			Keller oder Dach zuerst In: Besser als Mathe, 111-116	Part of a Book	1518CDE8325D7049C12576A700586235-MegowMatheonBuch2009
		2010			Mehlhorn, Kurt	[Fukuda, Komei] [Van der Hoeven, Joris] [Joswig, Michael] [Takayama, Nobuki]			Reliable and Efficient Geometric Computing In: Mathematical Software, ICMS 2010 : Third International Congress on Mathematical Software, 10-11	Proceedings Article	ECD1954FEE1EB130C125781700444D74-Mehlhorn2010
		2010			Mehlhorn, Kurt Ray, Saurabh				Faster algorithms for computing Hong's bound on absolute positiveness In: Journal of Symbolic Computation [45], 677-683	Journal Article	F2A3B1100AA47E69C125781800385310-MehlhornRay2010
		2010			Mehlhorn, Kurt Schweitzer, Pascal	[Lee, Der-Tsai] [Chen, Danny Z.] [Ying, Shi]			Progress on Certifying Algorithms In: Frontiers in Algorithmics : 4th International Workshop, FAW 2010, 1-5	Proceedings Article	6ADD7B6CDB83F33EC125781800375471-MehlhornSchweitzer2010
		2010			Mestre, Julian				Adaptive local ratio In: SIAM Journal on Computing [39], 3038-3057	Journal Article	6BF759B18B0611B3C1257834003BC079-Mestre2010
		2010			[Misra, Neeldhara] Philip, Geevarghese [Raman, Venkatesh] [Saurabh, Saket]	[Lodaya, Kamal] [Mahajan, Meena]			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	E1CA11B0E7B97ABFC12579E70056DBA0-MisraPhilipRamanSaurabh2010
		2010			[Misra, Neeldhara] Philip, Geevarghese [Raman, Venkatesh] [Saurabh, Saket] [Sikdar, Somnath]	[Rahman, Md. Saidur] [Fujita, Satoshi]			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	67878D87B3D5C57BC12579E70051A68E-MisraPhilipRamanSaurabhSikdar2010
		2010			[Mörig, Marc] [Scholz, Sven] [Tscheuschner, Tobias] Berberich, Eric	[Müller-Hannemann, Matthias] [Schirra, Stefan]			Implementation aspects In: Algorithm Engineering : Bridging the Gap between Algorithm Theory and Practice, 237-289	Part of a Book	FA5486F3C7C746D0C12577FB002BA765-mstb-giae-impl-2010
		2010			Mustafa, Nabil H. Ray, Saurabh				Improved Results on Geometric Hitting Set Problems In: Discrete & Computational Geometry [44], 883-895	Journal Article	D10A961FF1A5BDFAC1257834003C5D0F-MustafaRay2010
		2010			Neumann, Frank [Witt, Carsten]				Ant Colony Optimization and the minimum spanning tree problem In: Theoretical Computer Science [411], 2406-2413	Journal Article	7CD6D5A1752473CEC1257834003F3757-NeumannWitt2010
		2010			Neumann, Frank [Witt, Carsten]				Bioinspired Computation in Combinatorial Optimization : Algorithms and Their Computational Complexity	Book	DA62E96A98540346C125781B002527A5-BookNeumannWitt
		2010			[Nor, Igor] Hermelin, Danny [Charlat, Sylvain] [Engelstadter, Jan] [Reuter, Max] [Duron, Olivier Sagot, Marie-France]	[Amir, Amihood] [Parida, Laxmi]			Mod/Resc Parsimony Inference In: Combinatorial Pattern Matching : 21st Annual Symposium, CPM 2010, 202-213	Proceedings Article	8D82B31C89428782C125783A00601457-HermelinCulex2010
		2010			Panagiotou, Konstantinos [Steger, Angelika]				Maximal Biconnected Subgraphs of Random Planar Graphs In: ACM Transactions on Algorithms [6], 31,1-31,21	Journal Article	06D11D97A3782A39C125782100087115-PanagiotouStegerJournal2010
		2010			Philip, Geevarghese [Raman, Venkatesh] [Villanger, Yngve]	[Thilikos, Dimitrios M.]			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	7A2A3C34B2F796CDC12579E7004FE872-PhilipRamanVillanger2010
		2010			[Pountourakis, Emmanouil] Vidali, Angelina	[de Berg, Mark] [Meyer, Ulrich]			A complete characterization of group-strategyproof mechanisms of cost-sharing. In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. I, 146-157	Proceedings Article	453E3EDE938E1609C125781B00423C77-Vidali2010
		2010			[Rusinov, Momchil] Schweitzer, Pascal				Homomorphism -- homogeneous graphs In: Journal of Graph Theory [65], 253-262	Journal Article	3E145AAE9B8D30B2C12578340047450F-RusinovSchweitzer2010
		2010			Sagraloff, Michael				A General Approach to Isolating Roots of a Bitstream Polynomial In: Mathematics in Computer Science [4], 481-506	Journal Article	EDEA524F3884814BC1257861003A6A16-Sagraloff-BitstreamPrecision2011
		2010			Schweitzer, Pascal [Schweitzer, Patrick]				Connecting face hitting sets in planar graphs In: Information Processing Letters [111], 11-15	Journal Article	BA81420A8DFBE16DC125783400031E2C-SchweitzerSchweitzer2010
		2009			Ajwani, Deepak [Meyer, Ulrich] [Osipov, Vitaly]	[Demetrescu, Camil] [Goldberg, Andrew V.] [Johnson, David S.]			Breadth first search on massive graphs In: The shortest path problem : ninth DIMACS implemenation challenge, 291-307	Part of a Book	B62E30D7B1D78D43C12576F1004EBF16-AjwaniMeyerOsipov2009
		2009			[Althaus, Ernst] [Dumitriu, Daniel]	[Vahrenhold, Jan]			Fast and Accurate Bounds on Linear Programs In: Experimental Algorithms : 8th International Symposium on Experimental Algorithms (SEA 2009), 40-50	Proceedings Article	2F3502E19E41B66BC12575850049DCB3-AlthausD09
		2009			[Amaldi, Edoardo] [Iuliano, Claudio] Jurkiewicz, Tomasz Mehlhorn, Kurt [Rizzi, Romeo]	[Fiat, Amos] [Sanders, Peter]			Breaking the $O(m^2n)$ Barrier for Minimum Cycle Bases In: Algorithms - ESA 2009 : 17th Annual European Symposium, 301-312	Proceedings Article	FB5CF2AF86AB61A2C12576E10040C8D0-AmaldiIulianoetal009
		2009			[Amaldi, Edoardo] [Iuliano, Claudio] Jurkiewicz, Tomasz Mehlhorn, Kurt [Rizzi, Romeo]	[Fiat, Amos] [Sanders, Peter]			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	EEC67B0C575294D3C12576E2006D51BF-AIJMR09
		2009			Amini, Omid [Peleg, David] [Pérennes, Stéphane] [Sau, Ignasi] [Saurabh, Saket]	[Bampis, Evripidis] [Skutella, Martin]			Degree-Constrained Subgraph Problems: Hardness and Approximation Results In: Approximation and Online Algorithms : 6th International Workshop, WAOA 2008, 29-42	Proceedings Article	7C482BEE17B2635BC12576F10050B987-Aminietal2009
		2009			Amini, Omid [Pérennes, Stéphane] [Sau, Ignasi]				Hardness and approximation of traffic grooming In: Theoretical Computer Science [410], 3751-3760	Journal Article	78967428AF040DFDC12576F1005053FD-Amini2009a
		2009			Angelopoulos, Spyros	[Dehne, Frank] [Gavrilova, Marina] [Sack, Jörg-Rüdiger] [Tóth, Csaba D.]			Online Priority Steiner Tree Problems In: Algorithms and Data Structures : 11th International Symposium, WADS 2009, 37-48	Proceedings Article	0BA2B0A603ECEC7AC12576C6004418BF-Angelopoulos:wads2009
		2009			Angelopoulos, Spyros [Lopez-Ortiz, Alejandro]				Intertruptible Algorithms for Multi Problem Solving In: Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI 09), 380-386	Proceedings Article	411FA5ECACA68ABBC12576C6004392EB-AngLop:ijcai09
		2009			Angelopoulos, Spyros Schweitzer, Pascal	[Mathieu, Claire]			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	F8776844570B3510C1257551004A2193-AngSch:2009.bijective
		2009			[Bansal, Nikhil] Chan, Ho-Leung	[Mathieu, Claire]			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	DF4FDF682F979567C125754D00374F2C-Chan2008
		2009			[Bansal, Nikhil] Chan, Ho-Leung [Pruhs, Kirk]	[Mathieu, Claire]			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	194C06E65A88E9CDC125754D0037BD9F-Chan2008b
		2009			Bast, Hannah	Albers, Susanne Alt, Helmut Näher, Stefan			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	88E44ADF4BC4ACF5C12576DC0047613F-Bast2009
		2009			Bast, Holger Funke, Stefan Matijevic, Domagoj	[Demetrescu, Camil] [Goldberg, Andrew V.] [Johnson, David S.]			Ultrafast shortest-path queries via transit nodes In: The shortest path problem : ninth DIMACS implemenation challenge, 175-192	Part of a Book	D2981DD3E9BEF9D1C12576F100517762-BastFunkeMatjevic2009
		2009			[Baswana, Surender] [Biswas, Somenath] Doerr, Benjamin [Friedrich, Tobias] [Kurur, Piyush P.] Neumann, Frank	[Jansen, Thomas] [Garibay, Ivan] [Wiegand, R.Paul] [Wu, Annie S.]			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	55069E36095FFF64C1257559004BB431-BBDFKN09
		2009			Berberich, Eric Sagraloff, Michael				A Generic and Flexible Framework for the Geometrical and Topological Analysis of (Algebraic) Surfaces In: Computer Aided Geometric Design (CAGD) [26], 627-647	Journal Article	D04D6C8B136C018EC12576B1003F3BEC-bs-agffgtaas-cagd-09
		2009			[Bhaskar, Umang] [Fleischer, Lisa] [Hoy, Darrell] Huang, Chien-Chung	[Mathieu, Claire]			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	43985FF9A41F9862C125755C00598D6B-Huang2008
		2009			[Böcker, Sebastian] [Hüffner, Falk] [Truss, Anke] Wahlström, Magnus	[Chen, Jianer] [Fomin, Fedor V.]			A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams In: Parameterized and Exact Computation : 4th International Workshop, IWPEC 2009, 38-49	Proceedings Article	40BD3785024504A9C12576C80080921E-BHTWahlstroem2009
		2009			[Bringmann, Karl] [Friedrich, Tobias]	[Ehrgott, Matthias] [Fonseca, Carlos M.] [Gandibleux, Xavier] [Hao, Kin-Kao] [Sevaux, Marc]			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	4ED76878FE555F8AC1257559004B452D-BF09b
		2009			[Bringmann, Karl] [Friedrich, Tobias]	[Jansen, Thomas] [Garibay, Ivan] [Paul, Wiegand R.] [Wu, Annie S.]			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	E689E7518FE149F6C1257559004BF104-BF09a
		2009			[Brockhoff, Dimo] [Friedrich, Tobias] Hebbinghaus, Nils Klein, Christian Neumann, Frank [Zitzler, Eckart]				On the Effects of Adding Objectives to Plateau Functions In: IEEE Transactions on Evolutionary Computation [13], 591-603	Journal Article	45C84D56DF81D053C1257555002DB6C1-BroetalTEC2009
		2009			[Burnikel, Christoph] [Funke, Stefan] Mehlhorn, Kurt [Schirra, Stefan] Schmitt, Susanne				A Separation Bound for Real Algebraic Expressions In: Algorithmica [55], 14-28	Journal Article	9A5BB68F39EC8968C12576F10052E015-Burnikel2009
		2009			Celikik, Marjan Bast, Hannah	[Karlgren, Jussi] [Tarhio, Jorma] [Hyyrö, Heikki]			Fast Single-Pass Construction of a Half-Inverted Index In: String processing and information retrieval : 16th International Symposium, SPIRE 2009, 194-205	Proceedings Article	0290FA7A2EA0BDB4C12575CC0053EFAE-celikikbast2009spire
		2009			Celikik, Marjan Bast, Holger	[Shin, Dongwan]			Fast Error-Tolerant Search on Very Large Texts In: The 24th Annual ACM Symposium on Applied Computing, 1724-1731	Proceedings Article	EFCE206882C168FFC125755200522A25-bastcelikik2009sac
		2009			Chan, Ho-Leung [Edmonds, Jeff] [Pruhs, Kirk]				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	4D461A3CCC57D806C12576F100538A18-ChanSPAA2009
		2009			Chan, T-H. Hubert [Dhamdhere, Kedar] [Gupta, Anupam] [Kleinberg, Jon] [Slivkins, Aleksandrs]				Metric Embeddings with Relaxed Guarantees In: SIAM Journal on Computing [38], 2303-2329	Journal Article	BC14533EF00B5A52C1257577004BF873-CDGKS2009
		2009			Chan, T.-H. Hubert [Gupta, Anupam]				Small Hop-diameter Sparse Spanners for Doubling Metrics In: Discrete and Computational Geometry [41], 28-44	Journal Article	3244D1249961B4F8C125753E005753CC-ChanGupta2009
		2009			Christodoulou, George [Koutsoupias, Elias]				Mechanism Design for Scheduling In: Bulletin of European Association for Theoretical Computer Science [97], 40-59	Journal Article	D856555ABE6BA4CFC125755C0038E957-CK2009
		2009			Christodoulou, George [Koutsoupias, Elias] [Nanavati, Akash]				Coordination Mechanisms In: Theoretical Computer Science [410], 3327-3336	Journal Article	4B287EECC0A9C716C125755C0039F61A-CKV2009
		2009			Christodoulou, George [Koutsoupias, Elias] [Vidali, Angelina]				A lower bound for scheduling mechanisms In: Algorithmica [85], 729-740	Journal Article	447E0CC9C642AE4CC125755C00395E22-CKValgorithmica2008
		2009			Cilleruelo, Javier Hebbinghaus, Nils				Discrepancy in generalized arithmetic progressions In: European Journal of Combinatorics [30], 1607-1611	Journal Article	86F2E00F65DD0300C12576F1005447AA-Cilleruelo2009
		2009			[Cooley, Oliver] [Fountoulakis, Nikolaos] [Kühn, Daniela] [Osthus, Deryk]				Embeddings and Ramsey numbers of sparse k-uniform hypergraphs In: Combinatorica [29], 263-297	Journal Article	33BC15F9D4AEF2F6C125755C0035253E-Fountoulakis2009
		2009			[Correa, Jose R.] Megow, Nicole Raman, Rajiv [Suchan, Karol]	[Cafieri, Sonia] [Mucherino, Antonio] [Nannicini, Giacomo] [Tarissan, Fabien] [Liberti, Leo]			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	0CB417DB1AD1B90EC12576A700564A58-CorreaMRS2009
		2009			Doerr, Benjamin	[Albers, Susanne] [Alt, Helmut] [Näher, Stefan]			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	BA97F20EE9C762E3C12576B30031DEC6-Doerr2009
		2009			Doerr, Benjamin [Eremeev, Anton] [Horoba, Christian] Neumann, Frank [Theile, Madeleine]	[Raidl, Günther] [Rothlauf, Frank]			Evolutionary Algorithms and Dynamic Programming In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 771-777	Proceedings Article	8BD015392D6A2D22C125757B002A589B-DoerretalGECCO2009
		2009			Doerr, Benjamin [Fouz, Mahmoud]				A Time-Randomness Tradeoff for Quasi-Random Rumour Spreading In: Electronic Notes in Discrete Mathematics [34], 335 - 339	Journal Article	D9EDF5E3D373D390C12576B600519445-doerrfouz2009
		2009			Doerr, Benjamin Fouz, Mahmoud [Schmidt, Martin] Wahlström, Magnus	[Rothlauf, Franz]			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	DA2F71D9D8930E86C12576B3003337D5-DoerrFouzSchmidtWahlstroem2009
		2009			Doerr, Benjamin Friedrich, Tobias				Deterministic Random Walks on the Two-Dimensional Grid In: Combinatorics, Probability and Computing [18], 123-144	Journal Article	73E8FA33D1D6CF04C125757F001F0A89-DF2009
		2009			Doerr, Benjamin [Friedrich, Tobias] [Künnemann, Marvin] [Sauerwald, Thomas]	[Finocchi, Irene] [Hershberger, John]			Quasirandom Rumor Spreading: An Experimental Analysis In: 2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX), 145-153	Proceedings Article	0EB0663470348CEAC1257559004C5F59-DFKS09
		2009			Doerr, Benjamin Friedrich, Tobias [Sauerwald, Thomas]				Quasirandom Rumor Spreading on Expanders In: Electronic Notes in Discrete Mathematics [34], 243 - 247	Journal Article	2E6B00364A4B71C8C12576B60051E383-doerrfriedrichsauerwald2009
		2009			Doerr, Benjamin Friedrich, Tobias [Sauerwald, Thomas]	[Albers, Susanne] [Marchetti-Spaccamela, Alberto] [Matias, Yossi] [Nikoletseas, Sotiris] [Thomas, Wolfgang]			Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness In: Automata, Languages and Programming : 36th International Colloquium, ICALP 2009, 366-377	Proceedings Article	0B6782B6AFAE8B01C12575A500062765-DoerrFriedrichSauerwald09
		2009			Doerr, Benjamin [Gnewuch, Michael] Wahlström, Magnus	[L'Ecuyer, P.] [Owen, A. B.]			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	B7A1155B009AD169C1257818004B79B3-DoerrGW2009
		2009			Doerr, Benjamin Huber, Anna Levavi, Ariel	[Dong, Yingfei] [Du, Ding-Zhu] [Ibarra, Oscar]			Strong robustness of randomized rumor spreading protocols In: Algorithms and Computation : 20th International Symposium, ISAAC 2009, 812-821	Proceedings Article	4620570A1CD6F228C12576CA005B3D1C-DHL2009
		2009			Doerr, Benjamin [Theile, Madeleine]	[Raidl, Günther] [Rothlauf, Frank]			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	D28C6865C05039AAC1257592003D32DF-DoerrTheileGECCO2009
		2009			Doerr, Benjamin Wahlström, Magnus	[Finocchi, Irene] [Hershberger, John]			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	F113132C2317F653C125755B005F2774-DW09
		2009			[Eisenbrand, Friedrich] Karrenbauer, Andreas [Skutella, Martin] [Xu, Chihao]				Multiline Addressing by Network Flow In: Algorithmica [53], 583-596	Journal Article	12D5044018333F2BC125755F002F43D9-EKSX2008
		2009			Elbassioni, Khaled				Algorithms for Dualization over Products of Partially Ordered Sets In: SIAM Journal on Discrete Mathematics [23], 487-510	Journal Article	4135C1104B511479C125758500688DAA-Elbassioni2008p
		2009			Elbassioni, Khaled [Fishkin, Aleksei V.] [Sitters, René]				Approximation algorithms for the Euclidean traveling salesman problem with discrete and continuous neighborhoods In: International Journal of Computational Geometry & Applications [19], 173-193	Journal Article	AAE31D6EA6951EC4C12576F10054BF6F-Elbassioni2009x
		2009			Elbassioni, Khaled [Makino, Kazuhisa] Rauf, Imran	[Fiat, Amos] [Sanders, Peter]			Output-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs In: Algorithms - ESA 2009 : 17th Annual European Symposium, 143-154	Proceedings Article	CCC9B525CA40D5DBC12576CD0006F7A6-ESA:EMR09
		2009			Elbassioni, Khaled [Makino, Kazuhisa] Rauf, Imran	[Ngo, Hung Q.]			On the Readability of Monotone Boolean Formulae In: Computing and Combinatorics :15th Annual International Conference, COCOON 2009, 496-505	Proceedings Article	77E1A844B0740D89C12576CD000609C6-EMR09
		2009			Elbassioni, Khaled Raman, Rajiv [Ray, Saurabh] [Sitters, Rene]	[Matthieu, Claire]			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	1156F411F9B34628C1257553004BE079-Elbassioni2009a
		2009			Elbassioni, Khaled Raman, Rajiv Ray, Saurabh [Sitters, Rene]	[Mavronicolas, Marios] [Papadopoulou, Vicky G.]			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	7176B54B5909FFB3C125756400558A3B-Raman2009
		2009			Elbassioni, Khaled [Tiwary, Hans Raj]				Complexity of Approximating the Vertex Centroid of a Polyhedron In: Algorithms and Computation, 20th International Symposium (ISAAC), 413-422	Proceedings Article	343762D4745704DEC1257864007FFEC6-Elbassioni2009ISAAC
		2009			Elmasry, Amr				Computing the subset partial order for dense families of sets In: Information Processing Letters [109], 1082-1086	Journal Article	C26CA166242A9A45C12576F100557684-Elmasry2009x
		2009			Elmasry, Amr Manjunath, Madhusudan	Asano, Tetsuo			Enumerating Trichromatic Triangles Containing the Origin in Linear Time In: Japanese Conference in Computational Geometry and Graphs 2009, 101-103	Proceedings Article	4E5B92E327BCA600C12576A90068FB65-Manjunath2009b
		2009			Elmasry, Amr	[Matthieu, Claire]			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	55CEC128573A3E0CC12575600061DE33-Elmasry2009
		2009			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]			Visualizing Arcs of Implicit Algebraic Curves, Exactly and Fast In: Advances in Visual Computing : 5th International Symposium, ISVC 2009, 608-619	Proceedings Article	704CDFA7DEA1FF3FC125763C0047FA1C-EBS_09
		2009			Emeliyanenko, Pavel	[Dou, Yong] [Gruber, Ralf] [Joller, Josef]			Efficient Multiplication of Polynomials on Graphics Hardware In: Advanced Parallel Processing Technologies : 8th International Symposium, APPT 2009, 134-149	Proceedings Article	CA00677497561C7EC125763C0044A41A-emel_gpgpu_09
		2009			[Epstein, Leah] [Kleiman, Elena] Mestre, Julian	[Leonardi, Stefano]			Parametric Packing of Selfish Items and the Subset Sum Algorithm In: Internet and Network Economics : 5th International Workshop, WINE 2009, 67-78	Proceedings Article	5D0FB12429260167C12576320025FD9A-Mestre2008
		2009			[Epstein, Leah] [Kleiman, Elena] van Stee, Rob	[Leonardi, Stefano]			Maximizing the Minimum Load: The Cost of Selfishness In: Internet and Network Economics : 5th International Workshop, WINE 2009, 232-243	Proceedings Article	6D9BEB17DA265C17C12576C800526FC0-EpKlSt2009
		2009			[Epstein, Leah] van Stee, Rob [Tamir, Tami]				Paging with request sets In: Theory of Computing Systems [44], 67-81	Journal Article	68D876A40EDD9314C12576C800512C97-EpStTa2009
		2009			Fountoulakis, Nikolaos Huber, Anna				Quasirandom rumor spreading on the complete graph is as fast as randomized rumor spreading In: SIAM Journal on Discrete Mathematics [23], 1964-1991	Journal Article	ED508DE6EF92BBC4C12576CA00582546-HF2009
		2009			Fountoulakis, Nikolaos Huber, Anna Panagiotou, Konstantinos				The Speed of Broadcasting in Random Networks: Density Does Not Matter In: 23rd International Symposium on Distributed Computing (DISC '09), 529-530	Proceedings Article	AFDD7FAC8568A20FC1257831002C6571-FountoulakisHuberPanagiotouBrief2010
		2009			Fountoulakis, Nikolaos Huber, Anna Panagiotou, Konstantinos	[Keidar, Idit]			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	CDDD7221963CC326C12576CA005A4339-FHP2009
		2009			Fountoulakis, Nikolaos [Kühn, Daniela] [Osthus, Deryk]				Minors in random regular graphs In: Random Structures and Algorithms [35], 444-463	Journal Article	7D5C2EC76CCB9FD2C125755C0035897E-Fountoulakis2009b
		2009			Friedrich, Tobias Hebbinghaus, Nils Neumann, Frank				Comparison of Simple Diversity Mechanisms on Plateau Functions In: Theoretical Computer Science [410], 2455-2462	Journal Article	D5DBD05EF1A68FBBC1257555002D6DFF-FriHebNeuTCS2009
		2009			Friedrich, Tobias [He, Jun] Hebbinghaus, Nils Neumann, Frank [Witt, Carsten]				Analyses of Simple Hybrid Algorithms for the Vertex Cover Problem In: Evolutionary Computation, [17], 3-19	Journal Article	E7829074116CCAF2C1257555002CEDEA-FrietalECJ2009
		2009			Friedrich, Tobias [Horoba, Christian] Neumann, Frank	[Raidl, Günther] [Rothlauf, Franz]			Multiplicative Approximations and the Hypervolume Indicator In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 571-578	Proceedings Article	5765F50ACDCCE77CC125757B0029CDD7-FriHorNeuGECCO2009
		2009			[Friedrich, Tobias] [Oliveto, Pietro] [Sudholt, Dirk] [Witt, Carsten]				Analysis of Diversity-Preserving Mechanisms for Global Exploration In: Evolutionary Computation [17], 455-476	Journal Article	7AE9D668B93B0931C12576A7005371BB-FriedrichOSW2009
		2009			[Friedrich, Tobias] [Sauerwald, Thomas]				Near-Perfect Load Balancing by Randomized Rounding In: STOC09 : Proceedings of the 2009 ACM International Symposium on Theory of Computing, 121-130	Proceedings Article	C32B22BEB698CD34C1257559004ADC71-FS09
		2009			Friedrich, Tobias [Sauerwald, Thomas] [Vilenchik, Dan]	[Albers, Susanne] [Marchetti-Spaccamela, Alberto] [Matias, Yossi] [Nikoletseas, Sotiris] [Thomas, Wolfgang]			Smoothed Analysis of Balancing Networks In: Automata, Languages and Programming : 36th International Colloquium, ICALP 2009, 472-483	Proceedings Article	494EBD3D34C4088FC12575A50006337C-FriedrichSauerwaldVilenchik09
		2009			[Gandhi, Rajiv] Mestre, Julián				Combinatorial Algorithms for Data Migration to Minimize Average Completion Time In: Algorithmica [54], 54-71	Journal Article	F16428B232F6E2CBC125745E0044DEE1-journal/algo/GandhiM2007
		2009			Gärtner, Tobias [Hotz, Günter]	[Ambos-Spies, Klaus] [Löwe, Benedikt] [Merkle, Wolfgang]			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	22CDFED53B1F1A3CC12576F10056026F-GaertnerHotzr2009
		2009			Gidenstam, Anders [Papatriantafilou, Marina] [Sundell, Håkan] [Tsigas, Philippas]				Efficient and Reliable Lock-Free Memory Reclamation Based on Reference Counting In: IEEE Transactions on Parallel and Distributed Systems [20], 1173-1187	Journal Article	BFCE9EE699CFAEA8C125759A00420F36-Gidenstam200902
		2009			Harren, Rolf				Approximation Algorithms for Orthogonal Packing Problems for Hypercubes In: Theoretical Computer Science [410], 4504-4532	Journal Article	AE373149F22484E3C1257558003D0C47-Harren2009a
		2009			Harren, Rolf van Stee, Rob	[Dinur, Irit] [Jansen, Klaus] [Naor, Joseph] [Rolim, José]			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	3ECBF2866C781F32C12576AA00428459-HarrenvanStee2009b
		2009			[Helwig, Sabine] Neumann, Frank [Wanka, Rolf]	[Bouchachia, Abdelhamid] [Nedjah, Nadia] [de Macedo Mourelle, Luiza] [Pedrycz, Witold]			Particle Swarm Optimization with Velocity Adaptation In: 2009 International Conference on Adaptive and Intelligent Systems ICAIS 2009 : proceedings, 146-151	Proceedings Article	1D37309C59714525C125765C00481824-HelNeuWan2009
		2009			Hemmer, Michael				Modular Arithmetic, CGAL - Computational Geometry Algorithms Library, release 3.4	Manual	ADC6B57DB52F5EC4C1257583005B5D69-mod-hemmer-2009
		2009			Hemmer, Michael				Polynomials, CGAL - Computational Geometry Algorithms Library, release 3.4	Manual	29DBA08C43B0E531C1257583005BD6A3-poly-hemmer-2009
		2009			Hemmer, Michael [Hülse, Dominik]				Generic implementation of a modular GCD over Algebraic Extension Fields In: EuroCG'09 : 25th European Workshop on Computational Geometry, 321-324	Proceedings Article	F4397834F8C33046C125755B00566E16-hh-mgcd-2009
		2009			Hemmer, Michael Limbach, Sebastian [Schömer, Elmar]				Continued Work on the Computation of an Exact Arrangement of Quadrics In: EuroCG'09 : 25th European Workshop on Computational Geometry, 313-316	Proceedings Article	C6D65725A5087DBEC125755F00399D58-hls-qarr-2009
		2009			Hemmer, Michael [Tsigaridas, Elias P.] [Zafeirakopoulos, Zafeirakis] [Emiris, Ioannis Z.] [Karavelas, Menelaos I.] [Mourrain, Bernard]				Experimental evaluation and cross-benchmarking of univariate real solvers In: Symbolic Numeric Computation 2009 (SNC 2009), 45-54	Proceedings Article	79BF7E08E18F4A4FC12576B6004EC1F4-HTZ-AKCROSS-2009
		2009			[Horoba, Chrisitian] Neumann, Frank				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	7CD8964DDC1D112AC1257555002E9878-HorNeuFOGA2009
		2009			Johannsen, Daniel [Razgon, Igor] Wahlström, Magnus	[Kullmann, Oliver]			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	51115BB4AE9B7FA9C12575CA006D3653-JohannsenRazgonWahlstroem2008
		2009			[Kavitha, Telikepalli] Mestre, Julian	[Dong, Yingfei] [Du, Ding-Zhu] [Ibarra, Oscar]			Max-coloring paths: Tight bounds and extensions In: Algorithms and Computation : 20th International Symposium, ISAAC 2009, 87-96	Proceedings Article	55C74CBFF2A942B9C1257632002626F6-KavithaMestre2008
		2009			[Kavitha, T.] [Liebchen, Ch.] Mehlhorn, K. Michail, D. [Rizzi, R.] [Ueckerdt, T.] [Zweig, K.]				Cycle Bases in Graphs: Characterization, Algorithms, Complexity, and Applications In: Computer Science Review [3], 199-243	Journal Article	804B2DD468A04320C1257585005C05FE-SurveyCycleBases
		2009			[Kavitha, T.] Mestre, Julián [Nasre, M.]	[Albers, Susanne] [Marchetti-Spaccamela, Alberto] [Matias, Yossi] [Nikoletseas, Sotiris] [Thomas, Wolfgang]			Popular Mixed Matchings In: Automata, Languages and Programming : 36th International Colloquium, ICALP 2009, 574-584	Proceedings Article	A131D4CD6BAD4CB4C125759B00250516-Mestre2009
		2009			Kerber, Michael				Division-Free Computation of Subresultants Using Bezout Matrices In: International Journal of Computer Mathematics [86], 2186-2200	Journal Article	69A41BAA4FC3517DC12576A20033513A-kerber-ijcm-2009
		2009			Kerber, Michael	[Gerdt, Vladimir] [Mayr, Ernst] [Vorozhtsov, Evgenii]			On the Complexity of Reliable Root Approximation In: Computer Algebra in Scientific Computing : 11th International Workshop, CASC 2009, 155-167	Proceedings Article	0CAE6C20069272D1C12576A20034881B-Kerber_CASC_2009
		2009			Kowalik, Lukasz				Improved edge-coloring with three colors In: Theoretical Computer Science [410], 3733-3742	Journal Article	9EAC7FB2352F4CF0C12576F100573ACF-Kowalik2009
		2009			Kratsch, Stefan Neumann, Frank	[Raidl, Günther] [Rothlauf, Franz]			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	F63719BED44AA9ABC125757B002AE7A9-KraNeuGECCO2009
		2009			Kratsch, Stefan Wahlström, Magnus	[Chen, Jianer] [Fomin, Fedor V.]			Two Edge Modification Problems without Polynomial Kernels In: Parameterized and Exact Computation : 4th International Workshop, IWPEC 2009, 264-275	Proceedings Article	39FA959BA8B0C8C4C12576C0003FA629-KratschW2009
		2009			[Krumke, Sven] van Stee, Rob [Westphal, Stefan]	[Ravi, S.S.] [Shukla, Sandeep K.]			Online job admissions In: Fundamental Problems in Computing : Essays in Honor of Professor Daniel J. Rosenkrantz, 435-454	Part of a Book	FAC90EE9432DBF4CC12576C8005064D6-KrStWe2009
		2009			Mehlhorn, Kurt Sagraloff, Michael				Isolating real roots of real polynomials In: Proceedings of the 2009 international symposium on Symbolic and algebraic computation (ISSAC), 247-254	Proceedings Article	E62E9C08262CD98BC125781C003DE328-MS:Bitstream:2009
		2009			Neumann, Frank [Oliveto, Pietro Simone] [Witt, Carsten]	[Raidl, Günther] [Rothlauf, Franz]			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	72B34AAAF815C9BEC125757B002AAC76-NeuOliWitGECCO2009
		2009			Neumann, Frank [Sudholt, Dirk] [Witt, Carsten]				Analysis of Different MMAS ACO Algorithms on Unimodal Functions and Plateaus In: Swarm Intelligence [3], 35-68	Journal Article	CB7F1EB425E21BD7C1257555002E385E-NeuSudWitSwarm2009
		2009			Neumann, Frank [Sudholt, Dirk] [Witt, Carsten]	[Lim, Chee Peng] [Jain, Lakhmi C.] [Dehuri, Satchidananda]			Computational Complexity of Ant Colony Optimization and Its Hybridization with Local Search In: Innovations in Swarm Intelligence, 91-120	Part of a Book	BDD8936C63A9B37BC12576C8002CA422-NSWACOchapter09
		2009			Neumann, Frank [Witt, Carsten]				Runtime Analysis of a Simple Ant Colony Optimization Algorithm In: Algorithmica [54], 243-255	Journal Article	FC7DB6CEC14EF2D2C1257555002D260C-Neumann2008
		2009			[Oliveto, Pietro Simone] [Lehre, Per Kristian] Neumann, Frank				Theoretical Analysis of Rank-Based Mutation - Combining Exploration and Exploitation In: 2009 IEEE Congress on Evolutionary Computation : CEC, 1455-1462	Proceedings Article	B2220AB2E1022B34C125756E00448F0F-LehNeuOliCEC2009
		2009			Panagiotou, Konstantinos				The Degree Sequence of Random Graphs from Subcritical Classes In: Combinatorics, Probability and Computing [18], 647-681	Journal Article	335A9247CB3CD9B1C125782100083827-BernasconiPanagiotouSteger2009
		2009			Panagiotou, Konstantinos				Vertices of Degree k in Random Unlabeled Trees In: European Conference on Combinatorics, Graph Theory and Applications (EuroComb '09), 41-45	Proceedings Article	20CD244EAB22DA06C1257831002BDF59-PanagiotouSinhaProc2009
		2009			Panagiotou, Konstantinos [Steger, Angelika]	[Matthieu, Claire]			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	8DC9EF52A8ACA421C125755B00670431-PanagiotouSteger2008
		2009			Philip, Geevarghese [Raman, Venkatesh] [Sikdar, Somnath]	[Fiat, Amos] [Sanders, Peter]			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	8EB5E7CD14684E9AC12579E7004DAD72-PhilipRamanSikdar2009
		2009			Pyrga, Evangelia [Chung, Christine]	[Mavronicolas, Marios] [Papadopoulou, Vicky G.]			Stochastic Stability in Internet Router Congestion Games In: Algorithmic Game Theory : Second International Symposium, SAGT 2009, 183-195	Proceedings Article	CC5EE47F8F1710FBC12576C7004D112A-Pyrga2009
		2009				[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]			GECCO 2009: Proceedings of the 11th Annual conference on Genetic and evolutionary computation.	Proceedings	6EB068A1E76608A9C12576B600512E30-gecco2009
		2009			Sagraloff, Michael Kerber, Michael Hemmer, Michael	[Suzuki, Masakazu] [Hong, Hoon] [Anai, Hirokazu] [Yap, Chee] [Sato, Yosuke] [Yoshida, Hiroshi]			Certified Complex Root Isolation via Adaptive Root Separation Bounds In: The Joint Conference of ASCM 2009 and MACIS 2009, 151-166	Proceedings Article	52A95F956B07EF24C12576B6004D1976-SKH-CCRI-2009
		2009			[Sanders, Peter] Sivadasan, Naveen [Skutella, Martin]				Online scheduling with bounded migration In: Mathematics of Operations Research [34], 481-498	Journal Article	15CB21350070D175C12576F20031D403-Sivadasan2009
		2009			Schweitzer, Pascal				Using the Incompressibility Method to obtain Local Lemma results for Ramsey-type Problems In: Information Processing Letters [109], 229-232	Journal Article	2391DF15F53014DBC1257556003946D2-Schweitzer2008
		2009			Vidali, Angelina	[Leonardi, Stefano]			The Geometry of Truthfulness In: Internet and Network Economics : 5th International Workshop, WINE 2009, 340-350	Proceedings Article	4DA674C6FB105EEDC12576B7005F11F4-Vidali2009
		2009			Wahlström, Magnus	[Frid, Anna] [Morozov, Andrey] [Rybalchenko, Andrey] [Wagner, Klaus W.]			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	747BE53C2DFDB535C125755B005FE275-Wahlstroem2009
		2008			Ajwani, Deepak Friedrich, Tobias Meyer, Ulrich				An $O(n^2.75)$ algorithm for incremental topological ordering In: ACM Transactions on Algorithms [4], 1-14	Journal Article	545D71D860BAB7DBC12576A700541232-AFM08
		2008			Ajwani, Deepak [Malinger, Itay] [Meyer, Ulrich] [Toledo, Sivan]	[McGeoch, Catherine]			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	CF1C1BEC20E1A915C1257433005075A9-Flash-WEA-2008
		2008			[Albrecht, Marc] Karrenbauer, Andreas [Xu, Chihao]				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	58F91B68FD8B5716C125755F002E9591-AKX08
		2008			Althaus, Ernst Canzar, Stefan				A Lagrangian relaxation approach for the multiple sequence alignment problem In: Journal of Combinatorial Optimization [16], 127-154	Journal Article	FD3CB04A1F33D26DC125755C006FF161-AltCanJOC08
		2008			Althaus, Ernst Canzar, Stefan				LASA: A tool for non-heuristic alignment of multiple sequences In: Bioinformatics Research and Development (BIRD’08), 489-498	Proceedings Article	11549CC9EB48447FC125755C006E4786-AltCan2008
		2008			Althaus, Ernst Canzar, Stefan Elbassioni, Khaled Karrenbauer, Andreas Mestre, Julián				Approximating the Interval Constrained Coloring Problem In: 11th Scandinavian Workshop on Algorithm Theory (SWAT), 210-221	Proceedings Article	B5CB62E0A4E8D46AC125745E0046BA29-conf/swat/AlthausCEKM2008
		2008			Althaus, Ernst Canzar, Stefan [Emmett, Mark] Karrenbauer, Andreas [Marshall, Alan] [Meyer-Bäse, Anke] [Zhang, Huimin]				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	46A68A95153C582FC125755C006F7A80-AltCanKar08
		2008			Althaus, Ernst Naujoks, Rouven	[McGeoch, Catherine C.]			Reconstructing Phylogenetic Networks with One Recombination In: Experimental Algorithms, 7th International Workshop, WEA 2008, 275-288	Proceedings Article	BA6599E523231B47C125755B00411ADE-ALNA2008
		2008			Angelopoulos, Spyros				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	3EB6F5B2FD7D2467C1257551004AD9C1-Ang:08.steiner
		2008			Angelopoulos, Spyros [Dorrigiv, Reza] [Lopez-Ortiz, Alejandro]				List Update with Locality of Reference In: 8th Latin American Symposium on Theoretical Informatics (LATIN 2008), 399-410	Proceedings Article	EA4BEDD635A6E4F4C1257551004A9DC9-ADLO:08.listupdate
		2008			Angelopoulos, Spyros [Lopez-Ortiz, Alejandro] [Hamel,Angele]				Optimal Scheduling of Contract Algorithms with Soft Deadlines In: 23rd National Conference on Artificial Intelligence (AAAI 2008), 868-873	Proceedings Article	621E692B96E2A04EC1257551004B4F84-ALOH:08.soft
		2008			Berberich, Eric Emeliyanenko, Pavel				CGAL's Curved Kernel via Analysis	Report	BBA3EB660291C7B9C12575860036280B-acs:tr123203-04-08
		2008			Berberich, Eric Hemmer, Michael [Karavelas, Menelaos] [Pion, Sylvain] [Teillaud, Monique] [Tsigaridas, Elias]				Prototype implementation of the algebraic kernel	Report	82BB011B2FE36AAAC125754A0047676B-ACS-TR-121202-01
		2008			Berberich, Eric Kerber, Michael	[Haines, Eric] [McGuire, Morgan]			Exact Arrangements on Tori and Dupin Cyclides In: Proceedings of the 2008 ACM Symposium on Solid and Physical Modeling, 59-66	Proceedings Article	45FA1D784FCF4D89C12574720059FF46-bk-eatdc-08
		2008			Berberich, Eric Kerber, Michael	[Petitjean, Sylvain]			Arrangements on Surfaces of Genus One: Tori and Dupin Cyclides In: 24th European Workshop on Computational Geometry - Collection of Abstracts, 209-212	Proceedings Article	412A64DA7E0F45E9C1257474004D3BD2-bk-aosogo-08
		2008			Berberich, Eric Kerber, Michael Sagraloff, Michael	[Petitjean, Sylvain]			Geometric Analysis of Algebraic Surfaces Based on Planar Arrangements In: 24th European Workshop on Computational Geometry - Collection of Abstracts, 29-32	Proceedings Article	C4E31B7B7A1369AEC1257474004C888A-bks-gaoasbopa-08
		2008			Berberich, Eric Kerber, Michael Sagraloff, Michael	[Teillaud, Monique] [Welzl, Emo]			Exact Geometric-Topological Analysis of Algebraic Surfaces In: Proceedings of the 24th ACM Symposium on Computational Geometry, 164-173	Proceedings Article	1DCDDD6C88DE7F04C1257472005AD63C-bks-egtaas-08
		2008			Berberich, Eric Sagraloff, Michael	[Haines, Eric] [McGuire, Morgan]			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	DA170A5504ABAF9BC1257472005B1B05-bs-agffgtaas-08
		2008			[Boros, Endre] Elbassioni, Khaled Gurvich, Vladimir [Makino, Kazuhisa] [Oudalov, Vladimir]				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	E5EFAD2E449A98A2C1257553004B3CAA-Elbassioni2008d
		2008			[Boros, Endre] Elbassioni, Khaled [Gurvich, Vladimir] [Tiwary, Hans Raj]				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	50629FABF5BD2F2CC1257553004DBFF8-Elbassioni2008
		2008			[Boros, Endre] Elbassioni, Khaled [Makino, Kazuhisa]				On Berge Multiplication for Monotone Boolean Dualization In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, 48-59	Proceedings Article	A5414D0F88EC198EC1257553004AC39F-Elbassioni2008c
		2008			Bringmann, Karl Friedrich, Tobias	[Hong, Seok-Hee] [Nagamochi, Hiroshi] [Fukunaga, Takuro]			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	367E47155339044FC1257559004F5F3E-BF08
		2008			[Brockhoff, Dimo] Friedrich, Tobias Neumann, Frank	[Rudolph, Günter] [Jansen, Thomas] [Lucas, Simon M.] [Poloni, Carlo] [Beume, Nicola]			Analyzing Hypervolume Indicator Based Algorithms In: Parallel Problem Solving from Nature (PPSN X), 651-660	Proceedings Article	F6CD0925F8BEE045C125755100470546-BroFriNeuPPSN2008
		2008			Chang, Kevin [Johnson, Aaron]				Online and offline selling in limit order markets In: 4th International Workshop on Internet and Network Economics (WINE 2008), 41-52	Proceedings Article	67887FDE0C72E9F2C125742B0032C014-Chang2008a
		2008			Christodoulou, George	[Kao, Ming-Yang]			Price of Anarchy In: Encyclopedia of Algorithms, 1-99	Part of a Book	B02BA9262737F2AFC125753A006D85A6-Christodoulou2008
		2008			Christodoulou, George [Koutsoupias, Elias] [Vidali, Angelina]	[Halperin, Dan] Mehlhorn, Kurt			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	2E4C37A8576707E2C125753A006C38D1-ChristodoulouKV2008
		2008			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]			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	6E56C4CE2818ED55C125753A006B7F69-ChristodoulouKS2008
		2008			Cole, Richard Kowalik, Lukasz				New Linear-Time Algorithms for Edge-Coloring Planar Graphs In: Algorithmica [50], 351-368	Journal Article	A6AC23744581D8E8C1257299003F58BE-KowalikEdgeColoring
		2008			[Cooley, Oliver] Fountoulakis, Nikolaos [Kühn, Daniela] [Osthus, Deryk]				3-Uniform hypergraphs of bounded degree have linear Ramsey numbers In: Journal of Combinatorial Theory B [98], 484-505	Journal Article	89A2E0CA85BF75E1C125755C0034A3E5-Fountoulakis2008a
		2008			[Cooper, Joshua] Doerr, Benjamin Friedrich, Tobias [Spencer, Joel]				Deterministic Random Walks on Regular Trees In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, 766-772	Proceedings Article	106756BF5366F50BC12573D400390F32-Doerr2008-SODAb
		2008			[Diedrich, Florian] Harren, Rolf [Jansen, Klaus] [Thöle, Ralf] [Thomas, Henning]				Approximation Algorithms for 3D Orthogonal Knapsack In: Journal of Science and Technology [23], 749-762	Journal Article	6D4A5B2A536E7F2AC125753A001BD3F4-DiedrichHarrenJansenThoeleThomas2008
		2008			[Diedrich, Florian] [Kehden, Britta] Neumann, Frank	[Berghammer, Rudolf] [Möller, Bernhard] [Struth, Georg]			Multi-objective Problems in Terms of Relational Algebra In: Relations and Kleene Algebra in Computer Science 2008, 84-98	Proceedings Article	6CCB7A938B9C64C9C125755100355CA0-DieKehNeu2008
		2008			[Diedrich, Florian] Neumann, Frank				Using Fast Matrix Multiplication in Bio-Inspired Computation for Complex Optimization Problems In: IEEE Congress on Evolutionary Computation 2008, 3828-3833	Proceedings Article	11989B9023D1AF63C125756E0044FE9E-DieNeuCEC2008
		2008			Doerr, Benjamin Friedrich, Tobias [Sauerwald, Thomas]				Quasirandom Rumor Spreading In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, 773-781	Proceedings Article	81273D5C0464C9E5C12573D2003D2BB9-Doerr2008-SODA
		2008			Doerr, Benjamin [Gnewuch, Michael]	[Keller, Alexander] [Heinrich, Stefan] [Niederreiter, Harald]			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	0F79CEF4C9921A92C1257546002B3A62-DoerrGnewuch2008
		2008			Doerr, Benjamin [Gnewuch, Michael] [Kritzer, Peter] [Pillichshammer, Friedrich]				Component-by-component construction of low-discrepancy point sets of small size In: Monte Carlo Methods and Applications [14], 129-149	Journal Article	8B813F3C7862C04FC1257546002DC161-DoerrGnewuchKritzerPillichshammer2008
		2008			Doerr, Benjamin [Gnewuch, Michael] [Kritzer, Peter] [Pillichshammer, Peter]				Component-by-component construction of low-discrepancy point sets of small size In: Monte Carlo Methods Applications [14], 129-150	Journal Article	5FCC7CBE62BE362BC12579B10038A90C-DoerrGKP08
		2008			Doerr, Benjamin Happ, Edda				Directed trees: A Powerful Representation for Sorting and Ordering Problems In: Proceedings of CEC 2008, 3606-3613	Proceedings Article	B7B6441A872139FFC1257543004A8ED5-DoerrHapp2008
		2008			Doerr, Benjamin Happ, Edda Klein, Christian	[Ryan, Conor] [Keijzer, Maarten]			Crossover Can Provably be Useful in Evolutionary Computation In: Genetic and Evolutionary Computation Conference 2008, 539-546	Proceedings Article	0BA998D0B9D13FCDC125754300392422-Happ2008
		2008			Doerr, Benjamin [Jansen, Thomas] [Klein, Christian]	[Ryan, Conor] [Keijzer, Maarten]			Comparing local and global mutations on bit-strings. In: Genetic and Evolutionary Computation Conference 2008, 929-936	Proceedings Article	1DD1014E91732B69C12575430045E42D-DoerrJansenKlein2008
		2008			Doerr, Benjamin Johannsen, Daniel [Tang, Ching Hoo]	[Günter Rudolph] [Thomas Jansen] [Simon M. Lucas] [Carlo Poloni] [Nicola Beume]			How Single Ant ACO Systems Optimize Pseudo-Boolean Functions In: Parallel Problem Solving from Nature – PPSN X, 378-388	Proceedings Article	377A3771E884B8A8C125743A003C16EE-DoerrJohannsenTang2008a
		2008			Dumitriu, Daniel [Funke, Stefan] [Kutz, Martin] [Milosavljevic, Nikola]				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	DB9CA9AA437B2A72C12573D900746854-DFKM08
		2008			Dumitriu, Daniel [Funke, Stefan] [Kutz, Martin] [Milosavljevic, Nikola]	[Gudmundsson, Joachim]			On the Locality of Extracting a 2-Manifold in $R^3$ In: 11th Scandinavian Workshop on Algorithm Theory (SWAT-2008), 270-281	Proceedings Article	1DDDB2ECAACD1503C125748D003232B1-DFKM2008b
		2008			Dumitriu, Daniel [Funke, Stefan] Kutz, Martin [Milosavljevic, Nikola]	[Petitjean, Sylvain]			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	7C4DA73E2FE1DE82C125753E003F600A-Dumitriu2008a
		2008			[Eigensatz, Michael] [Giesen, Joachim] Manjunath, Madhusudan	[Morin, Pat]			The Solution Path of the Slab Support Vector Machine In: The 20th Canadian Conference on Computational Geometry, 211-214	Proceedings Article	EBC61E13F7A716F1C125755C005BADE8-Manjunath2008
		2008			Eigenwillig, Arno Kerber, Michael				Exact and Efficient 2D-Arrangements of Arbitrary Algebraic Curves In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA08), 122-131	Proceedings Article	30CB4A34DB378E4EC12573700054479D-ek-eae2aoaac-08
		2008			Eisenbrand, Friedrich Funke, Stefan Karrenbauer, Andreas Matijevic, Domagoj				Energy-Aware Stage Illumination In: International Journal of Computational Geometry and Applications [18], 107-129	Journal Article	E911D0FC4396DAB3C125755F00307AF6-EFKM2008
		2008			El Kahoui, M'hammed				Computing with algebraic curves in generic position	Miscellaneous	D09953DBA7162ABFC1256FB30052CCEA-ElKahoui2005e
		2008			El Kahoui, M'hammed				Polynomial parametrization of nonsingular algebraic curves	Miscellaneous	3B4D0E56946F5E1CC1256FB300532D61-ElKahoui2005f
		2008			Elbassioni, Khaled				A note on systems with max-min and max-product constraints In: Fuzzy Sets and Systems [159], 2272-2277	Journal Article	A681697FB6B65E9BC1257553004CF6C4-Elbassioni2008h
		2008			Elbassioni, Khaled				On the complexity of monotone dualization and generating minimal hypergraph transversals In: Discrete Applied Mathematics [156], 2109-2123	Journal Article	74FB7DD6C55A81A8C1257553004D2118-Elbassioni2008i
		2008			Elbassioni, Khaled Elmasry, Amr [Kamel, Ibrahim]				Indexing Schemes for Multi-dimensional Moving Objects In: Encyclopedia of GIS, 523-529	Part of a Book	98B25C52D232AEB2C12575540038A544-Elbassioni2008o
		2008			Elbassioni, Khaled [Hagen, Matthias] Rauf, Imran				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	C8E7E18B039D40D3C1257553004A71BC-Elbassioni2008b
		2008			Elbassioni, Khaled [Tiwary, Hans Raj]				On a Cone Covering Problem In: Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 171-174	Proceedings Article	D1604A41113AC328C1257553004B9A74-Elbassioni2008e
		2008			Elbassioni, Khaled [Tiwary, Hans Raj]				On Computing the Vertex Centroid of a Polyhedron In: CoRR [abs/0806.3456], x-x	Journal Article	1FB9BCAF3C9CE40FC1257553004DF436-Elbassioni2008l
		2008			Elmasry, Amr	Elmasry, Amr			Violation Heaps: A Better Substitute for Fibonacci Heaps	Report	38446996125459D8C1257560006D219C-Elmasry2008d
		2008			Elmasry, Amr [Hammad, Abdelrahman]				Inversion-Sensitive Sorting Algorithms in Practice In: ACM Journal of Experimental Algorithmics [13], 1-18	Journal Article	7C22B0E1C4D7D4D0C12575600066ECF4-Elmasry2008a
		2008			Elmasry, Amr [Jensen, Claus] [Katajainen, Jyrki]				Multipartite Priority Queues In: ACM Transactions on Algorithms [5], 1-19	Journal Article	D5DD03E5E5C9CA35C1257560006445AF-Elmasry2008b
		2008			Elmasry, Amr [Jensen, Claus] [Katajainen, Jyrki]				Two New Methods for Constructing Double-Ended Priority Queues from Priority Queues In: Computing [83], 193-204	Journal Article	22044305A49A14FDC1257560006AFEE4-Elmasry2008c
		2008			Emeliyanenko, Pavel Kerber, Michael				An implementation of the 2D Algebraic Kernel	Report	38AE77FAF47E9912C1257474004E72C3-acs-tr-363602-01
		2008			Emeliyanenko, Pavel Kerber, Michael				Visualizing and Exploring Planar Algebraic Arrangements - a Web Application	Report	B1DC77CD8812DFF6C1257474004EC7E2-acs-tr-363608-02
		2008			Emeliyanenko, Pavel Kerber, Michael	[Teillaud, Monique] [Welzl, Emo]			Visualizing and Exploring Planar Algebraic Arrangements -- a Web Application In: Proceedings of the 24th ACM Symposium on Computational Geometry, 224-225	Proceedings Article	3A8F5D8DF7CC23DEC1257474004B4732-ek-vaepaa-08
		2008			[Emiris, Ioannis] Hemmer, Michael [Tsigaridas, Elias] [Tzoumas, Georg]				Voronoi diagram of ellipses: CGAL-based implementation	Report	816F5BCB020B91D6C125754A004B6F98-ACS-TR-363603-01
		2008			[Emiris, Ioannis Z.] Hemmer, Michael [Karavelas, Menelaos] [Mourrain, Bernard] [Tsigaridas, Elias P.] [Zafeirakopoulos, Zafeirakis]				Experimental evaluation and cross-benchmarking of univariate real solvers	Report	85BFC4B1AEDF0EFEC12575850059E29E-INRIA-00340887:1
		2008			[Emiris,Ioannis] Hemmer, Michael [Karavelas, Menelaos] [Limbach, Sebastian] [Mourrain, Bernard] [Tsigaridas, Elias] [Zafeirakopoulos,Zafeirakis]				Cross-benchmarks of univariate algebraic kernels	Report	FAC8CEE8282E7F68C125754A004A4CA4-ACS-TR-363602-02
		2008			[Epstein, Leah] [Levin, Asaf] van Stee, Rob				Online unit clustering: Variations on a theme In: Theoretical Computer Science [407], 85-96	Journal Article	D9A49C2C3A28861BC125753C0043D18F-vanStee2008g
		2008			[Epstein, Leah] [Levin, Asaf] van Stee, Rob				Two-dimensional packing with conflicts In: Acta Informatica [45], 155-175	Journal Article	00C0C443386133B5C125753C004236A2-vanStee2008e
		2008			[Epstein, Leah] van Stee, Rob	[Kaklamanis, Christos] [Skutella, Martin]			Approximation schemes for packing splittable items with cardinality constraints In: Approximation and Online Algorithms, 5th International Workshop, WAOA 2007, 232-245	Proceedings Article	4BF479C08756F3CBC125753C0045AA08-vanStee2008j
		2008			[Epstein, Leah] van Stee, Rob	[Kaklamanis, Christos] [Skutella, Martin]			On the Online Unit Clustering Problem In: Approximation and Online Algorithms, 5th International Workshop, WAOA 2007, 193-206	Proceedings Article	102A0877BB549663C125753C004602A1-vanStee2008k
		2008			[Epstein, Leah] van Stee, Rob	[Laber, Eduardo Sany] [Bornstein, Claudson] [Noguiera, Loana Tito] [Faria, Luerbio]			Maximizing the minimum load for selfish agents In: LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, 264-275	Proceedings Article	7437786F00E9A7EEC125753C0040D2EC-vanStee2008a
		2008			[Epstein, Leah] van Stee, Rob	[Monien, Burkhard] [Schroeder, Ulf-Peter]			The price of anarchy on uniformly related machines revisited In: Algorithmic Game Theory, First International Symposium, SAGT 2008, 46-57	Proceedings Article	EA2DADF8C39471CEC125753C00401339-vanStee2008
		2008			Fountoulakis, Nikolaos [Kühn, Daniela] [Osthus, Deryk]				The order of the largest complete minor in a random graph In: Random Structures and Algorithms [33], 127-141	Journal Article	C726BC5BE0FC02D2C125755C0034DA7B-Fountoulakis2008b
		2008			Fountoulakis, Nikolaos [Reed, Bruce]				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	179764A96B2E6D17C125755C00345175-Fountoulakis2008
		2008			Friedrich, Tobias Hebbinghaus, Nils	[Hong, Seok-Hee] [Nagamochi, Hiroshi] [Fukunaga, Takuro]			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	D90AB617C945DBF9C1257559004CB614-FH08
		2008			Friedrich, Tobias [Horoba, Christian] Neumann, Frank	[Rudolph, Günter] [Jansen, Thomas] [Lucas, Simon M.] [Poloni, Carlo] [Beume, Nicola]			Runtime Analyses for Using Fairness in Evolutionary Multi-Objective Optimization In: Parallel Problem Solving from Nature (PPSN X), 671-680	Proceedings Article	E78DE54D265455D5C1257551004654FF-FriHorNeuPPSN2008
		2008			Friedrich, Tobias Neumann, Frank				When to Use Bit-wise Neutrality In: IEEE Congress on Evolutionary Computation 2008, 997-1003	Proceedings Article	AAA1BCCFB153C9F2C125756E00453FED-FriNeuCEC2008
		2008			Friedrich, Tobias [Oliveto, Pietro] [Sudholt, Dirk] [Witt, Carsten]	[Keijzer, Maarten]			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	151FD4300DB9845CC1257559004FB0BD-FOSW08
		2008			[Froyland, Gary] [Koch, Thorsten] Megow, Nicole [Duane, Emily] [Wren, Howard]				Optimizing the Landside Operation of a Container Terminal In: OR Spectrum [30], 53-75	Journal Article	043D5C54C3FFB6EEC125747A00662314-FroylandKMDW08
		2008			Funke, Stefan Laue, Sören Naujoks, Rouven [Lotker, Zvi]	[Sotiris E. Nikoletseas] [Bogdan S. Chlebus] [David B. Johnson] [Bhaskar Krishnamachari]			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	EA178C8E24528EBEC125755B00405210-FLNL2008
		2008			[Garg, Naveen] [Kavitha, T.] [Kumar, Amit] Mehlhorn, Kurt Mestre, Julián				Assigning Papers to Referees	Unpublished/Draft	86EB53E0611C508DC125755B004D1C35-Mehlhorn2008a
		2008			Giesen, Joachim				Conjoint Analysis for Measuring the Perceived Quality in Volume Rendering In: IEEE Transactions on Visualization and Computer Graphics [13], 1664-1671	Journal Article	8433A939320ABD85C12573D900544887-Giesen2007c
		2008			Giesen, Joachim				Delaunay Triangulation Approximates Anchor Hull In: Computational Geometry - Theory and Applications [36], 131-143	Journal Article	664CB8B3368169ABC12573D9005412F2-Giesen2007b
		2008			Giesen, Joachim				The Flow Complex: A Data Structure for Geometric Modeling In: Computational Geometry - Theory and Applications [39], 178-190	Journal Article	3CC40EF995A3BE6DC12573D900557C77-Giesen2008z
		2008			Govindarajan, Sathish [Dietze, Michael C.] [Agarwal, Pankaj K.] [Clark, James S.]				A scalable algorithm for dispersing population In: Journal of Intellingent Information Systems [29], 39-61	Journal Article	EBE675C4A57BA2F7C12573EC0038F205-Govindarajan2007
		2008			Happ, Edda Johannsen, Daniel Klein, Christian Neumann, Frank	[Ryan, Conor] [Keijzer, Maarten]			Rigorous Analyses of Fitness-Proportional Selection for Optimizing Linear Functions In: Genetic and Evolutionary Computation Conference 2008, 953-960	Proceedings Article	773559694ACCE547C1257543003A0035-HappJohannsenKleinNeumann2008a
		2008			Harren, Rolf van Stee, Rob	[Gudmundsson, Joachim]			Packing Rectangles into 2 OPT Bins using Rotations In: 11th Scandinavian Workshop on Algorithm Theory, 306-318	Proceedings Article	611BD68620972B8BC125753A001A6755-HarrenvanStee2008
		2008			Hemmer, Michael				CGAL package for modular arithmetic operations	Report	FF33A3D6E3E2BFFAC125754A00495ADB-ACS-TR-243406-01
		2008			Hemmer, Michael				CGAL package: Algebraic Foundations	Report	BA99272A94A3AA36C125754A00491AF8-ACS-TR-243400-04
		2008			Hemmer, Michael				Evaluation of different approaches in 3D curved kernel for arrangements of quadrics	Report	4C682DA28AABF728C125754A004A0B3F-ACS-TR-363501-01
		2008			Hemmer, Michael [Dupont, Laurent] [Petitjean, Sylvain] [Schömer, Elmar]				Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangment of Quadrics	Report	56CB1681787F636BC125754A00471106-ACS-TR-241402-01
		2008			Hemmer, Michael [Limbach, Sebastian]				Arrangements of quadrics in 3D: continued work on experimental implementation	Report	7B3D948C8B09236EC125754A004ADD59-ACS-TR-363606-01
		2008			[Horoba, Christian] Neumann, Frank	[Ryan, Conor] [Keijzer, Maarten]			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	3B0A66AFBDAA11E1C125755100378A73-HorNeuGECCO2008
		2008			[Huang, Chien-Chung] Kavitha, Telikepalli [Michail, Dimitrios] [Nasre, Meghana]				Bounded Unpopularity Matchings In: 11th Scandinavian Workshop on Algorithm Theory (SWAT), 127-137	Proceedings Article	5449B47F72AAB326C12575980043A16E-HKMN08
		2008			Kavitha, Telikepalli				On a Special Co-cycle Basis of Graphs In: 11th Scandinavian Workshop on Algorithm Theory (SWAT), 343-354	Proceedings Article	495D5B822B92FD26C12575980043F98F-Kav08
		2008			Kavitha, Telikepalli [Nasre, Meghana]				Optimal Popular Matchings	Miscellaneous	0257B90051382A77C125759800448149-KM08
		2008				[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]			GECCO 2008: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation	Proceedings	87D7465F364317F3C125754D005226FB-Doerr2008GeccoProc
		2008			Kerber, Michael				On filter methods in CGAL's 2D curved kernel	Report	4D8A94FE54E2D932C1257474004DF5C6-acs-tr-243404-03
		2008			Kettner, Lutz Mehlhorn, Kurt [Pion, Sylvain] [Schirra, Stefan] [Yap, Chee]				Classroom Examples of Robustness Problems in Geometric Computations In: Computational Geometry: Theory and Applications [40], 61-78	Journal Article	113F896EB9E35B7AC12573E60045601C-Kettner2007Classroom
		2008			[Khachiyan, Leonid] [Boros, Endre] [Borys, Konrad] Elbassioni, Khaled [Gurvich, Vladimir]				Generating All Vertices of a Polyhedron Is Hard In: Discrete & Computational Geometry [39], 174-190	Journal Article	97D069C937088B62C1257553004D7858-Elbassioni2008k
		2008			[Khachiyan, Leonid] [Boros, Endre] [Borys, Konrad] Elbassioni, Khaled [Gurvich, Vladimir] [Makino, Kazuhisa]				Generating Cut Conjunctions in Graphs and Related Problems In: Algorithmica [51], 239-263	Journal Article	20A65E762A0428F1C12575540038437E-Elbassioni2008m
		2008			[Khachiyan, Leonid] [Boros, Endre] [Borys, Konrad] Elbassioni, Khaled [Gurvich, Vladimir] [Rudolf, Gabor] [Zhao, Jihui]				On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction In: Theory Comput. Syst. [43], 204-233	Journal Article	57E9607FA889B8D2C1257553004C7CAE-Elbassioni2008f
		2008			[Khachiyan, Leonid] [Boros, Endre] Elbassioni, Khaled [Gurvich, Vladimir]				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	9C01BF7E55207797C1257553004D4CB4-Elbassioni2008j
		2008			[Khachiyan, Leonid] [Boros, Endre] Elbassioni, Khaled [Gurvich, Vladimir]				On Enumerating Minimal Dicuts and Strongly Connected Subgraphs In: Algorithmica [50], 159-172	Journal Article	E69FF15607BAFEF9C12575540038679A-Elbassioni2008n
		2008			[Khuller, Samir] Mestre, Julián				An Optimal Incremental Algorithm for Minimizing Lateness with Rejection In: 16th Annual European Symposium on Algorithms (ESA), 601-610	Proceedings Article	9D833BAF69A446B3C125745E0046EF24-conf/esa/KhullerM2008
		2008			Kobel, Alexander				Automated Generation of Kempe Linkages for Algebraic Curves in a Dynamic Geometry System Universität des Saarlandes	Thesis - Bachelor thesis	93D62F0E44BD59BCC125797C0045E2F8-KobelBachelor2008
		2008			[Kroeske, Jense] [Ghandar, Adam] [Michalewicz, Zbigniew] Neumann, Frank	[Rudolph, Günter] [Jansen, Thomas] [Lucas, Simon M.] [Poloni, Carlo] [Beume, Nicola]			Learning Fuzzy Rules with Evolutionary Algorithms - An Analytic Approach In: Parallel Problem Solving from Nature (PPSN X), 1051-1060	Proceedings Article	18DE857C1D1B8387C12575510046AF56-KroGhaMicNeuPPSN2008
		2008			[Krumke, Sven Oliver] [Schwahn, Anne] van Stee, Rob [Westphal, Stephan]				A monotone approximation algorithm for scheduling with precedence constraints In: Operations Research Letters [36], 247-249	Journal Article	3A5A6B71C6400E9FC125753C00435CDE-vanStee2008f
		2008			[Kutz, Martin] Elbassioni, Khaled [Katriel, Irit] [Mahajan, Meena]				Simultaneous matchings: Hardness and approximation In: J. Comput. Syst. Sci. [74], 884-897	Journal Article	ECDB4DEDB11B3882C1257553004CD986-Elbassioni2008g
		2008			Malamatos, Theocharis				Lower Bounds for expected-case planar point location In: Computational Geometry Theory and Applications [39], 91-103	Journal Article	3EB60CB84E604F57C1257393004E9ABE-Malamatos2008
		2008			Mehlhorn, Kurt [Kavitha, T.] [Hariharan, R.]				Faster Deterministic and Randomized Algorithms for Minimum Cycle Basis in Directed Graphs In: SIAM Journal of Computing [38], 1430-1447	Journal Article	2E4A966E27BF5CF7C125755B004DA137-Mehlhorn2008b
		2008			Mehlhorn, Kurt Osbild, Ralf Sagraloff, Michael				A General Approach to the Analysis of Controlled Perturbation Algorithms	Report	6EFAB2B96B96C2BBC12575860034ECFA-ACS-TR-361502-02
		2008			Mehlhorn, Kurt Sagraloff, Michael				A deterministic Bitstream Descartes Algorithm	Report	D1C37618649E6733C125758600344786-ACS-TR-361502-03
		2008			Mehlhorn, Kurt [Sanders, Peter]				Algorithms and Data Structures: The Basic Toolbox	Book	75AD1CF772C0FE5BC12575850043645F-Mehlhorn-Sanders:Toolbox
		2008			Mestre, Julián				Adaptive Local Ratio In: 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 152-160	Proceedings Article	50F3F35FC21C5964C125745E00459C0A-conf/soda/Mestre2008
		2008			Mestre, Julián				Lagrangian Relaxation and Partial Cover (Extended Abstract) In: 25th International Symposium on Theoretical Aspects of Computer Science (STACS), 539-550	Proceedings Article	B9686B4D0FE910D2C125745E0045E9F7-conf/stacs/Mestre2008
		2008			[Meyer, Ulrich]				On Trade-Offs in External-Memory Diameter Approximation In: Proc. 11th Scandinavian Workshop on Algorithm Theory (SWAT), xxx-yyyy	Proceedings Article	E80D45568877A28FC1257433004FAA91-Meyer_Swat08
		2008			[Meyer, Ulrich]	[Albers, Susanne] [Weil, Pascal] [Rochange, Christine]			On Dynamic Breadth-First Search in External-Memory In: Proc. 25th Annual Symposium on Theoretical Aspects (STACS), 551-560	Proceedings Article	252FF91941D3653AC1257433004E4F46-DBLP:conf/stacs/Meyer08
		2008			Neumann, Frank				Expected Runtimes of Evolutionary Algorithms for the Eulerian Cycle Problem In: Computers and Operations Research [35], 2750-2759	Journal Article	7F0CC6CF67BD9AB7C125728B00341CD5-NeuEul07
		2008			Neumann, Frank [Reichel, Joachim]	[Rudolph, Günter] [Jansen, Thomas] [Lucas, Simon M.] [Poloni, Carlo] [Beume, Nicola]			Approximating Minimum Multicuts by Evolutionary Multi-Objective Algorithms In: Parallel Problem Solving from Nature (PPSN X), 72-81	Proceedings Article	353504D48984385BC12575510047582F-NeuReiPPSN2008
		2008			Neumann, Frank [Reichel, Joachim] [Skutella, Martin]	[Ryan, Conor] [Keijzer, Maarten]			Computing Minimum Cuts by Randomized Search Heuristics In: Genetic and Evolutionary Computation Conference 2008, 779-786	Proceedings Article	1758BA318E9582B4C125755100371DE9-NeuReiSku2008
		2008			Neumann, Frank [Sudholt, Dirk] [Witt, Carsten]	[Dorigo, Marco] [Birattari, Mauro] [Blum, Christian] [Clerc, Maurice] [Stützle, Thomas] [Winfield, Alan F. T.]			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	950B932E656D0E21C125755100383B2A-NeuSudWit2008
		2008			Neumann, Frank [Witt, Carsten]	[Maniezzo, Vittorio] [Battiti, Roberto and] [Watson, Jean-Paul]			Ant Colony Optimization and the Minimum Spanning Tree Problem In: International Conference on Learning and Intelligent Optimization 2007, 153-166	Proceedings Article	48D647042DEB363DC125755100345C5D-NeuWitLion2008
		2008			[Pruhs, Kirk] van Stee, Rob [Uthaisombut, Patchrawat]				Speed Scaling of Tasks with Precedence Constraints In: Theory of Computing Systems [43], 67-80	Journal Article	4EE6AA6FAA356140C125753C00444737-vanStee2008h
		2008			Pyrga, Evangelia [Ray, Saurabh]				New existence Proofs for epsilon-nets In: Proceedings of the twenty-fourth annual symposium on Computational geometry, 199-207	Proceedings Article	0147C7B47463E990C125755B003FEC0D-Pyrga2008
		2008			[Tiwary, Hans Raj] Elbassioni, Khaled				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	028C23D1E0757179C1257553003F51BE-Elbassioni2008a
		2008			van Stee, Rob	[Kao, Ming-Yang]			Packet Switching in Single Buffer In: Encyclopedia of Algorithms, 1-99	Part of a Book	3DF1F110CE4AE50EC125753C00415997-vanStee2008b
		2008			van Stee, Rob	[Kao, Ming-Yang]			Paging In: Encyclopedia of Algorithms, 1-99	Part of a Book	02FD4F2BE5FC4E7DC125753C00418ACA-vanStee2008d
		2008			Wahlström, Magnus	[Grohe, Martin] [Niedermeier, Rolf]			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	E33C46205BC9FFE2C1257551005BDF84-Wahlstroem2008
		2008			[Xu, Chihao] Karrenbauer, Andreas [Soh, Kian Min] [Codrea, Cosmin]				Consecutive multiline addressing: A scheme for addressing PMOLEDs In: Journal of the Society for Information Display [16], 211-219	Journal Article	6E50DE7300AF4588C12575830059975C-XKSC2008
		2008			Zotenko, Elena Mestre, Julián O'Leary, Dianne Przytyzka, Teresa				Essential Complex Biological Modules Explain the Centrality-Lethality Rule In: PLoS Computational Biology [x], x-x	Journal Article	A3B7369CD74E2571C125745E0047509A-jounal/ploscb/ZotenkoMOP2008
		2007			[Abraham, David J.] [Irving, Robert W.] [Kavitha, Telikepalli] Mehlhorn, Kurt				Popular Matchings In: SIAM Journal on Computing [37], 1030-1045	Journal Article	6B07E5D0BA1AD3E5C12573E70031E1C4-Abraham2007Popular
		2007			[Ahuja, Nitin] [Baltz, Andreas] Doerr, Benjamin [Privetivy, Ales] [Srivastav, Anand]				On the Minimum Load Coloring Problem In: Journal of Discrete Algorithms [5], 533-545	Journal Article	BA09FAA2EE9CD9BFC12573CC00463CBC-Doerr2007nitin
		2007			Ajwani, Deepak Elbassioni, Khaled Govindarajan, Sathish [Ray, Saurabh]	[Gibbons, Phillip B.] [Scheideler, Christian]			Conflict-free coloring for rectangle ranges using $n^.382$ colors In: SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallel Algorithms and Architectures, 181-187	Proceedings Article	53A9B99F1F6F7415C12573D70037B9B2-Elbassioni2007f
		2007			Ajwani, Deepak Elbassioni, Khaled M. Govindarajan, Sathish [Ray, Saurabh]				Conflict-Free Coloring for Rectangle Ranges Using $\tildeO(n^.382+\epsilon)$ Colors In: 19th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 07), (to-appear)	Proceedings Article	7E191C8CB191BF71C12572910055A7EF-Elbassioni2007a
		2007			Ajwani, Deepak Friedrich, Tobias	[Tokuyama, Takeshi]			Average-Case Analysis of Online Topological Ordering In: Algorithms and Computation : 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007. Proceedings, 464-475	Proceedings Article	1A6437E768ECBDE3C12573D0005558D7-OTO_ISAAC_2007
		2007			Ajwani, Deepak Meyer, Ulrich Osipov, Vitaly	[Applegate, David] [Brodal, Gerth]			Improved external memory BFS implementations In: 9th Workshop on Algorithm Engineering and Experiments (ALENEX), 3-12	Proceedings Article	ECDC892B6D7A6432C1257289005D9DEB-Ajwani07
		2007			Ajwani, Deepak [Ray, Saurabh] [Seidel, Raimund] [Tiwary, Hans Raj]	[Dehne, Frank] [Sack, Joerg-Ruediger] [Zeh, Norbert]			On Computing the Centroid of the Vertices of an Arrangement and Related Problems In: 10th Workshop on Algorithms and Data Structures (WADS), 519-528	Proceedings Article	19D218B65DC3DDE4C12572D3004835EC-WadsCentroid07
		2007			Althaus, Ernst [Baumann, Tobias] [Schömer, Elmar] [Werth, Kai]				Trunk Packing Revisited In: Experimental Algorithms, 6th International Workshop, 420-432	Proceedings Article	B6D61EA363D51D42C125736300315FB1-Althaus2007a
		2007			Althaus, Ernst [Canzar, Stefan]	[Dress, Andreas] [Xu, Yinfeng] [Zhu, Binhai]			A Lagrangian relaxation approach for the multiple sequence alignment problem In: Combinatorial Optimization and Applications : First International Conference, COCOA 2007, 267-278	Proceedings Article	E649CE94959606EEC12573630030F6B7-Althaus2007
		2007			Angelopoulos, Spyros				Improved bounds for the online steiner tree problem in graphs of bounded edge-asymmetry In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, 248-257	Proceedings Article	EF04F0E72F2B7B32C12573D400486F40-Angelopoulos2007SODA1
		2007			Angelopoulos, Spyros [Dorrigiv, Reza] [López-Ortiz, Alejandro]				On the separation and equivalence of paging strategies In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, 229-237	Proceedings Article	429256FA30DF037EC12573D400496827-Angelopoulos2007SODA2
		2007			[Aronov, Boris] [Asano, Tetsuo] Funke, Stefan	[Tokuyama, Takeshi]			Optimal Triangulation with Steiner Points In: Algorithms and Computation : 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007. Proceedings, 681-691	Proceedings Article	EF064114683388A4C12573D4004906F9-Funke2007
		2007			[Arya, Sunil] Malamatos, Theocharis [Mount, David M.]				A simple entropy-based algorithm for planar point location In: ACM Transactions on Algorithms [3], 17	Journal Article	79E8D6DBF10CC718C1257393004DDEE4-Malamatos2007b
		2007			[Arya, Sunil] Malamatos, Theocharis [Mount, David M.] [Wong, Ka Chun]				Optimal expected-case planar point location In: SIAM Journal on Computing [37], 584-610	Journal Article	42963F5202A944F1C1257393004D12BE-Malamatos2007a
		2007			[Bar-Yehuda, Reuven] [Flysher, Guy] Mestre, Julián [Rawitz, Dror]	[Arge, Lars] [Hoffmann, Michael] [Welzl, Emo]			Approximation of Partial Capacitated Vertex Cover In: 15th Annual European Symposium on Algorithms, 335-346	Proceedings Article	056F0FDF14F5F1F0C12573D1005B265C-conf/esa/Bar-YehudaFMR2007
		2007			Bast, Holger Chitea, Alexandru Suchanek, Fabian Weber, Ingmar	[Clarke, Charlie] [Fuhr, Norbert] [Kando, Noriko]			ESTER: Efficient Search in Text, Entities, and Relations In: 30th International Conference on Research and Development in Information Retrieval (SIGIR'07), 671-678	Proceedings Article	299527A245D38B7DC12572D1003AB946-bastetal07sigir
		2007			Bast, Holger Funke, Stefan Matijevic, Domagoj [Sanders, Peter] [Schultes, Dominik]	[Applegate, David] [Brodal, Gerth]			In Transit to Constant Time Shortest-Path Queries in Road Networks In: 9th Workshop on Algorithm Enginneering and Experiments (ALENEX'07), 46-59	Proceedings Article	E90810A80D03CF90C125721E0061D015-BastFMSS07
		2007			Bast, Holger Funke, Stefan [Sanders, Peter] [Schultes, Dominik]				Fast Routing in Road Networks using Transit Nodes In: Science [316], 566	Journal Article	B7EC401F13BCFE21C12573D4004BCBB0-BFSS07
		2007			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]			Efficient interactive query expansion with CompleteSearch In: 16th Conference on Information and Knowledge Management (CIKM'07), 857-860	Proceedings Article	D289D8E0DE25A115C12573D90059AB5F-BastMW07
		2007			Bast, Holger Weber, Ingmar	[Gronau, Norbert]			Managing Helpdesk Tasks with CompleteSearch: A Case Study In: 4th Conference on Professional Knowledge Management (WM'07), 101-108	Proceedings Article	45A088553B066F59C125723C005C1BB2-bastweber07gwem
		2007			Baswana, Surender [Sen, Sandeep]				A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs In: Random Structures & Algorithms [30], 532-563	Journal Article	D5D46F0C7C13EBFEC12573E8003E4922-BaswanaSen2007
		2007			Behle, Markus	[Dress, Andreas] [Xu, Yinfeng] [Zhu, Binhai]			On threshold BDDs and the optimal variable ordering problem In: Combinatorial Optimization and Applications : First International Conference, COCOA 2007, 124-135	Proceedings Article	F6F422137DAB987AC12573F70034EB7C-Behle2007
		2007			Behle, Markus [Jünger, Michael] [Liers, Frauke]	[Demetrescu, Camil]			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	91E83C9209A903B3C12573F700369045-Behle2007A
		2007			Beier, René [Röglin, Heiko] [Vöcking, Berthold]	[Fischettim, Matteo] [Williamson, David P.]			The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization In: Integer Programming and Combinatorial Optimization : 12th International IPCO Conference, 53-67	Proceedings Article	7C543D8B6003C6FDC125726B004CCB92-Beier2007
		2007			[Beldiceanu, Nicolas] Katriel, Irit Thiel, Sven				Filtering Algorithms for the Same and UsedBy Constraints In: Archives of Control Sciences [to appear], to appear	Journal Article	4BFB3485EFC1C1F5C1256F870047CA87-Same2005
		2007			Berberich, Eric Caroli, Manuel [Wolpert, Nicola]				Exact Computation of Arrangements of Rotated Conics	Report	1EB177EFAA801139C12573D1004D0246-acs:bcw-carc-07
		2007			Berberich, Eric Caroli, Manuel [Wolpert, Nicola]				Exact Computation of Arrangements of Rotated Conics In: Proceedings of 23rd European Workshop on Computational Geometry, 231-234	Proceedings Article	C870F68A75B40E8DC12572960038E456-BCW-ECARC2007
		2007			Berberich, Eric [Fogel, Efi] [Halperin, Dan] Mehlhorn, Kurt [Wein, Ron]				Sweeping and Maintaining Two-Dimensional Arrangements on Quadrics	Report	A2D9FC191F294C4BC12573D1004D4FA3-acs:bfhmw-smtaoq-07
		2007			Berberich, Eric [Fogel, Efi] [Halperin, Dan] Mehlhorn, Kurt [Wein, Ron]	[Arge, Lars] [Hoffmann, Michael] [Welzl, Emo]			Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step In: Algorithms - ESA 2007, 15th Annual European Symposium, 645-656	Proceedings Article	5496A47512AF3FBEC12573D1004BD408-bfhmw-samtdaosafs-07
		2007			Berberich, Eric [Fogel, Efi] [Halperin, Dan] [Wein, Ron]				Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces In: Proceedings of 23rd European Workshop on Computational Geometry, 223-226	Proceedings Article	5FB99C71838C942BC1257296003EC59D-BFHW-SMTDAS2007
		2007			Berberich, Eric [Fogel, Efi] Meyer, Andreas				Updated Website to include Benchmark Instances for Arrangements of Quadrics and Planar Algebraic Curves	Report	DEDF6F20E463424CC12573D1004E1823-acs:bfm-uwibaqpac-07
		2007			Berberich, Eric [Hemmer, Michael]				Definition of the 3D Quadrical Kernel Content	Report	2FF567066FB82A5FC12573D1004DDD73-acs:bh-dtqkc-07
		2007			Berberich, Eric Hemmer, Michael [Karavelas, Menelaos I.] [Teillaud, Monique]				Revision of interface specification of algebraic kernel	Report	1F31C7FA352D83DDC12573D1004F257E-acs:bhkt-risak-06
		2007			Berberich, Eric Kettner, Lutz				Linear-Time Reordering in a Sweep-line Algorithm for Algebraic Curves Intersecting in a Common Point	Report	D3347FB7A037EE5CC12573D1004C6833-bk-reorder-07
		2007			Berberich, Eric [Meyerovitch, Michal]				Computing Envelopes of Quadrics	Report	12A6DC64E5449DC9C12573D1004DA0BC-acs:bm-ceq-07
		2007			Berberich, Eric [Meyerovitch, Michal]				Computing Envelopes of Quadrics In: Proceedings of 23rd European Workshop on Computational Geometry, 235-238	Proceedings Article	4509C6E9CC1E2424C12572960039B7FB-BM-CEQ2007
		2007			[Bodirsky, Manuel] [Gröpl, Clemens] Johannsen, Daniel [Kang, Mihyun]				A Direct Decomposition of 3-connected Planar Graphs In: Séminaire Lotharingien de Combinatoire [B54Ak], 15	Journal Article	26034030119C9A17C1257298005B4CE8-BodirskyGroeplJohannsenKang2007a
		2007			[Bodirsky, Manuel] Kutz, Martin				Determining the consistency of partial tree descriptions In: Artificial Intelligence [171], 185-196	Journal Article	3BC87D2AAA30BD9DC12573E8004C0EBF-BodirskyKutz2007
		2007			[Boros, Endre] [Borys, Konrad] Elbassioni, Khaled [Gurvich, Vladimir] [Makino, Kazuhisa] [Rudolf, Gabor]	[Lin, Guohui]			Generating Minimal k-Vertex Connected Spanning Subgraphs In: Computing and Combinatorics, 13th Annual International Conference, COCOON 2007, Proceedings, 222-231	Proceedings Article	00A5EAFF759AA982C12573D700364DD0-Elbassioni2007e
		2007			[Boros, Endre] Elbassioni, Khaled M. [Gurvich, Vladimir] [Makino, Kazuhisa]				Generating Vertices of Polyhedra and Related Monotone Generation Problems	Unpublished/Draft	212B9C99B2099B55C12572910048F295-Elbassioni2007c
		2007			[Brockhoff, Dimo] Friedrich, Tobias Hebbinghaus, Nils Klein, Christian Neumann, Frank [Zitzler, Eckart]	[Dirk Thierens]			Do Additional Objectives Make a Problem Harder? In: Genetic and Evolutionary Computation Conference 2007, 765-772	Proceedings Article	FE874B1678C54758C125728A00593510-addobj07
		2007			[Caragiannis, Ioannis] Fishkin, Aleksei V. [Kaklamanis, Christos] [Papaioannou, Evi]				A tight bound for online colouring of disk graphs In: Theoretical Computer Science [384], 152-160	Journal Article	62267046A4B7ADBFC12573E8004CF718-Caragioannis2007
		2007			[Caragiannis, Ioannis] Fishkin, Aleksei V. [Kaklamanis, Christos] [Papaioannou, Evi]	[Kratochvíl, Jan] [Díaz, Josep] [Fiala , Jiří]			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	AD4CA31E5BD06414C12573E8004DAB59-CaragiannisFishkin2007
		2007			Chang, Kevin				Multiple pass streaming algorithms for learning mixtures of distributions in $R^d$ In: Algorithmic Learning Theory, 18th International Conference, Proceedings, 16	Proceedings Article	2A72B3310D4A5F5FC1257289003BD5E8-Chang2007
		2007			Christodoulou, George [Gourves, Laurent] [Pascual, Fanny]	[Lin, Guohui]			Scheduling Selfish Tasks: About the Performance of Truthful Algorithms In: Computing and Combinatorics : 13th Annual International Conference, COCOON 2007, 187-197	Proceedings Article	22B61A7109B1B2CCC12573F7003995F2-CGP2007
		2007			Christodoulou, George [Koutsoupias, Elias] Kovács, Annamária	[Arge, Lars] [Cachin, Christian] [Jurdzi´nski, Tomasz] [Tarlecki, Andrzej]			Mechanism design for fractional scheduling on unrelated machines In: Automata, Languages and Programming : 34th International Colloquium, ICALP 2007, 40-52	Proceedings Article	6BF1BBF86AB55A34C125729200393468-CKK07
		2007			Christodoulou, George [Koutsoupias, Elias] [Vidali, Angelina]				A lower bound for scheduling mechanisms In: ACM-SIAM Symposium on Discrete Algorithms (SODA), 1163-1170	Proceedings Article	BF80B0F6D9F89146C125729200372B54-CKV07
		2007			[Chrobak, Marek] [Gasieniec, Leszek] Kowalski, Dariusz R.				The wake-up problem in multihop radio networks In: SIAM Journal on Computing [36], 1453-1471	Journal Article	40739073EBED9539C12573E9004477EA-Chrobak2007
		2007			[Cole, Richard] Kowalik, Lukasz [Skrekovski, Riste]				A Generalization of Kotzig's Theorem and Its Application In: SIAM Journal on Discrete Mathematics [21], 93-106	Journal Article	2B42D710268D2833C125729A002C7A9F-KowalikKotzig
		2007			[Cooper, Joshua] Doerr, Benjamin Friedrich, Tobias [Spencer, Joel]				Deterministic Random Walks on Regular Trees In: Electronic Notes in Discrete Mathematics [29], 509-513	Journal Article	D818AC56EE641B9EC12573CC00502FA0-Doerr2007-ENDMa
		2007			[Cooper, Joshua] Doerr, Benjamin [Spencer, Joel] [Tardos, Gábor]				Deterministic random walks on the integers In: European Journal of Combinatorics [28], 2072-2090	Journal Article	250BF4FE9AF6CA68C12573060040EBB5-CDoerrST2007
		2007			Csaba, Bela				On the Bollobas-Eidrigde conjecture for bipartite graphs In: Combinatorics, Probability and Computing [16], 1-31	Journal Article	8B4ACA6957F04E0FC125730E004183A1-Csaba07
		2007			[Diedrich, Florian] Harren, Rolf [Jansen, Klaus] [Thöle, Ralf] [Thomas, Henning]	[Cai, Jin-Yi] [Cooper, S. Barry] [Zhu, Hong]			Approximation Algorithms for 3D Orthogonal Knapsack In: Theory and Applications of Models of Computation, 34-45	Proceedings Article	6956E12A3255B142C12573D30054DADF-Harren2007
		2007			Doerr, Benjamin				Lp Linear discrepancy of totally unimodular matrices In: Linear Algebra and Its Applications [420], 663-666	Journal Article	68E9DCFE809D7D23C1257230003F3518-LpDisc2006
		2007			Doerr, Benjamin				Matrix approximation and Tusnády's problem In: European Journal of Combinatorics [28], 990-995	Journal Article	83C541C6FDCEE445C1257299003DE0E6-DoerrTusnady
		2007			Doerr, Benjamin				Partial Colorings of Unimodular Hypergraphs In: Electronic Notes in Discrete Mathematics [29], 359-363	Journal Article	2F0884AA28ECA547C12573CC0050BFB3-Doerr2007partial
		2007			Doerr, Benjamin				Roundings respecting hard constraints In: Theory of Computing Systems [40], 467-483	Journal Article	D71AA8117D32EA78C12573E90048240E-DoerrTCS2007
		2007			Doerr, Benjamin Friedrich, Tobias Klein, Christian Osbild, Ralf				Unbiased Matrix Rounding In: Electronic Notes in Discrete Mathematics [28], 41-46	Journal Article	9570659128693AAAC12573CC0050998F-Doerr2007-ENDMb
		2007			Doerr, Benjamin [Gnewuch, Michael] Hebbinghaus, Nils Neumann, Frank				A Rigorous View On Neutrality In: IEEE Congress on Evolutionary Computation 2007, 2591-2597	Proceedings Article	A4510006DA0D0A8FC12573D2003AB51F-Doerr2007-CECb
		2007			Doerr, Benjamin Happ, Edda Klein, Christian				A Tight Bound for the (1+1)-EA on the Single Source Shortest Path Problem In: IEEE Congress on Evolutionary Computation 2007, 1890-1895	Proceedings Article	FB240459E98DA8DAC12573D2003B2D52-Doerr2007-CECa
		2007			Doerr, Benjamin Hebbinghaus, Nils Neumann, Frank				Speeding up Evolutionary Algorithms Through Asymmetric Mutation Operators In: Evolutionary Computation [15], 401-410	Journal Article	DDC530A1959FF539C125729F00350A5E-EulerECJ07
		2007			Doerr, Benjamin Johannsen, Daniel				Refined Runtime Analysis of a Basic Ant Colony Optimization Algorithm In: IEEE Congress on Evolutionary Computation 2007, 501-507	Proceedings Article	581B334E667B627DC12573D2003BF03C-DoerrJohannsen2007b
		2007			Doerr, Benjamin Johannsen, Daniel	[Thierens, Dirk]			Adjacency List Matchings --- An Ideal Genotype for Cycle Covers In: Genetic and Evolutionary Computation Conference (GECCO-2007), 1203-1210	Proceedings Article	2A58943DC07CF5F2C125729F00364AEC-DoerrJohannsen07a
		2007			Doerr, Benjamin Klein, Christian [Storch, Tobias]				Faster Evolutionary Algorithms by Superior Graph Representation In: First IEEE Symposium on Foundations of Computational Intelligence (FOCI-2007), 245-250	Proceedings Article	AB11529D580C94B0C125728B00473C81-bks07
		2007			Doerr, Benjamin Neumann, Frank [Sudholt, Dirk] [Witt, Carsten]	[Thierens, Dirk]			On the Runtime Analysis of the 1-ANT ACO algorithm In: Genetic and Evolutionary Computation Conference 2007, 33-40	Proceedings Article	863DA1281A102656C125728B0034B58F-AntGECCO07
		2007			Doerr, Benjamin	[Thomas, Wolfgang] [Weil, Pascal]			Randomly Rounding Rationals with Cardinality Constraints and Derandomizations In: STACS 2007 : 24th Annual Symposium on Theoretical Aspects of Computer Science, 441-452	Proceedings Article	D8848493C4E2863DC1257257004FF38F-stacs07_rand
		2007			[Dupont, Laurent] Hemmer, Michael [Petitjean, Sylvain] [Schömer, Elmar]	[Arge, Lars] [Hoffmann, Michael] [Welzl, Emo]			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	C9C370E15242F2D7C125754A0045A8EC-Hemmer2007
		2007			Eigenwillig, Arno				On Multiple Roots in Descartes' Rule and Their Distance to Roots of Higher Derivatives In: Journal of Computational and Applied Mathematics [200], 226-230	Journal Article	630A22C1D279C2D0C125725E0036EB66-Eigenwillig2007a
		2007			Eigenwillig, Arno Kerber, Michael [Wolpert, Nicola]	[Brown, Christopher W.]			Fast and Exact Geometric Analysis of Real Algebraic Plane Curves In: Proceedings of the 2007 International Symposium on Symbolic and Algebraic Computation, 151-158	Proceedings Article	6B96A81443C11220C125733200398E3C-ekw-fast-2007
		2007			Eigenwillig, Arno Kettner, Lutz [Wolpert, Nicola]				Snap Rounding of Bézier Curves	Report	13E19171EEC8D5E0C12572A0005C02F6-ACS-TR-121108-01
		2007			Eigenwillig, Arno Kettner, Lutz [Wolpert, Nicola]				Snap rounding of Bézier curves In: Proceedings of the Twenty-Third Annual Symposium on Computational Geometry (SCG'07), 158-167	Proceedings Article	100BAFC894F6C41FC125728F004F8913-Eigenwillig2007b
		2007			Eisenbrand, Friedrich [Funke, Stefan] Karrenbauer, Andreas Reichel, Joachim [Schömer, Elmar]				Packing a truck - Now with a twist! In: International Journal of Computational Geometry & Applications [17], 505-527	Journal Article	BCFEC78ADA725C8CC12573E90049A686-EisenbrandIJCGA2007
		2007			[Eisenbrand, Friedrich] Karrenbauer, Andreas [Xu, Chihao]	[Camil Demetrescu]			Algorithms for longer OLED Lifetime In: WEA 2007, 338-351	Proceedings Article	60E5F7A390C6D029C12575830033ECE0-EKX2007
		2007			El Kahoui, M'hammed [Rakrak, Said]				Structure of Groebner bases with respect to block orders In: Mathematics of Computation [76], 2181-2187	Journal Article	1A40D45BB9025E31C1256FB30053B2C7-ElKahoui2005g
		2007			Elbassioni, Khaled [Sitters, Rene] [Zhang, Yan]	[Arge, Lars] [Hoffmann, Michael] [Welzl, Emo]			A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs In: Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings, 451-462	Proceedings Article	D5F101BFCEF6665BC12573D70035BBB9-Elbassioni2007d
		2007			Elbassioni, Khaled M. [Sitters, Rene] [Zhang, Yan]				A Quasi-PTAS for Envy-free Pricing on Line Graphs	Unpublished/Draft	863BCD8C0956B33EC125728E0079720F-Elbassioni2007b
		2007			[Fogel, Efi] [Halperin, Dan] Kettner, Lutz [Teillaud, Monique] [Wein, Ron] Wolpert, Nicola	[Boissonnat, Jean-Daniel] [Teillaud, Monique]			Arrangements In: Effective Computational Geometry for Curves and Surfaces, 1-66	Part of a Book	E4AD242205143EECC12572630068AF3A-Kettner2007ECGBookz
		2007			[Fountoulakis, Nikolaos]				Percolation on sparse random graphs with given degree sequence In: Internet Mathematics [4], 329-356	Journal Article	37716ECA08ACCCD0C125755C003559F4-Fountoulakis2009a
		2007			Fountoulakis, Nikolaos [Reed, Bruce]				Faster Mixing and Small Bottlenecks In: Probability Theory and Related Fields [137], 475-486	Journal Article	6678ECC6CEEEEBF9C125755C0033E647-Fountoulakis2007
		2007			Friedrich, Tobias Hebbinghaus, Nils Neumann, Frank				Plateaus Can Be Harder in Multi-Objective Optimization In: IEEE Congress on Evolutionary Computation 2007, 2622-2629	Proceedings Article	A780102C8F12F52EC12573D10059A527-setcover07
		2007			Friedrich, Tobias Hebbinghaus, Nils Neumann, Frank	[Dirk Thierens]			Rigorous Analyses of Simple Diversity Mechanisms In: Genetic and Evolutionary Computation Conference 2007, 1219-1225	Proceedings Article	94353DCB9633368AC125728B00338D79-selection07
		2007			Friedrich, Tobias [He, Jun] Hebbinghaus, Nils Neumann, Frank [Witt, Carsten]				On Improving Approximate Solutions by Evolutionary Algorithms In: IEEE Congress on Evolutionary Computation 2007, 2614-2621	Proceedings Article	12230FD3C04C1F5DC12573D10059A369-HybridVC07
		2007			Friedrich, Tobias [He, Jun] Hebbinghaus, Nils Neumann, Frank [Witt, Carsten]	[Dirk Thierens]			Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models In: Genetic and Evolutionary Computation Conference 2007, 797-804	Proceedings Article	E1BA076358C02B99C125728A0058DCD2-MultVC07
		2007			Funke, Stefan Kesselman, Alexander [Kuhn, Fabian] [Lotker, Zvi] [Segal, Michael]				Improved approximation algorithms for connected sensor cover In: Wireless Networks [13], 153-164	Journal Article	05D2D25B4500970DC12573D4004D0F69-FKKLS07
		2007			Funke, Stefan Laue, Sören Naujoks, Rouven	[Aspnes, James] [Scheideler, Christian] [Arora, Anish] [Madden, Samuel]			Minimum Energy Broadcast with Few Senders In: Distributed Computing in Sensor Systems : Third IEEE International Conference, DCOSS 2007, 404-416	Proceedings Article	83BCB75A6E2427CAC12572D4004DB529-FLN2007
		2007			Funke, Stefan Laue, Sören	[Thomas, Wolfgang] [Weil, Pascal]			Bounded-Hop Energy-Efficient Broadcast in Low-Dimensional Metrics Via Coresets In: STACS 2007 : 24th Annual Symposium on Theoretical Aspects of Computer Science, 272-283	Proceedings Article	7CAF38D9D2C68FA1C125728E0048C8FF-FL2007
		2007			Funke, Stefan [Milosavljevic, Nikola]				Guaranteed-delivery Geographic Routing under Uncertain Node Locations In: IEEE INFOCOM 2007 : 26th IEEE International Conference on Computer Communications, 1244-1252	Proceedings Article	75A96D2C43F55952C12572920050FEF1-FM2007b
		2007			Funke, Stefan [Milosavljevic, Nikola]				Network Sketching or: "How much Geometry hides in Connectivity? - Part II" In: Proceedings of the eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-07), 958-967	Proceedings Article	2CD15A5E8C9725E5C1257284004B523C-FM2007
		2007			Funke, Stefan Rauf, Imran	[Kranakis, Evangelos] [Opatrny, Jaroslav]			Information Brokerage Via Location-Free Double Rulings In: Ad-Hoc, Mobile, and Wireless Networks : 6th International Conference, ADHOC-NOW 2007, Morelia, Mexico, September 24-26, 2007, Proceedings, 87-100	Proceedings Article	00C5B049270793F5C12573D40036279D-FunkeRauf07
		2007			Gidenstam, Anders [Papatriantafilou, Marina]	[Tovar, Eduardo] [Tsigas, Philippas] [Fouchal, Hacène]			LFthreads: A Lock-Free Thread Library In: 11th International Conference On Principles Of Distributed Systems (OPODIS), 217-231	Proceedings Article	447CF6B00B4879A6C12573D00050A85D-Gidenstam2007a
		2007			Giesen, Joachim				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	D3CF100EAABC5007C12573D900553A24-Giesen2007e
		2007			Giesen, Joachim	[A. Gustafsson] [A. Herrmann] [F. Huber]			The Combinatorial Structure of Polyhedral Choice Based Conjoint Analysis In: Conjoint Measurement: Methods and Applications, 259-271	Part of a Book	564915DC3975C8A3C12573D90053A4AD-Giesen2007conj
		2007			Giesen, Joachim [Mitsche, Dieter] [Schuberth, Eva]	[Kao, Ming-Yang] [Li, Xiang-Yang]			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	C5185326D67E383FC12573D90054EA98-Giesen2007col
		2007			Giesen, Joachim [Schuberth, Eva] [Simon, Klaus] [Zolliker, Peter] [Zweifel, Oliver]				Image-Dependent Gamut Mapping as Optimization Problem In: IEEE Transactions on Image Processing [16], 2401-2410	Journal Article	2C4C1701CF1502AFC12573D90053E06D-Giesen2007
		2007			[Gotsman, Craig] Kaligosi, Kanela Mehlhorn, Kurt Michail, Dimitrios Pyrga, Evangelia				Cycle Bases of Graphs and Sampled Manifolds In: Computer Aided Geometric Design [24], 464	Journal Article	CE8DCB4C127284AAC125728E003EFD6F-GKMMP06
		2007			Hachenberger, Peter Kettner, Lutz Mehlhorn, Kurt				Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, Optimized Implementation and Experiments In: Computational Geometry: Theory and Applications [38], 64-99	Journal Article	FECC77F07C1A1E72C12573D20003E1DD-Kettner2007Nef3
		2007			Harren, Rolf				Mehrdimensionale Packungsprobleme - Approximation geometrischer Verallgemeinerungen klassischer Packungsprobleme	Book	228309F80EBC2BF4C12573D300555230-Harren2007b
		2007			Hebbinghaus, Nils				Discrepancy of Sums of two Arithmetic Progressions	Report	DA3A1BAF1A58AC3AC12572960055DB6E-Hebbinghaus2007
		2007			Hemmer, Michael				Algebraic Foundations, CGAL - Computational Geometry Algorithms Library, release 3.3	Manual	163B20F4FDF57AA3C1257583005A0477-af-hemmer-2007
		2007			Hemmer, Michael [Hert, Susan] [Kettner, Lutz] [Pion, Sylvain] [Schirra, Stefan]				Number Types, CGAL - Computational Geometry Algorithms Library, release 3.3	Manual	789BEE7DE8CC4E72C1257583005B441A-nt-hemmer-2007
		2007			Hemmer, Michael [Hülse, Dominik]				Traits classes for polynomial gcd computation over algebraic extensions	Report	4933B3BD574CAE41C125754A0048100F-ACS-TR-241405-03
		2007			Hemmer, Michael [Limbach, Sebastian]				Benchmarks on a generic univariate algebraic kernel	Report	A80B6CCAED5015B2C125754A004881CA-ACS-TR-243306-03
		2007			[Hert, Susan] [Hoffmann, Michael] Kettner, Lutz [Pion, Sylvain] [Seel, Michael]				An adaptable and extensible geometry kernel In: Computational Geometry: Theory and Applications [38], 16-36	Journal Article	765A99A6A34EA3F5C12573D20002FF7C-Kettner2007CGALKernel
		2007			Kavitha, Telikepalli Mehlhorn, Kurt				Algorithms to compute minimum cycle basis in directed graphs In: Theory of Computing Systems [40], 485-505	Journal Article	4000DCDBCE376944C12573E6004AC629-Kavitha2007TCS
		2007			[Kavitha, Telikepalli] Mehlhorn, Kurt Michail, Dimitrios [Paluch, Katarzyna E.]				Strongly stable matchings in time O(nm) and extension to the hospitals-residents problem In: ACM Transactions on Algorithms [3], 15.1-15.18	Journal Article	C2986B86FD6341EBC12573CA0030895C-a15-kavitha
		2007			[Kavitha, Telikepalli] Mehlhorn, Kurt Michail, Dimitrios	[Thomas, Wolfgang] [Weil, Pascal]			New Approximation Algorithms for Minimum Cycle Bases of Graphs In: STACS 2007 : 24th Annual Symposium on Theoretical Aspects of Computer Science, 512-523	Proceedings Article	2BFAB74EC24AD32DC125728E003EAFF1-KMM07
		2007			[Khachiyan, Leonid] [Boros, Endre] Elbassioni, Khaled [Gurvich, Vladimir]				A global parallel algorithm for the hypergraph transversal problem In: Information Processing Letters [101], 148-155	Journal Article	7E82A0701999CFB3C12573D700385C43-Elbassioni2007h
		2007			[Khachiyan, Leonid] [Boros, Endre] Elbassioni, Khaled [Gurvich, Vladimir]				On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs In: Theoretical Computer Science [382], 139-150	Journal Article	FAE2DB2749204FEEC12573D7003908C6-Elbassioni2007j
		2007			[Khachiyan, Leonid] [Boros, Endre] Elbassioni, Khaled [Gurvich, Vladimir] [Makino, Kazuhisa]				Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data In: Theoretical Computer Science [379], 361-376	Journal Article	6F015E2E57F1FAD0C12573D70038D815-Elbassioni2007i
		2007			[Khachiyan, Leonid] [Boros, Endre] Elbassioni, Khaled [Gurvich, Vladimir] [Makino, Kazuhisa]				Enumerating disjunctions and conjunctions of paths and cuts in reliability theory In: Discrete Applied Mathematics [155], 137-149	Journal Article	A7DDCF78279C47CBC12573D70038080C-Elbassioni2007g
		2007			[Khuller, Samir] [Malekian, Azarakhsh] Mestre, Julián	[Arge, Lars] [Hoffmann, Michael] [Welzl, Emo]			To Fill or Not to Fill: The Gas Station Problem In: 15th Annual European Symposium on Algorithms, 534-545	Proceedings Article	E7F32A635F69DFBEC12573D1005CAEDC-conf/esa/KhullerMM2007
		2007			[Klein, Rolf] Kutz, Martin	[Kaufmann, Michael] [Wagner, Dorothea]			Computing Geometric Minimum-Dilation Graphs Is NP-Hard In: Graph Drawing : 14th International Symposium, GD 2006, 196-207	Proceedings Article	8A77A2F92F47D2DBC125729000496304-KlKu2006a
		2007			Kowalik, Lukasz				Adjacency Queries in Dynamic Sparse Graphs In: Inf. Proc. Lett. [-], -	Journal Article	189163B9342A2A28C125729D003984DF-KowalikAdjSparseGraphs
		2007			Kutz, Martin Schweitzer, Pascal	Applegate, David Brodal, Gerth			ScrewBox: a Randomized Certifying Graph Non-Isomorphism Algorithm In: 9th Workshop on Algorithm Engineering and Experiments (ALENEX'07), 150-157	Proceedings Article	5346A7E2A38C418AC1257290003FCFC8-KutzSchw2006
		2007			[Lehnert, Jörg] Schweitzer, Pascal				The Co-Word Problem for the Higman-Thompson Group is context-free In: Bulletin of the London Mathematical Society [39], 235-241	Journal Article	2543EE1253B6DC36C12573D1004C7286-LehnSchw2007
		2007			Mehlhorn, Kurt	[Dress, Andreas] [Xu, Yinfeng] [Zhu, Binhai]			Matchings in Graphs Variations of the Problem In: Combinatorial Optimization and Applications : First International Conference, COCOA 2007, 1-2	Proceedings Article	8919E7EBB8E64B8EC12573FB00310490-COCOA07
		2007			Mehlhorn, Kurt	Kucera, Ludek Kucera, Antonín			Minimum Cycle Bases in Graphs Algorithms and Applications In: Mathematical Foundations of Computer Science 2007 : 32nd International Symposium, MFCS 2007, 13-14	Proceedings Article	3E9ED811EBD4E1E9C12573FB002FFF04-MehlhornMFCS07
		2007			Michail, Dimitrios				Reducing rank-maximal to maximum weight matching In: Theoretical Computer Science [389], 125-132	Journal Article	812B1F5E7AAD888EC12573EF003EEF2B-Dimitrios2007
		2007			[Miklos, Balint] Giesen, Joachim [Pauly, Mark]				Medial Axis Approximation from Inner Voronoi Balls: A Demo of the Mesecina Tool In: Proceedings of the Twenty-Third Annual Symposium on Computational Geometry (SCG'07), 123-124	Proceedings Article	04DFC215581CC497C1257291007C8CC6-BaGiePa2007
		2007			[Mourrain, Bernard] [Pion, Sylvain] Schmitt, Susanne [Técourt, Jean-Pierre] [Tsigaridas, Elias] Wolpert, Nicola	[Boissonnat, Jean-Daniel] [Teillaud, Monique]			Algebraic Issues in Computational Geometry In: Effective Computational Geometry for Curves and Surfaces, 117-155	Part of a Book	ADACEACDB2E76F57C1257282002DD140-Kettner2007ECGBook
		2007			Mustafa, Nabil H. [Ray, Saurabh]				An Optimal Generalization of the Centerpoint Theorem, and its Extensions In: Proceedings of the Twenty-Third Annual Symposium on Computational Geometry (SCG'07), 138-141	Proceedings Article	E78375274D3398D0C12572A400483538-NaRa07
		2007			Neumann, Frank [Sudholt, Dirk] [Witt, Carsten]	[Stützle, Thomas] [Birattari, Mauro] [Hoss, Holger H.]			Comparing Variants of MMAS ACO Algorithms on Pseudo-Boolean Functions In: Engineering Stochastic Local Search Algorithms 2007, 61-75	Proceedings Article	54A7656C5D9D643FC12573D1004945C4-NSWSLS2007
		2007			Neumann, Frank [Wegener, Ingo]				Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem In: Theoretical Computer Science [378], 32-40	Journal Article	DD35F633268055C4C125728B0033310A-NeuWegMST2007
		2007			Pyrga, Evangelia [Schulz, Frank] [Wagner, Dorothea] [Zaroliagis, Christos]				Efficient models for timetable information in public transportation systems In: ACM Journal of Experimental Algorithmics [12], 1-39	Journal Article	11C670EE17289C83C1257355004DAEDB-Pyrga2007
		2007			[Ray, Saurabh] Mustafa, Nabil H.				Weak $\epsilon$-nets have a basis of size $O(1/\epsilon\log 1/\epsilon)$ in any dimension In: Proceedings of the Twenty-Third Annual Symposium on Computational Geometry (SCG'07), 239-244	Proceedings Article	5C0E34DFC28BDC80C12572A400488D60-NaRa07b
		2007				[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]			GECCO 2007: Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation	Proceedings	0F1ABC7B5797ADACC125754D0050B8F2-Doerr2007GeccoProc
		2007			Weikum, Gerhard Bast, Holger [Canright, Geoffrey] [Hales, David] [Schindelhauer, Christian] [Triantafillou, Peter]				Towards Peer-to-Peer Web Search In: 1st European Conference on Complex Systems, ECCS'05, ?	Proceedings Article	185DE91434CBA18DC125718800463065-WeikumBCHST05
		2007			[Xu, Chihao] Karrenbauer, Andreas [Soh, Kian Min] [Wahl, Jürgen]	[Morreale, Jay]			A New Addressing Scheme for PM OLED Display In: SID 2007 International Symposium Digest of Technical Papers, 97-100	Proceedings Article	09B1A1DF07396CF7C12575830033ECE1-XKSW2007
		2006			Ajwani, Deepak [Dementiev, Roman] Meyer, Ulrich				A computational study of external memory BFS algorithms In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'06, 601-610	Proceedings Article	2A7F571896C92254C125709A00333161-Ajwani06
		2006			Ajwani, Deepak Friedrich, Tobias Meyer, Ulrich	[Arge, Lars] [Freivalds, Rusins]			An $O(n^2.75)$ algorithm for online topological ordering In: Algorithm theory - SWAT 2006 : 10th Scandinavian Workshop on Algorithm Theory, 53-64	Proceedings Article	9A704547B66D15AAC12571430049F8F6-AFM06
		2006			Althaus, Ernst [Calinescu, Gruia] [Mandoiu, Ion] [Prasad, Sushil] [Tchervenski, Nickolay] [Zelikovsly, Alexander]				Power efficient range assignment for symmetric connectivity in static ad-hoc wireless networks In: Wireless Networks [12], 287-299	Journal Article	E968291C91FEA32AC1257363004372BE-Althaus2006
		2006			Althaus, Ernst [Caprara, Alberto] [Lenhof, Hans-Peter] [Reinert, Knut]				Aligning multiple sequences by cutting planes In: Mathematical Programming [2006], 387-425	Journal Article	85582A7E9DB4098EC125736300301E09-Althaus2006
		2006			Althaus, Ernst Naujoks, Rouven				Computing Steiner Minimal Trees in Hamming Metric In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'06, 172-181	Proceedings Article	C521C75A9A165EDBC12572810057422C-Naujoks2006
		2006			[Aronov, Boris] [Asano, Tetsuo] [Katoh, Naoki] Mehlhorn, Kurt [Tokuyama, Takeshi]				Polyline Fitting of Planar Points under Min-sum Criteria In: International Journal of Computational Geometry and Applications [16], 97-116	Journal Article	4975B3F8D71B70D6C12571C500423733-mehlhorn06z
		2006			[Arya, Sunil] Malamatos, Theocharis [Mount, David M.]				On the Importance of Idempotence In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, STOC'06, 564-573	Proceedings Article	1BF1CFF369CE953CC125721B00694225-AMM2006a
		2006			[Arya, Sunil] Malamatos, Theocharis [Mount, David M.]	[Amenta, Nina] [Cheong, Otfried]			The Effect of Corners on the Complexity of Approximate Range Searching In: Proceedings of the 22nd Annual Symposium on Computational Geometry, SCG'06, 11-20	Proceedings Article	9AFFDC095356AB50C125721B006A3640-AMM2006b
		2006			[Bárány, Imre] Doerr, Benjamin				Balanced partitions of vector sequences In: Linear Algebra and Its Applications [414], 464-469	Journal Article	7864B45F433AE0ACC125722E005C368D-Mcbg2006
		2006			[Bartal, Yair] [Leonardi, Stefano] [Shallom, Gill] Sitters, Rene	[Diaz, Josep] [Jansen, Klaus] [Rolim, José D. P.] [Zwick, Uri]			On the value of preemption in scheduling In: 9th Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX, 39-48	Proceedings Article	DEF063F1B495CAD3C12572A300439759-Sitters2006d
		2006			Bast, Holger [Dupret, Georges] Majumdar, Debapriyo [Piwowarski, Benjamin]	[Ackermann, Markus] [Berendt, Bettina] [Grobelnik, Marko] [Hotho, Andreas] [Mladenic, Dunja] [Semeraro, Giovanni] [Spiliopoulou, Myra] [Stumme, Gerd] [Svatek, Vojtech] [van Someren, Maarten W.]			Discovering a Term Taxonomy from Term Similarities Using Principal Component Analysis In: Semantics, web and mining : Joint International Workshops, EWMF 2005 and KDO 2005, 103-120	Proceedings Article	A57781D850A00AD5C12571EA0072C7DF-BastDMP06
		2006			Bast, Holger Majumdar, Debapriyo Schenkel, Ralf Theobald, Martin Weikum, Gerhard				IO-Top-k: Index-Access Optimized Top-k Query Processing	Report	6DBE3595F6B19E02C1257188004AA30F-TechReportGDF2006
		2006			Bast, Holger Majumdar, Debapriyo Schenkel, Ralf Theobald, Martin Weikum, Gerhard	[Dayal, Umeshwar] [Whang, Kyu-Young] [Lomet, David B.] [Alonso, Gustavo] [Lohman, Guy M.] [Kersten, Martin L.] [Cha, Sang Kyun] [Kim, Young-Kuk]			IO-Top-k: Index-Access Optimized Top-k Query Processing In: Proceedings of the 32nd International Conference on Very Large Data Bases, VLDB 2006, 475-486	Proceedings Article	A4369BF160083CD6C1257188004AA310-BastMSTW2006a
		2006			Bast, Holger Mehlhorn, Kurt Schäfer, Guido [Tamaki, Hisao]				Matching Algorithms are Fast in Sparse Random Graphs In: Theory of Computing Systems [39], 3-14	Journal Article	257B5C3871441CAAC1256FC0004404AB-BMST05
		2006			Bast, Holger [Mortensen, Christian Worm] Weber, Ingmar	[Crestani, Fabio] [Ferragina, Paolo] [Sanderson, Mark]			Output-Sensitive Autocompletion Search In: String Processing and Information Retrieval : 13th International Conference, SPIRE 2006, 150-162	Proceedings Article	773F504BAB365AA0C12571880037A8F6-bastetal06spire
		2006			Bast, Holger Weber, Ingmar	[Broder, Andrei] [Maarek, Yoelle]			When You're Lost For Words: Faceted Search With Autocompletion In: SIGIR'06 Workshop on Faceted Search, 31-35	Proceedings Article	C9F89364E23614AAC12571990056B0A5-bastweber06faceted
		2006			Bast, Holger Weber, Ingmar	[Efthimiadis, Efthimis N.] [Dumais, Susan] [Hawking, David] [Järvellin, Kalervo]			Type Less, Find More: Fast Autocompletion Search with a Succinct Index In: SIGIR 2006: Proceedings of the 29th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 364-371	Proceedings Article	8B5BAB9D35C4812FC12571880036EB8B-bastweber06sigir
		2006			Beier, René [Czumaj, Artur] [Krysta, Piotr] [Vöcking, Berthold]				Computing Equilibria for a Service Provider Game with (Im)perfect Information In: ACM Transactions on Algorithms [2], 679-706	Journal Article	26C30D10F87C8A88C125726B004C1CF9-Beier2006c
		2006			Beier, René [Vöcking, Berthold]				An Experimental Study of Random Knapsack Problems In: Algorithmica [45], 121-136	Journal Article	A4E16F16CD425642C12572430036652B-Beier2006b
		2006			Beier, René [Vöcking, Berthold]				Typical Properties of Winners and Losers in Discrete Optimization In: SIAM Journal on Computing [35], 855-881	Journal Article	FC1BB7431E8B1464C125714E002A87A3-Beier2006
		2006			Berberich, Eric Ebert, Franziska [Fogel, Efi] Kettner, Lutz				Web-site with benchmark instances for planar curve arrangements	Report	837AF24A1D9D2DF1C12573D1004E8683-acs:bek-wbipca-06
		2006			Berberich, Eric Ebert, Franziska Kettner, Lutz				Definition of file format for benchmark instances for arrangements of Quadrics	Report	848A6504DA523E47C12573D1004ED599-acs:bek-dffbiaq-06
		2006			Berberich, Eric Hemmer, Michael [Karavelas, Menelaos] [Pion, Sylvain] [Teillaud, Monique] [Tsigaridas, Elias]	Kettner, Lutz			Interface specification of algebraic kernel	Report	9FFA6FA3115E165AC125729500586321-ACS-TR-123101-01
		2006			Berberich, Eric Hemmer, Michael	Kettner, Lutz			Prototype implementation of the algebraic kernel	Report	FFFEA8EB1C1212A9C12572950057DCBB-ACS-TR-121202-01
		2006			[Bodlaender, Hans L.] [Feremans, Corinne] [Grigoriev, Alexander] [Penninkx, Eelko] Sitters, Rene [Wolle, Thomas]	[Erlebach, Thomas] [Kaklamanis, Christos]			On the minimum corridor connection and other generalized geometric problems In: 4th Workshop on Approximation and Online Algorithms, WAOA, 69-82	Proceedings Article	072F5E9B26FE3CA5C12572A3003B2E39-Sitters2006
		2006			[Brodal, Gerth Stølting] Kaligosi, Kanela [Katriel, Irit] Kutz, Martin	[Moshe, Lewenstein] [Gabriel, Valiente]			Faster Algorithms for Computing Longest Common Increasing Subsequences In: Combinatorial Pattern Matching, 17th Annual Symposium, CPM 2006, 330-341	Proceedings Article	2A4A9F04F32099E6C125729600518139-Kaligosi2006b
		2006			[Brönnimann, Hervé] Kettner, Lutz [Pocchiola, Michel] [Snoeyink, Jack]				Counting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm In: SIAM Journal on Computing [36], 721-739	Journal Article	512A66D02FF267B9C1257263006F7D0D-Kettner2006PseudoTEnum
		2006			[Brown, Christopher] El Kahoui, M'hammed [Novotni, Dominik] [Weber, Andreas]				Algorithmic methods for investigating equilibria in epidemic modeling In: Journal of Symbolic Computation [41], 1157-1173	Journal Article	DF5D51E72306F1EDC1256FB30052107F-ElKahoui2005d
		2006			[Bundy, David] Hebbinghaus, Nils [Stellmacher, Bernd]				The Local C(G,T) Theorem In: Journal of Algebra [300], 741-789	Journal Article	784256F19764EFFFC125725A00629A29-Hebbinghaus2006a
		2006			Canzar, Stefan [Remy, Jan]				Shape Distributions and Protein Similarity In: GCB, 1-10	Proceedings Article	FACB313B8EED3129C12573D4006314B8-Canzar2006
		2006			Caroli, Manuel				Exakte Arrangement-Berechnung gedrehter Quadratischer Kurven Universität des Saarlandes	Thesis - Bachelor thesis	4D72CB46B2E47667C125722100433285-BachCaroli06
		2006			Chang, Kevin L. [Kannan, Ravi]				The Space Complexity of Pass-Efficient Algorithms for Clustering In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'06, 1157-1166	Proceedings Article	42E27E9B111F2537C1257289003D2F0F-Chang2006
		2006			[Chrobak, Marek] [Dürr, Christoph] [Jawor, Wojciech] Kowalik, Lukasz [Kurowski, Maciej]				A Note on Scheduling Equal-Length Jobs to Maximize Throughput In: Journal of Scheduling [9], 71-73	Journal Article	718791FDF6C28B09C125727B0053BC94-Kowalik2006
		2006			[Cooper, Joshua] Doerr, Benjamin [Spencer, Joel] [Tardos, Gabor]				Deterministic Random Walks on the Integers In: ??? [?], 1-27	Miscellaneous	4BE7456A0E0C34DCC1257299003149AA-CDoerrSP2006
		2006			[Cooper, Joshua] Doerr, Benjamin [Spencer, Joel] [Tardos, Gábor]	[Raman, Rajeev] [Sedgewick, Robert] [Stallmann, Matthias F.]			Deterministic Random Walks In: Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments and the Third Workshop on Analytic Algorithmics and Combinatorics (ALENEX'06 / ANALCO'06), 185-197	Proceedings Article	DC59A2F138682FFAC1257299003BF463-DoerrANALCO06
		2006			Csaba, Bela [Lodha, S.]				A randomized on-line algorithm for the k-server problem on the line In: Random Structures and Algorithms [29], 82-104	Journal Article	76530DD97BD55BE3C125730E003E835C-Csaba06
		2006			[Czyzowicz, Jurek] Kowalski, Dariusz [Markou, Euripides] [Pelc, Andrzej]				Complexity of searching for a black hole	Unpublished/Draft	531EAC2DC17E94EBC1256FC4005F9CBE-CKMP-manus
		2006			[Dessmark, Anders] [Fraigniaud, Pierre] Kowalski, Dariusz [Pelc, Andrzej]				Deterministic rendezvous in graphs	Unpublished/Draft	76306124C6DB4F0AC1256FC4005FF1A1-DFKP
		2006			[Dessmark, Anders] [Fraigniaud, Pierre] Kowalski, Dariusz [Pelc, Andrzej]				Deterministic Rendezvous in Graphs In: Algorithmica [46], 69-96	Journal Article	1CA3F3D4360A47C3C12572790065619B-DFKP2006
		2006			Doerr, Benjamin				Matrix Rounding With Respect to Small Submatrices In: Random Structures & Algorithms [28], 107-112	Journal Article	DB16C5B2F37DDF64C125722E005CAE38-RoundSmSub2006
		2006			Doerr, Benjamin				Non-independent randomized rounding and coloring In: Discrete Applied Mathematics [154], 650-659	Journal Article	82FC4A7BC8675C7DC125722E005B1D0A-RandCol2006
		2006			Doerr, Benjamin				Non-independent Randomized Rounding, Linear Discrepancy and an Application to Digital Halftoning In: Eurocomb '03 [3], 95-99	Journal Article	2D7D286FAC17902CC125723500780675-DigHalf2003
		2006			Doerr, Benjamin	[Durand, Bruno] [Thomas, Wolfgang]			Generating Randomized Roundings with Cardinality Constraints and Derandomizations In: STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, 571-583	Proceedings Article	482118BCAB9812F7C125727A004F8EA3-DoerrStacs2006
		2006			Doerr, Benjamin Fouz, Mahmoud				Hereditary Discrepancies in Different Numbers of Colors II In: ??? [?], 1-19	Miscellaneous	66D830EC2616DE26C1257299002F345D-DoerrFouz2006
		2006			Doerr, Benjamin Friedrich, Tobias				Quasirandomness in Graphs In: Electronic Notes in Discrete Mathematics [25], 61-64	Journal Article	60B8DD6719365DA1C1257257004AFDB1-2006CTW_Propp
		2006			Doerr, Benjamin Friedrich, Tobias	[Asano, Tetsuo]			Deterministic Random Walks on the Two-Dimensional Grid In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 474-483	Proceedings Article	2E93A9601DA3F2C0C125722E004854E8-DF2006
		2006			Doerr, Benjamin Friedrich, Tobias Klein, Christian Osbild, Ralf	[Arge, Lars] [Freivalds, Rusins]			Unbiased Matrix Rounding In: Algorithm theory - SWAT 2006 : 10th Scandinavian Workshop on Algorithm Theory, 102-112	Proceedings Article	13A774E39EDED496C12571430049FD2C-DFKO06
		2006			Doerr, Benjamin [Gnewuch, Michael]				Construction of low-discrepancy point sets of small size by bracketing covers and dependent randomized rounding	Report	85622412FD48AC75C125729D0038CB9E-SemKiel
		2006			Doerr, Benjamin Hebbinghaus, Nils Neumann, Frank	[Runarsson, Thomas Ph.] [Beyer, Hans G.] [Burke, Edmund] [Merelo-Guervós, Juan J.] [Whitley, L. Darrell] [Yao, Xin]			Speeding Up Evolutionary Algorithms Through Restricted Mutation Operators In: Parallel Problem Solving from Nature - PPSN IX, 9th International Conference, 978-987	Proceedings Article	3D7F17130E081DC3C125725A005FBED0-Hebbinghaus2006
		2006			Doerr, Benjamin Hebbinghaus, Nils [Werth, Sören]				Improved Bounds and Schemes for the Declustering Problem In: Theoretical Computer Science [359], 123-132	Journal Article	95937C899DB87AD9C125722E005CFBCB-ImpBoun2006
		2006			Doerr, Benjamin Klein, Christian	[Arun-Kumar, S.] Garg, Naveen			Unbiased Rounding of Rational Matrices In: FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science: 26th International Conference, 200-211	Proceedings Article	1FFC886090FF93A5C1257230004364EF-unbiasmatr2006
		2006			Doerr, Benjamin [Lengler, Johannes] [Steurer, Daniel]	[Asano, Tetsuo]			The Interval Liar Game In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 318-327	Proceedings Article	5C3C2CF999724474C12572300043ED40-IntLiar2006
		2006			Doerr, Benjamin [Lorenz, Ulf]				Error Propagation in Game Trees In: Mathematical Methods of Operations Research [64], 79-93	Journal Article	2FE9675AF4BACF57C12571540050EE01-Doerr2006gametrees
		2006			Eigenwillig, Arno Kettner, Lutz [Schömer, Elmar] Wolpert, Nicola				Exact, Efficient and Complete Arrangement Computation for Cubic Curves In: Computational Geometry [35], 36-73	Journal Article	9FBA65AC1148D2AEC1257176004AA8EE-eksw-eecaccc-06
		2006			[Eisenbrand, Friedrich] Karrenbauer, Andreas [Skutella, Martin] [Xu, Chihao]	[Azar, Yossi] [Erlebach, Thomas]			Multiline Addressing by Network Flow In: Algorithms - ESA 2006 : 14th Annual European Symposium, 744-755	Proceedings Article	2C6924778F55161CC12575830033ECDF-EKSX2006
		2006			Elbassioni, Khaled M.				Multiconsistency and Robustness with Global Constraints In: Constraints [11], 335-352	Journal Article	E0B88F775F04A9CAC12572990039C925-ElbassioniKatriel2006
		2006			Elbassioni, Khaled M.				On the Complexity of Monotone Boolean Duality Testing	Report	14E660A5B807C13AC1257299003BF712-Elbassioni2006
		2006			Elbassioni, Khaled M.	[Azar, Yossi] [Erlebach, Thomas]			On the Complexity of the Multiplication Method for Monotone CNF/DNF Dualization In: Algorithms - ESA 2006, 14th Annual European Symposium, 340-351	Proceedings Article	30572401508639A4C12572510078E3D3-Elbassioni2006d
		2006			Elbassioni, Khaled M.	[Correa, José R.] [Hevia, Alejandro] [Kiwi, Marcos A.]			Finding All Minimal Infrequent Multi-dimensional Intervals In: LATIN 2006: Theoretical Informatics, 7th Latin American Symposium, 423-434	Proceedings Article	6ACA73B93A364142C12571470003C7AD-Elbassioni2006c
		2006			Elbassioni, Khaled M. [Fishkin, Aleksei V.] Sitters, Rene	[Asano, Tetsuo]			On Approximating the TSP with Intersecting Neighborhoods In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 213-222	Proceedings Article	A6FE9C8693113897C1257251007AB1AD-Elbassioni2006g
		2006			Elbassioni, Khaled M. [Lotker, Zvi] [Seidel, Raimund]				Upper bound on the number of vertices of polyhedra with 0, 1-constraint matrices In: Information Processing Letters [100], 69 - 71	Journal Article	661374BD9200F9CAC125725100797570-Elbassioni2006e
		2006			Elbassioni, Khaled M. Mustafa, Nabil H.	[Durand, Bruno] [Thomas, Wolfgang]			Conflict-Free Colorings of Rectangle Ranges In: STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, 254-263	Proceedings Article	90A328888CEF8DE0C125714700037628-Elbassioni2006b
		2006			[Epstein, Leah] Kesselman, Alexander				On the remote server problem or more about TCP acknowledgments In: Theoretical Computer Science [369], 285	Journal Article	E4503BCAD03231BFC12573E9004BADAE-Epstein2006
		2006			[Feremans, Corinne] [Grigoriev, Alexander] Sitters, Rene				The geometric generalized minimum spanning tree problem with grid clustering In: 4OR: A Quarterly Journal of Operations Research [4], 319-329	Journal Article	70BACB842651D151C12572A3003C2CD4-Sitters2006a
		2006			Fouz, Mahmoud				Hereditary Discrepancy in Different Numbers of Colors Universität des Saarlandes	Thesis - Bachelor thesis	41EF68B656E97AEAC12572210043B74D-BachFouz06
		2006			Funke, Stefan [Guibas, Leonidas] [Nguyen, An] [Wang, Yusu]	[Gibbons, Phillip B.] [Abdelzaher, Tarek F.] [Aspnes, James] [Rao, Ramesh]			Distance-Sensitive Information Brokerage in Sensor Networks In: Distributed Computing in Sensor Systems, Second IEEE International Conference, DCOSS 2006, 234-251	Proceedings Article	968DB8A60B501125C125725E004AD699-FuGui2006
		2006			[Funke, Stefan] Kesselman, Alexander Meyer, Ulrich [Segal, Michael]				A Simple Improved Distributed Algorithm for Minimum CDS in Unit Disk Graphs In: ACM Transactions on Sensor Networks [2], 444-453	Journal Article	BF015BC599D1E427C12572A0006F08BD-FKesselmanMeyerS2006
		2006			Funke, Stefan Klein, Christian	[Amenta, Nina] [Cheong, Otfried]			Hole Detection or: "How Much Geometry Hides in Connectivity?" In: Proceedings of the 22nd Annual Symposium on Computational Geometry, SCG'06, 377-385	Proceedings Article	501E6A40DCBD9F35C125725E004D389A-FK2006
		2006			Funke, Stefan Klein, Christian Mehlhorn, Kurt Schmitt, Susanne				Controlled Perturbation for Delaunay Triangulations	Report	24FC52673E3AEC17C1257157004F86C0-acstr123109-01
		2006			Funke, Stefan Laue, Sören Naujoks, Rouven [Lotker, Zvi]				Power Assignment Problems in Wireless Communication In: ??? [?], 1-14	Miscellaneous	7AB6736586524AEEC12572A000712072-FunkeLaueLotkerNaujoks2006
		2006			Funke, Stefan [Malamatos, Theocharis] [Matijevic, Domagoj] Wolpert, Nicola	[Rappaport, David]			(Approximate) Conic Nearest Neighbors and the induced Voronoi Diagram In: 18th Canadian Conference on Computational Geometry, 23-26	Proceedings Article	07FA7E47F576294BC12571D500640CD3-FMMW2006
		2006			[Golumbic, Martin Charles] [Mintz, Aviad] [Rotics, Udi]				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	49123B4A64CFF91AC1257576004CD2BD-GolumbicMR06
		2006			[Grigoriev, Alexander] [van Loon, Joyce] Sitters, Rene [Uetz, Marc]	[Fomin, Fedor V.]			How to Sell a Graph: Guidelines for Graph Retailers In: Graph-Theoretic Concepts in Computer Science : 32nd International Workshop, WG 2006, 125-136	Proceedings Article	2075BCCE862F84FCC12572A300420D82-Sitters2006c
		2006			[Hariharan, Ramesh] [Telikepalli, Kavitha] Mehlhorn, Kurt	[Bugliesi, Michele] [Preneel, Bart] [Sassone, Vladimir] [Wegener, Ingo]			A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs In: Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Part I, 250-261	Proceedings Article	C5345CC3A9361E5BC12571CA003B984B-HTM06a
		2006			Harren, Rolf				Approximation mehrdimensionaler Packungsprobleme Universität Dortmund	Thesis - other	72BF42454FC4639EC12573D4004C1F16-Harren2006b
		2006			Harren, Rolf	[Bugliesi, M.] [Preneel, B.] [Sassone, V.] [Wegener, I.]			Approximating the Orthogonal Knapsack Problem for Hypercubes In: Automata, Languages and Programming, 238-249	Proceedings Article	840D573CEB99415BC12573D4004CD5D9-Harren2006a
		2006			[Irving, Robert W.] [Telikepalli, Kavitha] Mehlhorn, Kurt Michail, Dimitrios [Paluch, Katarzyna]				Rank-Maximal Matchings In: ACM Transactions on Algorithms [2], 602-610	Journal Article	B6D1D2487C87162EC125728E003DA65E-ITMMP2006
		2006			Kaligosi, Kanela [Sanders, Peter]	[Azar, Yossi] [Erlebach, Thomas]			How Branch Mispredictions Affect Quicksort In: Algorithms - ESA 2006, 14th Annual European Symposium, 780-791	Proceedings Article	9F331DF0CA804105C1257296005020FB-Kaligosi2006a
		2006			Kettner, Lutz Mehlhorn, Kurt [Pion, Sylvain] [Schirra, Stefan] [Yap, Chee]	[Gavrilova, Marina] [Gervasi, Osvaldo] [Kumar, Vipin] [Tan, C. J.Kenneth] [Taniar, David] [Laganà, Antonio] [Mun, Youngsong] [Choo, Hyunseung]			Reply to "Backward Error Analysis ..." In: Computational Science and Its Applications - ICCSA 2006, I, 60-60	Proceedings Article	47155FF99A36D907C12571F1002C58B0-mehlhorn06
		2006			Kettner, Lutz	[Musser, David] [Siek, Jeremy]			Reference Counting in Library Design---Optionally and with Union-Find Optimization In: Proceedings of the First International Workshop on Library-Centric Software Design, LCSD'05, 34-43	Proceedings Article	F04930F5AFCD850BC1257263006D424D-Kettner2006Handle
		2006			[Khachiyan, Leonid] [Boros, Endre] [Borys, Konrad] Elbassioni, Khaled M. [Gurvich, Vladimir]				Generating All Vertices of a Polyhedron is Hard In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'06, 758-765	Proceedings Article	1DE82F86EED342F8C1257147000307B6-Elbassioni2006a
		2006			[Khachiyan, Leonid] [Boros, Endre] [Borys, Konrad] Elbassioni, Khaled M. [Gurvich, Vladimir] [Makino, Kazuhisa]	[Azar, Yossi] [Erlebach, Thomas]			Enumerating Spanning and Connected Subsets in Graphs and Matroids In: Algorithms - ESA 2006, 14th Annual European Symposium, 444-455	Proceedings Article	B1FD8FCBD7E4E89BC1257251007A4FDC-Elbassioni2006f
		2006			[Klein, Rolf] Kutz, Martin				The Density of Iterated Crossing Points and a Gap Result for Triangulations of Finite Point Sets In: Proceedings of the 22nd Annual Symposium on Computational Geometry, SCG'06, 264-272	Proceedings Article	67D8B5546AFB1F84C12572900046ADB2-KlKu2006b
		2006			Kovács, Annamária	[Calamoneri, Tiziana] [Finocchi, Irene] [Italiano, Giuseppe F.]			Tighter Approximation Bounds for LPT Scheduling in Two Special Cases In: Algorithms and Complexity : 6th Italian Conference, CIAC 2006, 187-198	Proceedings Article	AAC809B9617E79BFC125719A004F60D5-Kovacs2006
		2006			Kowalik, Lukasz	[Asano, Tetsuo]			Approximation Scheme for Lowest Outdegree Orientation and Graph Density Measures In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 557-566	Proceedings Article	CA824324F72E753BC12572370080AD09-KowalikISAAC2006
		2006			Kowalik, Lukasz	[Fomin, Fedor V.]			Improved Edge Coloring with Three Colors In: Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, WG 2006, 90-101	Proceedings Article	B99A5ACCABF44B8AC1257237007FD6ED-Kowalik2005
		2006			[Krandick, Werner] Mehlhorn, Kurt				New bounds for the Descartes method In: Journal of Symbolic Computation [41], 49-66	Journal Article	8291BD2AF8984049C12571C50041D379-mehlhorn06e
		2006			[Kratsch, Dieter] [McConnell, Ross] Mehlhorn, Kurt [Spinrad, Jeremy P.]				Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs In: Siam Journal on Computing, 326-353 In: SIAM Journal on Computing [36], 326-353	Journal Article	90DAACD3D4A0C6A8C1256E20004505E1-mehlhorn06b
		2006			Kutz, Martin	[Amenta, Nina] [Cheong, Otfried]			Computing Shortest Non-Trivial Cycles on Orientable Surfaces of Bounded Genus in Almost Linear Time. In: Proceedings of the 22nd Annual Symposium on Computational Geometry, SCG'06, 430-437	Proceedings Article	D331462109CCC5B5C125729000424481-Kutz2006
		2006			[Lotker, Zvi] Majumdar, Debapriyo [Narayanaswamy, N.S.] Weber, Ingmar	[Chen, Danny Z.] [Lee, D. T.]			Sequences Characterizing k-Trees In: Computing and Combinatorics, 12th Annual International Conference, COCOON 2006, 216-225	Proceedings Article	5BD4BB38E06D00BEC1257188003869E7-lotkeretal06cocoon
		2006			Maue, Jens [Sanders, Peter] Matijevic, Domagoj	[Alvarez, Carme] [Serna, Maria J.]			Goal Directed Shortest Path Queries Using Precomputed Cluster Distances In: Experimental Algorithms, 5th International Workshop, WEA 2006, 316-327	Proceedings Article	E6D1991056F598FCC1257194003878C7-MaueSandersMatijevic2006
		2006			Mehlhorn, Kurt	[Calamoneri, Tiziana] [Finocchi, Irene] [Italiano, Giuseppe F.]			Reliable and Efficient Geometric Computing In: Algorithms and Complexity : 6th Italian Conference, CIAC 2006, 1-2	Proceedings Article	EC5B8ABF87E0F995C12571F1002BEFEC-mehlhorn06x
		2006			Mehlhorn, Kurt Osbild, Ralf Sagraloff, Michael	[Bugliesi, Michele] [Preneel, Bart] [Sassone, Vladimir] [Wegener, Ingo]			Reliable and Efficient Computational Geometry Via Controlled Perturbation In: Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Part I, 299-310	Proceedings Article	1C44F76383A124E7C12571CA003ABB0D-MOS06
		2006			Meyer, Ulrich [Zeh, Norbert]	[Azar, Yossi] [Erlebach, Thomas]			I/O-Efficient Undirected Shortest Paths with Unbounded Edge Lengths In: Algorithms - ESA 2006, 14th Annual European Symposium, 540-551	Proceedings Article	ABF03BBA009BE850C12571F5002F9A7D-MeyZeh06
		2006			Meyer, Ulrike [Wetzel, Susanne]				Introducing History-Enriched Security Context Transfer to Enhance the Security of Subsequent Handover In: 4th IEEE Conference on Pervasive Computing and Communications Workshops (PerCom 2006 Workshops), 277-282	Proceedings Article	0F7EE1718EC79393C1257298005574BD-MeyerWetzel2006
		2006			Neumann, Frank [Witt, Carsten]				Ant Colony Optimization and the Minimum Spanning Tree Problem	Report	FECCABAD93394D9BC125728B0033F1BE-NeuWittMST2006
		2006			Paluch, Katarzyna	[Asano, Tetsuo]			A New Approximation Algorithm for Multidimensional Rectangle Tiling In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 712-721	Proceedings Article	267A7891DC5BE6ADC12572A3005639C8-Paluch2006
		2006			Schmitt, Daniel				Implementierung einer Überlagerungvon konvexen Arrangements der Kugeloberfläche Universität des Saarlandes	Thesis - Bachelor thesis	38318B5C794C02B1C12572210043E597-BachSchmitt06
		2006			[Schömer, Elmar] Wolpert, Nicola				An Exact and Efficient Approach for Computing a Cell in an Arrangement of Quadrics In: Computational Geometry [33], 65 - 97	Journal Article	96ED3851A99533FAC1256F8C004D635B-sw-eeaccaq-05
		2006			Sitters, Rene [Stougie, Leen]				The general two-server problem In: Journal of the ACM [53], 437-458	Journal Article	B0706EEBC5750A36C12572A3003C9CA3-Sitters2006b
		2006			Steurer, David				Tight Bounds on the Min-Max Boundary Decomposition Cost of Weighted Graphs Universität des Saarlandes	Thesis - Bachelor thesis	22DEBEFF935612A2C125722100440F5E-BachSteurer06
		2006			[Teramoto, Sachio] [Asano, Tetsuo] [Katoh, Naoki] Doerr, Benjamin				Inserting Points Uniformly at Every Instance In: IEICE - Transactions on Information and Systems [E89-D], 2348-2356	Journal Article	AA6C18ED7CFD2C64C125725700568662-inserpoints2006
		2005			Abraham, David [Irving, Robert W.] Mehlhorn, Kurt Telikepalli, Kavitha				Popular Matchings In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 424-432	Proceedings Article	463863EBA0A07CEEC1256FC400392258-AIKM05
		2005			[Abraham, David J.] [Cechlárová, Katarína] [Manlove, David] Mehlhorn, Kurt	[Deng, Xiaotie] Du, Dingzhu			Pareto Optimality in House Allocation Problems In: Algorithms and computation : 16th International Symposium, ISAAC 2005, 1163-1175	Proceedings Article	66A5D51179C0420FC12571F1003E95A9-mehlhorn06y
		2005			[Ahuja, Nitin] [Baltz, Andreas] Doerr, Benjamin [Privetivy, Ales] [Srivastav, Anand]	[Erlebach, Thomas] [Persiano, Pino]			On the Minimum Load Coloring Problem In: Third Workshop on Approximation and Online Algorithms (WAOA 2005), 15-26	Proceedings Article	22F84EEC035AE3D3C125715400531D71-Doerr2005minload
		2005			Althaus, Ernst Funke, Stefan [Har-Peled, Sariel] [Könemann, Jochen] [Ramos, Edgar A.] Skutella, Martin				Approximating k-Hop Minimum-Spanning Trees In: Operations Research Letters [33], 115-120	Journal Article	C90DA7D9684C7004C1256F950021EE6E-AFHKRS05
		2005			[Arya, Sunil] Malamatos, Theocharis Mount, David M.				Space-Time Tradeoffs for Approximate Spherical Range Counting In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 535-544	Proceedings Article	9D8C2AD6A052BC81C1256FA9005819A7-AMM2005
		2005			Bast, Holger				Präzisionssuche im homöopathischen Netz In: Homöopathie-Zeitschrift [I/05], 119-122	Journal Article	61125014AF525F8DC1256FE80055C60F-bast05hz
		2005			Bast, Holger Majumdar, Debapriyo	[Marchionini, Gary] [Moffat, Alistair] [Tait, John] [Baeza-Yates, Ricardo] [Ziviani, Nivio]			Why Spectral Retrieval Works In: 28th Annual International Conference on Research and Development in Information Retrieval (SIGIR'05), 11-18	Proceedings Article	ADC0E49B750350FBC1256FE3003F05CA-bastmajumdar05sigir
		2005			Bast, Holger Weber, Ingmar	[Adachi, Jun] [Shan, Wang] [Vakali, Athena]			Insights from Viewing Ranked Retrieval as Rank Aggregation In: Workshop on Challenges in Web Information Retrieval and Integration (WIRI'05), 243-248	Proceedings Article	A06CD6FA3CA5D27FC1256FC00062DEA4-bastweber05wiri
		2005			Bast, Holger Weber, Ingmar	Nikoletseas, Sotiris			Don't Compare Averages In: 4th International Workshop on Efficient and Experimental Algorithms (WEA'05), 67-76	Proceedings Article	226BA8F96DCAC6B6C1256FC00061A839-bastweber05wea
		2005			Baswana, Surender [Goyal, Vishrut] [Sen, Sandeep]	[Diekert, Volker] [Durand, Bruno]			All-pairs nearly 2-approximate shortest paths in $O(n^2 \mathrm polylog n)$ time In: STACS 2005 : 22nd Annual Symposium on Theoretical Aspects of Computer Science, 666-679	Proceedings Article	CDE770BF7CC4479FC1256FBE0037715A-BGS2005
		2005			Baswana, Surender Telikepalli, Kavitha Mehlhorn, Kurt Pettie, Seth				New Constructions of (alpha, beta)-Spanners and Purely Additive Spanners In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 672-681	Proceedings Article	0AA8BBA59356C31EC1256FB90040183D-BaswanaEtal2005
		2005			[Beldiceanu, Nicolas] Katriel, Irit Thiel, Sven	[Faltings, Boi] [Petcu, Adrian] [Fages, Francois] [Rossi, Francesca]			GCC-like Restrictions on the Same constraint In: Constraint Satisfaction and Constraint Logic Programming : ERCIM/CoLogNet International Workshop, CSCLP 2004, 1-11 In: Recent Advances in Constraints [3419], 1-11	Proceedings Article	EA16F6B4E04F15B8C1256F87004743CC-KatrielSWC2004
		2005			Berberich, Eric Eigenwillig, Arno [Hemmer, Michael] [Hert, Susan] Kettner, Lutz Mehlhorn, Kurt Reichel, Joachim Schmitt, Susanne [Schömer, Elmar] Wolpert, Nicola	[Brodal, Gerth S.] [Leonardi, Stefano]			EXACUS: Efficient and exact algorithms for curves and surfaces In: 13th Annual European Symposium on Algorithms (ESA 2005), 155-166	Proceedings Article	D9CE0617730DAB73C1257050002DEDED-Berberich05
		2005			Berberich, Eric [Hemmer, Michael] Kettner, Lutz [Schömer, Elmar] Wolpert, Nicola	[Mitchell, Joe] [Rote, Günter] Kettner, Lutz			An Exact, Complete and Efficient Implementation for Computing Planar Maps of Quadric Intersection Curves In: 21st Annual Symposium on Computational Geometry (SCG'05), 99-106	Proceedings Article	F477E647B2943C59C12570B30054504C-bhksw-eceicpmqic-05
		2005			[Brönnimann, Hervé] Kettner, Lutz [Pocchiola, Michel] [Snoeyink, Jack]	[Demetrescu, Camil] [Tamassia, Roberto] [Sedgewick, Robert]			Counting and enumerating pointed pseudo-triangulations with the greed