Katedra Algorytmiki - lista publikacji

Nadjednostka:

[Wszystkie publikacje]


[2024] [2023] [2022] [2021] [2020] [2019] [2018] [2017] [2016] [2015] [2014] [2013] [2012] [2011] [2010] [2009] [2008] [2007] [2006] [2005] [2003] [1998] [1997] [1995] [1989] [1988] [1985]
1-17 z 17.

2013

17.
Johannes Schmidt, Michał Wrona
The Complexity of Abduction for Equality Constraint Languages, Lipics–leibniz International Proceedings in Informatics vol. 23 (2013), 615-633
16.
Jean Cardinal, Kolja Knauer, Piotr Micek, Torsten Ueckerdt
Making triangles colorful, Journal of Computational Geometry vol. 4 (2013), 240-246
15.
Andrei Asinowski, Jean Cardinal, Nathann Cohen, Sébastien Collette, Günter Rote, Thomas Hackl, Michael Hoffman, Kolja Knauer, Stefan Langerman, Michał Lasoń, Piotr Micek, Torsten Ueckerdt
Coloring hypergraphs induced by dynamic point sets and bottomless rectangles, Lecture Notes in Computer Science vol. 8037 (2013), 73-84
14.
Michał Staromiejski
Polynomial-time locality tests for finite rings, Journal of Algebra vol. 379 (2013), 441-452
13.
Tomasz Krawczyk, Arkadiusz Pawlik, Bartosz Walczak
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
12.
Michał Lasoń, Piotr Micek, Arkadiusz Pawlik, Bartosz Walczak
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
11.
Arkadiusz Pawlik, Jakub Kozik, Tomasz Krawczyk, Michał Lasoń, Piotr Micek, William T. Trotter, Bartosz Walczak
Triangle-free geometric intersection graphs with large chromatic number, Discrete and Computational Geometry vol. 50 (2013), 714-726
10.
Bartłomiej Bosek, Kamil Kloch, Tomasz Krawczyk, Piotr Micek
On-Line Dimension of Semi-Orders, Order vol. 30(2) (2013), 593-615
9.
Jarosław Grytczuk, Piotr Szafruga, Michał Zmarz
Online version of the theorem of Thue, Information Processing Letters vol. 113 (2013), 193-195
8.
Jarosław Grytczuk, Jakub Kozik, Piotr Micek
New approach to nonrepetitive sequences, Random Structures and Algorithms vol. 42 (2013), 214-225
7.
Jakub Kozik, Piotr Micek
Nonrepetitive choice number of trees, SIAM Journal on Discrete Mathematics vol. 27-1 (2013), 436-446
6.
Stefan Felsner, Tomasz Krawczyk, William T. Trotter
On-line dimension for posets excluding two long incomparable chains, Order vol. 30(1) (2013), 1-12
5.
Stefan Felsner, Kamil Kloch, Grzegorz Matecki, Piotr Micek
On-line Chain Partitions of Up-growing Semi-orders, Order vol. 30(1) (2013), 85-101
4.
Bartłomiej Bosek, Tomasz Krawczyk, Grzegorz Matecki
First-Fit Coloring of Incomparability Graphs, SIAM Journal on Discrete Mathematics vol. 27(1) (2013), 126-140
3.
Lech Duraj
A linear algorithm for 3-letter longest common weakly increasing subsequence, Information Processing Letters vol. 113 (2013), 94-99
2.
Michał Lasoń
f-vectors implying vertex decomposability, Discrete and Computational Geometry vol. 49 (2013), 296-301
1.
Katarzyna Grygiel, Paweł Idziak, Marek Zaionc
How big is BCI fragment of BCK logic, Journal of Logic and Computation vol. 23(3) (2013), 673-691