The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Zbigniew Lonc" ( http://dblp.L3S.de/Authors/Zbigniew_Lonc )

URL (Homepage):  http://www.mini.pw.edu.pl/tiki-index.php?page=prac_lonc_zbigniew  Author page on DBLP  Author page in RDF  Community of Zbigniew Lonc in ASPL-2

Publication years (Num. hits)
1981-1996 (18) 1997-2001 (16) 2002-2010 (15) 2011-2017 (20) 2018-2019 (3)
Publication types (Num. hits)
article(58) inproceedings(14)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 5 occurrences of 5 keywords

Results
Found 73 publication records. Showing 72 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Zbigniew Lonc, Miroslaw Truszczynski Maximin share allocations on cycles. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Michal Debski, Zbigniew Lonc, Pawel Rzazewski Achromatic and Harmonious Colorings of Circulant Graphs. Search on Bibsonomy Journal of Graph Theory The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Zbigniew Lonc, Miroslaw Truszczynski Maximin Share Allocations on Cycles. Search on Bibsonomy IJCAI The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Zbigniew Lonc, Pawel Naroski, Pawel Rzazewski Tight Euler tours in uniform hypergraphs - computational aspects. Search on Bibsonomy Discrete Mathematics & Theoretical Computer Science The full citation details ... 2017 DBLP  BibTeX  RDF
1Adrian Bondy, Zbigniew Lonc, Pawel Rzazewski Erratum: Constructing Optimal k-Radius Sequences. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Michal Debski, Zbigniew Lonc, Pawel Rzazewski Harmonious and achromatic colorings of fragmentable hypergraphs. Search on Bibsonomy Eur. J. Comb. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Michal Debski, Zbigniew Lonc, Pawel Rzazewski Sequences of radius k for complete bipartite graphs. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Zbigniew Lonc, Pawel Naroski, Pawel Rzazewski Tight Euler tours in uniform hypergraphs - computational aspects. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Michal Debski, Zbigniew Lonc, Pawel Rzazewski Sequences of radius k for complete bipartite graphs. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Zbigniew Lonc Note on a construction of short k-radius sequences. Search on Bibsonomy Discrete Mathematics The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Adrian Bondy, Zbigniew Lonc, Pawel Rzazewski Constructing Optimal k-Radius Sequences. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Zbigniew Lonc, Miroslaw Truszczynski Packing analogue of k-radius sequences. Search on Bibsonomy Eur. J. Comb. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Michal Debski, Zbigniew Lonc Universal Cycle Packings and Coverings for k-Subsets of an n-Set. Search on Bibsonomy Graphs and Combinatorics The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Michal Debski, Zbigniew Lonc, Pawel Rzazewski Sequences of Radius k for Complete Bipartite Graphs. Search on Bibsonomy WG The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Michal Debski, Zbigniew Lonc, Pawel Rzazewski Harmonious and achromatic colorings of fragmentable hypergraphs. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Michal Debski, Zbigniew Lonc Sequences of large radius. Search on Bibsonomy Eur. J. Comb. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Zbigniew Lonc, Nataliya Petryshyn On Rooted Packings, Decompositions, and Factors of Graphs. Search on Bibsonomy Journal of Graph Theory The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Zbigniew Lonc, Karolina Warno Minimum size transversals in uniform hypergraphs. Search on Bibsonomy Discrete Mathematics The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Zbigniew Lonc, Pawel Naroski A linear time algorithm for finding an Euler walk in a strongly connected 3-uniform hypergraph. Search on Bibsonomy Discrete Mathematics & Theoretical Computer Science The full citation details ... 2012 DBLP  BibTeX  RDF
1Jaroslaw Grytczuk, Zbigniew Lonc Preface. Search on Bibsonomy Discrete Mathematics The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Jerzy W. Jaromczyk, Zbigniew Lonc, Miroslaw Truszczynski Constructions of asymptotically shortest k-radius sequences. Search on Bibsonomy J. Comb. Theory, Ser. A The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Zbigniew Lonc, Miroslaw Truszczynski On graph equivalences preserved under extensions. Search on Bibsonomy Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Konstanty Junosza-Szaniawski, Zbigniew Lonc, Michal Tuczynski Counting Independent Sets in Claw-Free Graphs. Search on Bibsonomy WG The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Zbigniew Lonc, Pawel Naroski On Tours that Contain All Edges of a Hypergraph. Search on Bibsonomy Electr. J. Comb. The full citation details ... 2010 DBLP  BibTeX  RDF
1Zbigniew Lonc, Monika Pszczola Edge decompositions into two kinds of graphs. Search on Bibsonomy Discrete Mathematics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Krzysztof Brys, Zbigniew Lonc Polynomial cases of graph decomposition: A complete solution of Holyer's problem. Search on Bibsonomy Discrete Mathematics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Zbigniew Lonc, Miroslaw Truszczynski On the number of minimal transversals in 3-uniform hypergraphs. Search on Bibsonomy Discrete Mathematics The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Zbigniew Lonc, Miroslaw Truszczynski Computing minimal models, stable models and answer sets. Search on Bibsonomy TPLP The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Zbigniew Lonc, Miroslaw Truszczynski Computing minimal models, stable models and answer sets Search on Bibsonomy CoRR The full citation details ... 2005 DBLP  BibTeX  RDF
1Zbigniew Lonc, Mariusz Meszka, Zdzislaw Skupien Edge Decompositions of Multigraphs into 3-Matchings. Search on Bibsonomy Graphs and Combinatorics The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Matching, Decomposition, Characterization, Multigraph
1Zbigniew Lonc, Miroslaw Truszczynski Computing stable models: worst-case performance estimates. Search on Bibsonomy TPLP The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Mekkia Kouider, Zbigniew Lonc Stability number and [a, b]-factors in graphs. Search on Bibsonomy Journal of Graph Theory The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Jerzy W. Jaromczyk, Zbigniew Lonc Sequences of Radius k: How to Fetch Many Huge Objects into Small Memory for Pairwise Computations. Search on Bibsonomy ISAAC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Zbigniew Lonc, Miroslaw Truszczynski Fixed-parameter complexity of semantics for logic programs. Search on Bibsonomy ACM Trans. Comput. Log. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF Normal logic programs, fixed-parameter complexity, supported models, stable models
1Muktar E. Elzobi, Zbigniew Lonc Partitioning Boolean lattices into antichains. Search on Bibsonomy Discrete Mathematics The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Zbigniew Lonc, Miroslaw Truszczynski Computing Minimal Models, Stable Models, and Answer Sets. Search on Bibsonomy ICLP The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Zbigniew Lonc, Miroslaw Truszczynski Computing stable models: worst-case performance estimates Search on Bibsonomy CoRR The full citation details ... 2002 DBLP  BibTeX  RDF
1Zbigniew Lonc, Miroslaw Truszczynski Computing Stable Models: Worst-Case Performance Estimates. Search on Bibsonomy ICLP The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Krzysztof Brys, Zbigniew Lonc Monochromatic Partitions of Complete Uniform Hypergraphs. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Zbigniew Lonc, Miroslaw Truszczynski Fixed-parameter complexity of semantics for logic programs Search on Bibsonomy CoRR The full citation details ... 2001 DBLP  BibTeX  RDF
1Zbigniew Lonc, Miroslaw Truszczynski On the problem of computing the well-founded semantics Search on Bibsonomy CoRR The full citation details ... 2001 DBLP  BibTeX  RDF
1Zbigniew Lonc, Miroslaw Truszczynski On the problem of computing the well-founded semantics. Search on Bibsonomy TPLP The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Zbigniew Lonc, Krzysztof Parol, Jacek Wojciechowski On the number of spanning trees in directed circulant graphs. Search on Bibsonomy Networks The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Zbigniew Lonc, Miroslaw Truszczynski Fixed-Parameter Complexity of Semantics for Logic Programs. Search on Bibsonomy ICLP The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Zbigniew Lonc, Marian Srebrny A Combinatorial Algorithm for Sharing a Key. Search on Bibsonomy ACS The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Zbigniew Lonc, Miroslaw Truszczynski On the Problem of Computing the Well-Founded Semantics. Search on Bibsonomy Computational Logic The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Zbigniew Lonc On ordered sets without 2-colourings. Search on Bibsonomy Discrete Mathematics The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Mekkia Kouider, Zbigniew Lonc Path decompositions and perfect path double covers. Search on Bibsonomy Australasian J. Combinatorics The full citation details ... 1999 DBLP  BibTeX  RDF
1Zbigniew Lonc, Muktar E. Elzobi Chain Partitions of Products of Two Chains. Search on Bibsonomy J. Comb. Theory, Ser. A The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Krzysztof Brys, Mekkia Kouider, Zbigniew Lonc, Maryvonne Mahéo Decomposition of multigraphs. Search on Bibsonomy Discussiones Mathematicae Graph Theory The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Krzysztof Brys, Zbigniew Lonc Clique and anticlique partitions of graphs. Search on Bibsonomy Discrete Mathematics The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Zbigniew Lonc Delta-system decompositions of graphs. Search on Bibsonomy Discrete Mathematics The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Zbigniew Lonc, Krzysztof Parol, Jacek Wojciechowski On the asymptotic behavior of the maximum number of spanning trees in circulant graphs. Search on Bibsonomy Networks The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Zbigniew Lonc Edge Decomposition into Isomorphic Copies ofsK1, 2Is Polynomial. Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Zbigniew Lonc Clique packings and clique partitions of graphs without odd chordles cycles. Search on Bibsonomy Discussiones Mathematicae Graph Theory The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
1Mekkia Kouider, Zbigniew Lonc Covering Cycles and k-Term Degree Sums. Search on Bibsonomy Combinatorica The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
1Zbigniew Lonc On the Complexity of Some Edge-partition Problems for Graphs. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
1Krzysztof Brys, Zbigniew Lonc Clique and Anticlique Partition of Graphs. Search on Bibsonomy WG The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
1Zbigniew Lonc Partitions of large Boolean lattices. Search on Bibsonomy Discrete Mathematics The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
1Zbigniew Lonc Majorization, packing, covering and matroids. Search on Bibsonomy Discrete Mathematics The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
1Zbigniew Lonc Toward a Solution of the Holyer's Problem. Search on Bibsonomy WG The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
1Zbigniew Lonc Packing, covering and decomposing of a complete uniform hypergraph into delta-systems. Search on Bibsonomy Graphs and Combinatorics The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
1Zbigniew Lonc Partitions, Packings and Coverings by Families with Nonempty Intersections. Search on Bibsonomy J. Comb. Theory, Ser. A The full citation details ... 1992 DBLP  BibTeX  RDF
1Zbigniew Lonc On Complexity of Some Chain and Antichain Partition Problems. Search on Bibsonomy WG The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
1Zbigniew Lonc Solution of a delta-system decomposition problem. Search on Bibsonomy J. Comb. Theory, Ser. A The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
1Zbigniew Lonc On decomposition of hypergraphs into Delta-systems. Search on Bibsonomy J. Comb. Theory, Ser. A The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
1Zbigniew Lonc Decompositions of graphs into trees. Search on Bibsonomy Journal of Graph Theory The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
1Zbigniew Lonc On resolvable tree-decompositions of complete graphs. Search on Bibsonomy Journal of Graph Theory The full citation details ... 1988 DBLP  DOI  BibTeX  RDF
1Zbigniew Lonc Decompositions of hypergraphs into hyperstars. Search on Bibsonomy Discrete Mathematics The full citation details ... 1987 DBLP  DOI  BibTeX  RDF
1Zbigniew Lonc, Ivan Rival Chains, antichains, and fibres. Search on Bibsonomy J. Comb. Theory, Ser. A The full citation details ... 1987 DBLP  DOI  BibTeX  RDF
1Zbigniew Lonc, Tomasz Traczyk, Miroslaw Truszczynski Optimal F-Graphs for the Family of all K-Subsets of an N-Set. Search on Bibsonomy FODO The full citation details ... 1981 DBLP  BibTeX  RDF
1Zbigniew Lonc A Shotest Linear Organization for Some Uniform Multiattribute Files. Search on Bibsonomy FODO The full citation details ... 1981 DBLP  BibTeX  RDF
Displaying result #1 - #72 of 72 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license