Katedra Podstaw Informatyki - lista publikacji

1-111 z 111.

2017

111.
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
109.
Boolean dimension and local dimension, ELECTRONIC NOTES IN DISCRETE MATHEMATICS vol. 61 (2017), 1047-1053
108.
Coloring curves that cross a fixed curve vol. 77 of Leibniz International Proceedings in Informatics (2017), "33rd International Symposium on Computational Geometry (SoCG 2017)", Schloss Dagstuhl – Leibniz-Zentrum für Informatik
103.
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
100.

2016

95.
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
94.
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

2015

87.
Asymmetric coloring games on incomparability graphs, ELECTRONIC NOTES IN DISCRETE MATHEMATICS vol. 49 (2015), 803-811
85.
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.
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
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.
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.
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

2012

57.
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.
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

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

2009

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

2008

38.
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

2007

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

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