Instytut Informatyki Analitycznej - lista publikacji

Online metric algorithms with untrusted predictions, International Conference on Machine Learning [ICML], (2020),

Equivalences between triangle and range query problems, ACM/SIAM Symposium on Discrete Algorithms [SODA], (2020),

Monochromatic Triangles, Intermediate Matrix Products, and Convolutions, Innovations in Theoretical Computer Science [ITCS], (2020),

Intermediate problems in modular circuits satisfiability, IEEE Symposium on Logic in Computer Science [LICS] vol. Association for Computing Machinery (ACM) (2020), 578–590

Online Coloring of Short Intervals, International Workshop on Approximation Algorithms for Combinatorial Optimization Problems [APPROX] vol. 176 (Leibniz International Proceedings in Informatics) (2020), 52:1-52:18

Degree Distribution for Duplication-Divergence Graphs: Large Deviations, International Workshop on Graph-Theoretic Concepts in Computer Science [WG], (2020), 226-237

Temporal Ordered Clustering in Dynamic Networks, IEEE International Symposium on Information Theory [ISIT], (2020), 1349-1354

Power-Law Degree Distribution in the Connected Component of a Duplication Graph, International Conference on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms [AofA] vol. 16 (2020), 1-14

Seymour's Conjecture on 2-Connected Graphs of Large Pathwidth, Combinatorica vol. 40 (2020), 839–868

Vertex Deletion into Bipartite Permutation Graphs, International Symposium on Parameterized and Exact Computation (was IWPEC pre 2004) [IPEC] vol. 180 of Leibniz International Proceedings in Informatics, 15th International Symposium on Parameterized and Exact Computation, IPEC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference) (2020), 5:1-5:16

On The Relational Width of First-Order Expansions of Finitely Bounded Homogeneous Binary Cores with Bounded Strict Width, IEEE Symposium on Logic in Computer Science [LICS] vol. 35TH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS 2020) (2020), 958-971

Relational Width of First-Order Expansions of Homogeneous Graphs with Bounded Strict Width, International Symposium on Theoretical Aspects of Computer Science [STACS] vol. 154 (LIPIcs) (2020), 39:1-39:16

A Sub-Quadratic Algorithm for the Longest Common Increasing Subsequence Problem, International Symposium on Theoretical Aspects of Computer Science [STACS] vol. 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020) (2020), 41:1-41:18

Local dimension is unbounded for planar posets, Electronic Journal of Combinatorics vol. 27(4) (2020), P4.28

Adjacency labelling for planar graphs (and beyond), (2020), "2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)", Institute of Electrical and Electronics Engineers (IEEE)

Planar Graphs Have Bounded Queue-Number, Journal of the ACM vol. 67(4) (2020), 862-875

Boolean Dimension and Tree-Width, Combinatorica vol. 40 (2020), 655-677

Improved bounds for centered colorings vol. SODA '20 (2020), "Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms", Society for Industrial and Applied Mathematics (SIAM)

Boolean Dimension, Components and Blocks, Order (2020), 287-298

Sensitive Instances of the Constraint Satisfaction Problem, International Colloquium on Automata Languages and Programming [ICALP](MAIN), (2020), 110:1-110:18

Compression of Dynamic Graphs Generated by a Duplication Model, Algorithmica vol. 82 (2020), 2687-2707

Even faster algorithms for CSAT over supernilpotent algebras, International Symposium on Mathematical Foundations of Computer Science [MFCS] vol. 170 (2020), 55:1-55:13

Faster general parsing through context-free memoization, ACM-SIGPLAN Conference on Programming Language Design and Implementation [PLDI], (2020), 1022-1035

Recoloring Interval Graphs with Limited Recourse Budget vol. 162 (2020), "17th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2020, June 22-24, 2020, Tórshavn, Faroe Islands", Schloss Dagstuhl – Leibniz-Zentrum für Informatik

Quantitative Study of Fuzzy Logics, 2020 Ieee International Conference On Fuzzy Systems (fuzz-ieee) (2020), 1-8

Online metric algorithms with untrusted predictions, International Conference On Machine Learning (icml) vol. 119 (2020), 345–355

Planar graphs have bounded nonrepetitive chromatic number, Advances in Combinatorics vol. 2020 (2020), 5:1-11

Improved bound for the dimension of posets of treewidth two, Discrete Mathematics (2020), 111605

Monochromatic Triangles, Intermediate Matrix Products, and Convolutions, 11th Innovations in Theoretical Computer Science Conference (itcs 2020) vol. 151 (Leibniz International Proceedings in Informatics (LIPIcs)) (2020), 53:1-53:18

Equivalences between triangle and range query problems, Acm-siam Symposium On Discrete Algorithms 2020 (soda'20) (2020), 30-47