Katedra Podstaw Informatyki - lista publikacji

1-148 z 148.

2020

148.
Grzegorz Gutowski, Konstanty Junosza-Szaniawski, Patryk Mikos, Adam Polak, Joanna Sokół
Online Coloring of Short Intervals, INTERNATIONAL WORKSHOP ON APPROXIMATION ALGORITHMS FOR COMBINATORIAL OPTIMIZATION PROBLEMS (APPROX) (2020),
147.
Vida Dujmović, Louis Esperet, Gwenaël Joret, Bartosz Walczak, David R. Wood

2019

146.
Robert Janczewski, Paweł Obszarski, Krzysztof Turowski
2-Coloring number revisited, THEOR COMPUT SCI vol. 796 (2019), 187-195
145.
Neininger Ralph, Hwang, Hsien-Kuei
Preface, COMB PROBAB COMPUT 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
140.
Maciej Bendkowski, Olivier Bodini, Sergey Dovgal
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
137.
David M. Howard, Noah Streib, William T. Trotter, Bartosz Walczak, Ruidong Wang

2018

136.
Abram Magner, Wojciech Szpankowski, Krzysztof Turowski
Compression of Dynamic Graphs Generated by a Duplication Model, 57TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON 2018) (2018), 1089-1096
135.
Abram Magner, Wojciech Szpankowski, Krzysztof Turowski
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.
A note on two-colorability of nonuniform hypergraphs, LIPICS–LEIBNIZ INTERNATIONAL PROCEEDINGS IN INFORMATICS vol. 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018) (2018), 46:1--46:13
129.
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
128.
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)
125.
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
122.
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)
120.

2017

119.
Jacek Cichoń, Abram Magner, Wojciech Szpankowski, Krzysztof Turowski
On Symmetries of Non-Plane Trees in a Non-Uniform Model, 14TH WORKSHOP ON ANALYTIC ALGORITHMICS AND COMBINATORICS (ANALCO 2017) (2017), 156-163
118.
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
116.
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
115.
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
114.
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
113.
Combinatorics of λ-terms: a natural approach, J LOGIC COMPUT vol. Volume 27, Issue 8 (2017), 2611–2630
110.
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
108.
Martin Balko, Vít Jelínek, Pavel Valtr, Bartosz Walczak
107.

2016

105.
Abram Magner, Wojciech Szpankowski, Krzysztof Turowski
Lossless compression of binary trees with correlated vertex names, IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT 2016) (2016), 1217-1221
104.
101.
Vida Dujmović, Gwenaël Joret, Jakub Kozik, David R. Wood
Nonrepetitive colouring via entropy compression, COMBINATORICA vol. Volume 36, Issue 6 (2016), 661-686
100.
Adam Gągol, Gwenaël Joret, Jakub Kozik, Piotr Micek
Pathwidth and nonrepetitive list colorings, ELECTRON J COMB vol. Volume 23, Issue 4 (2016), 19
98.
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
97.
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
92.
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

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
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
82.
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)

2014

79.
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
78.
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
77.
Anetta Górnicka, Joanna Grygiel, Katarzyna Grygiel
75.
Michał Lasoń, Piotr Micek, Noah Streib, William T. Trotter, Bartosz Walczak
74.
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
73.
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)

2013

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
65.
Katarzyna Grygiel, Pierre Lescanne
64.
Gábor Czédli, Joanna Grygiel, Katarzyna Grygiel
63.
61.
Rene David, Katarzyna Grygiel, Jakub Kozik, Christophe Raffalli, Guillaume Theyssier,

2012

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

2011

53.
Sylwia Antoniuk, Paweł Waszkiewicz
51.
Jarosław Grytczuk, Jakub Kozik, Marcin Witkowski

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
46.
Dynamic Threshold Strategy for Universal Best Choice Problem, DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE PROCEEDINGS vol. AM (2010), 439–452
43.
Daniele Gardy, Herve Fournier, Antoine Genitrini, Marek Zaionc

2009

42.
Periodic solutions of scalar differential equations without uniqueness, BOLL. UNIONE MAT. ITAL. (9) vol. 2(2) (2009), 445–448
39.

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

2007

32.
Daniele Gardy, Herve Fournier, Antoine Genitrini, Marek Zaionc

2006

30.
Undecidable problems concerning densities of languages, DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE PROCEEDINGS (2006), 69-76

2005

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
24.
Probabilistic approach to the lambda definability for fourth order types, ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE (2005), 41-54

2004

22.

2003

17.
Statistics of implicational logic, ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE vol. 84 (2003), 205–216

2001

15.
Distance and Measurement in Domain Theory, ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE vol. 45 (2001), 448-462

2000

1997

1995

1992

1990

1989

1988

1987

1985

1984

1.
A computer model of evolution and ecological processes, MODELING, SIMULATION & CONTROL C (1984), 59-63