Instytut Informatyki Analitycznej - lista publikacji
Nadjednostka:
Podjednostki:
1-26 z 26.
2017
26.
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
25.
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
24.
Gwenaël Joret, Piotr Micek, William T. Trotter, Ruidong Wang, Veit Wiechert
On the Dimension of Posets with Cover Graphs of Treewidth 2, Order vol. 34.2 (2017), 185-234
23.
Piotr Micek, Veit Wiechert
Topological minors of cover graphs and dimension, Journal of Graph Theory vol. 86.3 (2017), 295–314
22.
Stefan Felsner, Gwenaël Joret, Piotr Micek, William T. Trotter, Veit Wiechert
Burling graphs, chromatic number, and orthogonal tree-decompositions, Electronic Notes in Discrete Mathematics vol. 61 (2017), 415-420
21.
Gwenaël Joret, Piotr Micek, Veit Wiechert
Planar posets have dimension at most linear in their height, SIAM Journal on Discrete Mathematics vol. 31 (4) (2017), 2754–2790
20.
Tomasz Krawczyk, Bartosz Walczak
On-line approach to off-line coloring problems on graphs with geometric representations, Combinatorica vol. 37 (2017), 1139-1179
19.
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
18.
Tomasz Krawczyk, Bartosz Walczak
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
17.
Marcin Anholcer, Bartłomiej Bosek, Jarosław Grytczuk
Majority Choosability of Digraphs, Electronic Journal of Combinatorics vol. 24(3) (2017), #P3.57
16.
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
15.
Combinatorics of λ-terms: a natural approach, Journal of Logic and Computation vol. Volume 27, Issue 8 (2017), 2611–2630
14.
13.
Uniform Cross-entropy Clustering, Schedae Informaticae vol. 25 (2017), 117-126
12.
11.
The Complexity of Minimal Inference Problem for Conservative Constraint Languages. Proceedings of the Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)., IEEE Symposium on Logic in Computer Science [LICS], (2017),
10.
Minimal Inference Problem over Finite Domains: The Landscape of Complexity. Procedings of the International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR)., International Conference on Logic Programming and Non-monotonic Reasoning [LPNMR], (2017),
9.
Barnaby Martin, Andras Pongracz, Michał Wrona
The Complexity of Counting Quantifiers on Equality Languages, Theoretical Computer Science vol. 670 (2017), 56–67
8.
Libor Barto, Marcin Kozik
Absorption in Universal Algebra and CSP, (2017), "The Constraint Satisfaction Problem: Complexity and Approximability", Schloss Dagstuhl – Leibniz-Zentrum für Informatik
7.
Victor Dalmau, Marcin Kozik, Andrei Krokhin, Konstantin Makarychev, Yury Makarychev, Jakub Oprsal
Robust algorithms with polynomial loss for near-unanimity CSPs, Proceedings of the 28th Annual Acm-siam Symposium On Discrete Algorithms Soda'17 (2017), 340-357
6.
Piotr Micek, Veit Wiechert
An On-line Competitive Algorithm for Coloring Bipartite Graphs Without Long Induced Paths, Algorithmica vol. 77 (2017), 1060-1070
5.
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
4.
Maciej Bendkowski, Katarzyna Grygiel, Paul Tarau
Boltzmann Samplers for Closed Simply-Typed Lambda Terms, Lecture Notes in Computer Science vol. 10137 (2017), 120-135
3.
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
2.
Minors and dimension, Journal of Combinatorial Theory. Series B vol. 122 (2017), 668-689
1.
On the likelihood of normalisation in combinatory logic, Journal of Logic and Computation vol. Volume 27, Issue 7 (2017), 2251–2269