Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID10. WALCOM 2016: Kathmandu, Nepal
- Mohammad Kaykobad, Rossella Petreschi:
WALCOM: Algorithms and Computation - 10th International Workshop, WALCOM 2016, Kathmandu, Nepal, March 29-31, 2016, Proceedings. Lecture Notes in Computer Science 9627, Springer 2016, ISBN 978-3-319-30138-9
Invited Talk
- Costas S. Iliopoulos, Ritu Kundu
, Manal Mohamed, Fatima Vayani:
Popping Superbubbles and Discovering Clumps: Recent Developments in Biological Sequence Analysis. 3-14
Graphs Coloring
- Jean-Alexandre Anglès d'Auriac, Csilla Bujtás, Hakim El Maftouhi, Marek Karpinski, Yannis Manoussakis, Leandro Montero, Narayanan Narayanan, Laurent Rosaz, Johan Thapper, Zsolt Tuza:
Tropical Dominating Sets in Vertex-Coloured Graphs. 17-27 - Devsi Bantva:
On Hamiltonian Colorings of Block Graphs. 28-39 - Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Vincenzo Roselli:
Vertex-Coloring with Star-Defects. 40-51
Graphs Exploration
- Aditya Kumar Akash, Sándor P. Fekete, Seoung Kyou Lee, Alejandro López-Ortiz, Daniela Maftuleac, James McLurkin:
Lower Bounds for Graph Exploration Using Local Policies. 55-67 - Alejandro López-Ortiz, Daniela Maftuleac:
Optimal Distributed Searching in the Plane with and Without Uncertainty. 68-79 - Subhash Bhagat, Sruti Gan Chaudhuri, Krishnendu Mukhopadhyaya:
Formation of General Position by Asynchronous Mobile Robots Under One-Axis Agreement. 80-91
Graphs Algorithms
- Franz J. Brandenburg, Alexander Esch, Daniel Neuwirth:
On Aligned Bar 1-Visibility Graphs. 95-106 - Md. Iqbal Hossain, Sammi Abida Salma, Md. Saidur Rahman:
A Necessary Condition and a Sufficient Condition for Pairwise Compatibility Graphs. 107-113 - Stefan Felsner, Daniel Heldt:
Mixing Times of Markov Chains of 2-Orientations. 114-127
Computational Geometry
- Sang Won Bae:
Computing a Minimum-Width Square Annulus in Arbitrary Orientation - [Extended Abstract]. 131-142 - Prosenjit Bose, Jean-Lou De Carufel:
A General Framework for Searching on a Line. 143-153 - K. Subramani, Piotr Wojciechowski:
An Optimal Algorithm for Computing the Integer Closure of UTVPI Constraints. 154-165 - Hwan-Gue Cho, William S. Evans, Noushin Saeedi, Chan-Su Shin:
Covering Points with Convex Sets of Minimum Size. 166-178
Data Structures
- Biswajit Sanyal, Subhashis Majumder, Wing-Kai Hon:
Efficient Generation of Top-k Procurements in a Multi-item Auction. 181-193 - Farah Chanchary, Anil Maheshwari:
Counting Subgraphs in Relational Event Graphs. 194-206
Computational Complexity
- Matthias Mnich:
Large Independent Sets in Subquartic Planar Graphs. 209-221 - Mike Behrisch, Miki Hermann, Stefan Mengel, Gernot Salzer:
As Close as It Gets. 222-235 - Takeshi Yamada, Ryuhei Uehara:
Shortest Reconfiguration of Sliding Tokens on a Caterpillar. 236-248
Approximation Algorithms
- Toshihiro Fujito, Daichi Suzuki:
Fast and Simple Local Algorithms for 2-Edge Dominating Sets and 3-Total Vertex Covers. 251-262 - Barun Gorain, Partha Sarathi Mandal, Krishnendu Mukhopadhyaya:
Approximation Algorithms for Generalized Bounded Tree Cover. 263-273 - Dipan Lal Shaw, A. S. M. Shohidull Islam, Shuvasish Karmaker, M. Sohel Rahman:
Approximation Algorithms for Three Dimensional Protein Folding. 274-285 - Morito Oomine, Aleksandar Shurbevski, Hiroshi Nagamochi:
Parameterization of Strategy-Proof Mechanisms in the Obnoxious Facility Game. 286-297
On-line Algorithms
- Shun Hasegawa, Toshiya Itoh:
Optimal Online Algorithms for the Multi-objective Time Series Search Problem. 301-312 - Tiziana Calamoneri, Angelo Monti, Rossella Petreschi:
Fully Dynamically Maintaining Minimal Integral Separator for Threshold and Difference Graphs. 313-324
Algorithms
- Oliver G. Czibula, Hanyu Gu, Yakov Zinder:
A Lagrangian Relaxation-Based Heuristic to Solve Large Extended Graph Partitioning Problems. 327-338 - Alonso Gragera, Vorapong Suppakitpaisarn:
Semimetric Properties of Sørensen-Dice and Tversky Indexes. 339-350 - Varunkumar Jayapaul, Venkatesh Raman, Srinivasa Rao Satti:
Finding Mode Using Equality Comparisons. 351-360
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 05:26 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:
