Algorithms and Complexity Group
  • People
  • Research
  • Courses
  • Talks
  • Jobs
  • Contact

Robert Ganian

Address:
Robert Ganian
Technische Universität Wien
Institute of Logic and Computation
Favoritenstraße 9–11, E192-01
1040 Wien
Austria

Room: HC0411
Phone: +43(1)58801–192127
Email: rganian@ac.tuwien.ac.at, rganian@gmail.com
Web: http://www.ac.tuwien.ac.at/people/rganian/

 

Robert Ganian is an assistant professor ("Privatdozent") at the Vienna University of Technology, Austria, and a member of the Algorithms and Complexity Group. His main research interests are centered around the parameterized algorithms and complexity paradigm, with a special focus on the applications of this paradigm in artificial intelligence research.

He received his Ph.D. in 2012, has published over 100 articles in scientific journals and conference proceedings, and has an Erdős Number of 2.

Research Grants and Funding:

  • Principal Investigator of FWF START Project Y1329: Parameterized Analysis in Artificial Intelligence – ParAI (approx. € 1 150 000, 2021-2027).
  • Co-investigator and vice-chair of admission for the LogiCS@TUWien Marie Skłodowska-Curie COFUND doctoral programme (approx. € 5 300 000 divided among 13 co-investigators, 2021-2026).
  • Principal Investigator of bilateral Czech-Austrian OeAD projects Structural Approaches in Stability Under Diversity Constraints (approx. € 10 000, 2021-2023) and Anonymizing User Data: A Parameterized Perspective (approx. € 4 000, 2022).
  • Principal Investigator of FWF stand-alone project P31336: New Frontiers for Parameterized Complexity – NFPC (approx. € 250 000, 2018-2022).
  • Coordinator of FWF stand-alone project P26696: Exploiting New Types of Structure for Fixed Parameter Tractability – X-TRACT (approx. € 350 000, completed).

Program Committee and Editorial Duties:

  • Senior Program Committee member of the International Joint Conference on Artificial Intelligence (IJCAI, annual).
  • Program Committee member of the AAAI Conference on Artificial Intelligence (AAAI, annual).
  • Program Committee member of the Conference on Neural Information Processing Systems (NeurIPS, annual).
  • Program Committee member of the 48th International Symposium on Current Trends in Theory and Practice of Computer Science (SOFSEM 2023).
  • Program Committee Co-Chair of the 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022).
  • Program Committee member of the 17th International Symposium on Parameterized and Exact Computation (IPEC 2022).
  • Program Committee member of the Tenth International Conference on Learning Representations (ICLR 2021).
  • Program Committee member of the 47th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2021).
  • Program Committee member of the Workshop on Model Counting (MCW-2020), co-located with the 23rd International Conference on Theory and Applications of Satisfiability Testing (SAT 2020).
  • Guest Editor of the GROW 2017 and GROW 2019 special issues of Discrete Applied Mathematics.

Other Academic Activities:

  • Steering Committee member of the Workshop on Graph Classes, Optimization, and Width Parameters (GROW).
  • Award Committee Co-Chair of the VCLA International Student Awards.
  • Organizer of upcoming Dagstuhl seminar New Frontiers of Parameterized Complexity in Graph Drawing, to be held in 2023. (Approx. 30 participants).
  • Co-location & Competition Chairs of the 31st International Joint Conference on Artificial Intelligence (IJCAI 2022).
  • Organizer of Dagstuhl seminar 21293 Parameterized Complexity in Graph Drawing in 2021. (Approx. 30 participants).
  • Organization co-chair of the 9th Workshop on Graph Classes, Optimization, and Width Parameters (GROW 2019) in Vienna. (Approx. 50 participants)
  • Organization co-chair of ALGO 2017 in Vienna; ALGO is an annual congress combining the premier algorithmic conference European Symposium on Algorithms and a number of other specialized conferences and workshops. (300+ participants)
  • Organizer of the Parameterized Complexity Summer School (PCSS 2017) in Vienna. (100+ participants)
  • Invited by the organizers to give a series of tutorials at the European Summer School in Logic, Language and Information (ESSLLI 2017) in Toulouse. (Approx. 400 participants)
  • Organizer of the workshop on Parameterized Complexity of Computational Reasoning (PCCR 2014) in Vienna. (40+ participants)
  • Member of the organizing team of the Symposium on Structure in Hard Combinatorial Problems (STRUCTURE 2013) in Vienna. (40+ participants)

Postdoctoral Researchers:

  • Kirill Simonov: from 2021.
  • Cornelius Brand: from 2021.

Doctoral Students:

  • Viktoriia Korchemna: from 2021.
  • Thekla Hamm: from 2018.
  • Eduard Eiben (co-advisor): 2014-2018.

Publications:
125 results

2022
[125]Parameterized Algorithms for Queue Layouts
Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg
J. Graph Algorithms Appl., 2022.
Note: to appear
[bibtex]
[124]An Efficient Algorithm for Counting Markov Equivalent DAGs
Robert Ganian, Thekla Hamm, Topi Talvitie
Artificial Intelligence, 2022.
[bibtex]
[123]Algorithmic Applications of Tree-Cut Width
Robert Ganian, Eun Jung Kim, Stefan Szeider
SIAM J. Discrete Math., 2022.
Note: to appear
[bibtex]
[122]Sum-of-Products with Default Values: Algorithms and Complexity Results
Robert Ganian, Eun Jung Kim, Friedrich Slivovsky, Stefan Szeider
Journal of Artificial Intelligence Research, volume 33, pages 535–552, 2022.
[bibtex] [pdf]
[121]Preface: Ninth workshop on graph classes, optimization, and Width Parameters, Vienna, Austria
Robert Ganian, Jan Kratochvíl, Stefan Szeider
Discr. Appl. Math., volume 312, pages 1–2, 2022.
[bibtex] [pdf]
[120]On Covering Segments with Unit Intervals
Dan Bergren, Eduard Eiben, Robert Ganian, Iyad Kanj
SIAM J. Discrete Math., 2022.
Note: to appear
[bibtex]
[119]Hedonic Diversity Games: A Complexity Picture with More than Two Colors
Robert Ganian, Thekla Hamm, Dušan Knop, Šimon Schierreich, Ondrej Suchý
Proceeding of AAAI-22, the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022, AAAI Press.
Note: to appear
[bibtex]
[118]The Complexity of k-Means Clustering when Little is Known
Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov
39th Thirty-ninth International Conference on Machine Learning (ICML 2022), 2022.
Note: to appear
[bibtex]
[117]The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width
Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov
49th International Colloquium on Automata, Languages, and Programming, ICALP 2022, July 4-8, 2022, Paris, France, 2022.
Note: to appear
[bibtex]
[116]Weighted Model Counting with Twin-Width
Robert Ganian, Filip Pokrývka, Andre Schidler, Kirill Simonov, Stefan Szeider
Theory and Applications of Satisfiability Testing - SAT 2022 - 25th International Conference, Proceedings, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Note: to appear
[bibtex]
[115]A Unifying Framework for Characterizing and Computing Width Measures
Eduard Eiben, Robert Ganian, Thekla Hamm, Lars Jaffke, O-joung Kwon
13th Innovations in Theoretical Computer Science Conference, ITCS 2022, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf]
[114]Finding a Cluster in Incomplete Data
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
30th Annual European Symposium on Algorithms (ESA 2022), 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Note: to appear
[bibtex]
[113]The Complexity of Envy-Free Graph Cutting
Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastiak Ordyniak
Proceeding of IJCAI-22, the 31st International Joint Conference on Artificial Intelligence, 2022.
Note: to appear
[bibtex]
[112]Parameterized Algorithms for Upward Planarity
Steven Chaplick, Emilio Di Giacomo, Fabrizio Frati, Robert Ganian, Chrysanthi N. Raftopoulou, Kirill Simonov
38th International Symposium on Computational Geometry, SoCG 2022, June 7-10, 2022, Berlin, Germany, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Note: to appear
[bibtex]
[111]Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cuts
Cornelius Brand, Esra Ceylan, Robert Ganian, Christian Hatschka, Viktoriia Korchemna
Proceeding of the 48th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2022), 2022.
Note: to appear
[bibtex]
[110]Bounding and Computing Obstacle Numbers of Graphs
Martin Balko, Steven Chaplick, Robert Ganian, Siddharth Gupta, Michael Hoffmann, Pavel Valtr, Alexander Wolff
30th Annual European Symposium on Algorithms (ESA 2022), 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Note: to appear
[bibtex]
2021
[109]Measuring what matters: A hybrid approach to dynamic programming with treewidth
Eduard Eiben, Robert Ganian, Thekla Hamm, O-joung Kwon
J. Comput. Syst. Sci., volume 121, pages 57–75, 2021.
[bibtex] [pdf]
[108]New Width Parameters for SAT and Sharp-SAT
Robert Ganian, Stefan Szeider
Artificial Intelligence, volume 295, pages 103460, 2021.
[bibtex] [pdf] [doi]
[107]On Structural Parameterizations of the Edge Disjoint Paths Problem
Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan
Algorithmica, volume 83, number 6, pages 1605–1637, 2021.
[bibtex] [pdf]
[106]The Power of Cut-Based Parameters for Computing Edge-Disjoint Paths
Robert Ganian, Sebastian Ordyniak
Algorithmica, volume 83, number 2, pages 726–752, 2021.
[bibtex] [pdf]
[105]On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem
Robert Ganian, Fabian Klute, Sebastian Ordyniak
Algorithmica, volume 83, number 1, pages 297–336, 2021.
[bibtex] [pdf]
[104]On Strict (Outer-)Confluent Graphs
Henry Förster, Robert Ganian, Fabian Klute, Martin Nöllenburg
J. Graph Algorithms Appl., 2021.
[bibtex] [pdf]
[103]The complexity landscape of decompositional parameters for ILP: Programs with Few Global Variables and Constraints
Pavel Dvorák, Eduard Eiben, Robert Ganian, Dušan Knop, Sebastian Ordyniak
Artificial Intelligence, 2021.
[bibtex] [pdf]
[102]Towards a Polynomial Kernel for Directed Feedback Vertex Set
Benjamin Bergougnoux, Eduard Eiben, Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan
Algorithmica, volume 83, number 5, pages 1201–1221, 2021.
[bibtex] [pdf]
[101]The Complexity of Bayesian Network Learning: Revisiting the Superstructure
Robert Ganian, Viktoriia Korchemna
Proceedings of NeurIPS 2021, the Thirty-fifth Conference on Neural Information Processing Systems, 2021.
Note: to appear
[bibtex] [pdf]
[100]The Complexity of Object Association in Multiple Object Tracking
Robert Ganian, Thekla Hamm, Sebastian Ordyniak
Thirty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2021, Virtual Event, February 2-9, 2021, pages 1388–1396, 2021, AAAI Press.
[bibtex] [pdf]
[99]Crossing-Optimal Extension of Simple Drawings
Robert Ganian, Thekla Hamm, Fabian Klute, Irene Parada, Birgit Vogtenhuber
48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference) (Nikhil Bansal, Emanuela Merelli, James Worrell, eds.), volume 198 of LIPIcs, pages 72:1–72:17, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf]
[98]The Parameterized Complexity of Clustering Incomplete Data
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
Proceeding of AAAI-21, the Thirty-Fifth AAAI Conference on Artificial Intelligence, pages 7296–7304, 2021, AAAI Press.
[bibtex] [pdf]
[97]The Parameterized Complexity of Connected Fair Division
Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, IJCAI 2021, Virtual Event / Montreal, Canada, 19-27 August 2021 (Zhi-Hua Zhou, ed.), pages 139–145, 2021, ijcai.org.
[bibtex] [pdf]
[96]Graphs with at most two moplexes
Clément Dallard, Robert Ganian, Meike Hatzel, Matjaz Krnc, Martin Milanic
Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, LAGOS 2021, 2021, Elsevier.
[bibtex] [pdf]
[95]Worbel: Aggregating Point Labels into Word Clouds
Sujoy Bhore, Robert Ganian, Guangping Li, Martin Nollenburg, Jules Wulms
Proceedings of the International Conference on Advances in Geographic Information Systems 2021 (ACM SIGSPATIAL 2021), 2021.
[bibtex] [pdf]
2020
[94]Parameterized Algorithms for Book Embedding Problems
Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg
J. Graph Algorithms Appl., 2020.
[bibtex] [doi]
[93]Using decomposition-parameters for QBF: Mind the prefix!
Eduard Eiben, Robert Ganian, Sebastian Ordyniak
J. Comput. Syst. Sci., volume 110, pages 1–21, 2020.
[bibtex] [pdf]
[92]On Existential MSO and its Relation to ETH
Robert Ganian, Ronald de Haan, Iyad Kanj, Stefan Szeider
ACM Transactions on Computation Theory, volume 12, number 4, pages 22:1–22:32, 2020.
[bibtex]
[91]Foreword: Eighth Workshop on Graph Classes, Optimization, and Width Parameters, Toronto, Ontario, Canada
Derek G. Corneil, Robert Ganian, Andrzej Proskurowski
Discr. Appl. Math., volume 278, pages 1–2, 2020.
[bibtex]
[90]Threshold Treewidth and Hypertree Width
Robert Ganian, Andre Schidler, Manuel Sorge, Stefan Szeider
Proceeding of IJCAI-PRICAI2020, the 29th International Joint Conference on Artificial Intelligence and the 17th Pacific Rim International Conference on Artificial Intelligence, pages 1898–1904, 2020.
[bibtex] [pdf] [doi]
[89]Fixed-Parameter Tractability of Dependency QBF with Structural Parameters
Robert Ganian, Tomás Peitl, Friedrich Slivovsky, Stefan Szeider
Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, KR 2020 (Diego Calvanese, Esra Erdem, Michael Thielscher, eds.), pages 392–402, 2020.
[bibtex] [pdf]
[88]On the Parameterized Complexity of Clustering Incomplete Data into Subspaces of Small Dimension
Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
Proceeding of AAAI-20, the Thirty-Fourth AAAI Conference on Artificial Intelligence, February 7–12, 2020, New York, pages 3906–3913, 2020, AAAI Press.
[bibtex] [pdf]
[87]An Efficient Algorithm for Counting Markov Equivalent DAGs
Robert Ganian, Thekla Hamm, Topi Talvitie
The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020, New York, NY, USA, February 7-12, 2020, pages 10136–10143, 2020, AAAI Press.
[bibtex] [pdf]
[86]The Complexity Landscape of Resource-Constrained Scheduling
Robert Ganian, Thekla Hamm, Guillaume Mescoff
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, IJCAI 2020 (Christian Bessiere, ed.), pages 1741–1747, 2020, ijcai.org.
[bibtex] [pdf]
[85]Parameterized Complexity of Envy-Free Resource Allocation in Social Networks
Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak
The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020, New York, NY, USA, February 7-12, 2020, pages 7135–7142, 2020, AAAI Press.
[bibtex] [pdf]
[84]Extending Nearly Complete 1-Planar Drawings in Polynomial Time
Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg
45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020, August 24-28, 2020, Prague, Czech Republic (Javier Esparza, Daniel Král', eds.), volume 170 of LIPIcs, pages 31:1–31:16, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf]
[83]Extending Partial 1-Planar Drawings
Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg
47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference) (Artur Czumaj, Anuj Dawar, Emanuela Merelli, eds.), volume 168 of LIPIcs, pages 43:1–43:19, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf]
[82]Stable Matchings with Diversity Constraints: Affirmative Action is beyond NP
Jiehua Chen, Robert Ganian, Thekla Hamm
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, IJCAI 2020 (Christian Bessiere, ed.), pages 146–152, 2020, ijcai.org.
[bibtex] [pdf]
[81]Parameterized Algorithms for Queue Layouts
Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg
Graph Drawing and Network Visualization - 28th International Symposium, GD 2020, Vancouver, BC, Canada, September 16-18, 2020, Revised Selected Papers (David Auber, Pavel Valtr, eds.), volume 12590 of Lecture Notes in Computer Science, pages 40–54, 2020, Springer Verlag.
[bibtex] [pdf]
[80]On Covering Segments with Unit Intervals
Dan Bergren, Eduard Eiben, Robert Ganian, Iyad Kanj
37th International Symposium on Theoretical Aspects of Computer Science, STACS 2020, March 10-13, 2020, Montpellier, France (Christophe Paul, Markus Bläser, eds.), volume 154 of LIPIcs, pages 13:1–13:17, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf]
2019
[79]Solving Integer Linear Programs by Exploiting Variable-Constraint Interactions: A Survey
Robert Ganian, Sebastian Ordyniak
Algorithms, volume 12, number 12, pages 248, 2019.
[bibtex] [pdf]
[78]On the Complexity Landscape of Connected f-Factor Problems
Robert Ganian, N. S. Narayanaswamy, Sebastian Ordyniak, C. S. Rahul, M. S. Ramanujan
Algorithmica, volume 81, number 6, pages 2606–2632, 2019.
[bibtex] [pdf]
[77]Parameterized Complexity of Asynchronous Border Minimization
Robert Ganian, Martin Kronegger, Andreas Pfandler, Alexandru Popa
Algorithmica, volume 81, number 1, pages 201–223, 2019.
[bibtex] [pdf]
[76]Shrub-Depth: Capturing Height of Dense Graphs
Robert Ganian, Petr Hlinený, Jaroslav Nesetril, Jan Obdrzálek, Patrice Ossona de Mendez
Logical Methods in Computer Science, 2019.
[bibtex] [pdf]
[75]Counting linear extensions: Parameterizations by treewidth
Eduard Eiben, Robert Ganian, Kustaa Kangas, Sebastian Ordyniak
Algorithmica, 2019.
[bibtex] [pdf]
[74]Group Activity Selection with Few Agent Types
Robert Ganian, Sebastian Ordyniak, C. S. Rahul
27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany (Michael A. Bender, Ola Svensson, Grzegorz Herman, eds.), pages 48:1–48:16, 2019.
[bibtex] [pdf]
[73]A Join-Based Hybrid Parameter for Constraint Satisfaction
Robert Ganian, Sebastian Ordyniak, Stefan Szeider
Proceedings of CP 2019, the 25th International Conference on Principles and Practice of Constraint Programming (Thomas Schiex, Simon de Givry, eds.), volume 11802 of Lecture Notes in Computer Science, pages 195–212, 2019, Springer Verlag.
[bibtex] [pdf] [doi]
[72]The Power of Cut-Based Parameters for Computing Edge Disjoint Paths
Robert Ganian, Sebastian Ordyniak
Graph-Theoretic Concepts in Computer Science - 45th International Workshop, WG 2019, Vall de Núria, Spain, June 19-21, 2019, Revised Papers (Ignasi Sau, Dimitrios M. Thilikos, eds.), pages 190–204, 2019.
[bibtex] [pdf]
[71]SAT-Encodings for Treecut Width and Treedepth
Robert Ganian, Neha Lodha, Sebastian Ordyniak, Stefan Szeider
Proceedings of ALENEX 2019, the 21st Workshop on Algorithm Engineering and Experiments (Stephen G. Kobourov, Henning Meyerhenke, eds.), pages 117–129, 2019, Society for Industrial and Applied Mathematics (SIAM).
[bibtex] [pdf] [doi]
[70]On Strict (Outer-)Confluent Graphs
Henry Förster, Robert Ganian, Fabian Klute, Martin Nöllenburg
Graph Drawing and Network Visualization - 27th International Symposium, GD 2019, Prague, Czech Republic, September 17-20, 2019, Proceedings (Daniel Archambault, Csaba D. Tóth, eds.), volume 11904 of Lecture Notes in Computer Science, pages 147–161, 2019, Springer Verlag.
[bibtex] [pdf]
[69]Solving integer quadratic programming via explicit and structural restrictions
Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak
The Thirty-Third AAAI Conference on Artificial Intelligence, AAAI 2019, Honolulu, Hawaii, USA, January 27 - February 1, 2019 (Pascal Van Hentenryck, Zhi-Hua Zhou, eds.), pages 1477–1484, 2019.
[bibtex] [pdf]
[68]The Parameterized Complexity of Cascading Portfolio Scheduling
Eduard Eiben, Robert Ganian, Iyad Kanj, Stefan Szeider
Proceedings of NeurIPS 2019, the Thirty-third Conference on Neural Information Processing Systems (Hanna M. Wallach, Hugo Larochelle, Alina Beygelzimer, Florence d'Alché-Buc, Emily B. Fox, Roman Garnett, eds.), pages 7666–7676, 2019.
[bibtex] [pdf]
[67]Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth
Eduard Eiben, Robert Ganian, Thekla Hamm, O-joung Kwon
44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019, August 26-30, 2019, Aachen, Germany (Peter Rossmanith, Pinar Heggernes, Joost-Pieter Katoen, eds.), pages 42:1–42:15, 2019.
[bibtex] [pdf]
[66]Integer Programming and Incidence Treedepth
Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak, Michal Pilipczuk, Marcin Wrochna
Integer Programming and Combinatorial Optimization - 20th International Conference, IPCO 2019, Ann Arbor, MI, USA, May 22-24, 2019, Proceedings (Andrea Lodi, Viswanath Nagarajan, eds.), volume 11480 of Lecture Notes in Computer Science, pages 194–204, 2019, Springer Verlag.
[bibtex] [pdf]
[65]Parameterized Algorithms for Book Embedding Problems
Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg
Graph Drawing and Network Visualization - 27th International Symposium, GD 2019, Prague, Czech Republic, September 17-20, 2019, Proceedings (Daniel Archambault, Csaba D. Tóth, eds.), volume 11904 of Lecture Notes in Computer Science, pages 365–378, 2019, Springer Verlag.
[bibtex] [pdf]
2018
[64]The complexity landscape of decompositional parameters for ILP
Robert Ganian, Sebastian Ordyniak
Artificial Intelligence, volume 257, pages 61–71, 2018.
[bibtex] [pdf]
[63]Meta-kernelization using well-structured modulators
Eduard Eiben, Robert Ganian, Stefan Szeider
Discr. Appl. Math., volume 248, pages 153–167, 2018.
[bibtex] [pdf] [doi]
[62]Solving Problems on Graphs of High Rank-Width
Eduard Eiben, Robert Ganian, Stefan Szeider
Algorithmica, volume 80, number 2, pages 742–771, 2018.
[bibtex] [pdf] [doi]
[61]On the complexity of rainbow coloring problems
Eduard Eiben, Robert Ganian, Juho Lauri
Discr. Appl. Math., volume 246, pages 38–48, 2018.
[bibtex] [pdf]
[60]A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion
Eduard Eiben, Robert Ganian, O-joung Kwon
Journal of Computer and System Sciences, volume 97, pages 121–146, 2018.
[bibtex] [pdf]
[59]On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem
Robert Ganian, Fabian Klute, Sebastian Ordyniak
35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28–March 3, 2018, Caen, France (Rolf Neidermeier, Brigitte Vallée, eds.), volume 96 of LIPIcs, pages 33:1–33:14, 2018, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.
[bibtex] [pdf]
[58]Sum-of-Products with Default Values: Algorithms and Complexity Results
Robert Ganian, Eun Jung Kim, Friedrich Slivovsky, Stefan Szeider
Proceedings of ICTAI 2018, the 30th IEEE International Conference on Tools with Artificial Intelligence (Lefteri H. Tsoukalas, Éric Grégoire, Miltiadis Alamaniotis, eds.), pages 733–737, 2018, IEEE.
[bibtex] [pdf] [doi]
[57]Parameterized Algorithms for the Matrix Completion Problem
Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
Proceeding of ICML, the Thirty-fifth International Conference on Machine Learning, Stockholm, July 10–15, 2018, pages 1642–1651, 2018, JMLR.org.
Note: ISSN: 1938-7228
[bibtex] [pdf]
[56]Small Resolution Proofs for QBF using Dependency Treewidth
Eduard Eiben, Robert Ganian, Sebastian Ordyniak
35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28–March 3, 2018, Caen, France (Rolf Neidermeier, Brigitte Vallée, eds.), volume 96 of LIPIcs, pages 28:1–28:15, 2018, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.
[bibtex] [pdf]
[55]A Structural Approach to Activity Selection
Eduard Eiben, Robert Ganian, Sebastian Ordyniak
Proceedings of IJCAI 2018, the 27th International Joint Conference on Artificial Intelligence, pages 203–209, 2018, ijcai.org.
[bibtex] [pdf]
[54]Unary Integer Linear Programming with Structural Restrictions
Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak
Proceedings of IJCAI 2018, the 27th International Joint Conference on Artificial Intelligence, pages 1284–1290, 2018, ijcai.org.
[bibtex] [pdf]
2017
[53]Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting
Robert Ganian, M. S. Ramanujan, Stefan Szeider
ACM Transactions on Algorithms, volume 13, number 2, pages 29:1–29:32, 2017.
[bibtex] [pdf] [doi]
[52]New Width Parameters for Model Counting
Robert Ganian, Stefan Szeider
Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings (Serge Gaspers, Toby Walsh, eds.), volume 10491 of Lecture Notes in Computer Science, pages 38–52, 2017, Springer Verlag.
[bibtex] [pdf] [doi]
[51]Backdoor Treewidth for SAT
Robert Ganian, M. S. Ramanujan, Stefan Szeider
Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings (Serge Gaspers, Toby Walsh, eds.), volume 10491 of Lecture Notes in Computer Science, pages 20–37, 2017, Springer Verlag.
[bibtex] [pdf] [doi]
[50]Combining Treewidth and Backdoors for CSP
Robert Ganian, M. S. Ramanujan, Stefan Szeider
34th Symposium on Theoretical Aspects of Computer Science (STACS 2017) (Heribert Vollmer, Vallée, eds.), volume 66 of Leibniz International Proceedings in Informatics (LIPIcs), pages 36:1–36:17, 2017, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik.
[bibtex] [pdf] [doi]
[49]On Structural Parameterizations of the Edge Disjoint Paths Problem
Robert Ganian, Sebastian Ordyniak, Ramanujan Sridharan
28th International Symposium on Algorithms and Computation, ISAAC 2017, December 9-12, 2017, Phuket, Thailand (Yoshio Okamoto, Takeshi Tokuyama, eds.), volume 92 of LIPIcs, pages 36:1–36:13, 2017, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.
[bibtex] [pdf]
[48]Solving Integer Linear Programs with a Small Number of Global Variables and Constraints
Pavel Dvo\v rák, Eduard Eiben, Robert Ganian, Dušan Knop, Sebastian Ordyniak
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, Melbourne, Australia, August 19-25, 2017 (Carles Sierra, ed.), pages 607–613, 2017, ijcai.org.
[bibtex] [pdf]
[47]Going Beyond Primal Treewidth for (M)ILP
Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, February 4-9, 2017, San Francisco, California, USA., pages 815–821, 2017.
[bibtex] [pdf]
[46]Towards a Polynomial Kernel for Directed Feedback Vertex Set
Benjamin Bergougnoux, Eduard Eiben, Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan
42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017, August 21-25, 2017 - Aalborg, Denmark (Kim G. Larsen, Hans L. Bodlaender, Jean-François Raskin, eds.), volume 83 of LIPIcs, pages 36:1–36:15, 2017, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.
[bibtex] [pdf]
2016
[45]Meta-Kernelization with Structural Parameters
Robert Ganian, Friedrich Slivovsky, Stefan Szeider
Journal of Computer and System Sciences, volume 82, number 2, pages 333–346, 2016.
[bibtex] [pdf] [doi]
[44]FO Model Checking of Interval Graphs
Robert Ganian, Petr Hlinený, Daniel Král, Jan Obdrzálek, Jarett Schwartz, Jakub Teska
Logical Methods in Computer Science, volume 11, number 4, 2016.
[bibtex] [pdf]
[43]Are There Any Good Digraph Measures?
Robert Ganian, Petr Hlinený, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar
Journal of Combinatorial Theory, Series B, volume 116, pages 250–286, 2016.
[bibtex]
[42]Quantified Conjunctive Queries on Partially Ordered Sets
Simone Bova, Robert Ganian, Stefan Szeider
Theoretical Computer Science, volume 618, pages 72–84, 2016.
[bibtex] [pdf] [doi]
[41]Model Checking Existential Logic on Partially Ordered Sets
Simone Bova, Robert Ganian, Stefan Szeider
ACM Transactions on Computational Logic, volume 17, number 2, 2016.
[bibtex] [doi]
[40]Backdoors to Tractable Valued CSP
Robert Ganian, M.S. Ramanujan, Stefan Szeider
Principles and Practice of Constraint Programming - 22nd International Conference, CP 2016, Toulouse, France, September 5-9, 2016, Proceedings (Michel Rueher, ed.), volume 9892 of Lecture Notes in Computer Science, pages 233–250, 2016, Springer Verlag.
[bibtex] [pdf] [doi]
[39]Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting
Robert Ganian, M. S. Ramanujan, Stefan Szeider
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016, pages 1670–1681, 2016.
[bibtex] [pdf] [doi]
[38]The Complexity Landscape of Decompositional Parameters for ILP
Robert Ganian, Sebastian Ordyniak
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence (Dale Schuurmans, Michael P. Wellman, eds.), pages 710–716, 2016, AAAI Press.
[bibtex] [pdf]
[37]Polynomial-Time Construction of Optimal MPI Derived Datatype Trees
Robert Ganian, Martin Kalany, Stefan Szeider, Jesper Larsson Träff
2016 IEEE International Parallel and Distributed Processing Symposium, IPDPS 2016, Chicago, IL, USA, May 23-27, 2016, pages 638–647, 2016, IEEE Computer Society.
[bibtex] [pdf] [doi]
[36]On Existential MSO and its Relation to ETH
Robert Ganian, Ronald de Haan, Iyad Kanj, Stefan Szeider
41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016) (Piotr Faliszewski, Anca Muscholl, Rolf Niedermeier, eds.), volume 58 of Leibniz International Proceedings in Informatics (LIPIcs), pages 42:1–42:14, 2016, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik.
[bibtex] [pdf] [doi]
[35]On the Complexity Landscape of Connected f-factor Problems
Robert Ganian, N.S. Narayanaswamy, Sebastian Ordyniak, C.S. Rahul, Ramanujan M. S.
Mathematical Foundations of Computer Science 2016 - 41st International Symposium, MFCS 2016 (Piotr Faliszewski, Anca Muscholl, Rolf Niedermeier, eds.), pages 41:1–41:14, 2016, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.
[bibtex] [pdf]
[34]Counting Linear Extensions: Parameterizations by Treewidth
Eduard Eiben, Robert Ganian, Kustaa Kangas, Sebastian Ordyniak
24th European Symposium of Algorithms, ESA 2016, volume 57 of LIPIcs, pages 39:1–39:18, 2016, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.
[bibtex] [pdf]
[33]Using Decomposition-Parameters for QBF: Mind the Prefix!
Eduard Eiben, Robert Ganian, Sebastian Ordyniak
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence (Dale Schuurmans, Michael P. Wellman, eds.), pages 964–970, 2016, AAAI Press.
[bibtex] [pdf]
[32]A Single-Exponential Fixed-Parameter Algorithm for Distance-Hereditary Vertex Deletion
Eduard Eiben, Robert Ganian, O-joung Kwon
Mathematical Foundations of Computer Science 2016 - 41st International Symposium, MFCS 2016 (Piotr Faliszewski, Anca Muscholl, Rolf Niedermeier, eds.), volume 58 of LIPIcs, pages 34:1–34:14, 2016, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.
[bibtex] [pdf]
2015
[31]Improving Vertex Cover as a Graph Parameter
Robert Ganian
Discrete Mathematics & Theoretical Computer Science, volume 17, number 2, pages 77–100, 2015.
[bibtex]
[30]Community Structure Inspired Algorithms for SAT and #SAT
Robert Ganian, Stefan Szeider
18th International Conference on Theory and Applications of Satisfiability Testing (SAT 2015), September 24-27, 2015, Austin, Texas (Marijn Heule, Sean Weaver, eds.), pages 223-237, 2015, Springer Verlag.
[bibtex] [pdf] [doi]
[29]Parameterized Complexity of Asynchronous Border Minimization
Robert Ganian, Martin Kronegger, Andreas Pfandler, Alexandru Popa
Theory and Applications of Models of Computation - 12th Annual Conference, TAMC 2015, Singapore, May 18-20, 2015, Proceedings (Rahul Jain, Sanjay Jain, Frank Stephan, eds.), volume 9076 of Lecture Notes in Computer Science, pages 428–440, 2015, Springer Verlag.
[bibtex] [pdf] [doi]
[28]Algorithmic Applications of Tree-Cut Width
Robert Ganian, Eun Jung Kim, Stefan Szeider
Mathematical Foundations of Computer Science 2015 - 40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings, Part II, volume 9235 of Lecture Notes in Computer Science, pages 348–360, 2015, Springer Verlag.
[bibtex] [pdf] [doi]
[27]Meta-Kernelization using Well-Structured Modulators
Eduard Eiben, Robert Ganian, Stefan Szeider
Parameterized and Exact Computation - 10th International Symposium, IPEC 2014, Patras, Greece, September 16-18, 2015. Revised Selected Papers (Thore Husfeldt, Iyad A. Kanj, eds.), volume 43 of LIPIcs, pages 114–126, 2015.
[bibtex] [pdf] [doi]
[26]Solving Problems on Graphs of High Rank-Width
Eduard Eiben, Robert Ganian, Stefan Szeider
Algorithms and Data Structures Symposium (WADS 2015), August 5-7, 2015, University of Victoria, BC, Canada, pages 314–326, 2015, Springer Verlag.
[bibtex] [pdf] [doi]
[25]On the Complexity of Rainbow Coloring Problems
Eduard Eiben, Robert Ganian, Juho Lauri
Combinatorial Algorithms - 26th International Workshop, IWOCA 2015, Verona, Italy, October 5-7, 2015, Revised Selected Papers (Zsuzsanna Lipták, William F. Smyth, eds.), pages 209–220, 2015.
[bibtex] [pdf] [doi]
2014
[24]Lower bounds on the complexity of MSO1 model-checking
Robert Ganian, Petr Hlinený, Alexander Langer, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar
J. Comput. Syst. Sci., volume 80, number 1, pages 180–194, 2014.
[bibtex]
[23]Digraph width measures in parameterized algorithmics
Robert Ganian, Petr Hlinený, Joachim Kneis, Alexander Langer, Jan Obdrzálek, Peter Rossmanith
Discrete Applied Mathematics, volume 168, pages 88–107, 2014.
[bibtex]
[22]Quantified Conjunctive Queries on Partially Ordered Sets
Simone Bova, Robert Ganian, Stefan Szeider
Parameterized and Exact Computation - 9th International Symposium, IPEC 2014, Wroclaw, Poland, September 10-12, 2014. Revised Selected Papers (Marek Cygan, Pinar Heggernes, eds.), volume 8894 of Lecture Notes in Computer Science, pages 122–134, 2014, Springer Verlag.
[bibtex] [pdf] [doi]
[21]Model checking existential logic on partially ordered sets
Simone Bova, Robert Ganian, Stefan Szeider
Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS '14, Vienna, Austria, July 14 - 18, 2014 (Thomas A. Henzinger, Dale Miller, eds.), pages 21:1–21:10, 2014, ACM.
[bibtex] [pdf] [doi]
2013
[20]Cops-and-robbers: remarks and problems
Michel Boyer, Sif El Harti, Amal El Ouarari, Robert Ganian, Tomas Gavenciak, Gena Hahn, Carsten Moldenauer, Ignaz Rutter, Benoit Theriault, Martin Vatshelle
Journal of Combinatorial Mathematics and Combinatorial Computing, volume 85, pages 141–159, 2013.
[bibtex]
[19]A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width
Robert Ganian, Petr Hlinený, Jan Obdrzálek
Eur. J. Comb., volume 34, number 3, pages 680–701, 2013.
[bibtex]
[18]Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width
Robert Ganian, Petr Hlinený, Jan Obdrzálek
Fundam. Inform., volume 123, number 1, pages 59–76, 2013.
[bibtex]
[17]Meta-kernelization with Structural Parameters
Robert Ganian, Friedrich Slivovsky, Stefan Szeider
Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings (Krishnendu Chatterjee, Jiri Sgall, eds.), volume 8087 of Lecture Notes in Computer Science, pages 457-468, 2013, Springer Verlag.
[bibtex] [doi]
[16]Expanding the Expressive Power of Monadic Second-Order Logic on Restricted Graph Classes
Robert Ganian, Jan Obdrzálek
Combinatorial Algorithms - 24th International Workshop, IWOCA 2013, Rouen, France, July 10-12, 2013, Revised Selected Papers, volume 8288 of Lecture Notes in Computer Science, pages 164–177, 2013, Springer Verlag.
[bibtex]
[15]FO Model Checking of Interval Graphs
Robert Ganian, Petr Hlinený, Daniel Král', Jan Obdrzálek, Jarett Schwartz, Jakub Teska
Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part II, volume 7966 of Lecture Notes in Computer Science, pages 250–262, 2013, Springer Verlag.
[bibtex]
2012
[14]When Trees Grow Low: Shrubs and Fast MSO1
Robert Ganian, Petr Hlinený, Jaroslav Nesetril, Jan Obdrzálek, Patrice Ossona de Mendez, Reshma Ramadurai
Mathematical Foundations of Computer Science 2012 - 37th International Symposium, MFCS 2012, Bratislava, Slovakia, August 27-31, 2012. Proceedings, volume 7464 of Lecture Notes in Computer Science, pages 419–430, 2012, Springer Verlag.
[bibtex]
[13]Lower Bounds on the Complexity of MSO1 Model-Checking
Robert Ganian, Petr Hlinený, Alexander Langer, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar
29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France, volume 14 of LIPIcs, pages 326–337, 2012, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.
[bibtex]
2011
[12]Clique-width: When Hard Does Not Mean Impossible
Robert Ganian, Petr Hlinený, Jan Obdrzálek
28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany, volume 9 of LIPIcs, pages 404–415, 2011, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.
[bibtex]
[11]Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics
Robert Ganian
Parameterized and Exact Computation - 6th International Symposium, IPEC 2011, Saarbrücken, Germany, September 6-8, 2011. Revised Selected Papers, volume 7112 of Lecture Notes in Computer Science, pages 259–271, 2011, Springer Verlag.
[bibtex]
[10]New Results on the Complexity of the Max- and Min-Rep Problems
Robert Ganian
SOFSEM 2011: Theory and Practice of Computer Science - 37th Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 22-28, 2011. Proceedings, volume 6543 of Lecture Notes in Computer Science, pages 238–247, 2011, Springer Verlag.
[bibtex]
2010
[9]On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width
Robert Ganian, Petr Hlinený
Discrete Applied Mathematics, volume 158, number 7, pages 851–867, 2010.
[bibtex]
[8]Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width
Robert Ganian, Petr Hlinený, Jan Obdrzálek
IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India, volume 8 of LIPIcs, pages 73–83, 2010, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.
[bibtex]
[7]New Results on the Complexity of Oriented Colouring on Restricted Digraph Classes
Robert Ganian, Petr Hlinený
SOFSEM 2010: Theory and Practice of Computer Science, 36th Conference on Current Trends in Theory and Practice of Computer Science, Spindleruv Mlýn, Czech Republic, January 23-29, 2010. Proceedings, volume 5901 of Lecture Notes in Computer Science, pages 428–439, 2010, Springer Verlag.
[bibtex]
[6]Are There Any Good Digraph Width Measures?
Robert Ganian, Petr Hlin\v ený, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar
Parameterized and Exact Computation - 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings, volume 6478 of Lecture Notes in Computer Science, pages 135–146, 2010, Springer Verlag.
[bibtex]
[5]Thread Graphs, Linear Rank-Width and Their Algorithmic Applications
Robert Ganian
Combinatorial Algorithms - 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers, volume 6460 of Lecture Notes in Computer Science, pages 38–42, 2010, Springer Verlag.
[bibtex]
2009
[4]Better Polynomial Algorithms on Graphs of Bounded Rank-Width
Robert Ganian, Petr Hlinený
Combinatorial Algorithms, 20th International Workshop, IWOCA 2009, Hradec nad Moravicí, Czech Republic, June 28-July 2, 2009, Revised Selected Papers, pages 266–277, 2009, Springer Verlag.
[bibtex]
[3]On Digraph Width Measures in Parameterized Algorithmics
Robert Ganian, Petr Hlin\v ený, Joachim Kneis, Alexander Langer, Jan Obdrzálek, Peter Rossmanith
Parameterized and Exact Computation, 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers, volume 5917 of Lecture Notes in Computer Science, pages 185–197, 2009, Springer Verlag.
[bibtex]
[2]The Parameterized Complexity of Oriented Colouring
Robert Ganian
Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science, MEMICS 2009, November 13-15, 2009, Prestige Hotel, Znojmo, Czech Republic, 2009, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany.
[bibtex]
2008
[1]Automata approach to graphs of bounded rank-width
Robert Ganian, Petr Hlinený
Proceedings of the 19th International Workshop on Combinatorial Algorithms, IWOCA 2008, September 13-15, 2008, Nagoya, Japan, pages 4–15, 2008, College Publications.
[bibtex]
  • Cornelius Brand
  • Doris Brazda
  • Jiehua Chen
  • Alexander Dobler
  • Jan Dreier
  • Herbert Fleischner
  • Nikolaus Frohner
  • Martin Gronemann
  • Robert Ganian
  • Thekla Hamm
  • Marc Huber
  • Thomas Jatschka
  • Markus Kirchweger
  • Viktoria Korchemna
  • Martin Kronegger
  • Andreas Müller
  • Soeren Nickel
  • Martin Nöllenburg
  • Daniel Obszelka
  • Tomáš Peitl
  • Vaidyanathan P. R.
  • Günther Raidl
  • Franz Xaver Reichl
  • Andre Schidler
  • Sofia Simola
  • Kirill Simonov
  • Friedrich Slivovsky
  • Manuel Sorge
  • Stefan Szeider
  • Johannes Varga
  • Anaïs Villedieu
  • Markus Wallinger
  • Jules Wulms
TU Wien Informatics
Offenlegung (§25 MedienG) Inhaber der Website ist das Institut für Logic and Computation an der Technischen Universität Wien, 1040 Wien. Die TU Wien distanziert sich von den Inhalten aller extern gelinkten Seiten und übernimmt diesbezüglich keine Haftung. – Disclaimer – Datenschutzerklärung
Log in requires cookies.