Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 27 matches
- 2021
- Haitao Wang, Yiming Zhao:
Algorithms for Diameters of Unicycle Graphs and Diameter-Optimally Augmenting Trees. WALCOM 2021: 27-39 - Oswin Aichholzer, Alan Arroyo, Zuzana Masárová, Irene Parada, Daniel Perz, Alexander Pilz, Josef Tkadlec, Birgit Vogtenhuber:
On Compatible Matchings. WALCOM 2021: 221-233 - Elena Arseneva, Pilar Cano, Linda Kleist, Tamara Mchedlidze, Saeed Mehrabi, Irene Parada, Pavel Valtr:
Upward Point Set Embeddings of Paths and Trees. WALCOM 2021: 234-246 - Tetsuo Asano:
A New Transportation Problem on a Graph with Sending and Bringing-Back Operations. WALCOM 2021: 13-24 - Mahdi Belbasi, Martin Fürer:
An Improvement of Reed's Treewidth Approximation. WALCOM 2021: 166-181 - Ahmad Biniaz:
Better Approximation Algorithms for Maximum Weight Internal Spanning Trees in Cubic Graphs and Claw-Free Graphs. WALCOM 2021: 260-271 - Prosenjit Bose, Saeed Mehrabi, Debajyoti Mondal:
Faster Multi-sided One-Bend Boundary Labelling. WALCOM 2021: 116-128 - Thomas Byrne, Sándor P. Fekete, Jörg Kalcsics, Linda Kleist:
Competitive Location Problems: Balanced Facility Location and the One-Round Manhattan Voronoi Game. WALCOM 2021: 103-115 - Alessio Conte, Etsuji Tomita:
Overall and Delay Complexity of the CLIQUES and Bron-Kerbosch Algorithms. WALCOM 2021: 195-207 - Jurek Czyzowicz, Konstantinos Georgiou, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Denis Pankratov:
The Bike Sharing Problem. WALCOM 2021: 65-77 - Umesh Sandeep Danda, G. Ramakrishna, Jens M. Schmidt, Mithinti Srikanth:
On Short Fastest Paths in Temporal Graphs. WALCOM 2021: 40-51 - Bireswar Das, Shivdutt Sharma:
Compact Data Structures for Dedekind Groups and Finite Rings. WALCOM 2021: 90-102 - Tetsuya Fujie, Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Yuki Tokuni:
Minmax Regret 1-Sink Location Problems on Dynamic Flow Path Networks with Parametric Weights. WALCOM 2021: 52-64 - Emilio Di Giacomo, Jaroslav Hancl, Giuseppe Liotta:
2-Colored Point-Set Embeddings of Partial 2-Trees. WALCOM 2021: 247-259 - Frank Gurski, Dominique Komander, Marvin Lindemann:
Homomorphisms to Digraphs with Large Girth and Oriented Colorings of Minimal Series-Parallel Digraphs. WALCOM 2021: 182-194 - Tesshu Hanaka, Kazuma Kawai, Hirotaka Ono:
Computing L(p, 1)-Labeling with Combined Parameters. WALCOM 2021: 208-220 - Mohammad Kaykobad, Franz J. M. Salzborn:
Majority Spanning Trees, Cotrees and Their Applications. WALCOM 2021: 3-12 - Soh Kumabe, Takanori Maehara:
r-Gathering Problems on Spiders: Hardness, FPT Algorithms, and PTASes. WALCOM 2021: 154-165 - Raghunath Reddy Madireddy, Subhas C. Nandy, Supantha Pandit:
On the Geometric Red-Blue Set Cover Problem. WALCOM 2021: 129-141 - Ko Minamisawa, Ryuhei Uehara, Masao Hara:
Mathematical Characterizations and Computational Complexity of Anti-slide Puzzles. WALCOM 2021: 321-332 - Debajyoti Mondal, N. Parthiban, V. Kavitha, Indra Rajasingh:
APX-Hardness and Approximation for the k-Burning Number Problem. WALCOM 2021: 272-283 - Soma Murata, Daiki Miyahara, Takaaki Mizuki, Hideaki Sone:
Efficient Generation of a Card-Based Uniformly Distributed Random Derangement. WALCOM 2021: 78-89 - Suthee Ruangwises, Toshiya Itoh:
Physical Zero-Knowledge Proof for Ripple Effect. WALCOM 2021: 296-307 - Kwon Kham Sai, Ryuhei Uehara, Giovanni Viglietta:
Cyclic Shift Problems on Graphs. WALCOM 2021: 308-320 - Toshiki Saitoh, Ryo Yoshinaka, Hans L. Bodlaender:
Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to Interval Graph Classes. WALCOM 2021: 142-153 - Kazuaki Yamazaki, Mengze Qian, Ryuhei Uehara:
Efficient Enumeration of Non-isomorphic Distance-Hereditary Graphs and Ptolemaic Graphs. WALCOM 2021: 284-295 - Ryuhei Uehara, Seok-Hee Hong, Subhas C. Nandy:
WALCOM: Algorithms and Computation - 15th International Conference and Workshops, WALCOM 2021, Yangon, Myanmar, February 28 - March 2, 2021, Proceedings. Lecture Notes in Computer Science 12635, Springer 2021, ISBN 978-3-030-68210-1 [contents]
loading more results
failed to load more results, please try again later
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-06-03 21:33 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint