default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeter Mursic
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j6]Eric Gottlieb, Matjaz Krnc, Peter Mursic
:
Sprague-Grundy values and complexity for LCTR. Discret. Appl. Math. 346: 154-169 (2024)- 2023
- [j5]Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanic, Peter Mursic, Ulrich Pferschy, Nevena Pivac:
Allocation of indivisible items with individual preference graphs. Discret. Appl. Math. 334: 45-62 (2023) - 2021
- [j4]Nina Chiarelli, Berenice Martínez-Barona, Martin Milanic, Jérôme Monnot, Peter Mursic:
Strong cliques in diamond-free graphs. Theor. Comput. Sci. 858: 49-63 (2021) - 2019
- [j3]Endre Boros, Vladimir Gurvich, Nhan Bao Ho, Kazuhisa Makino, Peter Mursic:
Sprague-Grundy function of symmetric hypergraphs. J. Comb. Theory A 165: 176-186 (2019) - [j2]Endre Boros, Vladimir Gurvich, Nhan Bao Ho, Kazuhisa Makino, Peter Mursic:
Sprague-Grundy function of matroids and related hypergraphs. Theor. Comput. Sci. 799: 40-58 (2019) - 2018
- [j1]Endre Boros, Vladimir Gurvich, Nhan Bao Ho, Kazuhisa Makino, Peter Mursic:
On the Sprague-Grundyfunction of Exact k-Nim. Discret. Appl. Math. 239: 1-14 (2018)
Conference and Workshop Papers
- 2024
- [c5]Paloma T. Lima, Martin Milanic, Peter Mursic, Karolina Okrasa, Pawel Rzazewski, Kenny Storgel:
Tree Decompositions Meet Induced Matchings: Beyond Max Weight Independent Set. ESA 2024: 85:1-85:17 - [c4]Jesse Beisegel, Nina Chiarelli, Ekkehard Köhler, Martin Milanic, Peter Mursic, Robert Scheffler:
The Simultaneous Interval Number: A New Width Parameter that Measures the Similarity to Interval Graphs. SWAT 2024: 7:1-7:20 - 2021
- [c3]Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanic, Peter Mursic, Nevena Pivac, Ulrich Pferschy:
Allocating Indivisible Items with Minimum Dissatisfaction on Preference Graphs. ADT 2021: 243-257 - 2020
- [c2]Nina Chiarelli, Berenice Martínez-Barona, Martin Milanic, Jérôme Monnot, Peter Mursic:
Strong Cliques in Diamond-Free Graphs. WG 2020: 261-273 - 2017
- [c1]Martin Milanic, Peter Mursic, Marcelo Mydlarz:
Induced Embeddings into Hamming Graphs. MFCS 2017: 28:1-28:15
Informal and Other Publications
- 2024
- [i6]Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanic, Peter Mursic, Ulrich Pferschy:
Allocation of Indivisible Items with a Common Preference Graph: Minimizing Total Dissatisfaction. CoRR abs/2402.00921 (2024) - [i5]Paloma T. Lima, Martin Milanic, Peter Mursic, Karolina Okrasa, Pawel Rzazewski, Kenny Storgel:
Tree decompositions meet induced matchings: beyond Max Weight Independent Set. CoRR abs/2402.15834 (2024) - [i4]Jesse Beisegel, Nina Chiarelli, Ekkehard Köhler, Martin Milanic, Peter Mursic, Robert Scheffler:
The Simultaneous Interval Number: A New Width Parameter that Measures the Similarity to Interval Graphs. CoRR abs/2404.10670 (2024) - 2023
- [i3]Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanic, Peter Mursic, Ulrich Pferschy:
Minimizing Maximum Dissatisfaction in the Allocation of Indivisible Items under a Common Preference Graph. CoRR abs/2312.01804 (2023) - 2022
- [i2]Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanic, Peter Mursic, Ulrich Pferschy, Nevena Pivac:
Allocation of Indivisible Items with Individual Preference Graphs. CoRR abs/2202.04465 (2022) - [i1]Eric Gottlieb, Matjaz Krnc, Peter Mursic:
Sprague-Grundy values and complexity for LCTR. CoRR abs/2207.05599 (2022)
Coauthor Index
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.
last updated on 2024-09-26 01:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
