default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Zbigniew Lonc
@inproceedings{DBLP:conf/ijcai/Lonc23,
author = {Zbigniew Lonc},
title = {Approximating Fair Division on D-Claw-Free Graphs},
booktitle = {Proceedings of the Thirty-Second International Joint Conference on
Artificial Intelligence, {IJCAI} 2023, 19th-25th August 2023, Macao,
SAR, China},
pages = {2826--2834},
publisher = {ijcai.org},
year = {2023},
url = {https://doi.org/10.24963/ijcai.2023/315},
doi = {10.24963/IJCAI.2023/315},
timestamp = {Mon, 28 Aug 2023 17:23:07 +0200},
biburl = {https://dblp.org/rec/conf/ijcai/Lonc23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/LoncP22,
author = {Zbigniew Lonc and
Nataliya Petryshyn},
title = {Edge decompositions and rooted packings of graphs},
journal = {Discret. Math.},
volume = {345},
number = {12},
pages = {113057},
year = {2022},
url = {https://doi.org/10.1016/j.disc.2022.113057},
doi = {10.1016/J.DISC.2022.113057},
timestamp = {Tue, 18 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/LoncP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/DebskiLOPR22,
author = {Michal Debski and
Zbigniew Lonc and
Karolina Okrasa and
Marta Piecyk and
Pawel Rzazewski},
editor = {Sang Won Bae and
Heejin Park},
title = {Computing Homomorphisms in Hereditary Graph Classes: The Peculiar
Case of the 5-Wheel and Graphs with No Long Claws},
booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC}
2022, December 19-21, 2022, Seoul, Korea},
series = {LIPIcs},
volume = {248},
pages = {14:1--14:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.14},
doi = {10.4230/LIPICS.ISAAC.2022.14},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/DebskiLOPR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2205-13270,
author = {Michal Debski and
Zbigniew Lonc and
Karolina Okrasa and
Marta Piecyk and
Pawel Rzazewski},
title = {Computing homomorphisms in hereditary graph classes: the peculiar
case of the 5-wheel and graphs with no long claws},
journal = {CoRR},
volume = {abs/2205.13270},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2205.13270},
doi = {10.48550/ARXIV.2205.13270},
eprinttype = {arXiv},
eprint = {2205.13270},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2205-13270.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DebskiJL20,
author = {Michal Debski and
Konstanty Junosza{-}Szaniawski and
Zbigniew Lonc},
title = {Bundling all shortest paths},
journal = {Discret. Appl. Math.},
volume = {277},
pages = {82--91},
year = {2020},
url = {https://doi.org/10.1016/j.dam.2019.08.027},
doi = {10.1016/J.DAM.2019.08.027},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/DebskiJL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jair/TruszczynskiL20,
author = {Miroslaw Truszczynski and
Zbigniew Lonc},
title = {Maximin Share Allocations on Cycles},
journal = {J. Artif. Intell. Res.},
volume = {69},
pages = {613--655},
year = {2020},
url = {https://doi.org/10.1613/jair.1.11702},
doi = {10.1613/JAIR.1.11702},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jair/TruszczynskiL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1905-03038,
author = {Zbigniew Lonc and
Miroslaw Truszczynski},
title = {Maximin share allocations on cycles},
journal = {CoRR},
volume = {abs/1905.03038},
year = {2019},
url = {http://arxiv.org/abs/1905.03038},
eprinttype = {arXiv},
eprint = {1905.03038},
timestamp = {Mon, 27 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1905-03038.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/DebskiLR18,
author = {Michal Debski and
Zbigniew Lonc and
Pawel Rzazewski},
title = {Achromatic and Harmonious Colorings of Circulant Graphs},
journal = {J. Graph Theory},
volume = {87},
number = {1},
pages = {18--34},
year = {2018},
url = {https://doi.org/10.1002/jgt.22137},
doi = {10.1002/JGT.22137},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgt/DebskiLR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/LoncT18,
author = {Zbigniew Lonc and
Miroslaw Truszczynski},
editor = {J{\'{e}}r{\^{o}}me Lang},
title = {Maximin Share Allocations on Cycles},
booktitle = {Proceedings of the Twenty-Seventh International Joint Conference on
Artificial Intelligence, {IJCAI} 2018, July 13-19, 2018, Stockholm,
Sweden},
pages = {410--416},
publisher = {ijcai.org},
year = {2018},
url = {https://doi.org/10.24963/ijcai.2018/57},
doi = {10.24963/IJCAI.2018/57},
timestamp = {Tue, 20 Aug 2019 16:19:08 +0200},
biburl = {https://dblp.org/rec/conf/ijcai/LoncT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DebskiLR17,
author = {Michal Debski and
Zbigniew Lonc and
Pawel Rzazewski},
title = {Sequences of radius k for complete bipartite graphs},
journal = {Discret. Appl. Math.},
volume = {225},
pages = {51--63},
year = {2017},
url = {https://doi.org/10.1016/j.dam.2017.03.017},
doi = {10.1016/J.DAM.2017.03.017},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/DebskiLR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Lonc17,
author = {Zbigniew Lonc},
title = {Note on a construction of short k-radius sequences},
journal = {Discret. Math.},
volume = {340},
number = {3},
pages = {504--507},
year = {2017},
url = {https://doi.org/10.1016/j.disc.2016.09.010},
doi = {10.1016/J.DISC.2016.09.010},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Lonc17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/LoncNR17,
author = {Zbigniew Lonc and
Pawel Naroski and
Pawel Rzazewski},
title = {Tight Euler tours in uniform hypergraphs - computational aspects},
journal = {Discret. Math. Theor. Comput. Sci.},
volume = {19},
number = {3},
year = {2017},
url = {https://doi.org/10.23638/DMTCS-19-3-2},
doi = {10.23638/DMTCS-19-3-2},
timestamp = {Sun, 12 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dmtcs/LoncNR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/DebskiLR17,
author = {Michal Debski and
Zbigniew Lonc and
Pawel Rzazewski},
title = {Harmonious and achromatic colorings of fragmentable hypergraphs},
journal = {Eur. J. Comb.},
volume = {66},
pages = {60--80},
year = {2017},
url = {https://doi.org/10.1016/j.ejc.2017.06.013},
doi = {10.1016/J.EJC.2017.06.013},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/DebskiLR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BondyLR17,
author = {J. Adrian Bondy and
Zbigniew Lonc and
Pawel Rzazewski},
title = {Erratum: Constructing Optimal k-Radius Sequences},
journal = {{SIAM} J. Discret. Math.},
volume = {31},
number = {1},
pages = {645--646},
year = {2017},
url = {https://doi.org/10.1137/16M108505X},
doi = {10.1137/16M108505X},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/BondyLR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LoncNR17,
author = {Zbigniew Lonc and
Pawel Naroski and
Pawel Rzazewski},
title = {Tight Euler tours in uniform hypergraphs - computational aspects},
journal = {CoRR},
volume = {abs/1706.09356},
year = {2017},
url = {http://arxiv.org/abs/1706.09356},
eprinttype = {arXiv},
eprint = {1706.09356},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/LoncNR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1711-05091,
author = {Michal Debski and
Zbigniew Lonc and
Pawel Rzazewski},
title = {Sequences of radius k for complete bipartite graphs},
journal = {CoRR},
volume = {abs/1711.05091},
year = {2017},
url = {http://arxiv.org/abs/1711.05091},
eprinttype = {arXiv},
eprint = {1711.05091},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1711-05091.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/LoncT16,
author = {Zbigniew Lonc and
Miroslaw Truszczynski},
title = {Packing analogue of k-radius sequences},
journal = {Eur. J. Comb.},
volume = {57},
pages = {57--70},
year = {2016},
url = {https://doi.org/10.1016/j.ejc.2016.04.004},
doi = {10.1016/J.EJC.2016.04.004},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/LoncT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/DebskiL16,
author = {Michal Debski and
Zbigniew Lonc},
title = {Universal Cycle Packings and Coverings for k-Subsets of an n-Set},
journal = {Graphs Comb.},
volume = {32},
number = {6},
pages = {2323--2337},
year = {2016},
url = {https://doi.org/10.1007/s00373-016-1727-6},
doi = {10.1007/S00373-016-1727-6},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/gc/DebskiL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BondyLR16,
author = {J. Adrian Bondy and
Zbigniew Lonc and
Pawel Rzazewski},
title = {Constructing Optimal k-Radius Sequences},
journal = {{SIAM} J. Discret. Math.},
volume = {30},
number = {1},
pages = {452--464},
year = {2016},
url = {https://doi.org/10.1137/15M1023506},
doi = {10.1137/15M1023506},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/BondyLR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/DebskiLR16,
author = {Michal Debski and
Zbigniew Lonc and
Pawel Rzazewski},
editor = {Pinar Heggernes},
title = {Sequences of Radius k for Complete Bipartite Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science - 42nd International
Workshop, {WG} 2016, Istanbul, Turkey, June 22-24, 2016, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {9941},
pages = {1--12},
year = {2016},
url = {https://doi.org/10.1007/978-3-662-53536-3\_1},
doi = {10.1007/978-3-662-53536-3\_1},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/DebskiLR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/DebskiLR15,
author = {Michal Debski and
Zbigniew Lonc and
Pawel Rzazewski},
title = {Harmonious and achromatic colorings of fragmentable hypergraphs},
journal = {Electron. Notes Discret. Math.},
volume = {49},
pages = {309--314},
year = {2015},
url = {https://doi.org/10.1016/j.endm.2015.06.042},
doi = {10.1016/J.ENDM.2015.06.042},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/DebskiLR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/DebskiL14,
author = {Michal Debski and
Zbigniew Lonc},
title = {Sequences of large radius},
journal = {Eur. J. Comb.},
volume = {41},
pages = {197--204},
year = {2014},
url = {https://doi.org/10.1016/j.ejc.2014.04.005},
doi = {10.1016/J.EJC.2014.04.005},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/DebskiL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/LoncP14,
author = {Zbigniew Lonc and
Nataliya Petryshyn},
title = {On Rooted Packings, Decompositions, and Factors of Graphs},
journal = {J. Graph Theory},
volume = {76},
number = {2},
pages = {106--128},
year = {2014},
url = {https://doi.org/10.1002/jgt.21753},
doi = {10.1002/JGT.21753},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgt/LoncP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/LoncW13,
author = {Zbigniew Lonc and
Karolina Warno},
title = {Minimum size transversals in uniform hypergraphs},
journal = {Discret. Math.},
volume = {313},
number = {23},
pages = {2798--2815},
year = {2013},
url = {https://doi.org/10.1016/j.disc.2013.08.022},
doi = {10.1016/J.DISC.2013.08.022},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/LoncW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/GrytczukL12,
author = {Jaroslaw Grytczuk and
Zbigniew Lonc},
title = {Preface},
journal = {Discret. Math.},
volume = {312},
number = {23},
pages = {3425},
year = {2012},
url = {https://doi.org/10.1016/j.disc.2012.09.006},
doi = {10.1016/J.DISC.2012.09.006},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/GrytczukL12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/LoncN12,
author = {Zbigniew Lonc and
Pawel Naroski},
title = {A linear time algorithm for finding an Euler walk in a strongly connected
3-uniform hypergraph},
journal = {Discret. Math. Theor. Comput. Sci.},
volume = {14},
number = {1},
pages = {147--158},
year = {2012},
url = {https://doi.org/10.46298/dmtcs.568},
doi = {10.46298/DMTCS.568},
timestamp = {Tue, 31 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dmtcs/LoncN12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/JaromczykLT12,
author = {Jerzy W. Jaromczyk and
Zbigniew Lonc and
Miroslaw Truszczynski},
title = {Constructions of asymptotically shortest k-radius sequences},
journal = {J. Comb. Theory {A}},
volume = {119},
number = {3},
pages = {731--746},
year = {2012},
url = {https://doi.org/10.1016/j.jcta.2011.11.009},
doi = {10.1016/J.JCTA.2011.11.009},
timestamp = {Fri, 07 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/JaromczykLT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/LoncT11,
author = {Zbigniew Lonc and
Miroslaw Truszczynski},
title = {On graph equivalences preserved under extensions},
journal = {Discret. Math.},
volume = {311},
number = {12},
pages = {966--977},
year = {2011},
url = {https://doi.org/10.1016/j.disc.2011.02.029},
doi = {10.1016/J.DISC.2011.02.029},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/LoncT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/Junosza-SzaniawskiLT11,
author = {Konstanty Junosza{-}Szaniawski and
Zbigniew Lonc and
Michal Tuczynski},
editor = {Petr Kolman and
Jan Kratochv{\'{\i}}l},
title = {Counting Independent Sets in Claw-Free Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science - 37th International
Workshop, {WG} 2011, Tepl{\'{a}} Monastery, Czech Republic, June
21-24, 2011. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {6986},
pages = {227--237},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-25870-1\_21},
doi = {10.1007/978-3-642-25870-1\_21},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/Junosza-SzaniawskiLT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/LoncN10,
author = {Zbigniew Lonc and
Pawel Naroski},
title = {On Tours that Contain All Edges of a Hypergraph},
journal = {Electron. J. Comb.},
volume = {17},
number = {1},
year = {2010},
url = {https://doi.org/10.37236/416},
doi = {10.37236/416},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/LoncN10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BrysL09,
author = {Krzysztof Brys and
Zbigniew Lonc},
title = {Polynomial cases of graph decomposition: {A} complete solution of
Holyer's problem},
journal = {Discret. Math.},
volume = {309},
number = {6},
pages = {1294--1326},
year = {2009},
url = {https://doi.org/10.1016/j.disc.2008.01.054},
doi = {10.1016/J.DISC.2008.01.054},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BrysL09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/LoncP09,
author = {Zbigniew Lonc and
Monika Pszczola},
title = {Edge decompositions into two kinds of graphs},
journal = {Discret. Math.},
volume = {309},
number = {22},
pages = {6368--6374},
year = {2009},
url = {https://doi.org/10.1016/j.disc.2008.10.024},
doi = {10.1016/J.DISC.2008.10.024},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/LoncP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/LoncT08,
author = {Zbigniew Lonc and
Miroslaw Truszczynski},
title = {On the number of minimal transversals in 3-uniform hypergraphs},
journal = {Discret. Math.},
volume = {308},
number = {16},
pages = {3668--3687},
year = {2008},
url = {https://doi.org/10.1016/j.disc.2007.07.024},
doi = {10.1016/J.DISC.2007.07.024},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/LoncT08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tplp/LoncT06,
author = {Zbigniew Lonc and
Miroslaw Truszczynski},
title = {Computing minimal models, stable models and answer sets},
journal = {Theory Pract. Log. Program.},
volume = {6},
number = {4},
pages = {395--449},
year = {2006},
url = {https://doi.org/10.1017/S1471068405002607},
doi = {10.1017/S1471068405002607},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tplp/LoncT06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0506104,
author = {Zbigniew Lonc and
Miroslaw Truszczynski},
title = {Computing minimal models, stable models and answer sets},
journal = {CoRR},
volume = {abs/cs/0506104},
year = {2005},
url = {http://arxiv.org/abs/cs/0506104},
eprinttype = {arXiv},
eprint = {cs/0506104},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0506104.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/LoncMS04,
author = {Zbigniew Lonc and
Mariusz Meszka and
Zdzislaw Skupien},
title = {Edge Decompositions of Multigraphs into 3-Matchings},
journal = {Graphs Comb.},
volume = {20},
number = {4},
pages = {507--515},
year = {2004},
url = {https://doi.org/10.1007/s00373-004-0581-0},
doi = {10.1007/S00373-004-0581-0},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/gc/LoncMS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/KouiderL04,
author = {Mekkia Kouider and
Zbigniew Lonc},
title = {Stability number and [\emph{a, b}]-factors in graphs},
journal = {J. Graph Theory},
volume = {46},
number = {4},
pages = {254--264},
year = {2004},
url = {https://doi.org/10.1002/jgt.20008},
doi = {10.1002/JGT.20008},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgt/KouiderL04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tplp/LoncT04,
author = {Zbigniew Lonc and
Miroslaw Truszczynski},
title = {Computing stable models: worst-case performance estimates},
journal = {Theory Pract. Log. Program.},
volume = {4},
number = {1-2},
pages = {193--231},
year = {2004},
url = {https://doi.org/10.1017/S147106840300173X},
doi = {10.1017/S147106840300173X},
timestamp = {Thu, 13 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tplp/LoncT04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/JaromczykL04,
author = {Jerzy W. Jaromczyk and
Zbigniew Lonc},
editor = {Rudolf Fleischer and
Gerhard Trippen},
title = {Sequences of Radius k: How to Fetch Many Huge Objects into Small Memory
for Pairwise Computations},
booktitle = {Algorithms and Computation, 15th International Symposium, {ISAAC}
2004, Hong Kong, China, December 20-22, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3341},
pages = {594--605},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-30551-4\_52},
doi = {10.1007/978-3-540-30551-4\_52},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/JaromczykL04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/ElzobiL03,
author = {Muktar E. Elzobi and
Zbigniew Lonc},
title = {Partitioning Boolean lattices into antichains},
journal = {Discret. Math.},
volume = {260},
number = {1-3},
pages = {45--55},
year = {2003},
url = {https://doi.org/10.1016/S0012-365X(02)00448-X},
doi = {10.1016/S0012-365X(02)00448-X},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/ElzobiL03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tocl/LoncT03,
author = {Zbigniew Lonc and
Miroslaw Truszczynski},
title = {Fixed-parameter complexity of semantics for logic programs},
journal = {{ACM} Trans. Comput. Log.},
volume = {4},
number = {1},
pages = {91--119},
year = {2003},
url = {https://doi.org/10.1145/601775.601779},
doi = {10.1145/601775.601779},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tocl/LoncT03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iclp/LoncT03,
author = {Zbigniew Lonc and
Miroslaw Truszczynski},
editor = {Catuscia Palamidessi},
title = {Computing Minimal Models, Stable Models, and Answer Sets},
booktitle = {Logic Programming, 19th International Conference, {ICLP} 2003, Mumbai,
India, December 9-13, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2916},
pages = {209--223},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-24599-5\_15},
doi = {10.1007/978-3-540-24599-5\_15},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iclp/LoncT03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iclp/LoncT02,
author = {Zbigniew Lonc and
Miroslaw Truszczynski},
editor = {Peter J. Stuckey},
title = {Computing Stable Models: Worst-Case Performance Estimates},
booktitle = {Logic Programming, 18th International Conference, {ICLP} 2002, Copenhagen,
Denmark, July 29 - August 1, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2401},
pages = {347--362},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45619-8\_24},
doi = {10.1007/3-540-45619-8\_24},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/iclp/LoncT02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-LO-0205013,
author = {Zbigniew Lonc and
Miroslaw Truszczynski},
title = {Computing stable models: worst-case performance estimates},
journal = {CoRR},
volume = {cs.LO/0205013},
year = {2002},
url = {https://arxiv.org/abs/cs/0205013},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-LO-0205013.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/LoncPW01,
author = {Zbigniew Lonc and
Krzysztof Parol and
Jacek Wojciechowski},
title = {On the number of spanning trees in directed circulant graphs},
journal = {Networks},
volume = {37},
number = {3},
pages = {129--133},
year = {2001},
url = {https://doi.org/10.1002/net.2},
doi = {10.1002/NET.2},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/LoncPW01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BrysL01,
author = {Krzysztof Brys and
Zbigniew Lonc},
title = {Monochromatic Partitions of Complete Uniform Hypergraphs},
journal = {{SIAM} J. Discret. Math.},
volume = {14},
number = {3},
pages = {286--290},
year = {2001},
url = {https://doi.org/10.1137/S0895480199357716},
doi = {10.1137/S0895480199357716},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/BrysL01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tplp/LoncT01,
author = {Zbigniew Lonc and
Miroslaw Truszczynski},
title = {On the problem of computing the well-founded semantics},
journal = {Theory Pract. Log. Program.},
volume = {1},
number = {5},
pages = {591--609},
year = {2001},
url = {https://doi.org/10.1017/S1471068401001053},
doi = {10.1017/S1471068401001053},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tplp/LoncT01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/acs2/LoncS01,
author = {Zbigniew Lonc and
Marian Srebrny},
editor = {Jerzy Soldek and
Jerzy Pejas},
title = {A Combinatorial Algorithm for Sharing a Key},
booktitle = {Advanced Computer Systems, Eighth International Conference, {ACS}
2001, Mielno, Poland, October 17-19, 2001 Proceedings},
pages = {393--406},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/978-1-4419-8530-9\_32},
doi = {10.1007/978-1-4419-8530-9\_32},
timestamp = {Thu, 24 Jan 2019 18:01:15 +0100},
biburl = {https://dblp.org/rec/conf/acs2/LoncS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iclp/LoncT01,
author = {Zbigniew Lonc and
Miroslaw Truszczynski},
editor = {Philippe Codognet},
title = {Fixed-Parameter Complexity of Semantics for Logic Programs},
booktitle = {Logic Programming, 17th International Conference, {ICLP} 2001, Paphos,
Cyprus, November 26 - December 1, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2237},
pages = {197--211},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45635-X\_21},
doi = {10.1007/3-540-45635-X\_21},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/iclp/LoncT01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-LO-0101014,
author = {Zbigniew Lonc and
Miroslaw Truszczynski},
title = {On the problem of computing the well-founded semantics},
journal = {CoRR},
volume = {cs.LO/0101014},
year = {2001},
url = {https://arxiv.org/abs/cs/0101014},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-LO-0101014.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-LO-0107027,
author = {Zbigniew Lonc and
Miroslaw Truszczynski},
title = {Fixed-parameter complexity of semantics for logic programs},
journal = {CoRR},
volume = {cs.LO/0107027},
year = {2001},
url = {https://arxiv.org/abs/cs/0107027},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-LO-0107027.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cl/LoncT00,
author = {Zbigniew Lonc and
Miroslaw Truszczynski},
editor = {John W. Lloyd and
Ver{\'{o}}nica Dahl and
Ulrich Furbach and
Manfred Kerber and
Kung{-}Kiu Lau and
Catuscia Palamidessi and
Lu{\'{\i}}s Moniz Pereira and
Yehoshua Sagiv and
Peter J. Stuckey},
title = {On the Problem of Computing the Well-Founded Semantics},
booktitle = {Computational Logic - {CL} 2000, First International Conference, London,
UK, 24-28 July, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1861},
pages = {673--687},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44957-4\_45},
doi = {10.1007/3-540-44957-4\_45},
timestamp = {Tue, 14 May 2019 10:00:42 +0200},
biburl = {https://dblp.org/rec/conf/cl/LoncT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/KouiderL99,
author = {Mekkia Kouider and
Zbigniew Lonc},
title = {Path decompositions and perfect path double covers},
journal = {Australas. {J} Comb.},
volume = {19},
pages = {261--274},
year = {1999},
url = {http://ajc.maths.uq.edu.au/pdf/19/ocr-ajc-v19-p261.pdf},
timestamp = {Wed, 11 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/KouiderL99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Lonc99,
author = {Zbigniew Lonc},
title = {On ordered sets without 2-colourings},
journal = {Discret. Math.},
volume = {201},
number = {1-3},
pages = {171--188},
year = {1999},
url = {https://doi.org/10.1016/S0012-365X(98)00318-5},
doi = {10.1016/S0012-365X(98)00318-5},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Lonc99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/LoncE99,
author = {Zbigniew Lonc and
Muktar E. Elzobi},
title = {Chain Partitions of Products of Two Chains},
journal = {J. Comb. Theory {A}},
volume = {86},
number = {1},
pages = {140--150},
year = {1999},
url = {https://doi.org/10.1006/jcta.1998.2925},
doi = {10.1006/JCTA.1998.2925},
timestamp = {Fri, 07 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/LoncE99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BrysL98,
author = {Krzysztof Brys and
Zbigniew Lonc},
title = {Clique and anticlique partitions of graphs},
journal = {Discret. Math.},
volume = {185},
number = {1-3},
pages = {41--49},
year = {1998},
url = {https://doi.org/10.1016/S0012-365X(97)00181-7},
doi = {10.1016/S0012-365X(97)00181-7},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BrysL98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/BrysKLM98,
author = {Krzysztof Brys and
Mekkia Kouider and
Zbigniew Lonc and
Maryvonne Mah{\'{e}}o},
title = {Decomposition of multigraphs},
journal = {Discuss. Math. Graph Theory},
volume = {18},
number = {2},
pages = {225--232},
year = {1998},
url = {https://doi.org/10.7151/dmgt.1078},
doi = {10.7151/DMGT.1078},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/BrysKLM98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Lonc97,
author = {Zbigniew Lonc},
title = {Delta-system decompositions of graphs},
journal = {Discret. Math.},
volume = {164},
number = {1-3},
pages = {221--224},
year = {1997},
url = {https://doi.org/10.1016/S0012-365X(96)00054-4},
doi = {10.1016/S0012-365X(96)00054-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Lonc97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Lonc97,
author = {Zbigniew Lonc},
title = {Edge Decomposition into Isomorphic Copies of\emph{sK}\({}_{\mbox{1,
2}}\)Is Polynomial},
journal = {J. Comb. Theory {B}},
volume = {69},
number = {2},
pages = {164--182},
year = {1997},
url = {https://doi.org/10.1006/jctb.1996.1735},
doi = {10.1006/JCTB.1996.1735},
timestamp = {Fri, 07 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/Lonc97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/LoncPW97,
author = {Zbigniew Lonc and
Krzysztof Parol and
Jacek Wojciechowski},
title = {On the asymptotic behavior of the maximum number of spanning trees
in circulant graphs},
journal = {Networks},
volume = {30},
number = {1},
pages = {47--56},
year = {1997},
url = {https://doi.org/10.1002/(SICI)1097-0037(199708)30:1\&\#60;47::AID-NET6\&\#62;3.0.CO;2-L},
doi = {10.1002/(SICI)1097-0037(199708)30:1\&\#60;47::AID-NET6\&\#62;3.0.CO;2-L},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/LoncPW97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/KouiderL96,
author = {Mekkia Kouider and
Zbigniew Lonc},
title = {Covering Cycles and \emph{k}-Term Degree Sums},
journal = {Comb.},
volume = {16},
number = {3},
pages = {407--412},
year = {1996},
url = {https://doi.org/10.1007/BF01261324},
doi = {10.1007/BF01261324},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/combinatorica/KouiderL96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Lonc96,
author = {Zbigniew Lonc},
title = {On the Complexity of Some Edge-partition Problems for Graphs},
journal = {Discret. Appl. Math.},
volume = {70},
number = {2},
pages = {177--183},
year = {1996},
url = {https://doi.org/10.1016/0166-218X(95)00107-3},
doi = {10.1016/0166-218X(95)00107-3},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Lonc96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/Lonc96,
author = {Zbigniew Lonc},
title = {Clique packings and clique partitions of graphs without odd chordles
cycles},
journal = {Discuss. Math. Graph Theory},
volume = {16},
number = {2},
pages = {143--149},
year = {1996},
url = {https://doi.org/10.7151/dmgt.1029},
doi = {10.7151/DMGT.1029},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/Lonc96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BrysL96,
author = {Krzysztof Brys and
Zbigniew Lonc},
editor = {Fabrizio d'Amore and
Paolo Giulio Franciosa and
Alberto Marchetti{-}Spaccamela},
title = {Clique and Anticlique Partition of Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 22nd International Workshop,
{WG} '96, Cadenabbia (Como), Italy, June 12-14, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1197},
pages = {67--72},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-62559-3\_7},
doi = {10.1007/3-540-62559-3\_7},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/BrysL96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Lonc94,
author = {Zbigniew Lonc},
title = {Partitions of large Boolean lattices},
journal = {Discret. Math.},
volume = {131},
number = {1-3},
pages = {173--181},
year = {1994},
url = {https://doi.org/10.1016/0012-365X(94)90382-4},
doi = {10.1016/0012-365X(94)90382-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Lonc94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Lonc93,
author = {Zbigniew Lonc},
title = {Majorization, packing, covering and matroids},
journal = {Discret. Math.},
volume = {121},
number = {1-3},
pages = {151--157},
year = {1993},
url = {https://doi.org/10.1016/0012-365X(93)90548-8},
doi = {10.1016/0012-365X(93)90548-8},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Lonc93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/Lonc93,
author = {Zbigniew Lonc},
editor = {Jan van Leeuwen},
title = {Toward a Solution of the Holyer's Problem},
booktitle = {Graph-Theoretic Concepts in Computer Science, 19th International Workshop,
{WG} '93, Utrecht, The Netherlands, June 16-18, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {790},
pages = {144--152},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57899-4\_48},
doi = {10.1007/3-540-57899-4\_48},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/Lonc93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/Lonc92,
author = {Zbigniew Lonc},
title = {Packing, covering and decomposing of a complete uniform hypergraph
into delta-systems},
journal = {Graphs Comb.},
volume = {8},
number = {4},
pages = {333--341},
year = {1992},
url = {https://doi.org/10.1007/BF02351590},
doi = {10.1007/BF02351590},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/gc/Lonc92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Lonc92,
author = {Zbigniew Lonc},
title = {Partitions, Packings and Coverings by Families with Nonempty Intersections},
journal = {J. Comb. Theory {A}},
volume = {61},
number = {2},
pages = {263--278},
year = {1992},
timestamp = {Fri, 07 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/Lonc92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/Lonc91,
author = {Zbigniew Lonc},
editor = {Gunther Schmidt and
Rudolf Berghammer},
title = {On Complexity of Some Chain and Antichain Partition Problems},
booktitle = {17th International Workshop, {WG} '91, Fischbachau, Germany, June
17-19, 1991, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {570},
pages = {97--104},
publisher = {Springer},
year = {1991},
url = {https://doi.org/10.1007/3-540-55121-2\_9},
doi = {10.1007/3-540-55121-2\_9},
timestamp = {Sun, 02 Oct 2022 16:17:33 +0200},
biburl = {https://dblp.org/rec/conf/wg/Lonc91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Lonc90,
author = {Zbigniew Lonc},
title = {Solution of a delta-system decomposition problem},
journal = {J. Comb. Theory {A}},
volume = {55},
number = {1},
pages = {33--48},
year = {1990},
url = {https://doi.org/10.1016/0097-3165(90)90045-X},
doi = {10.1016/0097-3165(90)90045-X},
timestamp = {Fri, 07 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/Lonc90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Lonc89,
author = {Zbigniew Lonc},
title = {On decomposition of hypergraphs into Delta-systems},
journal = {J. Comb. Theory {A}},
volume = {52},
number = {1},
pages = {158--162},
year = {1989},
url = {https://doi.org/10.1016/0097-3165(89)90070-8},
doi = {10.1016/0097-3165(89)90070-8},
timestamp = {Fri, 07 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/Lonc89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Lonc89,
author = {Zbigniew Lonc},
title = {Decompositions of graphs into trees},
journal = {J. Graph Theory},
volume = {13},
number = {4},
pages = {393--403},
year = {1989},
url = {https://doi.org/10.1002/jgt.3190130403},
doi = {10.1002/JGT.3190130403},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgt/Lonc89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Lonc88,
author = {Zbigniew Lonc},
title = {On resolvable tree-decompositions of complete graphs},
journal = {J. Graph Theory},
volume = {12},
number = {2},
pages = {295--303},
year = {1988},
url = {https://doi.org/10.1002/jgt.3190120219},
doi = {10.1002/JGT.3190120219},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgt/Lonc88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Lonc87,
author = {Zbigniew Lonc},
title = {Decompositions of hypergraphs into hyperstars},
journal = {Discret. Math.},
volume = {66},
number = {1-2},
pages = {157--168},
year = {1987},
url = {https://doi.org/10.1016/0012-365X(87)90128-2},
doi = {10.1016/0012-365X(87)90128-2},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Lonc87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/LoncR87,
author = {Zbigniew Lonc and
Ivan Rival},
title = {Chains, antichains, and fibres},
journal = {J. Comb. Theory {A}},
volume = {44},
number = {2},
pages = {207--228},
year = {1987},
url = {https://doi.org/10.1016/0097-3165(87)90029-X},
doi = {10.1016/0097-3165(87)90029-X},
timestamp = {Fri, 07 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/LoncR87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fodo/Lonc81,
author = {Zbigniew Lonc},
editor = {Sakti P. Ghosh and
Yahiko Kambayashi and
Witold Lipski Jr.},
title = {A Shotest Linear Organization for Some Uniform Multiattribute Files},
booktitle = {Data Base File Organization, Theory and Applications of the Consecutive
Retrieval Property, Papers from the Conference on Consecutive Retrieval
Property and Applications, 17-22 August 1981, Warsaw, Poland},
pages = {137--150},
publisher = {Academic Press},
year = {1981},
timestamp = {Thu, 01 Aug 2019 14:29:20 +0200},
biburl = {https://dblp.org/rec/conf/fodo/Lonc81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fodo/LoncTT81,
author = {Zbigniew Lonc and
Tomasz Traczyk and
Miroslaw Truszczynski},
editor = {Sakti P. Ghosh and
Yahiko Kambayashi and
Witold Lipski Jr.},
title = {Optimal F-Graphs for the Family of all K-Subsets of an N-Set},
booktitle = {Data Base File Organization, Theory and Applications of the Consecutive
Retrieval Property, Papers from the Conference on Consecutive Retrieval
Property and Applications, 17-22 August 1981, Warsaw, Poland},
pages = {247--270},
publisher = {Academic Press},
year = {1981},
timestamp = {Thu, 01 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fodo/LoncTT81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
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.
last updated on 2024-06-10 21:28 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:
