IWOCA C

31 papers

YearTitle / Authors
20112-Layer Right Angle Crossing Drawings.
Emilio Di Giacomo, Walter Didimo, Peter Eades, Giuseppe Liotta
2011A Golden Ratio Parameterized Algorithm for Cluster Editing.
Sebastian Böcker
2011A New View on Rural Postman Based on Eulerian Extension and Matching.
Manuel Sorge, René van Bevern, Rolf Niedermeier, Mathias Weller
2011A Unifying Property for Distribution-Sensitive Priority Queues.
Amr Elmasry, Arash Farzan, John Iacono
2011Acyclic Colorings of Graph Subdivisions.
Debajyoti Mondal, Rahnuma Islam Nishat, Sue Whitesides, Md. Saidur Rahman
2011Algorithmic Aspects of Dominator Colorings in Graphs.
S. Arumugam, K. Raja Chandrasekar, Neeldhara Misra, Geevarghese Philip, Saket Saurabh
2011An Algorithm for Road Coloring.
A. N. Trahtman
2011Combinatorial Algorithms - 22nd International Workshop, IWOCA 2011, Victoria, BC, Canada, July 20-22, 2011, Revised Selected Papers
Costas S. Iliopoulos, William F. Smyth
2011Complexity of Cycle Transverse Matching Problems.
Ross Churchley, Jing Huang, Xuding Zhu
2011Complexity of the Cop and Robber Guarding Game.
Robert Sámal, Rudolf Stolar, Tomás Valla
2011Efficient Codon Optimization with Motif Engineering.
Anne Condon, Chris Thachuk
2011Efficient Conditional Expectation Algorithms for Constructing Hash Families.
Charles J. Colbourn
2011Enumerating Tatami Mat Arrangements of Square Grids.
Alejandro Erickson, Mark Schurch
2011Generating All Simple Convexly-Drawable Polar Symmetric 6-Venn Diagrams.
Khalegh Mamakani, Wendy J. Myrvold, Frank Ruskey
2011Hamilton Cycles in Restricted Rotator Graphs.
Brett Stevens, Aaron Williams
2011Hamiltonian Orthogeodesic Alternating Paths.
Emilio Di Giacomo, Luca Grilli, Marcus Krug, Giuseppe Liotta, Ignaz Rutter
2011How Not to Characterize Planar-Emulable Graphs.
Markus Chimani, Martin Derka, Petr Hlinený, Matej Klusácek
2011Improved Steiner Tree Algorithms for Bounded Treewidth.
Markus Chimani, Petra Mutzel, Bernd Zey
2011Kinetic Euclidean Minimum Spanning Tree in the Plane.
Zahed Rahmati, Alireza Zarei
2011On Minimizing the Number of Label Transitions around a Vertex of a Planar Graph.
Bojan Mohar, Petr Skoda
2011Parameterized Longest Previous Factor.
Richard Beal, Donald A. Adjeroh
2011Periods in Partial Words: An Algorithm.
Francine Blanchet-Sadri, Travis Mandel, Gautam Sisodia
2011Quasi-Cyclic Codes over $\mathbb{F}_{13}$.
T. Aaron Gulliver
2011Ranking and Loopless Generation of k-ary Dyck Words in Cool-lex Order.
Stephane Durocher, Pak Ching Li, Debajyoti Mondal, Aaron Williams
2011Stable Sets of Threshold-Based Cascades on the Erdős-Rényi Random Graphs.
Ching-Lueh Chang, Yuh-Dauh Lyuu
2011Testing Monotone Read-Once Functions.
Dmitry V. Chistikov
2011The 1-Neighbour Knapsack Problem.
Glencora Borradaile, Brent Heeringa, Gordon T. Wilfong
2011The Rand and Block Distances of Pairs of Set Partitions.
Frank Ruskey, Jennifer Woodcock
2011Two Constant-Factor-Optimal Realizations of Adaptive Heapsort.
Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen
2011Weighted Improper Colouring.
Júlio Araújo, Jean-Claude Bermond, Frédéric Giroire, Frédéric Havet, Dorian Mazauric, Remigiusz Modrzejewski
2011p-Suffix Sorting as Arithmetic Coding.
Richard Beal, Donald A. Adjeroh