Instytut Informatyki Analitycznej - lista publikacji
Nadjednostka:
Podjednostki:
1-21 z 21.
2014
21.
Tractability Frontier for Dually-Closed Ord-Horn Quantified Constraint Satisfaction Problems, LECTURE NOTES IN COMPUTER SCIENCE vol. 8634 (Springer) (2014), 535--546
20.
Local-to-Global Consistency Implies Tractability of Abduction. Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence., PROCEEDINGS OF THE TWENTY-EIGHTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE (2014), 1128--1134
19.
Manuel Bodirsky, Hubie Chen, Michał Wrona
Tractability of quantified temporal constraints to the max, INT J ALGEBR COMPUT vol. 24 (2014), 1141--1156
18.
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
17.
16.
Piotr Micek, Veit Wiechert
An on-line competitive algorithm for coloring P_8-free bipartite graphs, (2014), "Algorithms and Computation -- 25th International Symposium, ISAAC 2014, Jeonju, Korea, December 15-17, 2014, Proceedings", Springer
15.
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
14.
Jean Cardinal, Kolja Knauer, Piotr Micek, Torsten Ueckerdt
Making octants colorful, and related covering decomposition problems, (2014), "Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2014)", Society for Industrial and Applied Mathematics (SIAM)
13.
Jean Cardinal, Kolja Knauer, Piotr Micek, Torsten Ueckerdt
Making octants colorful, and related covering decomposition problems, SIAM J DISCRETE MATH vol. 28-4 (2014), 1948-1959
12.
Libor Barto, Marcin Kozik
Constraint Satisfaction Problems Solvable by Local Consistency Methods, J ACM vol. 61 (2014), article no. 3
11.
Anetta Górnicka, Joanna Grygiel, Katarzyna Grygiel
A note on blocks of skeleton tolerances, ACTA MATH HUNG vol. 143(1) (2014), 176-184
10.
Bartłomiej Bosek, Dariusz Leniowski, Piotr Sankowski, Anna Zych
Online bipartite matching in offline time, (2014), "55th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2014, October 18-21, 2014, Philadelphia, PA, USA", Institute of Electrical and Electronics Engineers (IEEE)
9.
Andrzej Grzesik, Hrant Khachatrian
Interval edge-colorings of K_{1,m,n}, DISCRETE APPL MATH vol. 174 (2014), 140-145
8.
7.
An extremal problem on crossing vectors, J COMB THEORY A vol. 128 (2014), 41-55
6.
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
5.
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)
4.
Jakub Kozik, Tomasz Krawczyk, Michał Lasoń, Piotr Micek, Arkadiusz Pawlik, William T. Trotter, Bartosz Walczak
Triangle-free intersection graphs of line segments with large chromatic number, J COMB THEORY B vol. 105 (2014), 6-10
3.
Kolja Knauer, Piotr Micek, Bartosz Walczak
Outerplanar graph drawings with few slopes, COMP GEOM-THEOR APPL vol. 47 (2014), 614-624
2.
Jakub Kozik, Piotr Micek, Xuding Zhu
Towards an on-line version of Ohba’s conjecture, EUR J COMBIN vol. 36 (2014), 110-121
1.
Bartłomiej Bosek, Jarosław Grytczuk, Grzegorz Matecki, Sebastian Czerwiński, Tomasz Bartnicki, Wiktor Żelazny
Additive Coloring of Planar Graphs, GRAPH COMBINATOR vol. 30(5) (2014), 1087-1098