![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
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 33 matches
- 2023
- A. Karim Abu-Affash, Paz Carmi, Meytal Maman:
Piercing Diametral Disks Induced by Edges of Maximum Spanning Trees. WALCOM 2023: 71-77 - Oswin Aichholzer
, Kristin Knorr
, Wolfgang Mulzer
, Johannes Obenaus
, Rosna Paul
, Birgit Vogtenhuber
:
Flipping Plane Spanning Paths. WALCOM 2023: 49-60 - Tetsuya Araki, Shin-Ichi Nakano:
Away from Each Other. WALCOM 2023: 61-70 - N. R. Aravind, Roopam Saxena:
Parameterized Complexity of Path Set Packing. WALCOM 2023: 291-302 - Gennaro Cordasco
, Luisa Gargano, Adele A. Rescigno
:
Groups Burning: Analyzing Spreading Processes in Community-Based Networks. WALCOM 2023: 330-342 - Stephane Durocher, J. Mark Keil, Debajyoti Mondal
:
Minimum Ply Covering of Points with Unit Squares. WALCOM 2023: 23-35 - Guilherme Dias da Fonseca
, Yan Gerard
, Bastien Rivier
:
On the Longest Flip Sequence to Untangle Segments in the Plane. WALCOM 2023: 102-112 - Ameet Gadekar:
On the Parameterized Complexity of Compact Set Packing. WALCOM 2023: 359-370 - Prashant Gokhale, J. Mark Keil, Debajyoti Mondal
:
Improved and Generalized Algorithms for Burning a Planar Point Set. WALCOM 2023: 90-101 - Martin Gronemann, Martin Nöllenburg, Anaïs Villedieu:
Splitting Plane Graphs to Outerplanarity. WALCOM 2023: 217-228 - Roberto Grossi
, Costas S. Iliopoulos
, Jesper Jansson
, Zara Lim
, Wing-Kin Sung
, Wiktor Zuba
:
Finding the Cyclic Covers of a String. WALCOM 2023: 139-150 - Duc A. Hoang
:
On the Complexity of Distance-d Independent Set Reconfiguration. WALCOM 2023: 254-266 - Giuseppe F. Italiano
, Athanasios L. Konstantinidis, Charis Papadopoulos
:
Structural Parameterization of Cluster Deletion. WALCOM 2023: 371-383 - Varunkumar Jayapaul, Seungbum Jo, Krishna V. Palem, Srinivasa Rao Satti:
Energy Efficient Sorting, Selection and Searching. WALCOM 2023: 179-190 - Michael Kaufmann
:
The Family of Fan-Planar Graphs. WALCOM 2023: 12-19 - Jun Kawahara
, Toshiki Saitoh
, Hirokazu Takeda, Ryo Yoshinaka
, Yui Yoshioka:
Efficient Non-isomorphic Graph Enumeration Algorithms for Subclasses of Perfect Graphs. WALCOM 2023: 151-163 - Jan Kratochvíl
:
Graph Covers: Where Topology Meets Computer Science, and Simple Means Difficult. WALCOM 2023: 3-11 - Koshiro Kumagai, Diptarama Hendrian
, Ryo Yoshinaka
, Ayumi Shinohara:
Inferring Strings from Position Heaps in Linear Time. WALCOM 2023: 115-126 - Huong Luu, Marek Chrobak:
Better Hardness Results for the Minimum Spanning Tree Congestion Problem. WALCOM 2023: 167-178 - Virginia Ardévol Martínez
, Florian Sikora
, Stéphane Vialette
:
Parity Permutation Pattern Matching. WALCOM 2023: 384-395 - Ulrich Meyer, Hung Tran, Konstantinos Tsakalidis:
Certifying Induced Subgraphs in Large Graphs. WALCOM 2023: 229-241 - Kazuki Mitani, Takuya Mieno, Kazuhisa Seto
, Takashi Horiyama:
Internal Longest Palindrome Queries in Optimal Time. WALCOM 2023: 127-138 - A. Mohanapriya, P. Renjith, N. Sadagopan:
Roman k-Domination: Hardness, Approximation and Parameterized Results. WALCOM 2023: 343-355 - Angelo Monti
, Blerina Sinaimeri
:
On Star-Multi-interval Pairwise Compatibility Graphs. WALCOM 2023: 267-278 - Bengt J. Nilsson
, Christiane Schmidt
:
k-Transmitter Watchman Routes. WALCOM 2023: 202-213 - Kaustav Paul, Arti Pandey:
Some Algorithmic Results for Eternal Vertex Cover Problem in Graphs. WALCOM 2023: 242-253 - Rin Saito
, Hiroshi Eto
, Takehiro Ito
, Ryuhei Uehara
:
Reconfiguration of Vertex-Disjoint Shortest Paths on Graphs. WALCOM 2023: 191-201 - Baruch Schieber, Bhargav Samineni, Soroush Vahidi
:
Interweaving Real-Time Jobs with Energy Harvesting to Maximize Throughput. WALCOM 2023: 305-316 - Ildikó Schlotter:
Recognizing When a Preference System is Close to Admitting a Master List. WALCOM 2023: 317-329 - Takumi Shiota, Toshiki Saitoh
:
Overlapping Edge Unfoldings for Archimedean Solids and (Anti)prisms. WALCOM 2023: 36-48
skipping 3 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-08-20 11:04 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