Остановите войну!
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 31 matches
- 2024
- Jingyang Zhao, Mingyu Xiao:
Improved Approximation Algorithms for Cycle and Path Packings. WALCOM 2024: 179-193 - Oleg Verbitsky, Maksim Zhukovskii:
Canonization of a Random Circulant Graph by Counting Walks. WALCOM 2024: 319-334 - Ruoying Li, Sabine Storandt:
Exact and Approximate Hierarchical Hub Labeling. WALCOM 2024: 194-211 - N. R. Aravind, Roopam Saxena:
The Parameterized Complexity of Terminal Monitoring Set. WALCOM 2024: 76-90 - Mark de Berg, Andrés López Martínez, Frits C. R. Spieksma:
Stable and Dynamic Minimum Cuts. WALCOM 2024: 273-287 - Adri Bhattacharya, Giuseppe F. Italiano, Partha Sarathi Mandal:
Black Hole Search in Dynamic Cactus Graph. WALCOM 2024: 288-303 - Cornelius Brand, Viktoriia Korchemna, Kirill Simonov, Michael Skotnica:
Counting Vanishing Matrix-Vector Products. WALCOM 2024: 335-349 - Deniz Agaoglu Çagirici, Peter Zeman:
Recognition and Isomorphism of Proper $\boldsymbol{H}$-Graphs for Unicyclic $\boldsymbol{H}$ in FPT-Time. WALCOM 2024: 304-318 - Susanna Caroppo, Giordano Da Lozzo, Giuseppe Di Battista:
Quantum Graph Drawing. WALCOM 2024: 32-46 - T.-H. Hubert Chan, Gramoz Goranci, Shaofeng H.-C. Jiang, Bo Wang, Quan Xue:
Fully Dynamic Algorithms for Euclidean Steiner Tree. WALCOM 2024: 62-75 - Julien Courtiel, Paul Dorbec, Tatsuya Gima, Romain Lecoq, Yota Otachi:
Orientable Burning Number of Graphs. WALCOM 2024: 377-391 - Thomas Depian, Alexander Dobler, Christoph Kern, Jules Wulms:
Minimizing Corners in Colored Rectilinear Grids. WALCOM 2024: 134-148 - Naoki Domon, Akira Suzuki, Yuma Tamura, Xiao Zhou:
The Shortest Path Reconfiguration Problem Based on Relaxation of Reconfiguration Rules. WALCOM 2024: 227-241 - Guilherme Dias da Fonseca, Yan Gerard, Bastien Rivier:
Short Flip Sequences to Untangle Segments in the Plane. WALCOM 2024: 163-178 - Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Ryota Murai, Hirotaka Ono, Yota Otachi:
Structural Parameterizations of Vertex Integrity. WALCOM 2024: 406-420 - Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Yota Otachi, Tomohito Shirai, Akira Suzuki, Yuma Tamura, Xiao Zhou:
On the Complexity of List H-Packing for Sparse Graph Classes. WALCOM 2024: 421-435 - Tatsuya Gima, Soh Kumabe, Kazuhiro Kurita, Yuto Okada, Yota Otachi:
Dichotomies for Tree Minor Containment with Structural Parameters. WALCOM 2024: 392-405 - Carolina Haase, Philipp Kindermann:
On Layered Area-Proportional Rectangle Contact Representations. WALCOM 2024: 149-162 - Gordon Hoi, Sanjay Jain, Ammar Fathin Sabili, Frank Stephan:
A Bisection Approach to Subcubic Maximum Induced Matching. WALCOM 2024: 257-272 - Jeffrey Kam, Shahin Kamali, Avery Miller, Naomi Nishimura:
Reconfiguration of Multisets with Applications to Bin Packing. WALCOM 2024: 212-226 - Julia Katheder, Stephen G. Kobourov, Axel Kuckuk, Maximilian Pfister, Johannes Zink:
Simultaneous Drawing of Layered Trees. WALCOM 2024: 47-61 - Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Fabrizio Grosso, Maurizio Patrignani:
Efficient Enumeration of Drawings and Combinatorial Structures for Maximal Planar Graphs. WALCOM 2024: 350-364 - Arturo I. Merino, Namrata, Aaron Williams:
On the Hardness of Gray Code Problems for Combinatorial Objects. WALCOM 2024: 103-117 - Shin-ichi Minato:
Recent Research Activities on Algorithmic Foundations for Social Advancement. WALCOM 2024: 1-8 - Shin-Ichi Nakano:
(t, s)-Completely Independent Spanning Trees. WALCOM 2024: 365-376 - Naomi Nishimura:
Reasons to Fall (More) in Love with Combinatorial Reconfiguration. WALCOM 2024: 9-14 - Fahad Panolan, Hannane Yaghoubizade:
On MAX-SAT with Cardinality Constraint. WALCOM 2024: 118-133 - Csaba D. Tóth:
Plane Multigraphs with One-Bend and Circular-Arc Edges of a Fixed Angle. WALCOM 2024: 15-31 - Dennis Wong, Bowie Liu, Chan-Tong Lam, Marcus Im:
Generating Cyclic 2-Gray Codes for Fibonacci q-Decreasing Words. WALCOM 2024: 91-102 - Yuya Yamada, Mutsunori Banbara, Katsumi Inoue, Torsten Schaub, Ryuhei Uehara:
Combinatorial Reconfiguration with Answer Set Programming: Algorithms, Encodings, and Empirical Analysis. WALCOM 2024: 242-256
skipping 1 more match
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-05-21 05:35 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