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 1,374 matches
- 2024
- Alessandro Aloisio, Michele Flammini, Cosimo Vinci:
Generalized Distance Polymatrix Games. SOFSEM 2024: 25-39 - Mutsunori Banbara, Shin-ichi Minato, Hirotaka Ono, Ryuhei Uehara:
On the Computational Complexity of Generalized Common Shape Puzzles. SOFSEM 2024: 55-68 - Arash Beikmohammadi, William S. Evans, Seyed Ali Tabatabaee:
Fractional Bamboo Trimming and Distributed Windows Scheduling. SOFSEM 2024: 69-81 - Sebastian Berndt, Matthias Mnich, Tobias Stamm:
New Support Size Bounds and Proximity Bounds for Integer Linear Programming. SOFSEM 2024: 82-95 - Sriram Bhyravarapu, Lawqueen Kanesh, A. Mohanapriya, Nidhi Purohit, N. Sadagopan, Saket Saurabh:
On the Parameterized Complexity of Minus Domination. SOFSEM 2024: 96-110 - Ivan Bliznets, Jesper Nederlof:
Exact and Parameterized Algorithms for Choosability. SOFSEM 2024: 111-124 - Ivan Bliznets, Jesper Nederlof, Krisztina Szilágyi:
Parameterized Algorithms for Covering by Arithmetic Progressions. SOFSEM 2024: 125-138 - Annalisa De Bonis:
Group Testing in Arbitrary Hypergraphs and Related Combinatorial Structures. SOFSEM 2024: 154-168 - Stefano Crespi-Reghizzi, Antonio Restivo, Pierluigi San Pietro:
Row-Column Combination of Dyck Words. SOFSEM 2024: 139-153 - Jona Dirks, Enna Gerhard, Mario Grobler, Amer E. Mouawad, Sebastian Siebertz:
Data Reduction for Directed Feedback Vertex Set on Graphs Without Long Induced Cycles. SOFSEM 2024: 183-197 - William S. Evans, Kassian Köck, Stephen G. Kobourov:
Visualization of Bipartite Graphs in Limited Window Size. SOFSEM 2024: 198-210 - Jirí Fiala, Oksana Firman, Giuseppe Liotta, Alexander Wolff, Johannes Zink:
Outerplanar and Forest Storyplans. SOFSEM 2024: 211-225 - Alexander Firbas, Alexander Dobler, Fabian Holzer, Jakob Schafellner, Manuel Sorge, Anaïs Villedieu, Monika Wißmann:
The Complexity of Cluster Vertex Splitting and Company. SOFSEM 2024: 226-239 - Oksana Firman, Tim Hegemann, Boris Klemz, Felix Klesen, Marie Diana Sieper, Alexander Wolff, Johannes Zink:
Morphing Graph Drawings in the Presence of Point Obstacles. SOFSEM 2024: 240-254 - Pamela Fleischmann, Lukas Haschke, Tim Löck, Dirk Nowotka:
Word-Representable Graphs from a Word's Perspective. SOFSEM 2024: 255-268 - Janosch Fuchs, Christoph Grüne, Tom Janßen:
The Complexity of Online Graph Games. SOFSEM 2024: 269-282 - Laurent Gourvès, Aris Pagourtzis:
Removable Online Knapsack with Bounded Size Items. SOFSEM 2024: 283-296 - Tesshu Hanaka, Hironori Kiya, Michael Lampis, Hirotaka Ono, Kanae Yoshiwatari:
Faster Winner Determination Algorithms for (Colored) Arc Kayles. SOFSEM 2024: 297-310 - Stefan Hoffmann:
Automata Classes Accepting Languages Whose Commutative Closure is Regular. SOFSEM 2024: 311-325 - Jan Janousek, Stepán Plachý:
Shortest Characteristic Factors of a Deterministic Finite Automaton and Computing Its Positive Position Run by Pattern Set Matching. SOFSEM 2024: 326-339 - Yoshito Kawasaki, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara:
Query Learning of Minimal Deterministic Symbolic Finite Automata Separating Regular Languages. SOFSEM 2024: 340-354 - Christian Laußmann, Jörg Rothe, Tessa Seeger:
Apportionment with Thresholds: Strategic Campaigns are Easy in the Top-Choice but Hard in the Second-Chance Mode. SOFSEM 2024: 355-368 - Diego Maldonado, Pedro Montealegre, Martín Ríos-Wilson, Guillaume Theyssier:
Local Certification of Majority Dynamics. SOFSEM 2024: 369-382 - Virginia Ardévol Martínez, Steven Chaplick, Steven Kelk, Ruben Meuwese, Matús Mihalák, Georgios Stamoulis:
Relaxed Agreement Forests. SOFSEM 2024: 40-54 - Caroline Mattes, Alexander Ushakov, Armin Weiß:
Complexity of Spherical Equations in Finite Groups. SOFSEM 2024: 383-397 - S. Mahmoud Mousawi, Sandra Zilles:
Positive Characteristic Sets for Relational Pattern Languages. SOFSEM 2024: 398-412 - Andreea-Teodora Nász:
The Weighted HOM-Problem Over Fields. SOFSEM 2024: 427-441 - Jesper Nederlof, Krisztina Szilágyi:
Algorithms and Turing Kernels for Detecting and Counting Small Patterns in Unit Disk Graphs. SOFSEM 2024: 413-426 - Kévin Perrot, Sylvain Sené, Léah Tapin:
Combinatorics of Block-Parallel Automata Networks. SOFSEM 2024: 442-455 - M. Praveen, Philippe Schnoebelen, Julien Veron, Isa Vialard:
On the Piecewise Complexity of Words and Periodic Words. SOFSEM 2024: 456-470
skipping 1,344 more matches
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-12-02 21:39 CET 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