Accepted Papers

IWOCA 2017 List of Accepted Papers

  1. Nathann Cohen, Frédéric Havet, Dorian Mazauric, Ignasi Sau and Rémi Watrigant. Complexity Dichotomies for the Minimum F-Overlay Problem.
  2. Markus Chimani, Stefan Felsner, Stephen Kobourov, Torsten Ueckerdt, Pavel Valtr and Alexander Wolff. On the Maximum Crossing Number.
  3. Vadim Lozin. Graph Parameters and Ramsey Theory.
  4. Oswin Aichholzer, Martin Balko, Thomas Hackl, Alexander Pilz, Pedro Ramos, Pavel Valtr and Birgit Vogtenhuber. Holes in 2-convex point sets.
  5. Akanksha Agrawal. On the Parameterized Complexity of Happy Vertex Coloring.
  6. Robin Milosz and Sylvie Hamel. Heuristic, Branch-and-Bound Solver and Improved Space Reduction for the Median of Permutations Problem.
  7. Benoit Darties, Annie Chateau, Rodolphe Giroudeau and Matthias Weller. Improved Complexity for Power Edge Set Problem.
  8. John Ellis and Ulrike StegeA Practical, Provably Average Case Linear Time, In-place and Stable Merge Algorithm via the Perfect Shuffle
  9. Tatsuya Ohno, Yoshimasa Takabatake, Tomohiro I and Hiroshi Sakamoto. A Faster Implementation of Online Run-Length Burrows-Wheeler Transform.
  10. Narayan Vikas. Computational Complexity Relationship between Compaction, Vertex-Compaction, and Retraction.
  11. Cyriac Grigorious, Thomas Kalinowski and Sudeep Stephen. On the power domination number of de Bruijn and Kautz digraphs.
  12. Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos and Solon P. PissisHow to answer a small batch of RMQs or LCA queries in practice
  13. Matěj Konečný, Stanislav Kučera, Jana Novotná, Jakub Pekárek, Štěpán Šimsa and Martin Töpfer. Minimal Sum Labeling of Graphs.
  14. Hanyu Gu, Julia Memar and Yakov Zinder. Efficient Lagrangian Heuristics for the Two-Stage Flow Shop with Job Dependant Buffer Requirements.
  15. Ramesh Rajaby and Wing-Kin Sung. Interval-based maximum bipartite matching and its application to summarize two trees.
  16. Hiroki Oshima. Derandomization for k-submodular maximization.
  17. Sven Mallach. Linear Ordering Based MIP Formulations for the Vertex Separation or Pathwidth Problem.
  18. Alexandre Blondin Massé, Julien de Carufel, Alain Goupil and Maxime Samson. Fully Leafed Tree-Like Polyominoes and Polycubes.
  19. Federico Della Croce, Ulrich Pferschy and Rosario Scatamacchia. Approximation Results for the Incremental Knapsack Problem.
  20. Michel Vasquez and Yannick Vimont. On solving the queen graph coloring problem.
  21. Josep Domingo-Ferrer. Privacy-Preserving and Co-Utile Distributed Social Credit.
  22. Bogdan Alecu, Vadim Lozin, Victor Zamaraev and Dominique de Werra. Letter graphs and geometric grid classes of permutations: characterization and recognition.
  23. Sergiu Carpov, Pascal Aubry and Renaud Sirdey. A multi-start heuristic for multiplicative depth minimization of boolean circuits.
  24. Andrei Kelarev, Jennifer Seberry, Leanne Rylands and Xun Yi. Combinatorial algorithms and methods for security of statistical databases related to the work of Mirka Miller.
  25. Shiho Sugimoto, Naoki Noda, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda. Computing Abelian string regularities based on RLE.
  26. Yuto Nakashima, Hiroe Inoue, Takuya Mieno, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda. Shortest Unique Palindromic Substring Queries in Optimal Time.
  27. Hovhannes Harutyunyan and Zhiyuan Li. Improved lower bound on broadcast function based on graph partition.
  28. Uwe Schauz. Orientations of 1-Factorizations and the List Chromatic Index of Small Graphs.
  29. Rhydian Lewis, Kate Smith-Miles and Kyle Phillips. The School Bus Routing Problem: An Analysis and Algorithm.
  30. Neeldhara Misra and I. Vinod Reddy. The Parameterized Complexity of Happy Colorings.