![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.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 34 matches
- 2022
- Akanksha Agrawal, Pratibha Choudhary, N. S. Narayanaswamy, K. K. Nisha, Vijayaragunathan Ramamoorthi:
Parameterized Complexity of Minimum Membership Dominating Set. WALCOM 2022: 288-299 - Joshua Ani, Erik D. Demaine
, Yevhenii Diomidov, Dylan H. Hendrickson
, Jayson Lynch
:
Traversability, Reconfiguration, and Reachability in the Gadget Framework. WALCOM 2022: 47-58 - Joshua Ani, Erik D. Demaine
, Dylan H. Hendrickson
, Jayson Lynch
:
Trains, Games, and Complexity: 0/1/2-Player Motion Planning Through Input/Output Gadgets. WALCOM 2022: 187-198 - Alan Arroyo, Stefan Felsner:
Approximating the Bundled Crossing Number. WALCOM 2022: 383-395 - Susobhan Bandopadhyay, Suman Banerjee, Aritra Banik, Venkatesh Raman:
Structural Parameterizations of Budgeted Graph Coloring. WALCOM 2022: 340-351 - Amotz Bar-Noy, Toni Böhnlein, David Peleg, Dror Rawitz:
Vertex-Weighted Graphs: Realizable and Unrealizable Domains. WALCOM 2022: 315-327 - Gaétan Berthe
, Barnaby Martin, Daniël Paulusma
, Siani Smith
:
The Complexity of L(p, q)-Edge-Labelling. WALCOM 2022: 175-186 - Ivona Bezáková, Wenbo Sun:
Counting and Sampling Orientations on Chordal Graphs. WALCOM 2022: 352-364 - Arghya Bhattacharya, Rathish Das:
Machine Learning Advised Ski Rental Problem with a Discount. WALCOM 2022: 213-224 - Hans L. Bodlaender
:
From the W-hierarchy to XNLP - Classes of Fixed Parameter Intractability. WALCOM 2022: 15-25 - Prosenjit Bose, Guillermo Esteban, David Orden, Rodrigo I. Silveira:
On Approximating Shortest Paths in Weighted Triangular Tessellations. WALCOM 2022: 409-421 - Nader H. Bshouty:
An Optimal Tester for k-Linear. WALCOM 2022: 201-212 - Deniz Agaoglu Çagirici
, Petr Hlinený
:
Isomorphism Testing for T-graphs in FPT. WALCOM 2022: 239-250 - Tiziana Calamoneri
, Blerina Sinaimeri
:
Some Problems Related to the Space of Optimal Tree Reconciliations - (Invited Talk). WALCOM 2022: 3-14 - Dibyayan Chakraborty, Kshitij Gajjar
:
Finding Geometric Representations of Apex Graphs is NP-Hard. WALCOM 2022: 161-174 - Alexandre Cooper, Stephanie Maaz, Amer E. Mouawad, Naomi Nishimura:
Parameterized Complexity of Reconfiguration of Atoms. WALCOM 2022: 263-274 - Gennaro Cordasco
, Luisa Gargano, Adele A. Rescigno
:
Parameterized Complexity of Immunization in the Threshold Model. WALCOM 2022: 275-287 - Jared Espenant, Debajyoti Mondal:
StreamTable: An Area Proportional Visualization for Tables with Flowing Streams. WALCOM 2022: 97-108 - Hiroshi Eto, Takehiro Ito
, Yasuaki Kobayashi
, Yota Otachi
, Kunihiro Wasa
:
Reconfiguration of Regular Induced Subgraphs. WALCOM 2022: 35-46 - Hiroshi Eto, Takehiro Ito, Eiji Miyano
, Akira Suzuki, Yuma Tamura:
Happy Set Problem on Subclasses of Co-comparability Graphs. WALCOM 2022: 149-160 - William Evans, Rebecca Lin
:
The Polygon Burning Problem. WALCOM 2022: 123-134 - Stefan Felsner, Andrew Nathenson, Csaba D. Tóth:
Aspect Ratio Universal Rectangular Layouts. WALCOM 2022: 73-84 - Celina M. H. de Figueiredo, Raul Lopes, Alexsander Andrade de Melo, Ana Silva
:
Parameterized Algorithms for Steiner Tree and Dominating Set: Bounding the Leafage by the Vertex Leafage. WALCOM 2022: 251-262 - Oksana Firman
, Joachim Spoerhase
:
Hypergraph Representation via Axis-Aligned Point-Subspace Cover. WALCOM 2022: 328-339 - Ajinkya Gaikwad, Soumen Maity:
On the Harmless Set Problem Parameterized by Treewidth. WALCOM 2022: 227-238 - Renzo Gómez
, Flávio Keidi Miyazawa
, Yoshiko Wakabayashi
:
Minimum t-Spanners on Subcubic Graphs. WALCOM 2022: 365-380 - Aleksandra Istomina, Elena Arseneva, Rahul Gangopadhyay:
Morphing Tree Drawings in a Small 3D Grid. WALCOM 2022: 85-96 - Takehiro Ito:
Invitation to Combinatorial Reconfiguration. WALCOM 2022: 26-31 - Chuzo Iwamoto
, Tatsuaki Ibusuki:
Vertex-to-Point Conflict-Free Chromatic Guarding is NP-Hard. WALCOM 2022: 111-122 - Kenya Kobayashi, Guohui Lin, Eiji Miyano
, Toshiki Saitoh
, Akira Suzuki, Tadatoshi Utashima, Tsuyoshi Yagita:
Path Cover Problems with Length Cost. WALCOM 2022: 396-408
skipping 4 more matches
loading more results
failed to load more results, please try again later
![](https://dblp1.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-07-01 18:17 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