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
Likely 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 40 matches
- 2024
- Eric Gottlieb, Matjaz Krnc, Peter Mursic:
Sprague-Grundy values and complexity for LCTR. Discret. Appl. Math. 346: 154-169 (2024) - Vladimir Gurvich, Matjaz Krnc, Mikhail N. Vyalyi:
Growing Trees and Amoebas' Replications. CoRR abs/2401.07484 (2024) - Clément Dallard, Matjaz Krnc, O.-joung Kwon, Martin Milanic, Andrea Munaro, Kenny Storgel, Sebastian Wiederrecht:
Treewidth versus clique number. IV. Tree-independence number of graphs excluding an induced star. CoRR abs/2402.11222 (2024) - 2023
- Nina Chiarelli, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Nevena Pivac, Joachim Schauer:
Fair Allocation of Indivisible Items with Conflict Graphs. Algorithmica 85(5): 1459-1489 (2023) - Mikita Akulich, Iztok Savnik, Matjaz Krnc, Riste Skrekovski:
Multiset-Trie Data Structure. Algorithms 16(3): 170 (2023) - Nina Chiarelli, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Joachim Schauer:
Fair allocation algorithms for indivisible items under structured conflict constraints. Comput. Appl. Math. 42(7): 302 (2023) - Robert Hancock, Daniel Král', Matjaz Krnc, Jan Volec:
Toward characterizing locally common graphs. Random Struct. Algorithms 62(1): 181-218 (2023) - Nina Chiarelli, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Joachim Schauer:
Fair Allocation Algorithms for Indivisible Items under Structured Conflict Constraints. CoRR abs/2308.09399 (2023) - 2022
- Mario Karlovcec, Matjaz Krnc, Riste Skrekovski:
Evaluating group degree centrality and centralization in networks. Informatica (Slovenia) 46(5) (2022) - Vladimir Gurvich, Matjaz Krnc, Martin Milanic, Mikhail N. Vyalyi:
Shifting paths to avoidable ones. J. Graph Theory 100(1): 69-83 (2022) - Mikita Akulich, Iztok Savnik, Matjaz Krnc, Riste Skrekovski:
Multiset-trie data structure - datasets. Zenodo, 2022 - Vladimir Gurvich, Matjaz Krnc, Martin Milanic, Mikhail N. Vyalyi:
Computer-assisted verification of confining two-rooted graphs with certain cages. Zenodo, 2022 - Eric Gottlieb, Matjaz Krnc, Peter Mursic:
Sprague-Grundy values and complexity for LCTR. CoRR abs/2207.05599 (2022) - Vladimir Gurvich, Matjaz Krnc, Martin Milanic, Mikhail N. Vyalyi:
Avoidability beyond paths. CoRR abs/2208.12803 (2022) - 2021
- Jesse Beisegel, Carolin Denkert, Ekkehard Köhler, Matjaz Krnc, Nevena Pivac, Robert Scheffler, Martin Strehler:
The Recognition Problem of Graph Search Trees. SIAM J. Discret. Math. 35(2): 1418-1446 (2021) - Nina Klobas, Matjaz Krnc:
Distinguishing Graphs via Cycles. COCOON 2021: 387-398 - Clément Dallard, Robert Ganian, Meike Hatzel, Matjaz Krnc, Martin Milanic:
Graphs with Two Moplexes. LAGOS 2021: 248-256 - Clément Dallard, Robert Ganian, Meike Hatzel, Matjaz Krnc, Martin Milanic:
Graphs with at most two moplexes. CoRR abs/2106.10049 (2021) - Matjaz Krnc, Nevena Pivac:
Graphs where Search Methods are Indistinguishable. CoRR abs/2109.00035 (2021) - 2020
- Matjaz Krnc, Robin J. Wilson:
Recognizing generalized Petersen graphs in linear time. Discret. Appl. Math. 283: 756-761 (2020) - Matjaz Krnc, Jean-Sébastien Sereni, Riste Skrekovski, Zelealem B. Yilma:
Eccentricity of networks with structural constraints. Discuss. Math. Graph Theory 40(4): 1141-1162 (2020) - Nina Chiarelli, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Nevena Pivac, Joachim Schauer:
Fair Packing of Independent Sets. IWOCA 2020: 154-165 - Gregor Bankhamer, Robert Elsässer, Dominik Kaaser, Matjaz Krnc:
Positive Aging Admits Fast Asynchronous Plurality Consensus. PODC 2020: 385-394 - Jesse Beisegel, Nina Chiarelli, Ekkehard Köhler, Matjaz Krnc, Martin Milanic, Nevena Pivac, Robert Scheffler, Martin Strehler:
Edge Elimination and Weighted Graph Classes. WG 2020: 134-147 - Nina Chiarelli, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Nevena Pivac, Joachim Schauer:
Fair packing of independent sets. CoRR abs/2003.11313 (2020) - Vladimir Gurvich, Matjaz Krnc, Martin Milanic, Mikhail N. Vyalyi:
Shifting paths to avoidable ones. CoRR abs/2008.01128 (2020) - Nina Klobas, Matjaz Krnc:
Fast recognition of some parametric graph families. CoRR abs/2008.08856 (2020) - 2019
- Jesse Beisegel, Carolin Denkert, Ekkehard Köhler, Matjaz Krnc, Nevena Pivac, Robert Scheffler, Martin Strehler:
On the End-Vertex Problem of Graph Searches. Discret. Math. Theor. Comput. Sci. 21(1) (2019) - Matjaz Krnc, Tomaz Pisanski:
Generalized Petersen graphs and Kronecker covers. Discret. Math. Theor. Comput. Sci. 21(4) (2019) - Jesse Beisegel, Carolin Denkert, Ekkehard Köhler, Matjaz Krnc, Nevena Pivac, Robert Scheffler, Martin Strehler:
Recognizing Graph Search Trees. LAGOS 2019: 99-110
skipping 10 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 2025-01-21 09:15 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