Database Entry Point
max planck institut
informatik
mpii logo Minerva of the Max Planck Society
 

MPI-INF D1 Publications , MPG Format, generated: Saturday, 25. October 2014

Scientific Publications for 2013

Adamaszek, A. and A. Wiese: Approximation schemes for maximum weight independent set of rectangles. In: Proc. 54th Annual IEEE Symp. on Foundations of Computer Science (FOCS 2013) [***Warning: Editor(s) might be missing!]. IEEE, Los Alamitos 2013, [***Warning: Pages missing!].

Afshani, P., M. Agrawal, B. Doerr, C. Doerr, K.G. Larsen and K. Mehlhorn: The query complexity of finding a hidden permutation. In: Space-Efficient Data Structures, Streams, and Algorithms, Lect. Notes Comput. Sci. 8066, (Eds.) A. Brodnik, A. López-Ortiz, V. Raman, A. Viola. Springer, Heidelberg 2013, 1-11.

Agrawal, M., C. Saha and N. Saxena: A case of depth-3 identity testing, sparse factorization and duality. In: 45th ACM Symp. on the Theory of Computing (STOC-13). ACM, New York 2013, toappear p.

Alvarez, V., K. Bringmann, S. Ray and R. Seidel: Counting triangulations approximately. In: 25th Canadian Conf. on Computational Geometry (CCCG-13). [***Warning: Publishers name missing!], Waterloo 2013, 85-89.

Anagnostopoulos, A., F. Grandoni, S. Leonardi and A. Wiese: Constant integrality gap lp formulations of unsplittable flow on a path. In: Proc. 16th Conf. on Integer Programming and Combinatorial Optimization (IPCO 2013) [***Warning: Editor(s) might be missing!]. Springer, Heidelberg 2013, [***Warning: Pages missing!].

Anand, S., K. Bringmann, T. Friedrich, N. Garg and A. Kumar: Minimizing maximum (weighted) flow-time on related and unrelated machines. In: Automata, Languages, and Programming - 40th Int. Colloquium (ICALP-13), Lect. Notes Comput. Sci. 7965, (Eds.) F.V. Fomin, R. Freivalds, M. Kwiatkowska, D. Peleg. Springer, Heidelberg 2013, 13-24.

Anshelevich, E., O. Bhardwaj and M. Hoefer: Friendship and stable matching.. In: 21st European Symp. on Algorithms (ESA-13), Lect. Notes Comput. Sci. 8125, (Eds.) H. Bodlaender, G. Italiano. Springer, New York 2013, 49-60.

Antoniadis, A., C.-C. Huang, S. Ott and J. Verschae: How to pack your items when you have to buy your knapsack. In: Mathematical Foundations of Computer Science 2013 - 38th Int. Symp., MFCS 2013, Lect. Notes Comput. Sci. 8087, (Eds.) K. Chatterjee, J. Sgall. Springer, Berlin 2013, 62-73.

Bannai, H., P. Gawrychowski, S. Inenaga and M. Takeda: Converting slp to lz78 in almost linear time. In: Combinatorial Pattern Matching, 24th Annual Symp. (CPM 2013), Lect. Notes Comput. Sci. 7922, (Eds.) J. Fischer, P. Sanders. Springer, Berlin 2013, 38-49.

Berberich, E., P. Emeliyanenko, A. Kobel and M. Sagraloff: Exact symbolic–numeric computation of planar algebraic curves. Theoretical Computer Science 491, 1-32 (2013).

Bonifaci, V., A. Marchetti-Spaccamela, N. Megow and A. Wiese: Polynomial-Time exact schedulability tests for harmonic real-time tasks. In: Proc. 34th IEEE Real-Time Systems Symp. (RTSS 2013) [***Warning: Editor(s) might be missing!]. IEEE, Los Alamitos 2013, [***Warning: Pages missing!].

Bonifaci, V., A. Marchetti-Spaccamela, S. Stiller and A. Wiese: Feasibility analysis in the sporadic dag task model. In: Proc. 25th Euromicro Conf. on Real-Time Systems (ECRTS 2013) [***Warning: Editor(s) might be missing!]. IEEE, Los Alamitos 2013, [***Warning: Pages missing!].

Bringmann, K.: Bringing order to special cases of klee’s measure problem. In: 38th Int. Symp. on Mathematical Foundations of Computer Science (MFCS-13), Lect. Notes Comput. Sci. 8087, (Eds.) K. Chatterjee, J. Sgall. Springer, Heidelberg 2013, 207-218.

Bringmann, K., B. Doerr, A. Neumann and J. Sliacan: Online checkpointing with improved worst-case guarantees. In: Automata, Languages, and Programming - 40th Int. Colloquium (ICALP 2013), Lect. Notes Comput. Sci. 7965, (Eds.) F.V. Fomin, R. Freivalds, M. Kwiatkowska, D. Peleg. Springer, Heidelberg 2013, 255-266.

Bringmann, K., C. Engels, B. Manthey and B.V. Raghavendra Rao: Random shortest paths: non-euclidean instances for metric optimization problems. In: 38th Int. Symp. on Mathematical Foundations of Computer Science (MFCS-13), Lect. Notes Comput. Sci. 8087, (Eds.) K. Chatterjee, J. Sgall. Springer, Heidelberg 2013, 219-230.

Bringmann, K. and T. Friedrich: Approximation quality of the hypervolume indicator. Artificial Intelligence 195, 265–290 (2013).

- Parameterized average-case complexity of the hypervolume indicator. In: 15th Annual Conf. on Genetic and Evolutionary Computation (GECCO-13) [***Warning: Editor(s) might be missing!]. ACM, New York 2013, 575-582.

- Exact and efficient generation of geometric random variates and random graphs. In: Automata, Languages, and Programming - 40th Int. Colloquium (ICALP-13), Lect. Notes Comput. Sci. 7965, (Eds.) F.V. Fomin, R. Freivalds, M. Kwiatkowska, D. Peleg. Springer, Heidelberg 2013, 267-278.

Bringmann, K., T. Friedrich, C. Igel and T. Voß: Speeding up many-objective optimization by monte carlo approximations. Artificial Intelligence 204, 22–29 (2013).

Bringmann, K. and K. Green Larsen: Succinct sampling from discrete distributions. In: 45th ACM Symp. on Theory of Computing (STOC-13) [***Warning: Editor(s) might be missing!]. ACM, New York 2013, 775-782.

Cai, J.-Y., P. Lu and M. Xia: Dichotomy for Holant* problems with a function on domain size 3. In: Proc. Twenty-Fourth Annual ACM-SIAM Symp. on Discrete Algorithms. SIAM, Philadelphia 2013, 1278-1295.

Chen, X., L. Epstein, E. Kleiman and R. van Stee: Maximizing the minimum load: the cost of selfishness. Theoretical Computer Science 482, 9-19 (2013).

Christodoulou, G., A. Kovacs and R. van Stee: A truthful constant approximation for maximizing the minimum load on related machines. Theoretical Computer Science 489-490, 88-98 (2013).

Clementi, A., P. Crescenzi, C. Doerr, P. Fraigniaud, M. Isopi, A. Panconesi, F. Pasquale and R. Silvestri: Rumor spreading in random evolving graphs. In: Proc. of the 21st European Symp. on Algorithms (ESA 2013), Lect. Notes Comput. Sci. 8125 [***Warning: Editor(s) might be missing!]. Springer, Berlin 2013, 325-336.

Clementi, A., P. Crescenzi, C. Doerr, P. Fraigniaud, F. Pasquale and R. Silvestri: Diffusion probabiliste dans les reseaux dynamiques. In: Proc. of the 15èmes Rencontres Francophones pour les Aspects Algorithmiques des Télécommunications (AlgoTel 2013) [***Warning: Editor(s) might be missing!]. 0, 0 2013, [***Warning: Pages missing!].

Croitoru, C.: Abstract debates. In: IEEE Int. Conf. on Tools with Artificial Intelligence (ICTAI) - 2013. IEEE Computer Society, Washington 2013, [***Warning: Pages missing!].

Curticapean, R. and M. Künnemann: A quantization framework for smoothed analysis of euclidean optimization problems. In: 21st Annual European Symp. on Algorithms (ESA 2013), Lect. Notes Comput. Sci. 8125, (Eds.) H.L. Bodlaender, G.F. Italiano. Springer, Berlin 2013, 349-360.

Dams, J., M. Hoefer and T. Kesselheim: Sleeping experts in wireless networks. In: 27th Int. Symp. on Distributed Computing (DISC-13), Lect. Notes Comput. Sci. 8205, (Ed.) Y. Afek. Springer, New York 2013, 344-357.

Doerr, B.: Improved approximation algorithms for the min-max selecting items problem. Information Processing Letters 113, 747-749 (2013).

Doerr, B., C. Doerr and F. Ebel: Lessons from the black-box: fast crossover-based genetic algorithms. In: Proc. of Genetic and Evolutionary Computation Conf. (GECCO 2013) [***Warning: Editor(s) might be missing!]. ACM, New York 2013, 781-788.

Doerr, B. and L.A. Goldberg: Adaptive drift analysis. Algorithmica 65, 224-250 (2013).

Doerr, B., A. Huber and A. Levavi: Strong robustness of randomized rumor spreading protocols. Discrete Applied Mathematics 161, 778-793 (2013).

Doerr, B., T. Jansen, D. Sudholt, C. Winzen and C. Zarges: Mutation rate matters even when optimizing monotonic functions. Evolutionary Computation 21, 1-27 (2013).

Doerr, B., D. Johannsen, T. Kötzing, F. Neumann and M. Theile: More effective crossover operators for the all-pairs shortest path problem. Theoretical Computer Science 471, 12-26 (2013).

Doerr, B., B. Kodric and M. Voigt: Lower bounds for the runtime of a global multi-objective evolutionary algorithm. In: IEEE Congress on Evolutionary Computation [***Warning: Editor(s) might be missing!]. IEEE, New York 2013, 432-439.

Doerr, B., T. Kötzing, J. Lengler and C. Winzen: Black-Box complexities of combinatorial problems. Theoretical Computer Science 471, 84-106 (2013).

Doerr, B. and M. Künnemann: 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). IEEE, Piscataway 2013, 424-431.

- How the (1+λ) evolutionary algorithm optimizes linear functions. In: 15th Annual Conf. on Genetic and Evolutionary Computation Conf. (GECCO '13), (Ed.) C. Blum. ACM, New York 2013, 1589-1596.

Doerr, B., R. Spöhel, H. Thomas and C. Winzen: Playing mastermind with many colors. In: Proc. Twenty-Fourth Annual ACM-SIAM Symp. on Discrete Algorithms (SODA 2013) [***Warning: Editor(s) might be missing!]. SIAM, Philadelphia 2013, 695-704.

Doerr, B., D. Sudholt and C. Witt: When do evolutionary algorithms optimize separable functions in parallel?. In: ACM/SIGEVO Foundations of Genetic Algorithms (FOGA 2013). ACM, New York 2013, 51-63.

Doerr, C. and F.-M. De Rainville: Constructing low star discrepancy point sets with genetic algorithms. In: Proc. of Genetic and Evolutionary Computation Conf. (GECCO 2013) [***Warning: Editor(s) might be missing!]. ACM, New York 2013, 789-796.

Doerr, C., M. Gnewuch and M. Wahlström: Calculation of discrepancy measures and applications. In: A Panorama of Discrepancy Theory, (Eds.) W.W.L. Chen, A. Srivastav, G. Travaglini. Springer, New York 2013, 1-55.

Doerr, C., J.M. Schmidt and G. Ramakrishna: Computing minimum cycle bases in weighted partial 2-trees in linear time. In: 39th Int. Workshop on Graph-Theoretic Concepts in Computer Science (WG'13) [***Warning: Editor(s) might be missing!]. Springer, Heidelberg 2013, 225-236.

Duan, R.: Breaking the $O(n^2.5)$ deterministic time barrier for undirected unit-capacity maximum flow. In: Proc. Twenty-Second Annual ACM-SIAM Symp. on Discrete Algorithms (SODA 2013) 6B [***Warning: Editor(s) might be missing!]. ACM-SIAM, Philadelphia 2013, 1171-1179.

Elbassioni, K.M., K. Makino, K. Mehlhorn and F. Ramezani: On randomized fictitious play for approximating saddle points over convex sets. In: 19th Annual Int. Computing and Combinatorics Conf. (COCOON-13), Lect. Notes Comput. Sci. 7936, (Eds.) D.-Z. Du, G. Zhang. Springer, Hangzhou 2013, 65-76.

Elmasry, A., K. Mehlhorn and J.M. Schmidt: Every DFS tree of a 3-connected graph contains a contractible edge. Journal of Graph Theory 72, 112-121 (2013).

Epstein, L., A. Levin and R. van Stee: A unified approach to truthful scheduling on related machines. In: Proc. Twenty-Fourth Annual ACM-SIAM Symp. on Discrete Algorithms, SODA 2013 [ *** Wrong entry format - no comma found in name value: Sanjeev Khanna]. SIAM, Philadelphia 2013, 1243-1252.

Fanghänel, A., S. Geulen, M. Hoefer and B. Vöcking: Online capacity maximization in wireless networks. Journal of Scheduling 16, 81-91 (2013).

Fekete, S.P., S. Friedrichs, A. Kröller and C. Schmidt: Facets for art gallery problems. In: Computing and Combinatorics, Lect. Notes Comput. Sci. 7936, (Eds.) D.-Z. Du, G. Zhang. Springer, Berlin 2013, 208-220.

Fountoulakis, N. and K. Panagiotou: On the insertion time of cuckoo hashing. SIAM Journal on Computing [***Warning: Volume missing ?, ] [***Warning: Pages missing ?-?] (2013).

Gagie, T., P. Gawrychowski and Y. Nekrich: Heaviest induced ancestors and longest common substrings. In: 25th Canadian Conf. on Computational Geometry (CCCG 13). [***Warning: Publishers name missing!], Waterloo 2013, 145-150.

Gawrychowski, P.: Alphabetic minimax trees in linear time. In: 8th Int. Computer Science Symp. in Russia (CSR 2013), Lect. Notes Comput. Sci. 7913, (Eds.) A.A. Bulatov, A.M. Shur. Springer, Berlin 2013, 36-48.

Gawrychowski, P., G. Kucherov, Y. Nekrich and T. Starikovskaya: Minimal discriminating words problem revisited. In: String Processing and Information Retrieval - 20th Int. Symp. (SPIRE 2013), Lect. Notes Comput. Sci. 8214, (Eds.) O. Kurland, M. Lewenstein, E. Porat. Springer, Berlin 2013, [***Warning: Pages missing!].

Gawrychowski, P., F. Manea, R. Mercas, D. Nowotka and C. Tiseanu: Finding pseudo-repetitions. In: 30th Int. Symp. on Theoretical Aspects of Computer Science (STACS 2013), Leibniz International Proceedings in Informatics (LIPIcs) 20, (Eds.) N. Portier, T. Wilke. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl 2013, 257-268.

Gawrychowski, P., F. Manea and D. Nowotka: Discovering hidden repetitions in words. In: 9th Conf. on Computability in Europe (CiE 2013), Lect. Notes Comput. Sci. 7921, (Eds.) P. Bonizzoni, V. Brattka, B. Lowe. Springer, Berlin 2013, 210-219.

Gawrychowski, P. and D. Straszak: Beating o(nm) in approximate lzw-compressed pattern matching. In: Algorithms and Computation - 24th Int. Symp. (ISAAC 2013), Lect. Notes Comput. Sci. 8283, (Eds.) L. Cai, S.-W. Cheng, T.W. Lam. Springer, Berlin 2013, 78-88.

Günther, E., O. Maurer, N. Megow and A. Wiese: A new approach to online scheduling: approximating the optimal competitive ratio. In: 24st Annual ACM-SIAM Symp. on Discrete Algorithms (SODA 2013) [***Warning: Editor(s) might be missing!]. SIAM, USA 2013, [***Warning: Pages missing!].

Harks, T., M. Hoefer, M. Klimm and A. Skopalik: Computing pure nash and strong equilibria in bottleneck congestion games. Mathematical Programming 141, 193-215 (2013).

Heydrich, S. and R. van Stee: Dividing connected chores fairly. In: 6th Int. Symp. on Algorithmic Game Theory, Lect. Notes Comput. Sci. 8146, (Ed.) B. Voecking. Springer, New York 2013, 420-433.

Hoefer, M.: Local matching dynamics in social networks. Information & Computation 222, 20-35 (2013).

- Strategic cooperation in cost sharing games. International Journal of Game Theory 42, 29-53 (2013).

Hoefer, M. and T. Kesselheim: Brief announcement: universally truthful secondary spectrum auctions. In: 25th Symp. on Parallelism in Algorithms and Architectures (SPAA-13) [***Warning: Editor(s) might be missing!]. ACM, New York 2013, 99-101.

Hoefer, M., T. Kesselheim and B. Vöcking: Truthfulness and stochastic dominance with monetary transfers.. In: 14th Conf. Electronic Commerce (EC-13) [***Warning: Editor(s) might be missing!]. ACM, New York 2013, 567-582.

Hoefer, M. and T. Sauerwald: Brief announcement: threshold load balancing in networks. In: 32nd Symp. on Principles of Distributed Computing (PODC-13) [***Warning: Editor(s) might be missing!]. ACM, New York 2013, 54-56.

Hoefer, M. and A. Skopalik: Altruism in atomic congestion games. ACM Transactions on Economics and Computation 1, 21 (2013).

- On the complexity of pareto-optimal nash and strong equilibria. Theory of Computing Systems 53, 441-453 (2013).

Hoefer, M. and L. Wagner: Designing profit shares in matching and coalition formation games. In: 9th Conf. on Web and Internet Economics (WINE-13), Lect. Notes Comput. Sci. 8289, (Eds.) Y. Chen, N. Immorlica. Springer, New York 2013, 249-262.

- Locally stable marriage with strict preferences. In: 40th Int. Colloquium on Automata, Languages and Programming (ICALP-13), Lect. Notes Comput. Sci. 7966, (Eds.) F. Fomin, R. Freivalds, M. Kwiatkowska, D. Peleg. Springer, New York 2013, 620-631.

Jez, A.: Recompression: word equations and beyond. In: 17th Int. Conf. on Developments in Language Theory (DLT 2013), Lect. Notes Comput. Sci. 7907, (Eds.) M.-P. Beal, O. Carton. Springer, Heidelberg 2013, 12-26.

- Approximation of grammar-based compression via recompression. In: 24th Annual Symp. on Combinatorial Pattern Matching (CPM 2013), Lect. Notes Comput. Sci. 7922, (Eds.) J. Fischer, P. Sanders. Springer, Heidelberg 2013, 165-176.

- One-Variable word equations in linear time. In: 40th Int. Colloquium on Automata, Languages, and Programming (ICALP 2013), Lect. Notes Comput. Sci. 7966, (Eds.) F.V. Fomin, R. Freivalds, M.Z. Kwiatkowska, D. Peleg. Springer, Heidelberg 2013, 324-335.

Jez, A. and A. Maletti: Hyepr-minimization for deterministic tree automata. International Journal of Foundations of Computer Science 24, 815-830 (2013).

Jez, A. and A. Okhotin: Unambiguous conjunctive grammars over a one-letter alphabet. In: 17th Int. Conf. on Developments in Language Theory (DLT 2013), Lect. Notes Comput. Sci. 7907, (Eds.) M.-P. Beal, O. Carton. Springer, Heidelberg 2013, 277-288.

Jez, A.: Recompression: a simple and powerful technique for word equations. In: 30th Int. Symp. on Theoretical Aspects of Computer Science (STACS 2013), Leibniz International Proceedings in Informatics (LIPIcs) 20, (Eds.) N. Portier, T. Wilke. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl 2013, 233-244.

Jurkiewicz, T. and K. Mehlhorn: The cost of address translation. In: Proc. Meeting on Algorithm Engineering & Experiments [***Warning: Editor(s) might be missing!]. Society for Industrial and Applied Mathematics, 3600 Market Street 2013, [***Warning: Pages missing!].

Khosla, M.: Balls into bins made faster. In: Algorithms - ESA 2013, Lect. Notes Comput. Sci. 8125, (Eds.) H.L. Bodlaender, G.F. Italiano. Springer, Berlin 2013, [***Warning: Pages missing!].

Megow, N. and J. Mestre: Instance-sensitive robustness guarantees for sequencing with unknown packing and covering constraints. In: 4th Conf. on Innovations in Theoretical Computer Science (ITCS 2013) [***Warning: Editor(s) might be missing!]. ACM, USA 2013, [***Warning: Pages missing!].

Megow, N. and J. Verschae: Dual techniques for scheduling on a machine with varying speed. In: Proc. of the 40th Int. Colloquium on Automata, Languages and Programming (ICALP 2013), Lect. Notes Comput. Sci. 7965 [***Warning: Editor(s) might be missing!]. Springer, Berlin/Heidelberg 2013, 745–756 p.

Mehlhorn, K., A. Neumann and J.M. Schmidt: Certifying 3-edge-connectivity. In: 39th Int. Workshop on Graph-Theoretic Concepts in Computer Science (WG'13) [***Warning: Editor(s) might be missing!]. Springer, Heidelberg 2013, 358-369.

Panagiotou, K., A. Pourmiri and T. Sauerwald: Faster rumor spreading with multiple calls. In: 24th Int. Symp. on Algorithms and Computation (ISAAC-13), Lect. Notes Comput. Sci. 8283, (Ed.) S.-W.C.T.W.L. Leizhen Cai. Springer, Hong Kong 2013, 446-456.

Panagiotou, K., R. Spöhel, A. Steger and H. Thomas: Explosive percolation in Erdös-Rényi-like random graph processes. Combinatorics, Probability and Computing 22, 133-145 (2013).

Sanders, P., J. Singler and R. van Stee: Real-time prefetching and caching. Journal of Scheduling 16, 47-58 (2013).

Schmidt, J.M.: A planarity test via construction sequences. In: 38th Int. Symp. on Mathematical Foundations of Computer Science (MFCS'13) [***Warning: Editor(s) might be missing!]. Springer, Heidelberg 2013, 765-776.

- A simple test on 2-vertex- and 2-edge-connectivity. Information Processing Letters 113, 241-244 (2013).

- Contractions, removals and certifying 3-connectivity in linear time. SIAM Journal on Computing 42, 494-535 (2013).

Sviridenko, M. and A. Wiese: Approximating the Configuration-LP for minimizing weighted sum of completion times on unrelated machines. In: Proc. 16th Conf. on Integer Programming and Combinatorial Optimization (IPCO 2013), Lect. Notes Comput. Sci. 7801, (Ed.) M. Goemans. Springer, Heidelberg 2013, [***Warning: Pages missing!].

van Stee, R.: SIGACT news online algorithms column 22. SIGACT News 44, 125 (2013).

Winzen, C.: Direction-Reversing quasi-random rumor spreading with restarts. Information Processing Letters 113, 921-926 (2013).

Publikationen im Internet

Bogdan, P., T. Sauerwald, A. Stauffer and H. Sun: Balls into bins via local search. In: 24th ACM-SIAM Symp. on Discrete Algorithms (SODA-13) [ *** Wrong entry format - no comma found in name value: Sanjeev Khanna]. SIAM, Philadelphia 2013, 16-34 [***Warning: Internet Reference URL not specified!]..

Case, J. and T. Kötzing: Memory-limited non-U-shaped learning with solved open problems. Theoretical Computer Science 473, 100-123 (2013). Internet: <http://dx.doi.org/10.1016/j.tcs.2012.10.010>

Doerr, B., C. Doerr, R. Spöhel and H. Thomas: Playing Mastermind with many colors. arXiv abs/1207.0773, 1-22 (2013). Internet: <http://arxiv.org/abs/1207.0773>

Kobel, A. and M. Sagraloff: Fast approximate polynomial multipoint evaluation and applications. arXiv abs/1304.8069, 17 (2013).

Kollias, K.: Nonpreemptive coordination mechanisms for identical machines. Theory of Computing Systems 53, 424-440 (2013). Internet: <http://dx.doi.org/10.1007/s00224-012-9429-9>

Mehlhorn, K., M. Sagraloff and P. Wang: From approximate factorization to root isolation with application to cylindrical algebraic decomposition. arXiv abs/1301.4870, [***Warning: Pages missing!] (2013). [***Warning: Internet Reference URL not specified!].

Saha, C., R. Saptharishi and N. Saxena: A case of depth-3 identity testing, sparse factorization and duality. Computational Complexity 22, 39-69 (2013). Internet: <http://link.springer.com/content/pdf/10.1007%2Fs00037-012-0054-4>

Wahlström, M.: Abusing the Tutte matrix: an algebraic instance compression for the K-set-cycle problem. In: 29th Int. Symp. on Theoretical Aspects of Computer Science (STACS-13), (Eds.) N. Portier, T. Wilke, LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Saarbrücken/Wadern 2013, [***Warning: Pages missing!] [***Warning: Internet Reference URL not specified!]..

Doctoral dissertation

Jurkiewicz, T.: Toward better computation models for modern machines. Universität des Saarlandes 2013.