default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIWOCA 2019: Pisa, Italy
- Charles J. Colbourn, Roberto Grossi, Nadia Pisanti:
Combinatorial Algorithms - 30th International Workshop, IWOCA 2019, Pisa, Italy, July 23-25, 2019, Proceedings. Lecture Notes in Computer Science 11638, Springer 2019, ISBN 978-3-030-25004-1 - Appattu Vallapil Prajeesh
, Krishnan Paramasivam, Nainarraj Kamatchi:
A Note on Handicap Incomplete Tournaments. 1-9 - Yeganeh Bahoo, Prosenjit Bose, Stephane Durocher, Thomas C. Shermer:
Computing the k-Crossing Visibility Region of a Point in a Polygon. 10-21 - Mirza Galib Anwarul Husain Baig, Deepanjan Kesh, Chirag Sodani:
An Improved Scheme in the Two Query Adaptive Bitprobe Model. 22-34 - Martin Balko, Sujoy Bhore, Leonardo Martínez-Sandoval, Pavel Valtr:
On Erdős-Szekeres-Type Problems for k-convex Point Sets. 35-47 - Sandip Banerjee, Sujoy Bhore:
Algorithm and Hardness Results on Liar's Dominating Set and \varveck -tuple Dominating Set. 48-60 - Aritra Banik, Ashwin Jacob, Vijay Kumar Paliwal, Venkatesh Raman:
Fixed-Parameter Tractability of (n-k) List Coloring. 61-69 - Magsarjav Bataa, Sung Gwan Park, Amihood Amir, Gad M. Landau, Kunsoo Park:
Finding Periods in Cartesian Tree Matching. 70-84 - Matthias Bentert, Roman Haag, Christian Hofer, Tomohiro Koana, André Nichterlein:
Parameterized Complexity of Min-Power Asymmetric Connectivity. 85-96 - Arindam Biswas, Venkatesh Raman, Saket Saurabh:
Solving Group Interval Scheduling Efficiently. 97-107 - Hans-Joachim Böckenhauer, Nina Corvelo Benz, Dennis Komm:
Call Admission Problems on Trees with Advice - (Extended Abstract). 108-121 - Pierre Cazals, Benoît Darties, Annie Chateau, Rodolphe Giroudeau, Mathias Weller:
Power Edge Set and Zero Forcing Set Remain Difficult in Cubic Graphs. 122-135 - Janka Chlebíková, Clément Dallard:
Towards a Complexity Dichotomy for Colourful Components Problems on k-caterpillars and Small-Degree Planar Graphs. 136-147 - Alessio Conte, Mamadou Moustapha Kanté, Andrea Marino, Takeaki Uno:
Maximal Irredundant Set Enumeration in Bounded-Degeneracy and Bounded-Degree Hypergraphs. 148-159 - Gennaro Cordasco, Luisa Gargano, Adele Anna Rescigno:
Dual Domination. 160-174 - Giordano Da Lozzo, Ignaz Rutter:
Reaching 3-Connectivity via Edge-Edge Additions. 175-187 - Sandip Das, Harmender Gahlawat, Uma Kant Sahoo, Sagnik Sen:
Cops and Robber on Some Families of Oriented Graphs. 188-200 - Zola Donovan, K. Subramani, Vahan Mkrtchyan:
Disjoint Clustering in Combinatorial Circuits. 201-213 - Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach:
The Hull Number in the Convexity of Induced Paths of Order 3. 214-228 - Dalibor Froncek, Jiangyi Qiu:
Supermagic Graphs with Many Odd Degrees. 229-236 - Rahul Raj Gupta, Sushanta Karmakar:
Incremental Algorithm for Minimum Cut and Edge Connectivity in Hypergraph. 237-250 - Michel Habib, Fabien de Montgolfier, Lalla Mouatadid, Mengchuan Zou:
A General Algorithmic Scheme for Modular Decompositions of Hypergraphs and Applications. 251-264 - Herman J. Haverkort, David Kübel, Elmar Langetepe:
Shortest-Path-Preserving Rounding. 265-277 - Michael A. Henning, Arti Pandey, Vikash Tripathi:
Complexity and Algorithms for Semipaired Domination in Graphs. 278-289 - Jesper Jansson, Konstantinos Mampentzidis, Ramesh Rajaby, Wing-Kin Sung:
Computing the Rooted Triplet Distance Between Phylogenetic Networks. 290-303 - Anjeneya Swami Kare, I. Vinod Reddy:
Parameterized Algorithms for Graph Burning Problem. 304-314 - Mehdi Khosravian Ghadikolaei, Nikolaos Melissinos, Jérôme Monnot, Aris Pagourtzis:
Extension and Its Price for the Connected Vertex Cover Problem. 315-326 - Yasuaki Kobayashi, Yusuke Kobayashi, Shuichi Miyazaki, Suguru Tamaki:
An Improved Fixed-Parameter Algorithm for Max-Cut Parameterized by Crossing Number. 327-338 - Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno, Hiroki Arimura:
An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs in Sparse Graphs. 339-351 - Juho Lauri, Christodoulos Mitillos:
Complexity of Fall Coloring for Restricted Graph Classes. 352-364 - Fumito Miyake, Eiji Takimoto, Kohei Hatano:
Succinct Representation of Linear Extensions via MDDs and Its Application to Scheduling Under Precedence Constraints. 365-377 - Lachlan Plant, Lucia Moura:
Maximum Clique Exhaustive Search in Circulant k-Hypergraphs. 378-392 - Srecko Brlek, Andrea Frosini, Ilaria Mancini, Elisa Pergola, Simone Rinaldi:
Burrows-Wheeler Transform of Words Defined by Morphisms. 393-404 - Suthee Ruangwises, Toshiya Itoh:
Stable Noncrossing Matchings. 405-416 - Florian Stober, Armin Weiß:
On the Average Case of MergeInsertion. 417-429 - Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Shortest Unique Palindromic Substring Queries on Run-Length Encoded Strings. 430-441 - Yuan Xue, Boting Yang, Farong Zhong, Sandra Zilles:
A Partition Approach to Lower Bounds for Zero-Visibility Cops and Robber. 442-454
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 2025-11-04 22:07 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:
