Team Publications

2018

2017

  • Mateus de Oliveira Oliveira. Provability in Equational Logic, of the 26th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX 2017). Brasília, Brazil, September 2017
  • Mateus de Oliveira Oliveira. On Supergraphs Satisfying CMSO Properties
    of the 26th Annual Conference of the European Association for Computer Science Logic (CSL 2017). Stockholm, Sweden, August 2017
  • Mateus de Oliveira Oliveira, Pavel Pudlák. Representations of Monotone Boolean Functions by Linear Programs, To appear in the Proc. of the 32nd Computational Complexity Conference (CCC 2017). Riga, Latvia, July 2017
  • Christian Komusiewicz, Mateus de Oliveira Oliveira and Meirav Zehavi. Revisiting the Parameterized Complexity of Maximum-Duo Preservation String Mapping Problem. To appear in the Proc. of the 28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017). Warsaw, Poland, July 2017
  • Lars Jaffke, Hans L. Bodlaender, Pinar Heggernes, Jan Arne Telle.Definability equals recognizability for k-outerplanar graphs and l-chordal partial k-trees. J. Comb. 66: 191-234 (2017)
  • Lars Jaffke, Bart M. P. Jansen. Fine-Grained Parameterized Complexity Analysis of Graph Coloring Problems. CIAC 2017: 345-356
  • Lars Jaffke, Bart M. P. Jansen. Fine-Grained Parameterized Complexity Analysis of Graph Coloring Problems. CoRR abs/1701.06985 (2017)
  • Lars Jaffke, O-joung Kwon, Jan Arne Telle. Polynomial-time algorithms for the Longest Induced Path and Induced Disjoint Paths problems on graphs of bounded mim-width. CoRR abs/1708.04536 (2017)
  • Lars Jaffke, O-joung Kwon, Jan Arne Telle. A unified polynomial-time algorithm for Feedback Vertex Set on graphs of bounded mim-width. CoRR abs/1710.07148 (2017)
  • Adam R. Day, Michael R. Fellows, Noam Greenberg, Bakhadyr Khoussainov, Alexander G. Melnikov, Frances A. Rosamond: Computability and Complexity – Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday. Lecture Notes in Computer Science 10010, Springer 2017, ISBN 978-3-319-50061-4
  • Mingyu Xiao, Frances A. Rosamond: Frontiers in Algorithmics – 11th International Workshop, FAW 2017, Chengdu, China, June 23-25, 2017, Proceedings. Lecture Notes in Computer Science 10336, Springer 2017, ISBN 978-3-319-59604-4

 

2016

  • Mateus de Oliveira Oliveira. Ground Reachability and Joinability in Linear Term Rewriting Systems are Fixed Parameter Tractable with Respect to Depth. of the 11th International Symposium on Parameterized and Exact Computation (IPEC 2016) Aarhus, Denmark , August 2016
  • Mateus de Oliveira Oliveira. Causality in Petri Nets is MSO Definable
    of the 23rd Workshop on Logic, Language, Information and Computation (WoLLIC 2016) Puebla, Mexico, August 2016
  • Mateus de Oliveira Oliveira. Satisfiability via Smooth Pictures. of the 19th International Conference on Theory and Applications of Satisfiability Testing (SAT 2016) Bordeaux, France, July 2016
  • Mateus de Oliveira Oliveira. Size-Treewidth Tradeoffs for Circuits Computing the Element Distinctness Function. Proc. of the 33rd International Symposium on Theoretical Aspects of Computer Science (STACS 2016). Orleans, France, February 2016.
  • Mateus de Oliveira Oliveira. An Algorithmic Metatheorem for Directed Treewidth (arxiv) Discrete Applied Mathematics, Vol. 204, Pages 49–76, 2016
  • Frances A. Rosamond. Editing to Cliques: A Survey of FPT Results and Recent Applications in Analyzing Large Datasets. 6th Latin-American Workshop on Cliques in Graphs, Editors: Celina M. H. de Figueiredo, Claudson Bornstein, Erika M. M. Coelho, Márcia R. Cappelle, Vol 44 (2016)
  • Michael R. Fellows, Danny Hermelin, Frances A. Rosamond, Hadas Shachnai. Tractable Parameterizations for the Minimum Linear Arrangement Problem. TOCT 8(2): 6:1-6:12 (2016)
  • Frances A. Rosamond: Max Leaf Spanning Tree. Encyclopedia of Algorithms 2016: 1211-1215.
  • Holger Dell, Thore Husfeldt, Bart M. P. Jansen, Petteri Kaski, Christian Komusiewicz, Frances Rosamond. The First Parameterized Algorithms and Computational Experiments Challenge. Published in IPEC Proceedings, Leibniz International Proceedings in Informatics (LIPIcs) series, Schloss Dagstuhl (2016)