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 18 matches
- 2024
- S. K. M. Anoop, Jayalal Sarma:
On Rotation Distance of Rank Bounded Trees. Fundam. Informaticae 191(2): 79-104 (2024) - David Auger, Johanne Cohen, Antoine Lobstein:
Nonatomic Non-Cooperative Neighbourhood Balancing Games. Fundam. Informaticae 191(3-4): 239-268 (2024) - Dipayan Chakraborty, Florent Foucaud, Aline Parreau, Annegret Wagler:
On Three Domination-based Identification Problems in Block Graphs. Fundam. Informaticae 191(3-4): 197-229 (2024) - Chavdar Dangalchev:
Link Residual Closeness of Harary Graphs. Fundam. Informaticae 191(1): 1-15 (2024) - Hande Tuncel Golpek, Aysun Aytaç:
Closeness and Vertex Residual Closeness of Harary Graphs. Fundam. Informaticae 191(2): 105-127 (2024) - Jesús Arturo Jiménez González:
A Strong Gram Classification of Non-negative Unit Forms of Dynkin Type 𝔸r. Fundam. Informaticae 191(1): 17-66 (2024) - Patric Gustafsson, Ion Petre:
Strong Regulatory Graphs. Fundam. Informaticae 191(3-4): 299-314 (2024) - Anni Hakanen, Ismael G. Yero:
Complexity and Equivalency of Multiset Dimension and ID-colorings. Fundam. Informaticae 191(3-4): 315-330 (2024) - Vesa Halava, Tero Harju, Dirk Nowotka, Esa Sahla:
Decision Problems on Copying and Shuffling. Fundam. Informaticae 191(3-4): 269-284 (2024) - Vesa Halava, Jarkko Kari, Tero Laihonen:
Preface. Fundam. Informaticae 191(3-4) (2024) - Pyry Herva, Tero Laihonen, Tuomo Lehtilä:
Optimal Local Identifying and Local Locating-dominating Codes. Fundam. Informaticae 191(3-4): 351-378 (2024) - Juha Honkala:
Commuting Upper Triangular Binary Morphisms. Fundam. Informaticae 191(3-4): 285-298 (2024) - Olivier Hudry, Ville Junnila, Antoine Lobstein:
On Iiro Honkala's Contributions to Identifying Codes. Fundam. Informaticae 191(3-4): 165-196 (2024) - Alexander Lindermayr, Sebastian Siebertz, Alexandre Vigny:
Elimination Distance to Bounded Degree on Planar Graphs Preprint. Fundam. Informaticae 191(2): 129-140 (2024) - Ville Salo, Ilkka Törmä:
Finding Codes on Infinite Grids Automatically. Fundam. Informaticae 191(3-4): 331-349 (2024) - Arto Salomaa, Kai Salomaa, Taylor J. Smith:
Descriptional Complexity of Finite Automata - Selected Highlights. Fundam. Informaticae 191(3-4): 231-237 (2024) - Chenxu Yang, Ralf Klasing, Changxiang He, Yaping Mao:
Perturbation Results for Distance-edge-monitoring Numbers. Fundam. Informaticae 191(2): 141-163 (2024) - Sizhong Zhou, Jiancheng Wu:
Two Sufficient Conditions for Graphs to Admit Path Factors. Fundam. Informaticae 191(1): 67-77 (2024)
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-10-22 12:32 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