Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID11. WALCOM 2017: Hsinchu, Taiwan
- Sheung-Hung Poon
, Md. Saidur Rahman, Hsu-Chun Yen:
WALCOM: Algorithms and Computation, 11th International Conference and Workshops, WALCOM 2017, Hsinchu, Taiwan, March 29-31, 2017, Proceedings. Lecture Notes in Computer Science 10167, Springer 2017, ISBN 978-3-319-53924-9
Invited Talk
- Etsuji Tomita:
Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications. 3-15
Computational Geometry I
- Koji Ouchi, Ryuhei Uehara:
Efficient Enumeration of Flat-Foldable Single Vertex Crease Patterns. 19-29 - N. K. Blanchard, Nicolas Schabanel:
Dynamic Sum-Radii Clustering. 30-41 - Arash Vaezi, Mohammad Ghodsi:
How to Extend Visibility Polygons by Mirrors to Cover Invisible Segments. 42-53 - Therese Biedl, Timothy M. Chan, Stephanie Lee, Saeed Mehrabi, Fabrizio Montecchiani, Hamideh Vosoughpour:
On Guarding Orthogonal Polygons with Sliding Cameras. 54-65 - Jong Min Choi, Dongwoo Park, Hee-Kap Ahn:
Bundling Two Simple Polygons to Minimize Their Convex Hull. 66-77
Combinatorial Optimization
- Koichi Yamazaki:
Tangle and Maximal Ideal. 81-92 - Dong Yeap Kang, O-joung Kwon, Torstein J. F. Strømme, Jan Arne Telle:
A Width Parameter Useful for Chordal and Co-comparability Graphs. 93-105 - Masashi Tsuchida, Fukuhito Ooshita, Michiko Inoue:
Byzantine Gathering in Networks with Authenticated Whiteboards. 106-118 - Jun Kawahara, Takashi Horiyama, Keisuke Hotta, Shin-ichi Minato:
Generating All Patterns of Graph Partitions Within a Disparity Bound. 119-131
Graph Drawing
- Felice De Luca, Emilio Di Giacomo, Walter Didimo, Stephen G. Kobourov, Giuseppe Liotta:
An Experimental Study on the Ply Number of Straight-Line Drawings. 135-148 - Quirijn W. Bouts, Bettina Speckmann, Kevin Verbeek:
Complexity Measures for Mosaic Drawings. 149-160 - Rafael G. Cano, Cid C. de Souza, Pedro J. de Rezende:
Fast Optimal Labelings for Rotating Maps. 161-173
Graph Algorithms I
- Asahi Takaoka:
Recognizing Simple-Triangle Graphs by Restricted 2-Chain Subgraph Cover. 177-189 - Fritz Bökler, Petra Mutzel:
Tree-Deletion Pruning in Label-Correcting Algorithms for the Multiobjective Shortest Path Problem. 190-203 - Hugo A. Akitaya, Rajasekhar Inkulu, Torrie L. Nichols, Diane L. Souvaine, Csaba D. Tóth, Charles R. Winston:
Minimum Weight Connectivity Augmentation for Planar Straight-Line Graphs. 204-216 - Miroslaw Kowaluk, Andrzej Lingas:
A Fast Deterministic Detection of Small Pattern Graphs in Graphs Without Large Cliques. 217-227 - Hiroshi Eto, Takehiro Ito, Zhilong Liu, Eiji Miyano:
Approximation Algorithm for the Distance-3 Independent Set Problem on Cubic Graphs. 228-240
Computational Geometry II
- Chun Chen, Francis C. M. Lau, Sheung-Hung Poon, Yong Zhang, Rong Zhou:
Online Inserting Points Uniformly on the Sphere. 243-253 - Eunjin Oh, Hee-Kap Ahn:
Computing the Center Region and Its Variants. 254-265 - Mohammad Ali Abam, Fatemeh Baharifard, Mohammad Sadegh Borouny, Hamid Zarrabi-Zadeh:
Fault-Tolerant Spanners in Networks with Symmetric Directional Antennas. 266-278 - Subhash Bhagat, Krishnendu Mukhopadhyaya:
Gathering Asynchronous Robots in the Presence of Obstacles. 279-291
Space-Efficient Algorithms
- Kengo Nakamura, Kunihiko Sadakane:
A Space-Efficient Algorithm for the Dynamic DFS Problem in Undirected Graphs. 295-307 - Yeganeh Bahoo, Bahareh Banyassady, Prosenjit Bose, Stephane Durocher, Wolfgang Mulzer:
Time-Space Trade-Off for Finding the k-Visibility Region of a Point in a Polygon. 308-319 - Toshiki Saitoh, David G. Kirkpatrick:
Space-Efficient and Output-Sensitive Implementations of Greedy Algorithms on Intervals. 320-332
Computational Complexity
- Yang Jiao, R. Ravi, Wolfgang Gatterbauer:
Algorithms for Automatic Ranking of Participants and Tasks in an Anonymized Contest. 335-346 - Hiroki Osawa, Akira Suzuki, Takehiro Ito, Xiao Zhou:
The Complexity of (List) Edge-Coloring Reconfiguration Problem. 347-358 - Kensuke Imanishi:
An Upper Bound for Resolution Size: Characterization of Tractable SAT Instances. 359-369
Approximation Algorithms
- Parinya Chalermsook, Andreas Schmid:
Finding Triangles for Maximum Planar Subgraphs. 373-384 - Zhi-Zhong Chen, Youta Harada, Fei Guo, Lusheng Wang:
An Approximation Algorithm for Maximum Internal Spanning Tree. 385-396 - Yuko Kuroki, Tomomi Matsui:
Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems. 397-408 - Klaus Jansen, Malin Rau:
Improved Approximation for Two Dimensional Strip Packing with Polynomial Bounded Width. 409-420 - Ei Ando:
An FPTAS for Computing the Distribution Function of the Longest Path Length in DAGs with Uniformly Distributed Edge Lengths. 421-432
Graph Algorithms II
- Katsuhisa Yamanaka, Erik D. Demaine, Takashi Horiyama, Akitoshi Kawamura, Shin-Ichi Nakano, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno:
Sequentially Swapping Colored Tokens on Graphs. 435-447 - Jun Kawahara, Toshiki Saitoh, Ryo Yoshinaka:
The Time Complexity of the Token Swapping Problem and Its Parallel Variants. 448-459 - Duc A. Hoang, Eli Fox-Epstein, Ryuhei Uehara:
Sliding Tokens on Block Graphs. 460-471
a service of 
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-04-25 22:00 CEST 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:
