var bibbase_data = {"data":"\"Loading..\"\n\n
\n\n \n\n \n\n \n \n\n \n\n \n \n\n \n\n \n
\n generated by\n \n \"bibbase.org\"\n\n \n
\n \n\n
\n\n \n\n\n
\n\n Excellent! Next you can\n create a new website with this list, or\n embed it in an existing web page by copying & pasting\n any of the following snippets.\n\n
\n JavaScript\n (easiest)\n
\n \n <script src=\"https://bibbase.org/show?bib=https://dblp.org/pid/17/7594.bib&jsonp=1&groupBy=Type&jsonp=1\"></script>\n \n
\n\n PHP\n
\n \n <?php\n $contents = file_get_contents(\"https://bibbase.org/show?bib=https://dblp.org/pid/17/7594.bib&jsonp=1&groupBy=Type\");\n print_r($contents);\n ?>\n \n
\n\n iFrame\n (not recommended)\n
\n \n <iframe src=\"https://bibbase.org/show?bib=https://dblp.org/pid/17/7594.bib&jsonp=1&groupBy=Type\"></iframe>\n \n
\n\n

\n For more details see the documention.\n

\n
\n
\n\n
\n\n This is a preview! To use this list on your own web site\n or create a new web site from it,\n create a free account. The file will be added\n and you will be able to edit it in the File Manager.\n We will show you instructions once you've created your account.\n
\n\n
\n\n

To the site owner:

\n\n

Action required! Mendeley is changing its\n API. In order to keep using Mendeley with BibBase past April\n 14th, you need to:\n

    \n
  1. renew the authorization for BibBase on Mendeley, and
    2. \n
  2. update the BibBase URL\n in your page the same way you did when you initially set up\n this page.\n
    3. \n
\n

\n\n

\n \n \n Fix it now\n

\n
\n\n
\n\n\n
\n \n \n
\n
\n  \n 2024\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Growing Trees and Amoebas' Replications.\n \n \n \n \n\n\n \n Gurvich, V.; Krnc, M.; and Vyalyi, M. N.\n\n\n \n\n\n\n CoRR, abs/2401.07484. 2024.\n \n\n\n\n
\n\n\n\n \n \n \"GrowingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/corr/abs-2401-07484,\n  author       = {Vladimir Gurvich and\n                  Matjaz Krnc and\n                  Mikhail N. Vyalyi},\n  title        = {Growing Trees and Amoebas' Replications},\n  journal      = {CoRR},\n  volume       = {abs/2401.07484},\n  year         = {2024},\n  url          = {https://doi.org/10.48550/arXiv.2401.07484},\n  doi          = {10.48550/ARXIV.2401.07484},\n  eprinttype    = {arXiv},\n  eprint       = {2401.07484},\n  timestamp    = {Wed, 07 Feb 2024 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2401-07484.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Treewidth versus clique number. IV. Tree-independence number of graphs excluding an induced star.\n \n \n \n \n\n\n \n Dallard, C.; Krnc, M.; Kwon, O.; Milanic, M.; Munaro, A.; Storgel, K.; and Wiederrecht, S.\n\n\n \n\n\n\n CoRR, abs/2402.11222. 2024.\n \n\n\n\n
\n\n\n\n \n \n \"TreewidthPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/corr/abs-2402-11222,\n  author       = {Cl{\\'{e}}ment Dallard and\n                  Matjaz Krnc and\n                  O.{-}joung Kwon and\n                  Martin Milanic and\n                  Andrea Munaro and\n                  Kenny Storgel and\n                  Sebastian Wiederrecht},\n  title        = {Treewidth versus clique number. {IV.} Tree-independence number of\n                  graphs excluding an induced star},\n  journal      = {CoRR},\n  volume       = {abs/2402.11222},\n  year         = {2024},\n  url          = {https://doi.org/10.48550/arXiv.2402.11222},\n  doi          = {10.48550/ARXIV.2402.11222},\n  eprinttype    = {arXiv},\n  eprint       = {2402.11222},\n  timestamp    = {Fri, 22 Mar 2024 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2402-11222.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2023\n \n \n (5)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Fair Allocation of Indivisible Items with Conflict Graphs.\n \n \n \n \n\n\n \n Chiarelli, N.; Krnc, M.; Milanic, M.; Pferschy, U.; Pivac, N.; and Schauer, J.\n\n\n \n\n\n\n Algorithmica, 85(5): 1459–1489. 2023.\n \n\n\n\n
\n\n\n\n \n \n \"FairPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/algorithmica/ChiarelliKMPPS23,\n  author       = {Nina Chiarelli and\n                  Matjaz Krnc and\n                  Martin Milanic and\n                  Ulrich Pferschy and\n                  Nevena Pivac and\n                  Joachim Schauer},\n  title        = {Fair Allocation of Indivisible Items with Conflict Graphs},\n  journal      = {Algorithmica},\n  volume       = {85},\n  number       = {5},\n  pages        = {1459--1489},\n  year         = {2023},\n  url          = {https://doi.org/10.1007/s00453-022-01079-8},\n  doi          = {10.1007/S00453-022-01079-8},\n  timestamp    = {Sat, 13 May 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/algorithmica/ChiarelliKMPPS23.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Multiset-Trie Data Structure.\n \n \n \n \n\n\n \n Akulich, M.; Savnik, I.; Krnc, M.; and Skrekovski, R.\n\n\n \n\n\n\n Algorithms, 16(3): 170. 2023.\n \n\n\n\n
\n\n\n\n \n \n \"Multiset-TriePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/algorithms/AkulichSKS23,\n  author       = {Mikita Akulich and\n                  Iztok Savnik and\n                  Matjaz Krnc and\n                  Riste Skrekovski},\n  title        = {Multiset-Trie Data Structure},\n  journal      = {Algorithms},\n  volume       = {16},\n  number       = {3},\n  pages        = {170},\n  year         = {2023},\n  url          = {https://doi.org/10.3390/a16030170},\n  doi          = {10.3390/A16030170},\n  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/algorithms/AkulichSKS23.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Fair allocation algorithms for indivisible items under structured conflict constraints.\n \n \n \n \n\n\n \n Chiarelli, N.; Krnc, M.; Milanic, M.; Pferschy, U.; and Schauer, J.\n\n\n \n\n\n\n Comput. Appl. Math., 42(7): 302. 2023.\n \n\n\n\n
\n\n\n\n \n \n \"FairPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/cam/ChiarelliKMPS23,\n  author       = {Nina Chiarelli and\n                  Matjaz Krnc and\n                  Martin Milanic and\n                  Ulrich Pferschy and\n                  Joachim Schauer},\n  title        = {Fair allocation algorithms for indivisible items under structured\n                  conflict constraints},\n  journal      = {Comput. Appl. Math.},\n  volume       = {42},\n  number       = {7},\n  pages        = {302},\n  year         = {2023},\n  url          = {https://doi.org/10.1007/s40314-023-02437-0},\n  doi          = {10.1007/S40314-023-02437-0},\n  timestamp    = {Wed, 01 Nov 2023 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/cam/ChiarelliKMPS23.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Toward characterizing locally common graphs.\n \n \n \n \n\n\n \n Hancock, R.; Král', D.; Krnc, M.; and Volec, J.\n\n\n \n\n\n\n Random Struct. Algorithms, 62(1): 181–218. 2023.\n \n\n\n\n
\n\n\n\n \n \n \"TowardPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/rsa/HancockKKV23,\n  author       = {Robert Hancock and\n                  Daniel Kr{\\'{a}}l' and\n                  Matjaz Krnc and\n                  Jan Volec},\n  title        = {Toward characterizing locally common graphs},\n  journal      = {Random Struct. Algorithms},\n  volume       = {62},\n  number       = {1},\n  pages        = {181--218},\n  year         = {2023},\n  url          = {https://doi.org/10.1002/rsa.21099},\n  doi          = {10.1002/RSA.21099},\n  timestamp    = {Tue, 21 Mar 2023 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/rsa/HancockKKV23.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Fair Allocation Algorithms for Indivisible Items under Structured Conflict Constraints.\n \n \n \n \n\n\n \n Chiarelli, N.; Krnc, M.; Milanic, M.; Pferschy, U.; and Schauer, J.\n\n\n \n\n\n\n CoRR, abs/2308.09399. 2023.\n \n\n\n\n
\n\n\n\n \n \n \"FairPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/corr/abs-2308-09399,\n  author       = {Nina Chiarelli and\n                  Matjaz Krnc and\n                  Martin Milanic and\n                  Ulrich Pferschy and\n                  Joachim Schauer},\n  title        = {Fair Allocation Algorithms for Indivisible Items under Structured\n                  Conflict Constraints},\n  journal      = {CoRR},\n  volume       = {abs/2308.09399},\n  year         = {2023},\n  url          = {https://doi.org/10.48550/arXiv.2308.09399},\n  doi          = {10.48550/ARXIV.2308.09399},\n  eprinttype    = {arXiv},\n  eprint       = {2308.09399},\n  timestamp    = {Fri, 25 Aug 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2308-09399.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2022\n \n \n (4)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Evaluating group degree centrality and centralization in networks.\n \n \n \n \n\n\n \n Karlovcec, M.; Krnc, M.; and Skrekovski, R.\n\n\n \n\n\n\n Informatica (Slovenia), 46(5). 2022.\n \n\n\n\n
\n\n\n\n \n \n \"EvaluatingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/informaticaSI/KarlovcecKS22,\n  author       = {Mario Karlovcec and\n                  Matjaz Krnc and\n                  Riste Skrekovski},\n  title        = {Evaluating group degree centrality and centralization in networks},\n  journal      = {Informatica (Slovenia)},\n  volume       = {46},\n  number       = {5},\n  year         = {2022},\n  url          = {https://doi.org/10.31449/inf.v46i5.3817},\n  doi          = {10.31449/INF.V46I5.3817},\n  timestamp    = {Fri, 13 Jan 2023 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/informaticaSI/KarlovcecKS22.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Shifting paths to avoidable ones.\n \n \n \n \n\n\n \n Gurvich, V.; Krnc, M.; Milanic, M.; and Vyalyi, M. N.\n\n\n \n\n\n\n J. Graph Theory, 100(1): 69–83. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"ShiftingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/jgt/GurvichKMV22,\n  author       = {Vladimir Gurvich and\n                  Matjaz Krnc and\n                  Martin Milanic and\n                  Mikhail N. Vyalyi},\n  title        = {Shifting paths to avoidable ones},\n  journal      = {J. Graph Theory},\n  volume       = {100},\n  number       = {1},\n  pages        = {69--83},\n  year         = {2022},\n  url          = {https://doi.org/10.1002/jgt.22766},\n  doi          = {10.1002/JGT.22766},\n  timestamp    = {Wed, 27 Apr 2022 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/jgt/GurvichKMV22.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Sprague-Grundy values and complexity for LCTR.\n \n \n \n \n\n\n \n Gottlieb, E.; Krnc, M.; and Mursic, P.\n\n\n \n\n\n\n CoRR, abs/2207.05599. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"Sprague-GrundyPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/corr/abs-2207-05599,\n  author       = {Eric Gottlieb and\n                  Matjaz Krnc and\n                  Peter Mursic},\n  title        = {Sprague-Grundy values and complexity for {LCTR}},\n  journal      = {CoRR},\n  volume       = {abs/2207.05599},\n  year         = {2022},\n  url          = {https://doi.org/10.48550/arXiv.2207.05599},\n  doi          = {10.48550/ARXIV.2207.05599},\n  eprinttype    = {arXiv},\n  eprint       = {2207.05599},\n  timestamp    = {Thu, 14 Jul 2022 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2207-05599.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Avoidability beyond paths.\n \n \n \n \n\n\n \n Gurvich, V.; Krnc, M.; Milanic, M.; and Vyalyi, M. N.\n\n\n \n\n\n\n CoRR, abs/2208.12803. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"AvoidabilityPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/corr/abs-2208-12803,\n  author       = {Vladimir Gurvich and\n                  Matjaz Krnc and\n                  Martin Milanic and\n                  Mikhail N. Vyalyi},\n  title        = {Avoidability beyond paths},\n  journal      = {CoRR},\n  volume       = {abs/2208.12803},\n  year         = {2022},\n  url          = {https://doi.org/10.48550/arXiv.2208.12803},\n  doi          = {10.48550/ARXIV.2208.12803},\n  eprinttype    = {arXiv},\n  eprint       = {2208.12803},\n  timestamp    = {Mon, 29 Aug 2022 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2208-12803.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2021\n \n \n (5)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n The Recognition Problem of Graph Search Trees.\n \n \n \n \n\n\n \n Beisegel, J.; Denkert, C.; Köhler, E.; Krnc, M.; Pivac, N.; Scheffler, R.; and Strehler, M.\n\n\n \n\n\n\n SIAM J. Discret. Math., 35(2): 1418–1446. 2021.\n \n\n\n\n
\n\n\n\n \n \n \"ThePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/siamdm/BeisegelDKKPSS21,\n  author       = {Jesse Beisegel and\n                  Carolin Denkert and\n                  Ekkehard K{\\"{o}}hler and\n                  Matjaz Krnc and\n                  Nevena Pivac and\n                  Robert Scheffler and\n                  Martin Strehler},\n  title        = {The Recognition Problem of Graph Search Trees},\n  journal      = {{SIAM} J. Discret. Math.},\n  volume       = {35},\n  number       = {2},\n  pages        = {1418--1446},\n  year         = {2021},\n  url          = {https://doi.org/10.1137/20M1313301},\n  doi          = {10.1137/20M1313301},\n  timestamp    = {Mon, 04 Jul 2022 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/siamdm/BeisegelDKKPSS21.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Distinguishing Graphs via Cycles.\n \n \n \n \n\n\n \n Klobas, N.; and Krnc, M.\n\n\n \n\n\n\n In Chen, C.; Hon, W.; Hung, L.; and Lee, C., editor(s), Computing and Combinatorics - 27th International Conference, COCOON 2021, Tainan, Taiwan, October 24-26, 2021, Proceedings, volume 13025, of Lecture Notes in Computer Science, pages 387–398, 2021. Springer\n \n\n\n\n
\n\n\n\n \n \n \"DistinguishingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/cocoon/KlobasK21,\n  author       = {Nina Klobas and\n                  Matjaz Krnc},\n  editor       = {Chi{-}Yeh Chen and\n                  Wing{-}Kai Hon and\n                  Ling{-}Ju Hung and\n                  Chia{-}Wei Lee},\n  title        = {Distinguishing Graphs via Cycles},\n  booktitle    = {Computing and Combinatorics - 27th International Conference, {COCOON}\n                  2021, Tainan, Taiwan, October 24-26, 2021, Proceedings},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {13025},\n  pages        = {387--398},\n  publisher    = {Springer},\n  year         = {2021},\n  url          = {https://doi.org/10.1007/978-3-030-89543-3\\_33},\n  doi          = {10.1007/978-3-030-89543-3\\_33},\n  timestamp    = {Wed, 03 Nov 2021 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/cocoon/KlobasK21.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Graphs with Two Moplexes.\n \n \n \n \n\n\n \n Dallard, C.; Ganian, R.; Hatzel, M.; Krnc, M.; and Milanic, M.\n\n\n \n\n\n\n In Ferreira, C. E.; Lee, O.; and Miyazawa, F. K., editor(s), Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, LAGOS 2021, Online Event / São Paulo, Brazil, May 2021, volume 195, of Procedia Computer Science, pages 248–256, 2021. Elsevier\n \n\n\n\n
\n\n\n\n \n \n \"GraphsPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/lagos/DallardGHKM21,\n  author       = {Cl{\\'{e}}ment Dallard and\n                  Robert Ganian and\n                  Meike Hatzel and\n                  Matjaz Krnc and\n                  Martin Milanic},\n  editor       = {Carlos E. Ferreira and\n                  Orlando Lee and\n                  Fl{\\'{a}}vio Keidi Miyazawa},\n  title        = {Graphs with Two Moplexes},\n  booktitle    = {Proceedings of the {XI} Latin and American Algorithms, Graphs and\n                  Optimization Symposium, {LAGOS} 2021, Online Event / S{\\~{a}}o Paulo,\n                  Brazil, May 2021},\n  series       = {Procedia Computer Science},\n  volume       = {195},\n  pages        = {248--256},\n  publisher    = {Elsevier},\n  year         = {2021},\n  url          = {https://doi.org/10.1016/j.procs.2021.11.031},\n  doi          = {10.1016/J.PROCS.2021.11.031},\n  timestamp    = {Sat, 09 Apr 2022 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/lagos/DallardGHKM21.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Graphs with at most two moplexes.\n \n \n \n \n\n\n \n Dallard, C.; Ganian, R.; Hatzel, M.; Krnc, M.; and Milanic, M.\n\n\n \n\n\n\n CoRR, abs/2106.10049. 2021.\n \n\n\n\n
\n\n\n\n \n \n \"GraphsPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/corr/abs-2106-10049,\n  author       = {Cl{\\'{e}}ment Dallard and\n                  Robert Ganian and\n                  Meike Hatzel and\n                  Matjaz Krnc and\n                  Martin Milanic},\n  title        = {Graphs with at most two moplexes},\n  journal      = {CoRR},\n  volume       = {abs/2106.10049},\n  year         = {2021},\n  url          = {https://arxiv.org/abs/2106.10049},\n  eprinttype    = {arXiv},\n  eprint       = {2106.10049},\n  timestamp    = {Thu, 01 Jul 2021 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2106-10049.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Graphs where Search Methods are Indistinguishable.\n \n \n \n \n\n\n \n Krnc, M.; and Pivac, N.\n\n\n \n\n\n\n CoRR, abs/2109.00035. 2021.\n \n\n\n\n
\n\n\n\n \n \n \"GraphsPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/corr/abs-2109-00035,\n  author       = {Matjaz Krnc and\n                  Nevena Pivac},\n  title        = {Graphs where Search Methods are Indistinguishable},\n  journal      = {CoRR},\n  volume       = {abs/2109.00035},\n  year         = {2021},\n  url          = {https://arxiv.org/abs/2109.00035},\n  eprinttype    = {arXiv},\n  eprint       = {2109.00035},\n  timestamp    = {Mon, 20 Sep 2021 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2109-00035.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2020\n \n \n (8)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Recognizing generalized Petersen graphs in linear time.\n \n \n \n \n\n\n \n Krnc, M.; and Wilson, R. J.\n\n\n \n\n\n\n Discret. Appl. Math., 283: 756–761. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"RecognizingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/dam/KrncW20,\n  author       = {Matjaz Krnc and\n                  Robin J. Wilson},\n  title        = {Recognizing generalized Petersen graphs in linear time},\n  journal      = {Discret. Appl. Math.},\n  volume       = {283},\n  pages        = {756--761},\n  year         = {2020},\n  url          = {https://doi.org/10.1016/j.dam.2020.03.007},\n  doi          = {10.1016/J.DAM.2020.03.007},\n  timestamp    = {Thu, 06 Aug 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/dam/KrncW20.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Eccentricity of networks with structural constraints.\n \n \n \n \n\n\n \n Krnc, M.; Sereni, J.; Skrekovski, R.; and Yilma, Z. B.\n\n\n \n\n\n\n Discuss. Math. Graph Theory, 40(4): 1141–1162. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"EccentricityPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/dmgt/KrncSSY20,\n  author       = {Matjaz Krnc and\n                  Jean{-}S{\\'{e}}bastien Sereni and\n                  Riste Skrekovski and\n                  Zelealem B. Yilma},\n  title        = {Eccentricity of networks with structural constraints},\n  journal      = {Discuss. Math. Graph Theory},\n  volume       = {40},\n  number       = {4},\n  pages        = {1141--1162},\n  year         = {2020},\n  url          = {https://doi.org/10.7151/dmgt.2180},\n  doi          = {10.7151/DMGT.2180},\n  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/dmgt/KrncSSY20.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Fair Packing of Independent Sets.\n \n \n \n \n\n\n \n Chiarelli, N.; Krnc, M.; Milanic, M.; Pferschy, U.; Pivac, N.; and Schauer, J.\n\n\n \n\n\n\n In Gasieniec, L.; Klasing, R.; and Radzik, T., editor(s), Combinatorial Algorithms - 31st International Workshop, IWOCA 2020, Bordeaux, France, June 8-10, 2020, Proceedings, volume 12126, of Lecture Notes in Computer Science, pages 154–165, 2020. Springer\n \n\n\n\n
\n\n\n\n \n \n \"FairPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/iwoca/ChiarelliKMPPS20,\n  author       = {Nina Chiarelli and\n                  Matjaz Krnc and\n                  Martin Milanic and\n                  Ulrich Pferschy and\n                  Nevena Pivac and\n                  Joachim Schauer},\n  editor       = {Leszek Gasieniec and\n                  Ralf Klasing and\n                  Tomasz Radzik},\n  title        = {Fair Packing of Independent Sets},\n  booktitle    = {Combinatorial Algorithms - 31st International Workshop, {IWOCA} 2020,\n                  Bordeaux, France, June 8-10, 2020, Proceedings},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {12126},\n  pages        = {154--165},\n  publisher    = {Springer},\n  year         = {2020},\n  url          = {https://doi.org/10.1007/978-3-030-48966-3\\_12},\n  doi          = {10.1007/978-3-030-48966-3\\_12},\n  timestamp    = {Tue, 29 Dec 2020 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/iwoca/ChiarelliKMPPS20.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Positive Aging Admits Fast Asynchronous Plurality Consensus.\n \n \n \n \n\n\n \n Bankhamer, G.; Elsässer, R.; Kaaser, D.; and Krnc, M.\n\n\n \n\n\n\n In Emek, Y.; and Cachin, C., editor(s), PODC '20: ACM Symposium on Principles of Distributed Computing, Virtual Event, Italy, August 3-7, 2020, pages 385–394, 2020. ACM\n \n\n\n\n
\n\n\n\n \n \n \"PositivePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/podc/BankhamerEKK20,\n  author       = {Gregor Bankhamer and\n                  Robert Els{\\"{a}}sser and\n                  Dominik Kaaser and\n                  Matjaz Krnc},\n  editor       = {Yuval Emek and\n                  Christian Cachin},\n  title        = {Positive Aging Admits Fast Asynchronous Plurality Consensus},\n  booktitle    = {{PODC} '20: {ACM} Symposium on Principles of Distributed Computing,\n                  Virtual Event, Italy, August 3-7, 2020},\n  pages        = {385--394},\n  publisher    = {{ACM}},\n  year         = {2020},\n  url          = {https://doi.org/10.1145/3382734.3406506},\n  doi          = {10.1145/3382734.3406506},\n  timestamp    = {Tue, 04 Aug 2020 16:04:51 +0200},\n  biburl       = {https://dblp.org/rec/conf/podc/BankhamerEKK20.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Edge Elimination and Weighted Graph Classes.\n \n \n \n \n\n\n \n Beisegel, J.; Chiarelli, N.; Köhler, E.; Krnc, M.; Milanic, M.; Pivac, N.; Scheffler, R.; and Strehler, M.\n\n\n \n\n\n\n In Adler, I.; and Müller, H., editor(s), Graph-Theoretic Concepts in Computer Science - 46th International Workshop, WG 2020, Leeds, UK, June 24-26, 2020, Revised Selected Papers, volume 12301, of Lecture Notes in Computer Science, pages 134–147, 2020. Springer\n \n\n\n\n
\n\n\n\n \n \n \"EdgePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/wg/BeisegelCKKMPSS20,\n  author       = {Jesse Beisegel and\n                  Nina Chiarelli and\n                  Ekkehard K{\\"{o}}hler and\n                  Matjaz Krnc and\n                  Martin Milanic and\n                  Nevena Pivac and\n                  Robert Scheffler and\n                  Martin Strehler},\n  editor       = {Isolde Adler and\n                  Haiko M{\\"{u}}ller},\n  title        = {Edge Elimination and Weighted Graph Classes},\n  booktitle    = {Graph-Theoretic Concepts in Computer Science - 46th International\n                  Workshop, {WG} 2020, Leeds, UK, June 24-26, 2020, Revised Selected\n                  Papers},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {12301},\n  pages        = {134--147},\n  publisher    = {Springer},\n  year         = {2020},\n  url          = {https://doi.org/10.1007/978-3-030-60440-0\\_11},\n  doi          = {10.1007/978-3-030-60440-0\\_11},\n  timestamp    = {Mon, 04 Jul 2022 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/wg/BeisegelCKKMPSS20.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Fair packing of independent sets.\n \n \n \n \n\n\n \n Chiarelli, N.; Krnc, M.; Milanic, M.; Pferschy, U.; Pivac, N.; and Schauer, J.\n\n\n \n\n\n\n CoRR, abs/2003.11313. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"FairPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/corr/abs-2003-11313,\n  author       = {Nina Chiarelli and\n                  Matjaz Krnc and\n                  Martin Milanic and\n                  Ulrich Pferschy and\n                  Nevena Pivac and\n                  Joachim Schauer},\n  title        = {Fair packing of independent sets},\n  journal      = {CoRR},\n  volume       = {abs/2003.11313},\n  year         = {2020},\n  url          = {https://arxiv.org/abs/2003.11313},\n  eprinttype    = {arXiv},\n  eprint       = {2003.11313},\n  timestamp    = {Wed, 01 Apr 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2003-11313.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Shifting paths to avoidable ones.\n \n \n \n \n\n\n \n Gurvich, V.; Krnc, M.; Milanic, M.; and Vyalyi, M. N.\n\n\n \n\n\n\n CoRR, abs/2008.01128. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"ShiftingPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/corr/abs-2008-01128,\n  author       = {Vladimir Gurvich and\n                  Matjaz Krnc and\n                  Martin Milanic and\n                  Mikhail N. Vyalyi},\n  title        = {Shifting paths to avoidable ones},\n  journal      = {CoRR},\n  volume       = {abs/2008.01128},\n  year         = {2020},\n  url          = {https://arxiv.org/abs/2008.01128},\n  eprinttype    = {arXiv},\n  eprint       = {2008.01128},\n  timestamp    = {Fri, 07 Aug 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2008-01128.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Fast recognition of some parametric graph families.\n \n \n \n \n\n\n \n Klobas, N.; and Krnc, M.\n\n\n \n\n\n\n CoRR, abs/2008.08856. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"FastPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/corr/abs-2008-08856,\n  author       = {Nina Klobas and\n                  Matjaz Krnc},\n  title        = {Fast recognition of some parametric graph families},\n  journal      = {CoRR},\n  volume       = {abs/2008.08856},\n  year         = {2020},\n  url          = {https://arxiv.org/abs/2008.08856},\n  eprinttype    = {arXiv},\n  eprint       = {2008.08856},\n  timestamp    = {Sat, 23 Jan 2021 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2008-08856.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2019\n \n \n (3)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n On the End-Vertex Problem of Graph Searches.\n \n \n \n \n\n\n \n Beisegel, J.; Denkert, C.; Köhler, E.; Krnc, M.; Pivac, N.; Scheffler, R.; and Strehler, M.\n\n\n \n\n\n\n Discret. Math. Theor. Comput. Sci., 21(1). 2019.\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/dmtcs/BeisegelDKKPSS19,\n  author       = {Jesse Beisegel and\n                  Carolin Denkert and\n                  Ekkehard K{\\"{o}}hler and\n                  Matjaz Krnc and\n                  Nevena Pivac and\n                  Robert Scheffler and\n                  Martin Strehler},\n  title        = {On the End-Vertex Problem of Graph Searches},\n  journal      = {Discret. Math. Theor. Comput. Sci.},\n  volume       = {21},\n  number       = {1},\n  year         = {2019},\n  url          = {https://doi.org/10.23638/DMTCS-21-1-13},\n  doi          = {10.23638/DMTCS-21-1-13},\n  timestamp    = {Sun, 12 Feb 2023 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/dmtcs/BeisegelDKKPSS19.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Generalized Petersen graphs and Kronecker covers.\n \n \n \n \n\n\n \n Krnc, M.; and Pisanski, T.\n\n\n \n\n\n\n Discret. Math. Theor. Comput. Sci., 21(4). 2019.\n \n\n\n\n
\n\n\n\n \n \n \"GeneralizedPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/dmtcs/KrncP19,\n  author       = {Matjaz Krnc and\n                  Tomaz Pisanski},\n  title        = {Generalized Petersen graphs and Kronecker covers},\n  journal      = {Discret. Math. Theor. Comput. Sci.},\n  volume       = {21},\n  number       = {4},\n  year         = {2019},\n  url          = {https://doi.org/10.23638/DMTCS-21-4-15},\n  doi          = {10.23638/DMTCS-21-4-15},\n  timestamp    = {Tue, 24 Jan 2023 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/dmtcs/KrncP19.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Recognizing Graph Search Trees.\n \n \n \n \n\n\n \n Beisegel, J.; Denkert, C.; Köhler, E.; Krnc, M.; Pivac, N.; Scheffler, R.; and Strehler, M.\n\n\n \n\n\n\n In Coutinho, G.; Kohayakawa, Y.; dos Santos, V. F.; and Urrutia, S., editor(s), Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, LAGOS 2019, Belo Horizonte, Brazil, June 2-7, 2019, volume 346, of Electronic Notes in Theoretical Computer Science, pages 99–110, 2019. Elsevier\n \n\n\n\n
\n\n\n\n \n \n \"RecognizingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:journals/entcs/BeisegelDKKPSS19,\n  author       = {Jesse Beisegel and\n                  Carolin Denkert and\n                  Ekkehard K{\\"{o}}hler and\n                  Matjaz Krnc and\n                  Nevena Pivac and\n                  Robert Scheffler and\n                  Martin Strehler},\n  editor       = {Gabriel Coutinho and\n                  Yoshiharu Kohayakawa and\n                  Vin{\\'{\\i}}cius Fernandes dos Santos and\n                  Sebasti{\\'{a}}n Urrutia},\n  title        = {Recognizing Graph Search Trees},\n  booktitle    = {Proceedings of the tenth Latin and American Algorithms, Graphs and\n                  Optimization Symposium, {LAGOS} 2019, Belo Horizonte, Brazil, June\n                  2-7, 2019},\n  series       = {Electronic Notes in Theoretical Computer Science},\n  volume       = {346},\n  pages        = {99--110},\n  publisher    = {Elsevier},\n  year         = {2019},\n  url          = {https://doi.org/10.1016/j.entcs.2019.08.010},\n  doi          = {10.1016/J.ENTCS.2019.08.010},\n  timestamp    = {Tue, 16 Aug 2022 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/entcs/BeisegelDKKPSS19.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2018\n \n \n (3)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Fast Consensus Protocols in the Asynchronous Poisson Clock Model with Edge Latencies.\n \n \n \n \n\n\n \n Bankhamer, G.; Elsässer, R.; Kaaser, D.; and Krnc, M.\n\n\n \n\n\n\n CoRR, abs/1806.02596. 2018.\n \n\n\n\n
\n\n\n\n \n \n \"FastPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/corr/abs-1806-02596,\n  author       = {Gregor Bankhamer and\n                  Robert Els{\\"{a}}sser and\n                  Dominik Kaaser and\n                  Matjaz Krnc},\n  title        = {Fast Consensus Protocols in the Asynchronous Poisson Clock Model with\n                  Edge Latencies},\n  journal      = {CoRR},\n  volume       = {abs/1806.02596},\n  year         = {2018},\n  url          = {http://arxiv.org/abs/1806.02596},\n  eprinttype    = {arXiv},\n  eprint       = {1806.02596},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-1806-02596.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On the End-Vertex Problem of Graph Searches.\n \n \n \n \n\n\n \n Beisegel, J.; Denkert, C.; Köhler, E.; Krnc, M.; Pivac, N.; Scheffler, R.; and Strehler, M.\n\n\n \n\n\n\n CoRR, abs/1810.12253. 2018.\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/corr/abs-1810-12253,\n  author       = {Jesse Beisegel and\n                  Carolin Denkert and\n                  Ekkehard K{\\"{o}}hler and\n                  Matjaz Krnc and\n                  Nevena Pivac and\n                  Robert Scheffler and\n                  Martin Strehler},\n  title        = {On the End-Vertex Problem of Graph Searches},\n  journal      = {CoRR},\n  volume       = {abs/1810.12253},\n  year         = {2018},\n  url          = {http://arxiv.org/abs/1810.12253},\n  eprinttype    = {arXiv},\n  eprint       = {1810.12253},\n  timestamp    = {Mon, 04 Jul 2022 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-1810-12253.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Recognizing Graph Search Trees.\n \n \n \n \n\n\n \n Beisegel, J.; Denkert, C.; Köhler, E.; Krnc, M.; Pivac, N.; Scheffler, R.; and Strehler, M.\n\n\n \n\n\n\n CoRR, abs/1811.09249. 2018.\n \n\n\n\n
\n\n\n\n \n \n \"RecognizingPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/corr/abs-1811-09249,\n  author       = {Jesse Beisegel and\n                  Carolin Denkert and\n                  Ekkehard K{\\"{o}}hler and\n                  Matjaz Krnc and\n                  Nevena Pivac and\n                  Robert Scheffler and\n                  Martin Strehler},\n  title        = {Recognizing Graph Search Trees},\n  journal      = {CoRR},\n  volume       = {abs/1811.09249},\n  year         = {2018},\n  url          = {http://arxiv.org/abs/1811.09249},\n  eprinttype    = {arXiv},\n  eprint       = {1811.09249},\n  timestamp    = {Mon, 04 Jul 2022 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-1811-09249.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2016\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Closeness centralization measure for two-mode data of prescribed sizes.\n \n \n \n \n\n\n \n Krnc, M.; Sereni, J.; Skrekovski, R.; and Yilma, Z. B.\n\n\n \n\n\n\n Netw. Sci., 4(4): 474–490. 2016.\n \n\n\n\n
\n\n\n\n \n \n \"ClosenessPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/netsci/KrncSSY16,\n  author       = {Matjaz Krnc and\n                  Jean{-}S{\\'{e}}bastien Sereni and\n                  Riste Skrekovski and\n                  Zelealem B. Yilma},\n  title        = {Closeness centralization measure for two-mode data of prescribed sizes},\n  journal      = {Netw. Sci.},\n  volume       = {4},\n  number       = {4},\n  pages        = {474--490},\n  year         = {2016},\n  url          = {https://doi.org/10.1017/nws.2016.14},\n  doi          = {10.1017/NWS.2016.14},\n  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/netsci/KrncSSY16.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2015\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Group centralization of network indices.\n \n \n \n \n\n\n \n Krnc, M.; and Skrekovski, R.\n\n\n \n\n\n\n Discret. Appl. Math., 186: 147–157. 2015.\n \n\n\n\n
\n\n\n\n \n \n \"GroupPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/dam/KrncS15,\n  author       = {Matjaz Krnc and\n                  Riste Skrekovski},\n  title        = {Group centralization of network indices},\n  journal      = {Discret. Appl. Math.},\n  volume       = {186},\n  pages        = {147--157},\n  year         = {2015},\n  url          = {https://doi.org/10.1016/j.dam.2015.01.007},\n  doi          = {10.1016/J.DAM.2015.01.007},\n  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/dam/KrncS15.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Centralization of transmission in networks.\n \n \n \n \n\n\n \n Krnc, M.; and Skrekovski, R.\n\n\n \n\n\n\n Discret. Math., 338(12): 2412–2420. 2015.\n \n\n\n\n
\n\n\n\n \n \n \"CentralizationPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/dm/KrncS15,\n  author       = {Matjaz Krnc and\n                  Riste Skrekovski},\n  title        = {Centralization of transmission in networks},\n  journal      = {Discret. Math.},\n  volume       = {338},\n  number       = {12},\n  pages        = {2412--2420},\n  year         = {2015},\n  url          = {https://doi.org/10.1016/j.disc.2015.06.011},\n  doi          = {10.1016/J.DISC.2015.06.011},\n  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/dm/KrncS15.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2012\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Cyclic colorings of plane graphs with independent faces.\n \n \n \n \n\n\n \n Azarija, J.; Erman, R.; Král', D.; Krnc, M.; and Stacho, L.\n\n\n \n\n\n\n Eur. J. Comb., 33(3): 294–301. 2012.\n \n\n\n\n
\n\n\n\n \n \n \"CyclicPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/ejc/AzarijaEKKS12,\n  author       = {Jernej Azarija and\n                  Rok Erman and\n                  Daniel Kr{\\'{a}}l' and\n                  Matjaz Krnc and\n                  Ladislav Stacho},\n  title        = {Cyclic colorings of plane graphs with independent faces},\n  journal      = {Eur. J. Comb.},\n  volume       = {33},\n  number       = {3},\n  pages        = {294--301},\n  year         = {2012},\n  url          = {https://doi.org/10.1016/j.ejc.2011.09.011},\n  doi          = {10.1016/J.EJC.2011.09.011},\n  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/ejc/AzarijaEKKS12.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Extending Fractional Precolorings.\n \n \n \n \n\n\n \n Král', D.; Krnc, M.; Kupec, M.; Luzar, B.; and Volec, J.\n\n\n \n\n\n\n SIAM J. Discret. Math., 26(2): 647–660. 2012.\n \n\n\n\n
\n\n\n\n \n \n \"ExtendingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/siamdm/KralKKLV12,\n  author       = {Daniel Kr{\\'{a}}l' and\n                  Matjaz Krnc and\n                  Martin Kupec and\n                  Borut Luzar and\n                  Jan Volec},\n  title        = {Extending Fractional Precolorings},\n  journal      = {{SIAM} J. Discret. Math.},\n  volume       = {26},\n  number       = {2},\n  pages        = {647--660},\n  year         = {2012},\n  url          = {https://doi.org/10.1137/110828988},\n  doi          = {10.1137/110828988},\n  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/siamdm/KralKKLV12.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2010\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Improved induced matchings in sparse graphs.\n \n \n \n \n\n\n \n Erman, R.; Kowalik, L.; Krnc, M.; and Walen, T.\n\n\n \n\n\n\n Discret. Appl. Math., 158(18): 1994–2003. 2010.\n \n\n\n\n
\n\n\n\n \n \n \"ImprovedPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/dam/ErmanKKW10,\n  author       = {Rok Erman and\n                  Lukasz Kowalik and\n                  Matjaz Krnc and\n                  Tomasz Walen},\n  title        = {Improved induced matchings in sparse graphs},\n  journal      = {Discret. Appl. Math.},\n  volume       = {158},\n  number       = {18},\n  pages        = {1994--2003},\n  year         = {2010},\n  url          = {https://doi.org/10.1016/j.dam.2010.08.026},\n  doi          = {10.1016/J.DAM.2010.08.026},\n  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/dam/ErmanKKW10.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2009\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Improved Induced Matchings in Sparse Graphs.\n \n \n \n \n\n\n \n Erman, R.; Kowalik, L.; Krnc, M.; and Walen, T.\n\n\n \n\n\n\n In Chen, J.; and Fomin, F. V., editor(s), Parameterized and Exact Computation, 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers, volume 5917, of Lecture Notes in Computer Science, pages 134–148, 2009. Springer\n \n\n\n\n
\n\n\n\n \n \n \"ImprovedPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/iwpec/ErmanKKW09,\n  author       = {Rok Erman and\n                  Lukasz Kowalik and\n                  Matjaz Krnc and\n                  Tomasz Walen},\n  editor       = {Jianer Chen and\n                  Fedor V. Fomin},\n  title        = {Improved Induced Matchings in Sparse Graphs},\n  booktitle    = {Parameterized and Exact Computation, 4th International Workshop, {IWPEC}\n                  2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected\n                  Papers},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {5917},\n  pages        = {134--148},\n  publisher    = {Springer},\n  year         = {2009},\n  url          = {https://doi.org/10.1007/978-3-642-11269-0\\_11},\n  doi          = {10.1007/978-3-642-11269-0\\_11},\n  timestamp    = {Tue, 14 May 2019 10:00:45 +0200},\n  biburl       = {https://dblp.org/rec/conf/iwpec/ErmanKKW09.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n\n\n\n
\n\n\n \n\n \n \n \n \n\n
\n"}; document.write(bibbase_data.data);