Instytut Informatyki Analitycznej - lista publikacji

Nadjednostka:

Podjednostki:

[Wszystkie publikacje]


[2026] [2025] [2024] [2023] [2022] [2021] [2020] [2019] [2018] [2017] [2016] [2015] [2014] [2013] [2012] [2011] [2010] [2009] [2008] [2007] [2006] [2005] [2004] [2003] [2001] [2000] [1998] [1997] [1995] [1992] [1990] [1989] [1988] [1987] [1985] [1984]
1-16 z 16.

2026

16.
Changlong Wu, Jin Sima, Wojciech Szpankowski
Certifying Capabilities from Finite Tests: When Is It Possible?, International Conference on Machine Learning [ICML], (2026),
15.
Michael Drmota, Philippe Jacquet, Changlong Wu, Wojciech Szpankowski
Phase Transition of Regret for Logistic Regression with Large Weights, Algorithmic Learning Theory [ALT], (2026),
14.
Sławomir Rams, Matthias Schuett
Miyaoka’s bound for conics on K3 surfaces and beyond, Nagoya Mathematical Journal vol. 261 (2026), 12
13.
Demian Banakh, Alexey Barsukov, Vesa Nakajima Tamio
Towards infinite PCSP: a dichotomy for monochromatic cliques, IEEE Symposium on Logic in Computer Science [LICS], (2026),
12.
Stijn Cambie, Ervin Győri, Nika Salia, Casey Tompkins, James Tuite
The maximum Wiener index of a uniform hypergraph, Discrete Mathematics vol. 349 (2026),
11.
Ervin Győri, Binlong Li, Nika Salia, Casey Tompkins, Kitti Varga, Manran Zhu
On graphs without cycles of length 0 modulo 4, Journal of Combinatorial Theory. Series B vol. 176 (2026), 7-29
10.
Louis Esperet, Harmender Gahlawat, Ugo Giocanti
Coarse cops and robber in graphs and groups, European Journal of Combinatorics vol. 135 (2026),
9.
Marthe Bonamy, Oscar Defrain, Piotr Micek, Lhouari Nourine
Enumerating minimal dominating sets in the (in)comparability graphs of bounded dimension posets, Discrete Mathematics vol. 349:4 (2026), 114904
8.
Jędrzej Hodor, Hoang La, Piotr Micek, Clément Rambaud
Centered colorings in minor-closed graph classes, ACM/SIAM Symposium on Discrete Algorithms [SODA], (2026), 164-184
7.
Gwenaël Joret, Piotr Micek, Michał Pilipczuk, Bartosz Walczak
Cliquewidth and dimension, Proceedings of the London Mathematical Society vol. 132 (2026), e70116
6.
Stijn Cambie, Ervin Győri, Nika Salia, Casey Tompkins, James Tuite
The maximum Wiener index of a uniform hypergraph, Discrete Mathematics vol. 349 (2026), 114797
5.
Ervin Győri, Binlong Li, Nika Salia, Casey Tompkins, Kitti Varga, Manran Zhu
On graphs without cycles of length 0 modulo 4, Journal of Combinatorial Theory. Series B vol. 176 (2026), 7-29
4.
Tara Abrishami, Marcin Briański, James Davies, Xiying Du, Jana Masaříková, Paweł Rzążewski, Bartosz Walczak
Burling graphs in graphs with large chromatic number, ACM/SIAM Symposium on Discrete Algorithms [SODA], (2026), 3978-3998
3.
Seth Pettie, Gábor Tardos, Bartosz Walczak
On a clique game and the Erdős-Hajnal problem on high-chromatic high-girth subgraphs, ACM/SIAM Symposium on Discrete Algorithms [SODA], (2026), 2903-2927
2.
Paweł Rzążewski, Bartosz Walczak
Polynomial-time recognition and maximum independent set in Burling graphs, International Workshop on Graph-Theoretic Concepts in Computer Science [WG] vol. 16124 of Lecture Notes in Computer Science (2026), 445-460
1.
Sławomir Rams, Alexander Degtyarev
Counting lines with Vinberg's algorithm, Revista Matematica Iberoamericana vol. 42 (2026), 489-544