Konstanty Junosza-Szaniawski

Discret. Math., July, 2023

Coloring and Recognizing Directed Interval Graphs.

[BibT_eX]

[DOI]

Grzegorz Gutowski

CoRR, 2023

Finding Optimal Mixed Strategies in a Matrix Game Between the Attacker and the Network Operator.

[BibT_eX]

[DOI]

Michal Pióro

Mariusz Mycek

Artur Tomaszewski

Proceedings of the 13th International Workshop on Resilient Networks Design and Modeling, 2023

Coloring and Recognizing Mixed Interval Graphs.

[BibT_eX]

[DOI]

Grzegorz Gutowski

Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

Game-Theoretic Approach to Attack Planning and Controller Placement in Software Defined Networks.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Military Communications and Information Systems, 2023

2022

Fractional meanings of nonrepetitiveness.

[BibT_eX]

[DOI]

Joanna Chybowska-Sokól

Michal Debski

Jaroslaw Grytczuk

Barbara Nayar

Urszula Pastwa

J. Comb. Theory, Ser. A, 2022

Exact and Approximation Algorithms for Sensor Placement Against DDoS Attacks.

[BibT_eX]

[DOI]

Int. J. Appl. Math. Comput. Sci., 2022

2020

L(2, 1)-labeling of disk intersection graphs.

[BibT_eX]

[DOI]

Joanna Sokól

Discret. Appl. Math., 2020

Strong chromatic index of K1, t-free graphs.

[BibT_eX]

[DOI]

Michal Debski

Malgorzata Sleszynska-Nowak

Discret. Appl. Math., 2020

Bundling all shortest paths.

[BibT_eX]

[DOI]

Michal Debski

Zbigniew Lonc

Discret. Appl. Math., 2020

Exact and approximation algorithms for sensor placement against DDoS attacks.

[BibT_eX]

[DOI]

Agnieszka Wójcik

Proceedings of the 2020 Federated Conference on Computer Science and Information Systems, 2020

Online Coloring of Short Intervals.

[BibT_eX]

[DOI]

Joanna Chybowska-Sokól

Grzegorz Gutowski

Patryk Mikos

Adam Polak

Proceedings of the Approximation, 2020

2019

Exact and approximation algorithms for joint routing and flow rate optimization.

[BibT_eX]

[DOI]

Proceedings of the Preprints of Communication Papers of the 2019 Federated Conference on Computer Science and Information Systems, 2019

2018

Fixing improper colorings of graphs.

[BibT_eX]

[DOI]

Valentin Garnero

Pedro Montealegre

Theor. Comput. Sci., 2018

Online Coloring and L(2, 1)-Labeling of Unit Disk Intersection Graphs.

[BibT_eX]

[DOI]

Joanna Sokól

SIAM J. Discret. Math., 2018

Homothetic polygons and beyond: Maximal cliques in intersection graphs.

[BibT_eX]

[DOI]

Valentin E. Brimkov

Matthew Szczepankiewicz

Joshua Terhaar

Discret. Appl. Math., 2018

Upper Bound on the Circular Chromatic Number of the Plane.

[BibT_eX]

[DOI]

Electron. J. Comb., 2018

2017

Travel Time Prediction for Trams in Warsaw.

[BibT_eX]

[DOI]

Adam Zychowski

Aleksander Kosicki

Proceedings of the 10th International Conference on Computer Recognition Systems CORES 2017, 2017

Dynamic Transfer Patterns for Fast Multi-modal Route Planning.

[BibT_eX]

[DOI]

Thomas Liebig

Sebastian Peter

Maciej Grzenda

Proceedings of the Societal Geo-innovation, 2017

2016

Fractional and j-Fold Coloring of the Plane.

[BibT_eX]

[DOI]

Jaroslaw Grytczuk

Joanna Sokól

Discret. Comput. Geom., 2016

2015

First non-trivial upper bound on circular chromatic number of the plane.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

Counting independent sets via Divide Measure and Conquer method.

[BibT_eX]

[DOI]

Michal Tuczynski

CoRR, 2015

Fixing Improper Colorings of Graphs.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2015: Theory and Practice of Computer Science, 2015

Fastest, Average and Quantile Schedule.

[BibT_eX]

[DOI]

Armin Fügenschuh

Torsten Klug

Slawomir Kwasiborski

Thomas Schlechte

Proceedings of the SOFSEM 2015: Theory and Practice of Computer Science, 2015

2014

An Exact Algorithm for the Generalized List T-Coloring Problem.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2014

Homothetic Polygons and Beyond: Intersection Graphs, Recognition, and Maximum Clique.

[BibT_eX]

[DOI]

Valentin E. Brimkov

Matthew Szczepankiewicz

Joshua Terhaar

CoRR, 2014

2013

Fast exact algorithm for L(2, 1)-labeling of graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Determining the L(2, 1)L(2, 1)-span in polynomial space.

[BibT_eX]

[DOI]

Jan Kratochvíl

Discret. Appl. Math., 2013

2012

On the number of 2-packings in a connected graph.

[BibT_eX]

[DOI]

Discret. Math., 2012

Determining the L(2, 1)-Span in Polynomial Space.

[BibT_eX]

[DOI]

Jan Kratochvíl

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012

Counting Maximal Independent Sets in Subcubic Graphs.

[BibT_eX]

[DOI]

Michal Tuczynski

Proceedings of the SOFSEM 2012: Theory and Practice of Computer Science, 2012

Beyond Homothetic Polygons: Recognition and Maximum Clique.

[BibT_eX]

[DOI]

Jan Kratochvíl

Martin Pergel

Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

2011

On the complexity of exact algorithm for L(2, 1)-labeling of graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2011

Determining L(2,1)-Span in Polynomial Space

[BibT_eX]

[DOI]

CoRR, 2011

Counting Independent Sets in Claw-Free Graphs.

[BibT_eX]

[DOI]

Zbigniew Lonc

Michal Tuczynski

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2011

Fast Exact Algorithm for L(2, 1)-Labeling of Graphs.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2011

2010

Game chromatic number of graphs with locally bounded number of cycles.

[BibT_eX]

[DOI]

Lukasz Rozej

Inf. Process. Lett., 2010

On Improved Exact Algorithms for L(2, 1)-Labeling of Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

2006

Combinatorial lemmas for polyhedrons I.

[BibT_eX]

[DOI]

Adam Idzik

Discuss. Math. Graph Theory, 2006

2005

Coloring of G2-G, for Euclidesian graph G.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2005

Combinatorial Lemmas for Polyhedrons.

[BibT_eX]

[DOI]

Adam Idzik