Instytut Informatyki Analitycznej - lista publikacji

A Note on Two-Colorability of Nonuniform Hypergraphs, International Colloquium on Automata Languages and Programming [ICALP] vol. 107 (Leibniz International Proceedings in Informatics) (2018), 46:1-46:13

The Queue-Number of Posets of Bounded Width or Height vol. 11282 of Lecture Notes in Computer Science (2018), "Graph Drawing and Network Visualization. GD 2018", Springer

Sparsity and dimension, Combinatorica vol. 38 (2018), 1129-1148

Lossless Compression of Binary Trees With Correlated Vertex Names, IEEE Transactions on Information Theory vol. 64 (9) (2018), 6070-6080

Accidental exploration through value predictors, Schedae Informaticae vol. 27 (2018),

Burling Graphs, Chromatic Number, and Orthogonal Tree-Decompositions, Electronic Journal of Combinatorics vol. 25 (1) (2018), P1.35

Centroidal Localization Game, Electronic Journal of Combinatorics vol. 25 (4) (2018), 1-19

Common tangents of two disjoint polygons in linear time and constant workspace, ACM Transactions on Algorithms vol. 15 (2018), 12:1-21

On the Complexity of the Standard Translation of Lambda Calculus into Combinatory Logic, Reports on Mathematical Logic vol. 53 (2018), 19-42

Localization game on geometric and planar graphs, Discrete Applied Mathematics vol. 251 (2018), 30-39

Expressive Power, Satisfiability and Equivalence of Circuits over Nilpotent Algebras vol. Leibniz International Proceedings in Informatics (LIPIcs) (2018), "43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)", Schloss Dagstuhl – Leibniz-Zentrum für Informatik

Satisfiability in multi-valued circuits, (2018), "Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS'18)", Association for Computing Machinery (ACM)

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)

A Tight Bound for Shortest Augmenting Paths on Trees vol. 10870 (2018), "LATIN 2018: Theoretical Informatics", Springer

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

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)

Foreword to the Special Issue on Parallel and Distributed Computing based on The Functional Programming Paradigm, Concurrency Computation Practice and Experience (2018), 4

Absorption and directed Jónsson terms, (2018), "Don Pigozzi on Abstract Algebraic Logic", Springer

Defective 3-Paintability of Planar Graphs, Electronic Journal of Combinatorics vol. 25 (2) (2018), 20

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

An Easy Subexponential Bound for Online Chain Partitioning, Electronic Journal of Combinatorics vol. 25(2) (2018), #P2.28

Deferred On-Line Bipartite Matching, Electronic Journal of Combinatorics vol. 25 (2) (2018), P2.24

Every Plane Graph is Facially-Non-Repetitively C-choosable, Electronic Journal of Combinatorics vol. 25 (1) (2018), 13

A new lower bound for the on-line coloring of intervals with bandwidth, Theoretical Computer Science vol. 708 (2018), 96-100

Shortest Augmenting Paths for Online Matchings on Trees, Theory of Computing Systems vol. 62(2) (2018), 337-348

Graph coloring and Graham’s greatest common divisor problem, Discrete Mathematics vol. 341(3) (2018), 781-785

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)

Corrigendum to "A note on Thue games" [Inf. Process. Lett. 118 (2017) 75-77], Information Processing Letters vol. 130 (2018), 63-65

Why is it hard to beat O(n^2) for Longest Common Weakly Increasing Subsequence?, Information Processing Letters vol. 132 (2018), 1-5

On an Extremal Problem for Poset Dimension, Order vol. 35(3) (2018), 489-493

Random generation of closed simply-typed λ-terms: a synergy between logic programming and Boltzmann samplers, Theory and Practice of Logic Programming vol. 18(1) (2018), 97-119

The Partial Visibility Representation Extension Problem, Algorithmica vol. 80 (8) (2018), 2286-2323