Combinatorial Lemmas for Polyhedrons. - Adam Idzik; Konstanty Junosza-Szaniawski (Discuss. Math. Graph Theory, 2005)

Coloring of G2-G, for Euclidesian graph G. - Konstanty Junosza-Szaniawski (Discuss. Math. Graph Theory, 2005)

Combinatorial lemmas for polyhedrons I. - Adam Idzik; Konstanty Junosza-Szaniawski (Discuss. Math. Graph Theory, 2006)

On Improved Exact Algorithms for L(2, 1)-Labeling of Graphs. - Konstanty Junosza-Szaniawski; Pawel Rzazewski (IWOCA, 2010)

Game chromatic number of graphs with locally bounded number of cycles. - Konstanty Junosza-Szaniawski; Lukasz Rozej (Inf. Process. Lett., 2010)

Fast Exact Algorithm for L(2, 1)-Labeling of Graphs. - Konstanty Junosza-Szaniawski; Jan Kratochvíl; Mathieu Liedloff; Peter Rossmanith; Pawel Rzazewski (TAMC, 2011)

Counting Independent Sets in Claw-Free Graphs. - Konstanty Junosza-Szaniawski; Zbigniew Lonc; Michal Tuczynski (WG, 2011)

Determining L(2,1)-Span in Polynomial Space - Konstanty Junosza-Szaniawski; Pawel Rzazewski (CoRR, 2011)

On the complexity of exact algorithm for L(2, 1)-labeling of graphs. - Konstanty Junosza-Szaniawski; Pawel Rzazewski (Inf. Process. Lett., 2011)

Beyond Homothetic Polygons: Recognition and Maximum Clique. - Konstanty Junosza-Szaniawski; Jan Kratochvíl; Martin Pergel; Pawel Rzazewski (ISAAC, 2012)

Counting Maximal Independent Sets in Subcubic Graphs. - Konstanty Junosza-Szaniawski; Michal Tuczynski (SOFSEM, 2012)

Determining the L(2, 1)-Span in Polynomial Space. - Konstanty Junosza-Szaniawski; Jan Kratochvíl; Mathieu Liedloff; Pawel Rzazewski (WG, 2012)

On the number of 2-packings in a connected graph. - Konstanty Junosza-Szaniawski; Pawel Rzazewski (Discret. Math., 2012)

Determining the L(2, 1)L(2, 1)-span in polynomial space. - Konstanty Junosza-Szaniawski; Jan Kratochvíl; Mathieu Liedloff; Pawel Rzazewski (Discret. Appl. Math., 2013)

Fast exact algorithm for L(2, 1)-labeling of graphs. - Konstanty Junosza-Szaniawski; Jan Kratochvíl; Mathieu Liedloff; Peter Rossmanith; Pawel Rzazewski (Theor. Comput. Sci., 2013)

Homothetic Polygons and Beyond: Intersection Graphs, Recognition, and Maximum Clique. - Valentin E. Brimkov; Konstanty Junosza-Szaniawski; Sean Kafer; Jan Kratochvíl; Martin Pergel; Pawel Rzazewski; Matthew Szczepankiewicz; Joshua Terhaar (CoRR, 2014)

An Exact Algorithm for the Generalized List T-Coloring Problem. - Konstanty Junosza-Szaniawski; Pawel Rzazewski (Discret. Math. Theor. Comput. Sci., 2014)

Fastest, Average and Quantile Schedule. - Armin Fügenschuh; Konstanty Junosza-Szaniawski; Torsten Klug; Slawomir Kwasiborski; Thomas Schlechte (SOFSEM, 2015)

Fixing Improper Colorings of Graphs. - Konstanty Junosza-Szaniawski; Mathieu Liedloff; Pawel Rzazewski (SOFSEM, 2015)

Counting independent sets via Divide Measure and Conquer method. - Konstanty Junosza-Szaniawski; Michal Tuczynski (CoRR, 2015)

First non-trivial upper bound on circular chromatic number of the plane. - Konstanty Junosza-Szaniawski (Electron. Notes Discret. Math., 2015)

Fractional and j-Fold Coloring of the Plane. - Jaroslaw Grytczuk; Konstanty Junosza-Szaniawski; Joanna Sokól; Krzysztof Wesek (Discret. Comput. Geom., 2016)

Dynamic Transfer Patterns for Fast Multi-modal Route Planning. - Thomas Liebig; Sebastian Peter; Maciej Grzenda; Konstanty Junosza-Szaniawski (AGILE Conf., 2017)

Travel Time Prediction for Trams in Warsaw. - Adam Zychowski; Konstanty Junosza-Szaniawski; Aleksander Kosicki (CORES, 2017)

Upper Bound on the Circular Chromatic Number of the Plane. - Konstanty Junosza-Szaniawski (Electron. J. Comb., 2018)

Homothetic polygons and beyond: Maximal cliques in intersection graphs. - Valentin E. Brimkov; Konstanty Junosza-Szaniawski; Sean Kafer; Jan Kratochvíl; Martin Pergel; Pawel Rzazewski; Matthew Szczepankiewicz; Joshua Terhaar (Discret. Appl. Math., 2018)

Online Coloring and L(2, 1)-Labeling of Unit Disk Intersection Graphs. - Konstanty Junosza-Szaniawski; Pawel Rzazewski; Joanna Sokól; Krzysztof Wesek (SIAM J. Discret. Math., 2018)

Fixing improper colorings of graphs. - Valentin Garnero; Konstanty Junosza-Szaniawski; Mathieu Liedloff; Pedro Montealegre 001; Pawel Rzazewski (Theor. Comput. Sci., 2018)

Exact and approximation algorithms for joint routing and flow rate optimization. - Konstanty Junosza-Szaniawski; Dariusz Nogalski (FedCSIS (Communication Papers), 2019)

Exact and approximation algorithms for sensor placement against DDoS attacks. - Dariusz Nogalski; Konstanty Junosza-Szaniawski; Agnieszka Wójcik (FedCSIS, 2020)

Bundling all shortest paths. - Michal Debski; Konstanty Junosza-Szaniawski; Zbigniew Lonc (Discret. Appl. Math., 2020)

Strong chromatic index of K1, t-free graphs. - Michal Debski; Konstanty Junosza-Szaniawski; Malgorzata Sleszynska-Nowak (Discret. Appl. Math., 2020)

L(2, 1)-labeling of disk intersection graphs. - Joanna Sokól; Konstanty Junosza-Szaniawski; Pawel Rzazewski (Discret. Appl. Math., 2020)

Exact and Approximation Algorithms for Sensor Placement Against DDoS Attacks. - Konstanty Junosza-Szaniawski; Dariusz Nogalski; Pawel Rzazewski (Int. J. Appl. Math. Comput. Sci., 2022)

Fractional meanings of nonrepetitiveness. - Joanna Chybowska-Sokól; Michal Debski; Jaroslaw Grytczuk; Konstanty Junosza-Szaniawski; Barbara Nayar; Urszula Pastwa; Krzysztof Wesek (J. Comb. Theory A, 2022)

Game-Theoretic Approach to Attack Planning and Controller Placement in Software Defined Networks. - Konstanty Junosza-Szaniawski; Dariusz Nogalski (ICMCIS, 2023)

Coloring and Recognizing Mixed Interval Graphs. - Grzegorz Gutowski; Konstanty Junosza-Szaniawski; Felix Klesen; Pawel Rzazewski; Alexander Wolff 001; Johannes Zink 001 (ISAAC, 2023)

Finding Optimal Mixed Strategies in a Matrix Game Between the Attacker and the Network Operator. - Michal Pióro; Mariusz Mycek; Artur Tomaszewski; Konstanty Junosza-Szaniawski; Dariusz Nogalski (RNDM, 2023)

Coloring and Recognizing Directed Interval Graphs. - Grzegorz Gutowski; Konstanty Junosza-Szaniawski; Felix Klesen; Pawel Rzazewski; Alexander Wolff 001; Johannes Zink 001 (CoRR, 2023)

Coloring distance graphs on the plane. - Joanna Chybowska-Sokól; Konstanty Junosza-Szaniawski; Krzysztof Wesek (Discret. Math., 2023)

Federated SFC Placement in Sliced Collaborative Multi-Administrative Multi-Domain Networks. - Dariusz Nogalski; Dallal Belabed; Alexandre Triollet; Konstanty Junosza-Szaniawski; Slim Abdellatif; Pascal Berthou; Stanislas Pedebearn; Adam Dudko (SoftCOM, 2024)

Online coloring of short intervals. - Joanna Chybowska-Sokól; Grzegorz Gutowski; Konstanty Junosza-Szaniawski; Patryk Mikos; Adam Polak 001 (Eur. J. Comb., 2024)

Online coloring of disk graphs. - Joanna Chybowska-Sokól; Konstanty Junosza-Szaniawski (Theor. Comput. Sci., 2024)

Partial packing coloring and quasi-packing coloring of the triangular grid. - Hubert Grochowski; Konstanty Junosza-Szaniawski (Discret. Math., 2025)