Остановите войну!
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 49 matches
- 2023
- Áron Ambrus, Mónika Csikós, Gergely Kiss, János Pach, Gábor Somlai:
Optimal Embedded and Enclosing Isosceles Triangles. Int. J. Found. Comput. Sci. 34(7): 737-760 (2023) - Tetsuo Asano:
Transportation Problem Allowing Sending and Bringing Back. Int. J. Found. Comput. Sci. 34(5): 487-505 (2023) - Tetsuo Asano:
Minimizing Maximum Unmet Demand by Transportations Between Adjacent Nodes Characterized by Supplies and Demands. Int. J. Found. Comput. Sci. 34(7): 693-714 (2023) - Vecdi Aytaç, Tufan Turaci:
Analysis of Vulnerability of Some Transformation Networks. Int. J. Found. Comput. Sci. 34(1): 11-24 (2023) - Subhash Bhagat, Abhinav Chakraborty, Bibhuti Das, Krishnendu Mukhopadhyaya:
Optimal Gathering Over Weber Meeting Nodes in Infinite Grid. Int. J. Found. Comput. Sci. 34(1): 25-49 (2023) - Carla Binucci, Emilio Di Giacomo, Michael Kaufmann, Giuseppe Liotta, Alessandra Tappini:
k-Planar Placement and Packing of Δ-Regular Caterpillars. Int. J. Found. Comput. Sci. 34(7): 875-902 (2023) - Malte Blattmann, Andreas Maletti:
Compositions with Constant Weighted Extended Tree Transducers. Int. J. Found. Comput. Sci. 34(6): 539-558 (2023) - Eugenija A. Bondar, David Casas, Mikhail V. Volkov:
Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees. Int. J. Found. Comput. Sci. 34(6): 655-690 (2023) - Stijn Cambie, Michiel de Bondt, Henk Don:
Extremal Binary PFAs with Small Number of States. Int. J. Found. Comput. Sci. 34(2&3): 85-115 (2023) - Siu-Wing Cheng:
Shortest Journeys in Directed Temporal Graphs. Int. J. Found. Comput. Sci. 34(7): 761-771 (2023) - Manfred Droste, Zoltán Fülöp, Dávid Kószó:
Decidability Boundaries for the Finite-Image Property of Weighted Finite Automata. Int. J. Found. Comput. Sci. 34(6): 633-653 (2023) - Manfred Droste, George Rahonis, Arto Salomaa:
Special Issue: International Colloquium: Recent Advances of Quantitative Models in Computer Science (RAQM 2021) - Preface. Int. J. Found. Comput. Sci. 34(6): 537-538 (2023) - Luc Edixhoven, Sung-Shik Jongmans:
Balanced-by-Construction Regular and ω-Regular Languages. Int. J. Found. Comput. Sci. 34(2&3): 117-144 (2023) - Fabian Frei, Juraj Hromkovic, Rastislav Královic, Richard Královic:
Two-Way Non-Uniform Finite Automata. Int. J. Found. Comput. Sci. 34(2&3): 145-162 (2023) - Zsolt Gazdag, Sándor Vágvölgyi:
The Component Hierarchy of Chain-Free Cooperating Distributed Regular Tree Grammars Revisited. Int. J. Found. Comput. Sci. 34(4): 411-427 (2023) - Diana Geneva, Georgi Shopov, Stoyan Mihov:
Algorithms for Probabilistic and Stochastic Subsequential Failure Transducers. Int. J. Found. Comput. Sci. 34(8): 1023-1049 (2023) - Cinzia Di Giusto, Laetitia Laversa, Étienne Lozes:
Guessing the Buffer Bound for k-Synchronizability. Int. J. Found. Comput. Sci. 34(8): 1051-1076 (2023) - Luca Grilli, Seok-Hee Hong, Jan Kratochvíl, Ignaz Rutter:
Drawing Simultaneously Embedded Graphs with Few Bends. Int. J. Found. Comput. Sci. 34(7): 807-824 (2023) - Vesa Halava, Tero Harju, Reino Niskanen, Igor Potapov:
Integer Weighted Automata on Infinite Words. Int. J. Found. Comput. Sci. 34(2&3): 163-182 (2023) - Viktor Henriksson, Manfred Kufleitner:
Forbidden Patterns for FO2 Alternation Over Finite and Infinite Words. Int. J. Found. Comput. Sci. 34(2&3): 183-224 (2023) - Stefan Hoffmann:
Regularity Conditions for Iterated Shuffle on Commutative Regular Languages. Int. J. Found. Comput. Sci. 34(8): 923-957 (2023) - Stefan Hoffmann:
State Complexity of Permutation and the Language Inclusion Problem up to Parikh Equivalence on Alphabetical Pattern Constraints and Partially Ordered NFAs. Int. J. Found. Comput. Sci. 34(8): 959-986 (2023) - Markus Holzer, Christian Rauch:
The Range of State Complexities of Languages Resulting from the Cascade Product - The Unary Case. Int. J. Found. Comput. Sci. 34(8): 987-1022 (2023) - Kazuo Iwama, Shuichi Miyazaki:
Marriage and Roommate. Int. J. Found. Comput. Sci. 34(7): 853-873 (2023) - Jesper Jansson, Christos Levcopoulos, Andrzej Lingas:
Online and Approximate Network Construction from Bounded Connectivity Constraints. Int. J. Found. Comput. Sci. 34(5): 453-468 (2023) - Martin Kutrib, Uwe Meyer:
Reversible Top-Down Syntax Analysis. Int. J. Found. Comput. Sci. 34(2&3): 225-251 (2023) - I-Cheng Liao, Hsueh-I Lu:
A Simple 2-Approximation for Maximum-Leaf Spanning Tree. Int. J. Found. Comput. Sci. 34(7): 795-805 (2023) - Lan Lin, Yixun Lin:
Graph Bipartization Problem with Applications to Via Minimization in VLSI Design. Int. J. Found. Comput. Sci. 34(4): 347-361 (2023) - Meijie Ma, Chaoming Guo, Xiang-Jun Li:
Strong Menger Connectivity of Folded Hypercubes with Faulty Subcube. Int. J. Found. Comput. Sci. 34(5): 443-451 (2023) - Andreas Maletti, Teodora Nasz, Kevin Stier, Markus Ulbricht:
Ambiguity Hierarchies for Weighted Tree Automata. Int. J. Found. Comput. Sci. 34(8): 903-921 (2023)
skipping 19 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-07-02 05:15 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