Katedra Podstaw Informatyki - lista publikacji
Nadjednostka:
1-195 z 195.
2024
195.
Schnyder Woods and Alon-Tarsi Number of Planar Graphs, Electronic Journal of Combinatorics vol. Volume 31, Issue 1 (2024) (2024), 1-13
194.
Meike Hatzel, Gwenaël Joret, Piotr Micek, Marcin Pilipczuk, Torsten Ueckerdt, Bartosz Walczak
Tight bound on treedepth in terms of pathwidth and longest path, Combinatorica vol. 44 (2024), 417-427
193.
Joanna Chybowska-Sokół, Grzegorz Gutowski, Konstanty Junosza-Szaniawski, Patryk Mikos, Adam Polak
Online Coloring of Short Intervals, European Journal of Combinatorics vol. 118 (2024), 103919
192.
Coloring triangle-free L-graphs with O(log log n) colors, European Journal of Combinatorics vol. 117 (2024), 103831
191.
Gwenaël Joret, Piotr Micek, Michał Pilipczuk, Bartosz Walczak
Cliquewidth and dimension, ACM/SIAM Symposium on Discrete Algorithms [SODA], (2024), 1437-1446
190.
Jakub Kozik, Piotr Micek, William T. Trotter
Dimension is polynomial in height for posets with planar cover graphs, Journal of Combinatorial Theory. Series B vol. Volume 165, March 2024 (2024), 164-196
189.
Marcin Briański, James Davies, Bartosz Walczak
Separating polynomial χ-boundedness from χ-boundedness, Combinatorica vol. 44 (2024), 1-8
188.
Zofia Kostrzycka, Marek Zaionc
Fuzzy Logics - quantitatively, Journal of Applied Non-Classical Logics vol. 34 (2024), 97-132
2023
187.
James Davies, Tomasz Krawczyk, Rose McCarty, Bartosz Walczak
Grounded L-graphs are polynomially χ-bounded, Discrete and Computational Geometry vol. 70 (2023), 1523-1550
186.
Robert Janczewski, Krzysztof Turowski, Bartłomiej Wróblewski
Edge coloring of graphs of signed class 1 and 2, Discrete Applied Mathematics vol. 338 (2023), 311-319
185.
Grzegorz Gutowski, Konstanty Junosza-Szaniawski, Felix Klessen, Paweł Rzążewski, Alexander Wolff, Johannes Zink
Coloring and Recognizing Mixed Interval Graphs, International Symposium on Algorithms and Computation [ISAAC] vol. 283 (2023), 36:1-36:14
184.
Marcin Anholcer, Bartłomiej Bosek, Jarosław Grytczuk, Grzegorz Gutowski, Jakub Przybyło, Rafał Pyzik, Mariusz Zając
On a problem of Steinhaus, Bulletin of the London Mathematical Society vol. 55 (6) (2023), 2635-2652
183.
Jakub Kozik, Andrzej Dorobisz
Local Computation Algorithms for Hypergraph Coloring - Following Beck’s Approach, International Colloquium on Automata Languages and Programming [ICALP](MAIN) vol. 261 (LIPIcs) (2023), 48:1-48:20
182.
Mikkel Abrahamsen, Bartosz Walczak
Distinguishing classes of intersection graphs of homothets or similarities of two convex disks, International Symposium on Computational Geometry [SoCG] vol. 258 of Leibniz International Proceedings in Informatics (LIPIcs) (2023), 2:1-2:16
181.
Long-Distance Directional Dial-a-Ride Problems, International Conference on Vehicle Technology and Intelligent Transport Systems [VEHITS], (2023), 187-197
180.
James Davies, Tomasz Krawczyk, Rose McCarty, Bartosz Walczak
Coloring polygon visibility graphs and their generalizations, Journal of Combinatorial Theory. Series B vol. 161 (2023), 268-300
179.
Carla Groenland, Gwenaël Joret, Wojciech Nadara, Bartosz Walczak
Approximating pathwidth for graphs of small treewidth, ACM Transactions on Algorithms vol. 19 (2023), 16:1-19
2022
178.
Grzegorz Gutowski, Florian Mittelstädt, Ignaz Rutter, Joachim Spoerhase, Alexander Wolff, Johannes Zink
Coloring Mixed and Directional Interval Graphs, Graph Drawing [GD] vol. 13764 (Lecture Notes in Computer Science) (2022), 418-431
177.
James Davies, Chaya Keller, Linda Kleist, Shakhar Smorodinsky, Bartosz Walczak
A solution to Ringel's circle problem, International Symposium on Computational Geometry [SoCG] vol. 224 of Leibniz International Proceedings in Informatics (LIPIcs) (2022), 33:1-33:14
176.
Tytus Pikies, Marek Kubale, Krzysztof Turowski
175.
Robert Janczewski, Paweł Obszarski, Krzysztof Turowski
Weighted 2-sections and hypergraph reconstruction, Theoretical Computer Science vol. 915 (2022), 11-25
174.
Robert Janczewski, Paweł Obszarski, Krzysztof Turowski, Bartłomiej Wróblewski
Infinite chromatic games, Discrete Applied Mathematics vol. 309 (2022), 138-146
173.
Bartłomiej Bosek, Jarosław Grytczuk, Grzegorz Gutowski, Oriol Serra, Mariusz Zając
Graph Polynomials and Group Coloring of Graphs, European Journal of Combinatorics vol. 102 (2022), 103505
172.
Vida Dujmović, Louis Esperet, Pat Morin, Bartosz Walczak, David R. Wood
Clustered 3-colouring graphs of bounded degree, Combinatorics Probability and Computing vol. 31 (2022), 123-135
171.
Marthe Bonamy, Nicolas Bousquet, Michał Pilipczuk, Paweł Rzążewski, Stéphan Thomassé, Bartosz Walczak
2021
170.
Alan Frieze, Wojciech Szpankowski, Krzysztof Turowski
The Concentration of the Maximum Degree in the Duplication-Divergence Models, International Conference on Computing and Combinatorics [COCOON], (2021), 413-424
169.
The Slow-Coloring Game on Sparse Graphs: k-Degenerate, Planar, and Outerplanar, Journal of Combinatorics vol. 12 (2021) (2021), 283 – 302
168.
Marek Kubale, Tytus Pikies, Krzysztof Turowski
Scheduling with Complete Multipartite Incompatibility Graph on Parallel Machines, International Conference on Automated Planning and Scheduling [ICAPS], (2021), 262-270
167.
Jana Novotná, Karolina Okrasa, Michał Pilipczuk, Paweł Rzążewski, Erik Jan van Leeuwen, Bartosz Walczak
Subexponential-time algorithms for finding large induced sparse subgraphs, Algorithmica vol. 83 (2021), 2634-2650
166.
A note on the asymptotic expressiveness of ZF and ZFC, Journal of Logic and Computation vol. 31 (2021), 1598–1607
165.
Torsten Mütze, Jerri Nummenpalo, Bartosz Walczak
Sparse Kneser graphs are Hamiltonian, Journal of the London Mathematical Society vol. 103 (2021), 1253-1275
164.
James Davies, Tomasz Krawczyk, Rose McCarty, Bartosz Walczak
Colouring polygon visibility graphs and their generalizations, International Symposium on Computational Geometry [SoCG] vol. 189 of Leibniz International Proceedings in Informatics (LIPIcs) (2021), 29:1-29:16
163.
Improving Gebauer’s construction of 3-chromatic hypergraphs with few edges, International Colloquium on Automata Languages and Programming [ICALP] vol. Leibniz International Proceedings in Informatics (LIPIcs) (2021), 89:1-89:9
162.
Katarzyna Grygiel, Isabella Larcher
161.
Jithin K. Sreedharan, Wojciech Szpankowski, Krzysztof Turowski
160.
159.
Jithin K. Sreedharan, Wojciech Szpankowski, Krzysztof Turowski
158.
Robert Janczewski, Anna Maria Trzaskowska, Krzysztof Turowski
T-colorings, divisibility and circular chromatic number, Discussiones Mathematicae Graph Theory vol. 41(2) (2021), 441-450
157.
Carla Groenland, Gwenaël Joret, Wojciech Nadara, Bartosz Walczak
Approximating pathwidth for graphs of small treewidth, ACM/SIAM Symposium on Discrete Algorithms [SODA], (2021), 1965-1976
156.
Parinya Chalermsook, Bartosz Walczak
Coloring and maximum weight independent set of rectangles, ACM/SIAM Symposium on Discrete Algorithms [SODA], (2021), 860-868
155.
Lech Duraj, Jakub Kozik, Dmitry A. Shabanov
Random hypergraphs and property B, European Journal of Combinatorics vol. Volume 91, January 2021, 103205 (2021), 1-11
2020
154.
Joanna Chybowska-Sokół, Grzegorz Gutowski, Konstanty Junosza-Szaniawski, Patryk Mikos, Adam Polak
Online Coloring of Short Intervals, International Workshop on Approximation Algorithms for Combinatorial Optimization Problems [APPROX] vol. 176 (Leibniz International Proceedings in Informatics) (2020), 52:1-52:18
153.
Alan Frieze, Wojciech Szpankowski, Krzysztof Turowski
Degree Distribution for Duplication-Divergence Graphs: Large Deviations, International Workshop on Graph-Theoretic Concepts in Computer Science [WG], (2020), 226-237
152.
Jithin K. Sreedharan, Wojciech Szpankowski, Krzysztof Turowski
Temporal Ordered Clustering in Dynamic Networks, IEEE International Symposium on Information Theory [ISIT], (2020), 1349-1354
151.
Philippe Jacquet, Wojciech Szpankowski, Krzysztof Turowski
Power-Law Degree Distribution in the Connected Component of a Duplication Graph, International Conference on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms [AofA] vol. 16 (2020), 1-14
150.
Abram Magner, Wojciech Szpankowski, Krzysztof Turowski
Compression of Dynamic Graphs Generated by a Duplication Model, Algorithmica vol. 82 (2020), 2687-2707
149.
Zofia Kostrzycka, Marek Zaionc
Quantitative Study of Fuzzy Logics, 2020 Ieee International Conference On Fuzzy Systems (fuzz-ieee) (2020), 1-8
148.
Vida Dujmović, Louis Esperet, Gwenaël Joret, Bartosz Walczak, David R. Wood
Planar graphs have bounded nonrepetitive chromatic number, Advances in Combinatorics vol. 2020 (2020), 5:1-11
2019
147.
Philippe Jacquet, Wojciech Szpankowski, Krzysztof Turowski
Asymptotics of Entropy of the Dirichlet-Multinomial Distribution, IEEE International Symposium on Information Theory [ISIT], (2019), 1517-1521
146.
Robert Janczewski, Paweł Obszarski, Krzysztof Turowski
2-Coloring number revisited, Theoretical Computer Science vol. 796 (2019), 187-195
145.
Marek Zaionc, Neininger Ralph, Hwang
Preface, Combinatorics Probability and Computing vol. 28(4) (2019), 483-484
144.
Jana Novotná, Karolina Okrasa, Michał Pilipczuk, Paweł Rzążewski, Erik Jan van Leeuwen, Bartosz Walczak
Subexponential-time algorithms for finding large induced sparse subgraphs vol. 148 of Leibniz International Proceedings in Informatics (2019), "14th International Symposium on Parameterized and Exact Computation, IPEC 2019, September 11-13, 2019, Munich, Germany", Schloss Dagstuhl – Leibniz-Zentrum für Informatik
143.
Alexandre Rok, Bartosz Walczak
Outerstring graphs are χ-bounded, SIAM Journal on Discrete Mathematics vol. 33 (2019), 2181-2199
142.
Coloring triangle-free L-graphs with O(log log n) colors, Acta Mathematica Universitatis Comenianae vol. 88 (2019), 1063-1069
141.
Maciej Bendkowski, Pierre Lescanne
On the enumeration of closures and environments with an application to random generation, Logical Methods in Computer Science vol. 15, Issue 4 (2019), 3:1–3:21
140.
Maciej Bendkowski, Olivier Bodini, Sergey Dovgal
Statistical Properties of Lambda Terms, Electronic Journal of Combinatorics vol. 26, Issue 4 (2019), 70
139.
Towards the average-case analysis of substitution resolution in λ-calculus vol. Leibniz International Proceedings in Informatics (LIPIcs) (2019), "4th International Conference on Formal Structures for Computation and Deduction (FSCD 2019)", Schloss Dagstuhl – Leibniz-Zentrum für Informatik
138.
Alexandre Rok, Bartosz Walczak
Coloring curves that cross a fixed curve, Discrete and Computational Geometry vol. 61 (2019), 830-851
137.
David M. Howard, Noah Streib, William T. Trotter, Bartosz Walczak, Ruidong Wang
2018
136.
A Note on Two-Colorability of Nonuniform Hypergraphs, International Colloquium on Automata Languages and Programming [ICALP] vol. 107 (Leibniz International Proceedings in Informatics) (2018), 46:1-46:13
135.
Abram Magner, Wojciech Szpankowski, Krzysztof Turowski
Lossless Compression of Binary Trees With Correlated Vertex Names, IEEE Transactions on Information Theory vol. 64 (9) (2018), 6070-6080
134.
Tomasz Kisielewski, Damian Leśniak
Accidental exploration through value predictors, Schedae Informaticae vol. 27 (2018),
133.
Mikkel Abrahamsen, Bartosz Walczak
132.
131.
Maciej Bendkowski, Pierre Lescanne
Combinatorics of explicit substitutions vol. PPDP '18 (2018), "Proceedings of the 20th International Symposium on Principles and Practice of Declarative Programming", Association for Computing Machinery (ACM)
130.
Maciej Bendkowski, Pierre Lescanne
Counting Environments and Closures vol. Leibniz International Proceedings in Informatics (LIPIcs) (2018), "3rd International Conference on Formal Structures for Computation and Deduction (FSCD 2018)", Schloss Dagstuhl – Leibniz-Zentrum für Informatik
129.
Torsten Mütze, Jerri Nummenpalo, Bartosz Walczak
Sparse Kneser graphs are Hamiltonian, (2018), "Proceedings of 50th Annual ACM SIGACT Symposium on the Theory of Computing (STOC’18)", Association for Computing Machinery (ACM)
128.
Aleksander Byrski, Kevin Hammond, John Hughes, Wojciech Turek, Marek Zaionc
127.
Grzegorz Gutowski, Ming Han, Tomasz Krawczyk, Xuding Zhu
Defective 3-Paintability of Planar Graphs, Electronic Journal of Combinatorics vol. 25 (2) (2018), 20
126.
William T. Trotter, Bartosz Walczak, Ruidong Wang
Dimension and cut vertices: an application of Ramsey theory, (2018), "Connections in Discrete Mathematics: A Celebration of the Work of Ron Graham", Cambridge University Press
125.
Deferred On-Line Bipartite Matching, Electronic Journal of Combinatorics vol. 25 (2) (2018), P2.24
124.
123.
Maciej Bendkowski, Olivier Bodini, Sergey Dovgal
Polynomial tuning of multiparametric combinatorial samplers, (2018), "2018 Proceedings of the Fifteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO)", Society for Industrial and Applied Mathematics (SIAM)
122.
121.
The Partial Visibility Representation Extension Problem, Algorithmica vol. 80 (8) (2018), 2286-2323
2017
120.
Jacek Cichoń, Abram Magner, Wojciech Szpankowski, Krzysztof Turowski
On Symmetries of Non-Plane Trees in a Non-Uniform Model, Workshop on Analytic Algorithmics and Combinatorics [ANALCO], (2017), 156-163
119.
William T. Trotter, Bartosz Walczak
Boolean dimension and local dimension vol. 61 of Electronic Notes in Discrete Mathematics (2017), "The Ninth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2017", Elsevier Science
118.
117.
Asymptotic density in logic and computability, Proceedings of the Tenth Workshop On Information Theoretic Methods in Science and Engineering, Paris, France, September 11-13, 2017 vol. Publication series B, Report B-2017-3 (Editors: Jacquet Philippe, Leppä-Aho Janne, Roos Teemu (2017), 43
116.
Extending partial representations of trapezoid graphs vol. 10520 of Lecture Notes in Computer Science (2017), "Graph-Theoretic Concepts in Computer Science, 43rd International Workshop, WG 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised Selected Papers", Springer
115.
Alexandre Rok, Bartosz Walczak
Coloring curves that cross a fixed curve vol. 77 of Leibniz International Proceedings in Informatics (2017), "33rd International Symposium on Computational Geometry, SoCG 2017, July 4-7, 2017, Brisbane, Australia", Schloss Dagstuhl – Leibniz-Zentrum für Informatik
114.
Combinatorics of λ-terms: a natural approach, Journal of Logic and Computation vol. Volume 27, Issue 8 (2017), 2611–2630
113.
112.
111.
Grzegorz Gutowski, Patryk Mikos
Lower Bounds for On-line Interval Coloring with Vector and Cardinality Constraints vol. 10139 (Lecture Notes in Computer Science) (2017), "SOFSEM 2017: Current Trends in Theory and Practice of Computer Science, 43rd International Conference, Limerick, Ireland, January 16-20, 2017, Proceedings", Springer
110.
Maciej Bendkowski, Katarzyna Grygiel, Paul Tarau
Boltzmann Samplers for Closed Simply-Typed Lambda Terms, Lecture Notes in Computer Science vol. 10137 (2017), 120-135
109.
Martin Balko, Vít Jelínek, Pavel Valtr, Bartosz Walczak
On the Beer index of convexity and its variants, Discrete and Computational Geometry vol. 57 (2017), 179-214
108.
Minors and dimension, Journal of Combinatorial Theory. Series B vol. 122 (2017), 668-689
107.
On the likelihood of normalisation in combinatory logic, Journal of Logic and Computation vol. Volume 27, Issue 7 (2017), 2251–2269
2016
106.
Abram Magner, Wojciech Szpankowski, Krzysztof Turowski
Lossless compression of binary trees with correlated vertex names, IEEE International Symposium on Information Theory [ISIT], (2016), 1217-1221
105.
Robert Janczewski, Krzysztof Turowski
An O(n log n) algorithm for finding edge span of cacti, Journal of Combinatorial Optimization vol. 31(4) (2016), 1373-1382
104.
Robert Janczewski, Krzysztof Turowski
On the hardness of computing span of subcubic graphs, Information Processing Letters vol. 116(1) (2016), 26-32
103.
Criteria for regularity of Mahler power series and Becker's conjecture, Journal of Number Theory vol. 174 (2016), 456-486
102.
Vida Dujmović, Gwenaël Joret, Jakub Kozik, David R. Wood
Nonrepetitive colouring via entropy compression, Combinatorica vol. Volume 36, Issue 6 (2016), 661-686
101.
Pathwidth and nonrepetitive list colorings, Electronic Journal of Combinatorics vol. Volume 23, Issue 4 (2016), 19
100.
Chip Games and Paintability, Electronic Journal of Combinatorics vol. 23 (3) (2016), 12
99.
Mikkel Abrahamsen, Bartosz Walczak
Outer common tangents and nesting of convex hulls in linear time and constant workspace vol. 57 of Leibniz International Proceedings in Informatics (2016), "24th Annual European Symposium on Algorithms, ESA 2016, August 22-24, 2016, Aarhus, Denmark", Schloss Dagstuhl – Leibniz-Zentrum für Informatik
98.
Kolja Knauer, Bartosz Walczak
Graph drawings with one bend and few slopes vol. 9644 of Lecture Notes in Computer Science (2016), "LATIN 2016: Theoretical Informatics, 12th Latin American Symposium, Ensenada, Mexico, April 11-15, 2016, Proceedings", Springer
97.
Jakub Kozik, Dmitry A. Shabanov
Improved algorithms for colorings of simple hypergraphs and applications, Journal of Combinatorial Theory. Series B vol. Volume 116 (2016), 312-332
96.
Multipass greedy coloring of simple uniform hypergraphs, Random Structures and Algorithms vol. Volume 48, Issue 1 (2016), 125-146
95.
János Pach, Bartosz Walczak
94.
A natural counting of lambda terms, Lecture Notes in Computer Science vol. 9587 (2016), 183-194
93.
Gwenaël Joret, Piotr Micek, Kevin G. Milans, William T. Trotter, Bartosz Walczak, Ruidong Wang
Tree-width and dimension, Combinatorica vol. 36 (2016), 431-450
2015
92.
91.
Robert Janczewski, Krzysztof Turowski
90.
Robert Janczewski, Krzysztof Turowski
The Backbone Coloring Problem for Bipartite Backbones, Graphs and Combinatorics vol. 31(5) (2015), 1487-1496
89.
Robert Janczewski, Krzysztof Turowski
88.
Asymmetric coloring games on incomparability graphs vol. 49 of Electronic Notes in Discrete Mathematics (2015), "The Eight European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2015", Elsevier Science
87.
Katarzyna Grygiel, Pierre Lescanne
86.
Andrew Suk, Bartosz Walczak
85.
Martin Balko, Vít Jelínek, Pavel Valtr, Bartosz Walczak
On the Beer index of convexity and its variants vol. 34 of Leibniz International Proceedings in Informatics (2015), "31st International Symposium on Computational Geometry, SoCG 2015, June 22-25, 2015, Eindhoven, The Netherlands", Schloss Dagstuhl – Leibniz-Zentrum für Informatik
84.
Danila D. Cherkashin, Jakub Kozik
A note on random greedy coloring of uniform hypergraphs, Random Structures and Algorithms vol. 47 (2015), 407-413
83.
Minors and dimension, (2015), "26th Annual ACM-SIAM Symposium on Discrete Algorithms, January 4-6, 2015, San Diego, California, USA", Society for Industrial and Applied Mathematics (SIAM)
82.
81.
2014
80.
Katarzyna Grygiel, Pierre Lescanne
Counting Terms in the Binary Lambda Calculus, Dmtcs Proceedings - 25th International Conference On Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms vol. DMTCS-HAL Proceedings Series (2014), 13
79.
Lower Bounds for On-Line Graph Colorings vol. 8889 (Lecture Notes in Computer Science) (2014), "Algorithms and Computation, 25th International Symposium, ISAAC 2014, Jeonju, Korea, December 15-17, 2014, Proceedings", Springer
78.
Anetta Górnicka, Joanna Grygiel, Katarzyna Grygiel
A note on blocks of skeleton tolerances, Acta Mathematica Hungarica vol. 143(1) (2014), 176-184
77.
76.
An extremal problem on crossing vectors, Journal of Combinatorial Theory - Series A vol. 128 (2014), 41-55
75.
Coloring relatives of interval overlap graphs via on-line games vol. 8572 of Lecture Notes in Computer Science (2014), "Automata, Languages, and Programming, 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I", Springer
74.
Alexandre Rok, Bartosz Walczak
Outerstring graphs are χ-bounded, (2014), "30th Annual Symposium on Computational Geometry, SoCG 2014, June 8-11, 2014, Kyoto, Japan", Association for Computing Machinery (ACM)
73.
Arkadiusz Pawlik, Jakub Kozik, Tomasz Krawczyk, Michał Lasoń, Piotr Micek, William T. Trotter, Bartosz Walczak
72.
Kolja Knauer, Piotr Micek, Bartosz Walczak
Outerplanar graph drawings with few slopes, Computational Geometry: Theory and Applications vol. 47 (2014), 614-624
71.
Jakub Kozik, Piotr Micek, Xuding Zhu
Towards an on-line version of Ohba’s conjecture, European Journal of Combinatorics vol. 36 (2014), 110-121
2013
70.
Asymptotic properties of combinatory logic, Lecture Notes in Computer Science vol. 9076 (2013), 62-72
69.
Andrew Suk, Bartosz Walczak
New bounds on the maximum number of edges in k-quasi-planar graphs vol. 8242 of Lecture Notes in Computer Science (2013), "Graph Drawing, 21st International Symposium, GD 2013, Bordeaux, France, September 23-25, 2013, Revised Selected Papers", Springer
68.
Coloring triangle-free rectangular frame intersection graphs with O(log log n) colors vol. 8165 of Lecture Notes in Computer Science (2013), "Graph-Theoretic Concepts in Computer Science, 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers", Springer
67.
Coloring intersection graphs of arcwise connected sets in the plane vol. 16 of CRM Series (2013), "The Seventh European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2013", Springer
66.
Arkadiusz Pawlik, Jakub Kozik, Tomasz Krawczyk, Michał Lasoń, Piotr Micek, William T. Trotter, Bartosz Walczak
65.
Katarzyna Grygiel, Pierre Lescanne
Counting and generating lambda terms, Journal of Functional Programming vol. 23(5) (2013), 594-628
64.
Gábor Czédli, Joanna Grygiel, Katarzyna Grygiel
Distributive lattices determined by weighted double skeletons, Algebra Universalis vol. 69(4) (2013), 313-326
63.
Jarosław Grytczuk, Jakub Kozik, Piotr Micek
New approach to nonrepetitive sequences, Random Structures and Algorithms vol. 42 (2013), 214-225
62.
Nonrepetitive choice number of trees, SIAM Journal on Discrete Mathematics vol. 27-1 (2013), 436-446
61.
Asymptotically almost all λ-terms are strongly normalizing, Logical Methods in Computer Science vol. 9 (1:02) (2013), 1-30
60.
How big is BCI fragment of BCK logic, Journal of Logic and Computation vol. 23(3) (2013), 673-691
2012
59.
Dirk Hofmann, Paweł Waszkiewicz
A duality of quantale-enriched categories, Journal of Pure and Applied Algebra vol. 216 (2012), 1866-1878
58.
Antoine Genitrini, Jakub Kozik
57.
Pavel Klavík, Jan Kratochvíl, Tomasz Krawczyk, Bartosz Walczak
Extending partial representations of function graphs and permutation graphs vol. 7501 of Lecture Notes in Computer Science (2012), "Algorithms – ESA 2012, 20th Annual European Symposium on Algorithms, Ljubljana, Slovenia, September 10-12, 2012, Proceedings", Springer
56.
Kolja Knauer, Piotr Micek, Bartosz Walczak
Outerplanar graph drawings with few slopes vol. 7434 of Lecture Notes in Computer Science (2012), "Computing and Combinatorics, 18th Annual International Conference, COCOON 2012, Sydney, Australia, August 20-22, 2012, Proceedings", Springer
55.
Parity in graph sharing games, Discrete Mathematics vol. 312 (2012), 1788-1795
2011
54.
Dirk Hofmann, Paweł Waszkiewicz
Approximation in quantale-enriched categories., Topology and its Applications vol. 158 (2011), 963-977
53.
Sylwia Antoniuk, Paweł Waszkiewicz
The duality of generalized metric spaces., Topology and its Applications vol. 158 (2011), 2371-2381
52.
51.
Jarosław Grytczuk, Jakub Kozik, Marcin Witkowski
Nonrepetitive sequences on arithmetic progressions, Electronic Journal of Combinatorics vol. 18 (2011), 1-9
50.
A graph-grabbing game, Combinatorics Probability and Computing vol. 20 (2011), 623-629
49.
Mr. Paint and Mrs. Correct Go Fractional, Electronic Journal of Combinatorics vol. 18 (1) (2011), 8
2010
48.
Common patterns for metric and ordered fixed point theorems, in Proceedings of the 7th Workshop On Fixed Points in Computer Science (2010), 83-87
47.
46.
Dynamic Threshold Strategy for Universal Best Choice Problem, Discrete Mathematics and Theoretical Computer Science Proceedings vol. AM (2010), 439–452
45.
A simple representation of subwords of the Fibonacci word, Information Processing Letters vol. 110 (2010), 956-960
44.
First-Fit Algorithm for the On-Line Chain Partitioning Problem, SIAM Journal on Discrete Mathematics vol. 23(4) (2010), 1992-1999
43.
Daniele Gardy, Herve Fournier, Antoine Genitrini, Marek Zaionc
Tautologies over implication with negative literals, Mathematical Logic Quarterly vol. 56 (2010), 388-396
2009
42.
Periodic solutions of scalar differential equations without uniqueness, Boll. Unione Mat. Ital. (9) vol. 2(2) (2009), 445–448
41.
On Domain Theory over Girard Quantales, Fundamenta Informaticae vol. 92 (2009), 169-192
40.
Antoine Genitrini, Jakub Kozik
39.
Rene David, Marek Zaionc
Counting proofs in propositional logic, Archive for Mathematical Logic vol. 48 (2009), 185-199
2008
38.
Antoine Genitrini, Jakub Kozik, Grzegorz Matecki
On the density and the structure of the Peirce-like formulae, Discrete Mathematics and Theoretical Computer Science Proceedings (2008), 461-474
37.
Subcritical pattern languages for and/or trees, Discrete Mathematics and Theoretical Computer Science Proceedings (2008), 437–448
36.
Zofia Kostrzycka, Marek Zaionc
Asymptotic densities in logic and type theory, Studia Logica vol. 88 (2008), 385-403
35.
Antoine Genitrini, Jakub Kozik, Marek Zaionc
Intuitionistic vs. Classical Tautologies, Quantitative Comparison, Lecture Notes in Computer Science vol. 4941 (2008), 100-109
34.
Optimal Orientation On-Line, Lecture Notes in Computer Science vol. 4910 (2008), 271-279
2007
33.
Lidia Badura, Marek Zaionc
Parametrizability by regular expressions for equations on words, Bulletin of the Section of Logic vol. 36 (2007), 79-93
32.
Daniele Gardy, Herve Fournier, Antoine Genitrini, Marek Zaionc
Classical and intuitionistic logic are asymptotically identical, Lecture Notes in Computer Science vol. 4646 (2007), 177-193
2006
31.
Partial metrisability of continuous posets, Mathematical Structures in Computer Science vol. 16 (2006), 359-372
30.
Undecidable problems concerning densities of languages, Discrete Mathematics and Theoretical Computer Science Proceedings (2006), 69-76
29.
Probability distribution for simple tautologies, Theoretical Computer Science vol. 355 (2006), 243-260
2005
28.
Completeness and Compactness of Quantitative Domains, Lecture Notes in Computer Science vol. 3623 (2005), 341-351
27.
Approximation Simply Characterized., Electronic Notes in Theoretical Computer Science vol. 140 (2005), 113-117
26.
Conditional Densities of Regular Languages, Electronic Notes in Theoretical Computer Science (2005), 67-79
25.
24.
Probabilistic approach to the lambda definability for fourth order types, Electronic Notes in Theoretical Computer Science (2005), 41-54
2004
23.
Fredholm lternative and boundary value problems, Proceedings of the American Mathematical Society vol. 132(6) (2004), 1779-1784
22.
Zofia Kostrzycka, Marek Zaionc
Statistics of intuitionistic versus classical logics, Studia Logica vol. 76 (2004), 307 - 328
2003
21.
20.
Asymptotic properties of logics, Schedae Informaticae vol. 12 (2003), 129-138
19.
Zofia Kostrzycka, Marek Zaionc
On the density of truth in Dummet logic, Bulletin of the Section of Logic vol. 32 (2003), 43-55
18.
Quantitative Continuous Domains, Applied Categorical Structures vol. 11 (2003), 41-67
17.
Statistics of implicational logic, Electronic Notes in Theoretical Computer Science vol. 84 (2003), 205–216
2001
16.
15.
Distance and Measurement in Domain Theory, Electronic Notes in Theoretical Computer Science vol. 45 (2001), 448-462
2000
14.
1997
13.
Jan Małolepszy, Małgorzata Moczurad, Marek Zaionc
Schwichtenberg style lambda definability is undecidable, Lecture Notes in Computer Science vol. 1210 (1997), 267-283
1995
12.
1992
11.
Lambda definability on free algebras, Annals of Pure and Applied Logic vol. 51 (1992), 279-300
1990
10.
A Characterization of Lambda Definable Tree Operations, Information and Computation vol. 89 (1990), 35-46
1989
9.
On the lambda definable higher-order boolean functionals, Fundamenta Informaticae vol. 12 (1989), 181-190
8.
1988
7.
6.
On the lambda definable tree operations, Lecture Notes in Computer Science vol. 425 (1988), 279-292
1987
5.
Word Operations Definable in the Typed lambda Calculus, Theoretical Computer Science vol. 52 (1987), 1-14
4.
1985
3.
Nondeterministic Programs Definable in Typed Lambda Calculus, Fundamenta Informaticae vol. 8 (1985), 63-72
2.
The set of Unifiers in Typed lambda calculus as Regular Expression, Lecture Notes in Computer Science vol. 202 (1985), 430-440
1984
1.
A computer model of evolution and ecological processes, Modeling, Simulation & Control C (1984), 59-63