default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKonstanty Junosza-Szaniawski
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j22]Joanna Chybowska-Sokól, Grzegorz Gutowski, Konstanty Junosza-Szaniawski, Patryk Mikos, Adam Polak
:
Online coloring of short intervals. Eur. J. Comb. 118: 103919 (2024)- [c17]Dariusz Nogalski, Dallal Belabed, Alexandre Triollet, Konstanty Junosza-Szaniawski, Slim Abdellatif, Pascal Berthou, Stanislas Pedebearn, Adam Dudko:
Federated SFC Placement in Sliced Collaborative Multi-Administrative Multi-Domain Networks. SoftCOM 2024: 1-6 - 2023
- [j21]Joanna Chybowska-Sokól, Konstanty Junosza-Szaniawski, Krzysztof Wesek:
Coloring distance graphs on the plane. Discret. Math. 346(7): 113441 (2023) - [c16]Konstanty Junosza-Szaniawski, Dariusz Nogalski:
Game-Theoretic Approach to Attack Planning and Controller Placement in Software Defined Networks. ICMCIS 2023: 1-8 - [c15]Grzegorz Gutowski, Konstanty Junosza-Szaniawski, Felix Klesen, Pawel Rzazewski, Alexander Wolff, Johannes Zink:
Coloring and Recognizing Mixed Interval Graphs. ISAAC 2023: 36:1-36:14 - [c14]Michal Pióro, Mariusz Mycek, Artur Tomaszewski, Konstanty Junosza-Szaniawski, Dariusz Nogalski:
Finding Optimal Mixed Strategies in a Matrix Game Between the Attacker and the Network Operator. RNDM 2023: 1-8 - [i8]Grzegorz Gutowski, Konstanty Junosza-Szaniawski, Felix Klesen, Pawel Rzazewski, Alexander Wolff, Johannes Zink:
Coloring and Recognizing Directed Interval Graphs. CoRR abs/2303.07960 (2023) - 2022
- [j20]Konstanty Junosza-Szaniawski, Dariusz Nogalski, Pawel Rzazewski:
Exact and Approximation Algorithms for Sensor Placement Against DDoS Attacks. Int. J. Appl. Math. Comput. Sci. 32(1): 35-49 (2022) - [j19]Joanna Chybowska-Sokól, Michal Debski, Jaroslaw Grytczuk, Konstanty Junosza-Szaniawski, Barbara Nayar, Urszula Pastwa, Krzysztof Wesek:
Fractional meanings of nonrepetitiveness. J. Comb. Theory A 189: 105598 (2022) - [i7]Konstanty Junosza-Szaniawski, Dariusz Nogalski, Pawel Rzazewski:
Exact and approximation algorithms for sensor placement against DDoS attacks. CoRR abs/2210.06559 (2022) - 2020
- [j18]Joanna Sokól, Konstanty Junosza-Szaniawski, Pawel Rzazewski:
L(2, 1)-labeling of disk intersection graphs. Discret. Appl. Math. 277: 71-81 (2020) - [j17]Michal Debski, Konstanty Junosza-Szaniawski, Zbigniew Lonc:
Bundling all shortest paths. Discret. Appl. Math. 277: 82-91 (2020) - [j16]Michal Debski, Konstanty Junosza-Szaniawski, Malgorzata Sleszynska-Nowak:
Strong chromatic index of K1, t-free graphs. Discret. Appl. Math. 284: 53-60 (2020) - [c13]Joanna Chybowska-Sokól, Grzegorz Gutowski, Konstanty Junosza-Szaniawski, Patryk Mikos, Adam Polak:
Online Coloring of Short Intervals. APPROX-RANDOM 2020: 52:1-52:18 - [c12]Dariusz Nogalski, Konstanty Junosza-Szaniawski, Agnieszka Wójcik:
Exact and approximation algorithms for sensor placement against DDoS attacks. FedCSIS 2020: 295-301
2010 – 2019
- 2019
- [c11]Konstanty Junosza-Szaniawski, Dariusz Nogalski:
Exact and approximation algorithms for joint routing and flow rate optimization. FedCSIS (Communication Papers) 2019: 29-36 - 2018
- [j15]Konstanty Junosza-Szaniawski:
Upper Bound on the Circular Chromatic Number of the Plane. Electron. J. Comb. 25(1): 1 (2018) - [j14]Valentin E. Brimkov, Konstanty Junosza-Szaniawski, Sean Kafer, Jan Kratochvíl, Martin Pergel, Pawel Rzazewski, Matthew Szczepankiewicz, Joshua Terhaar:
Homothetic polygons and beyond: Maximal cliques in intersection graphs. Discret. Appl. Math. 247: 263-277 (2018) - [j13]Konstanty Junosza-Szaniawski, Pawel Rzazewski, Joanna Sokól, Krzysztof Wesek:
Online Coloring and L(2, 1)-Labeling of Unit Disk Intersection Graphs. SIAM J. Discret. Math. 32(2): 1335-1350 (2018) - [j12]Valentin Garnero, Konstanty Junosza-Szaniawski, Mathieu Liedloff, Pedro Montealegre, Pawel Rzazewski:
Fixing improper colorings of graphs. Theor. Comput. Sci. 711: 66-78 (2018) - [i6]Grzegorz Gutowski, Konstanty Junosza-Szaniawski, Patryk Mikos, Adam Polak, Joanna Sokól:
Online Coloring of Short Intervals. CoRR abs/1802.09503 (2018) - 2017
- [c10]Thomas Liebig, Sebastian Peter, Maciej Grzenda, Konstanty Junosza-Szaniawski:
Dynamic Transfer Patterns for Fast Multi-modal Route Planning. AGILE Conf. 2017: 223-236 - [c9]Adam Zychowski, Konstanty Junosza-Szaniawski, Aleksander Kosicki:
Travel Time Prediction for Trams in Warsaw. CORES 2017: 53-62 - 2016
- [j11]Jaroslaw Grytczuk, Konstanty Junosza-Szaniawski, Joanna Sokól, Krzysztof Wesek:
Fractional and j-Fold Coloring of the Plane. Discret. Comput. Geom. 55(3): 594-609 (2016) - [i5]Valentin Garnero, Konstanty Junosza-Szaniawski, Mathieu Liedloff, Pedro Montealegre, Pawel Rzazewski:
Fixing improper colorings of graphs. CoRR abs/1607.06911 (2016) - 2015
- [j10]Konstanty Junosza-Szaniawski:
First non-trivial upper bound on circular chromatic number of the plane. Electron. Notes Discret. Math. 49: 719-722 (2015) - [c8]Armin Fügenschuh, Konstanty Junosza-Szaniawski, Torsten Klug, Slawomir Kwasiborski, Thomas Schlechte:
Fastest, Average and Quantile Schedule. SOFSEM 2015: 201-216 - [c7]Konstanty Junosza-Szaniawski, Mathieu Liedloff, Pawel Rzazewski:
Fixing Improper Colorings of Graphs. SOFSEM 2015: 266-276 - [i4]Konstanty Junosza-Szaniawski, Michal Tuczynski:
Counting independent sets via Divide Measure and Conquer method. CoRR abs/1503.08323 (2015) - 2014
- [j9]Konstanty Junosza-Szaniawski, Pawel Rzazewski:
An Exact Algorithm for the Generalized List T-Coloring Problem. Discret. Math. Theor. Comput. Sci. 16(3): 77-94 (2014) - [i3]Valentin E. Brimkov, Konstanty Junosza-Szaniawski, Sean Kafer, Jan Kratochvíl, Martin Pergel, Pawel Rzazewski, Matthew Szczepankiewicz, Joshua Terhaar:
Homothetic Polygons and Beyond: Intersection Graphs, Recognition, and Maximum Clique. CoRR abs/1411.2928 (2014) - 2013
- [j8]Konstanty Junosza-Szaniawski, Jan Kratochvíl, Mathieu Liedloff, Pawel Rzazewski:
Determining the L(2, 1)L(2, 1)-span in polynomial space. Discret. Appl. Math. 161(13-14): 2052-2061 (2013) - [j7]Konstanty Junosza-Szaniawski, Jan Kratochvíl, Mathieu Liedloff, Peter Rossmanith, Pawel Rzazewski:
Fast exact algorithm for L(2, 1)-labeling of graphs. Theor. Comput. Sci. 505: 42-54 (2013) - [i2]Konstanty Junosza-Szaniawski, Pawel Rzazewski:
An Exact Algorithm for the Generalized List $T$-Coloring Problem. CoRR abs/1311.0603 (2013) - 2012
- [j6]Konstanty Junosza-Szaniawski, Pawel Rzazewski:
On the number of 2-packings in a connected graph. Discret. Math. 312(23): 3444-3450 (2012) - [c6]Konstanty Junosza-Szaniawski, Jan Kratochvíl, Martin Pergel, Pawel Rzazewski:
Beyond Homothetic Polygons: Recognition and Maximum Clique. ISAAC 2012: 619-628 - [c5]Konstanty Junosza-Szaniawski, Michal Tuczynski:
Counting Maximal Independent Sets in Subcubic Graphs. SOFSEM 2012: 325-336 - [c4]Konstanty Junosza-Szaniawski, Jan Kratochvíl, Mathieu Liedloff, Pawel Rzazewski:
Determining the L(2, 1)-Span in Polynomial Space. WG 2012: 126-137 - 2011
- [j5]Konstanty Junosza-Szaniawski, Pawel Rzazewski:
On the complexity of exact algorithm for L(2, 1)-labeling of graphs. Inf. Process. Lett. 111(14): 697-701 (2011) - [c3]Konstanty Junosza-Szaniawski, Jan Kratochvíl, Mathieu Liedloff, Peter Rossmanith, Pawel Rzazewski:
Fast Exact Algorithm for L(2, 1)-Labeling of Graphs. TAMC 2011: 82-93 - [c2]Konstanty Junosza-Szaniawski, Zbigniew Lonc, Michal Tuczynski:
Counting Independent Sets in Claw-Free Graphs. WG 2011: 227-237 - [i1]Konstanty Junosza-Szaniawski, Pawel Rzazewski:
Determining L(2,1)-Span in Polynomial Space. CoRR abs/1104.4506 (2011) - 2010
- [j4]Konstanty Junosza-Szaniawski, Lukasz Rozej:
Game chromatic number of graphs with locally bounded number of cycles. Inf. Process. Lett. 110(17): 757-760 (2010) - [c1]Konstanty Junosza-Szaniawski, Pawel Rzazewski:
On Improved Exact Algorithms for L(2, 1)-Labeling of Graphs. IWOCA 2010: 34-37
2000 – 2009
- 2006
- [j3]Adam Idzik, Konstanty Junosza-Szaniawski:
Combinatorial lemmas for polyhedrons I. Discuss. Math. Graph Theory 26(3): 439-448 (2006) - 2005
- [j2]Adam Idzik, Konstanty Junosza-Szaniawski:
Combinatorial Lemmas for Polyhedrons. Discuss. Math. Graph Theory 25(1-2): 95-102 (2005) - [j1]Konstanty Junosza-Szaniawski:
Coloring of G2-G, for Euclidesian graph G. Discuss. Math. Graph Theory 25(1-2): 219 (2005)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-11 22:24 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
