default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIWOCA 2017: Newcastle, NSW, Australia
- Ljiljana Brankovic
, Joe Ryan, William F. Smyth:
Combinatorial Algorithms - 28th International Workshop, IWOCA 2017, Newcastle, NSW, Australia, July 17-21, 2017, Revised Selected Papers. Lecture Notes in Computer Science 10765, Springer 2018, ISBN 978-3-319-78824-1
Invited Papers
- Martin Baca, Nurdin Hinding, Aisha Javed, Andrea Semanicová-Fenovcíková:
Entire H-irregularity Strength of Plane Graphs. 3-12 - Diane M. Donovan, Thomas A. McCourt:
Combinatorial Questions: How Can Graph Labelling Help? 13-23 - Henning Fernau:
Extremal Kernelization: A Commemorative Paper. 24-36 - Mai Alzamel, Costas S. Iliopoulos:
Recent Advances of Palindromic Factorization. 37-46 - Nikolay A. Balonin, Jennifer Seberry:
A Construction for 0, 1, -1 Orthogonal Matrices Visualized. 47-57
Approximation Algorithms and Hardness
- Markus Chimani, Stefan Felsner, Stephen G. Kobourov, Torsten Ueckerdt, Pavel Valtr, Alexander Wolff:
On the Maximum Crossing Number. 61-74 - Federico Della Croce, Ulrich Pferschy, Rosario Scatamacchia:
Approximation Results for the Incremental Knapsack Problem. 75-87 - Hiroki Oshima:
Derandomization for k-Submodular Maximization. 88-99
Computational Complexity
- Akanksha Agrawal:
On the Parameterized Complexity of Happy Vertex Coloring. 103-115 - Nathann Cohen, Frédéric Havet, Dorian Mazauric, Ignasi Sau, Rémi Watrigant:
Complexity Dichotomies for the Minimum ℱ -Overlay Problem. 116-127 - Benoît Darties, Annie Chateau, Rodolphe Giroudeau, Mathias Weller:
Improved Complexity for Power Edge Set Problem. 128-141 - Neeldhara Misra, I. Vinod Reddy:
The Parameterized Complexity of Happy Colorings. 142-153 - Narayan Vikas:
Computational Complexity Relationship between Compaction, Vertex-Compaction, and Retraction. 154-166
Computational Geometry
- Oswin Aichholzer, Martin Balko, Thomas Hackl, Alexander Pilz, Pedro Ramos, Pavel Valtr, Birgit Vogtenhuber:
Holes in 2-Convex Point Sets. 169-181
Graphs and Combinatorics
- Vadim V. Lozin:
Graph Parameters and Ramsey Theory. 185-194 - Bogdan Alecu, Vadim V. Lozin, Viktor Zamaraev, Dominique de Werra:
Letter Graphs and Geometric Grid Classes of Permutations: Characterization and Recognition. 195-205 - Alexandre Blondin Massé, Julien de Carufel, Alain Goupil, Maxime Samson:
Fully Leafed Tree-Like Polyominoes and Polycubes. 206-218 - Hovhannes A. Harutyunyan, Zhiyuan Li:
Improved Lower Bound on Broadcast Function Based on Graph Partition. 219-230
Graph Colourings, Labelings and Power Domination
- Uwe Schauz:
Orientations of 1-Factors and the List Edge Coloring Conjecture. 233-243 - Michel Vasquez, Yannick Vimont:
On Solving the Queen Graph Coloring Problem. 244-251 - Matej Konecný, Stanislav Kucera, Jana Novotná, Jakub Pekárek, Stepán Simsa, Martin Töpfer:
Minimal Sum Labeling of Graphs. 252-263 - Cyriac Grigorious, Thomas Kalinowski, Sudeep Stephen:
On the Power Domination Number of de Bruijn and Kautz Digraphs. 264-272
Heuristics
- Sergiu Carpov, Pascal Aubry, Renaud Sirdey:
A Multi-start Heuristic for Multiplicative Depth Minimization of Boolean Circuits. 275-286 - Rhydian Lewis, Kate Smith-Miles, Kyle Phillips:
The School Bus Routing Problem: An Analysis and Algorithm. 287-298 - Robin Milosz, Sylvie Hamel:
Heuristic, Branch-and-Bound Solver and Improved Space Reduction for the Median of Permutations Problem. 299-311 - Hanyu Gu, Julia Memar, Yakov Zinder:
Efficient Lagrangian Heuristics for the Two-Stage Flow Shop with Job Dependent Buffer Requirements. 312-324
Mixed Integer Programming
- Sven Mallach:
Linear Ordering Based MIP Formulations for the Vertex Separation or Pathwidth Problem. 327-340
Polynomial Algorithms
- Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis:
How to Answer a Small Batch of RMQs or LCA Queries in Practice. 343-355 - Ramesh Rajaby, Wing-Kin Sung:
Computing Asymmetric Median Tree of Two Trees via Better Bipartite Matching Algorithm. 356-367
Privacy
- Josep Domingo-Ferrer:
Privacy-Preserving and Co-utile Distributed Social Credit. 371-382 - Andrei Kelarev, Jennifer Seberry, Leanne Rylands, Xun Yi:
Combinatorial Algorithms and Methods for Security of Statistical Databases Related to the Work of Mirka Miller. 383-394
String Algorithms
- Yuto Nakashima, Hiroe Inoue, Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Shortest Unique Palindromic Substring Queries in Optimal Time. 397-408 - Tatsuya Ohno, Yoshimasa Takabatake, Tomohiro I, Hiroshi Sakamoto:
A Faster Implementation of Online Run-Length Burrows-Wheeler Transform. 409-419 - Shiho Sugimoto, Naoki Noda, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Computing Abelian String Regularities Based on RLE. 420-431
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-02 21:14 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
