default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIWOCA 2018: Singapore
- Costas S. Iliopoulos, Hon Wai Leong, Wing-Kin Sung:
Combinatorial Algorithms - 29th International Workshop, IWOCA 2018, Singapore, July 16-19, 2018, Proceedings. Lecture Notes in Computer Science 10979, Springer 2018, ISBN 978-3-319-94666-5 - Jammigumpula Ajay, Sasanka Roy:
Collision-Free Routing Problem with Restricted L-Path. 1-13 - Bogdan Alecu
, Vadim V. Lozin, Viktor Zamaraev:
Linear Clique-Width of Bi-complement Reducible Graphs. 14-25 - Aistis Atminas, Vadim V. Lozin, Viktor Zamaraev:
Linear Ramsey Numbers. 26-38 - Pierluigi Baiocchi, Tiziana Calamoneri, Angelo Monti, Rossella Petreschi:
Graphs that Are Not Pairwise Compatible: A New Proof Technique (Extended Abstract). 39-51 - Thaís Bardini Idalino, Lucia Moura:
Efficient Unbounded Fault-Tolerant Aggregate Signatures Using Nested Cover-Free Families. 52-64 - Moritz Beck, Sabine Storandt:
Minimum Polygons for Fixed Visibility VC-Dimension. 65-77 - Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh:
Minsum k-Sink Problem on Dynamic Flow Path Networks. 78-89 - Alexandre Blondin Massé, Julien de Carufel, Alain Goupil, Mélodie Lapointe, Émile Nadeau, Élise Vandomme:
Fully Leafed Induced Subtrees. 90-101 - Laurent Bulteau, Romeo Rizzi, Stéphane Vialette:
Pattern Matching for k-Track Permutations. 102-114 - Li-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung, Ralf Klasing:
Approximation Algorithms for the p-Hub Center Routing Problem in Parameterized Metric Graphs. 115-127 - Barbara Covella, Fabrizio Frati, Maurizio Patrignani:
On the Area Requirements of Straight-Line Orthogonal Drawings of Ternary Trees. 128-140 - Christine Dahn, Nils M. Kriege, Petra Mutzel:
A Fixed-Parameter Algorithm for the Max-Cut Problem on Embedded 1-Planar Graphs. 141-152 - Riccardo Dondi, Giancarlo Mauri, Florian Sikora, Italo Zoppis:
Covering with Clubs: Complexity and Approximability. 153-164 - Philippe Duchon, Cyril Nicaud:
On the Expected Number of Distinct Gapped Palindromic Factors. 165-176 - Tianfeng Feng, Takashi Horiyama, Yoshio Okamoto, Yota Otachi, Toshiki Saitoh, Takeaki Uno, Ryuhei Uehara:
Computational Complexity of Robot Arm Simulation Problems. 177-188 - Kristoffer Kleine, Ilias S. Kotsireas, Dimitris E. Simos:
Evaluation of Tie-Breaking and Parameter Ordering for the IPO Family of Algorithms Used in Covering Array Generation. 189-200 - Kazuhiro Kurita, Kunihiro Wasa, Alessio Conte, Takeaki Uno, Hiroki Arimura:
Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth. 201-213 - Christine Markarian:
An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest. 214-223 - Robin Milosz, Sylvie Hamel, Adeline Pierrot:
Median of 3 Permutations, 3-Cycles and 3-Hitting Set Problem. 224-236 - Neeldhara Misra:
On the Parameterized Complexity of Colorful Components and Related Problems. 237-249 - Takaaki Mizuki, Yuichi Komano:
Analysis of Information Leakage Due to Operative Errors in Card-Based Protocols. 250-262 - Hiroki Morizumi:
Zero-Suppression and Computation Models. 263-272 - Petra Mutzel, Lutz Oettershagen:
The Crossing Number of Seq-Shellable Drawings of Complete Graphs. 273-284 - Mikito Nanashima:
Cryptographic Limitations on Polynomial-Time a Posteriori Query Learning. 285-297 - Yen Kaow Ng, Wenlong Jia, Shuai Cheng Li:
Placing Segments on Parallel Arcs. 298-310 - Alexey Nikolaev, Mikhail Batsyn:
Branch-and-Bound Algorithm for Symmetric Travelling Salesman Problem. 311-322 - Tatsuya Ohno, Keisuke Goto, Yoshimasa Takabatake, Tomohiro I, Hiroshi Sakamoto:
LZ-ABT: A Practical Algorithm for α-Balanced Grammar Compression. 323-335 - Rameshwar Pratap, Sandeep Sen:
Faster Coreset Construction for Projective Clustering via Low-Rank Approximation. 336-348 - Stephen A. Seidel, Kaushik Sarkar, Charles J. Colbourn, Violet R. Syrotiuk:
Separating Interaction Effects Using Locating and Detecting Arrays. 349-360 - Kentaro Sumigawa, Kunihiko Sadakane:
An Efficient Representation of Partitions of Integers. 361-373 - Jean-François Culus, Sophie Toulouse:
How Far From a Worst Solution a Random Solution of a kCSP Instance Can Be? 374-386
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-01-10 18:20 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:
