default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAdrian Kosowski
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[i21]Michal Bartoszkiewicz, Jan Chorowski, Adrian Kosowski, Jakub Kowalski, Sergey Kulik, Mateusz Lewandowski, Krzysztof Nowicki, Kamil Piechowiak, Olivier Ruas, Zuzanna Stamirowska, Przemyslaw Uznanski:
Pathway: a fast and flexible unified stream data processing framework for analytical and Machine Learning applications. CoRR abs/2307.13116 (2023)- 2022
- [j43]Jurek Czyzowicz, Leszek Gasieniec
, Adrian Kosowski, Evangelos Kranakis, Paul G. Spirakis, Przemyslaw Uznanski:
On convergence and threshold properties of discrete Lotka-Volterra population protocols. J. Comput. Syst. Sci. 130: 1-25 (2022) - 2020
- [c66]Vincent Cohen-Addad, Adrian Kosowski, Frederik Mallmann-Trenn, David Saulpic:
On the Power of Louvain in the Stochastic Block Model. NeurIPS 2020
2010 – 2019
- 2019
- [j42]Adrian Kosowski, Dominik Pajak:
Does adding more agents make a difference? A case study of cover time for the rotor-router. J. Comput. Syst. Sci. 106: 80-93 (2019) - [j41]Petra Berenbrink, Ralf Klasing, Adrian Kosowski, Frederik Mallmann-Trenn, Przemyslaw Uznanski:
Improved Analysis of Deterministic Load-Balancing Schemes. ACM Trans. Algorithms 15(1): 10:1-10:22 (2019) - [c65]Siddharth Gupta, Adrian Kosowski, Laurent Viennot:
Exploiting Hopsets: Improved Distance Oracles for Graphs of Constant Highway Dimension and Beyond. ICALP 2019: 143:1-143:15 - [c64]Adrian Kosowski, Przemyslaw Uznanski, Laurent Viennot:
Hardness of Exact Distance Queries in Sparse Graphs Through Hub Labeling. PODC 2019: 272-279 - [i20]Adrian Kosowski, Przemyslaw Uznanski, Laurent Viennot:
Hardness of exact distance queries in sparse graphs through hub labeling. CoRR abs/1902.07055 (2019) - 2018
- [c63]Adrian Kosowski, Przemyslaw Uznanski:
Brief Announcement: Population Protocols Are Fast. PODC 2018: 475-477 - [c62]Adrian Kosowski, Przemyslaw Uznanski:
Ergodic Effects in Token Circulation. SODA 2018: 2668-2682 - [c61]Bartlomiej Dudek, Adrian Kosowski:
Universal protocols for information dissemination using emergent signals. STOC 2018: 87-99 - [i19]Adrian Kosowski, Przemyslaw Uznanski:
Population Protocols Made Easy. CoRR abs/1802.06872 (2018) - [i18]Siddharth Gupta, Adrian Kosowski, Laurent Viennot:
Exact Distance Oracles Using Hopsets. CoRR abs/1803.06977 (2018) - 2017
- [j40]Evangelos Bampas, Leszek Gasieniec, Nicolas Hanusse, David Ilcinkas, Ralf Klasing, Adrian Kosowski, Tomasz Radzik:
Robustness of the Rotor-Router Mechanism. Algorithmica 78(3): 869-895 (2017) - [j39]Jurek Czyzowicz, Leszek Gasieniec, Adrian Kosowski, Evangelos Kranakis, Danny Krizanc, Najmeh Taleb:
When Patrolmen Become Corrupted: Monitoring a Graph Using Faulty Mobile Robots. Algorithmica 79(3): 925-940 (2017) - [j38]Ralf Klasing, Adrian Kosowski, Dominik Pajak, Thomas Sauerwald:
The multi-agent rotor-router on the ring: a deterministic alternative to parallel random walks. Distributed Comput. 30(2): 127-148 (2017) - [j37]Jurek Czyzowicz, Dariusz Dereniowski, Leszek Gasieniec, Ralf Klasing, Adrian Kosowski, Dominik Pajak:
Collision-free network exploration. J. Comput. Syst. Sci. 86: 70-81 (2017) - [c60]Dan Alistarh, Bartlomiej Dudek, Adrian Kosowski, David Soloveichik, Przemyslaw Uznanski:
Robust Detection in Leak-Prone Population Protocols. DNA 2017: 155-171 - [c59]Dariusz Dereniowski, Adrian Kosowski, Przemyslaw Uznanski, Mengchuan Zou:
Approximation Strategies for Generalized Binary Search in Weighted Trees. ICALP 2017: 84:1-84:14 - [c58]Adrian Kosowski, Laurent Viennot:
Beyond Highway Dimension: Small Distance Labels Using Tree Skeletons. SODA 2017: 1462-1478 - [c57]Andrej Ivaskovic, Adrian Kosowski, Dominik Pajak, Thomas Sauerwald:
Multiple Random Walks on Paths and Grids. STACS 2017: 44:1-44:14 - [i17]Dariusz Dereniowski, Adrian Kosowski, Przemyslaw Uznanski, Mengchuan Zou:
Approximation Strategies for Generalized Binary Search in Weighted Trees. CoRR abs/1702.08207 (2017) - [i16]Bartlomiej Dudek, Adrian Kosowski:
Spreading a Confirmed Rumor: A Case for Oscillatory Dynamics. CoRR abs/1705.09798 (2017) - [i15]Dan Alistarh, Bartlomiej Dudek, Adrian Kosowski, David Soloveichik, Przemyslaw Uznanski:
Robust Detection in Leak-Prone Population Protocols. CoRR abs/1706.09937 (2017) - 2016
- [j36]Dariusz Dereniowski, Adrian Kosowski, Dominik Pajak, Przemyslaw Uznanski:
Bounds on the cover time of parallel rotor walks. J. Comput. Syst. Sci. 82(5): 802-816 (2016) - [c56]Pierre Fraigniaud, Marc Heinrich, Adrian Kosowski:
Local Conflict Coloring. FOCS 2016: 625-634 - [c55]Jurek Czyzowicz, Adrian Kosowski, Evangelos Kranakis, Najmeh Taleb:
Patrolling Trees with Mobile Robots. FPS 2016: 331-344 - [c54]Pawel Gawrychowski, Adrian Kosowski, Przemyslaw Uznanski:
Brief Announcement: Sublinear-Space Distance Labeling Using Hubs. PODC 2016: 43-45 - [c53]Ralf Klasing, Adrian Kosowski, Dominik Pajak:
Setting Ports in an Anonymous Network: How to Reduce the Level of Symmetry? SIROCCO 2016: 35-48 - [c52]Pawel Gawrychowski, Adrian Kosowski, Przemyslaw Uznanski:
Sublinear-Space Distance Labeling Using Hubs. DISC 2016: 230-242 - [i14]Adrian Kosowski, Laurent Viennot:
Beyond Highway Dimension: Small Distance Labels Using Tree Skeletons. CoRR abs/1609.00512 (2016) - [i13]Adrian Kosowski, Przemyslaw Uznanski:
Ergodic Effects in Token Circulation. CoRR abs/1612.09145 (2016) - 2015
- [j35]Adrian Kosowski, Bi Li, Nicolas Nisse, Karol Suchan:
k-Chordal Graphs: From Cops and Robber to Compact Routing via Treewidth. Algorithmica 72(3): 758-777 (2015) - [j34]Florent Becker, Adrian Kosowski, Martín Matamala, Nicolas Nisse, Ivan Rapaport, Karol Suchan, Ioan Todinca:
Allowing each node to communicate only once in a distributed system: shared whiteboard models. Distributed Comput. 28(3): 189-200 (2015) - [j33]Dariusz Dereniowski, Yann Disser, Adrian Kosowski, Dominik Pajak, Przemyslaw Uznanski:
Fast collaborative graph exploration. Inf. Comput. 243: 37-49 (2015) - [j32]Jurek Czyzowicz, Leszek Gasieniec, Adrian Kosowski, Evangelos Kranakis, Oscar Morales-Ponce, Eduardo Pacheco:
Position discovery for a system of bouncing robots. Inf. Comput. 244: 122-133 (2015) - [j31]Dariusz Dereniowski, Adrian Kosowski, Dominik Pajak:
Distinguishing views in symmetric networks: A tight lower bound. Theor. Comput. Sci. 582: 27-34 (2015) - [j30]Dariusz Dereniowski, Ralf Klasing, Adrian Kosowski, Lukasz Kuszner:
Rendezvous of heterogeneous mobile agents in edge-weighted networks. Theor. Comput. Sci. 608: 219-230 (2015) - [c51]Jurek Czyzowicz, Leszek Gasieniec, Adrian Kosowski, Evangelos Kranakis, Paul G. Spirakis, Przemyslaw Uznanski:
On Convergence and Threshold Properties of Discrete Lotka-Volterra Population Protocols. ICALP (1) 2015: 393-405 - [c50]Jurek Czyzowicz, Leszek Gasieniec, Adrian Kosowski, Evangelos Kranakis, Danny Krizanc, Najmeh Taleb:
When Patrolmen Become Corrupted: Monitoring a Graph Using Faulty Mobile Robots. ISAAC 2015: 343-354 - [c49]Petra Berenbrink, Ralf Klasing, Adrian Kosowski, Frederik Mallmann-Trenn, Przemyslaw Uznanski:
Improved Analysis of Deterministic Load-Balancing Schemes. PODC 2015: 301-310 - [c48]Jérémie Chalopin, Shantanu Das, Pawel Gawrychowski, Adrian Kosowski, Arnaud Labourel, Przemyslaw Uznanski:
Limit Behavior of the Multi-agent Rotor-Router System. DISC 2015: 123-139 - [e2]Adrian Kosowski, Igor Walukiewicz:
Fundamentals of Computation Theory - 20th International Symposium, FCT 2015, Gdańsk, Poland, August 17-19, 2015, Proceedings. Lecture Notes in Computer Science 9210, Springer 2015, ISBN 978-3-319-22176-2 [contents] - [i12]Jurek Czyzowicz, Leszek Gasieniec, Adrian Kosowski, Evangelos Kranakis, Paul G. Spirakis, Przemyslaw Uznanski:
On Convergence and Threshold Properties of Discrete Lotka-Volterra Population Protocols. CoRR abs/1503.09168 (2015) - [i11]Pawel Gawrychowski, Adrian Kosowski, Przemyslaw Uznanski:
Even Simpler Distance Labeling for (Sparse) Graphs. CoRR abs/1507.06240 (2015) - [i10]Pierre Fraigniaud, Marc Heinrich, Adrian Kosowski:
Local Conflict Coloring. CoRR abs/1511.01287 (2015) - 2014
- [j29]Jurek Czyzowicz, Adrian Kosowski, Andrzej Pelc:
Time versus space trade-offs for rendezvous in trees. Distributed Comput. 27(2): 95-109 (2014) - [c47]Adrian Kosowski, Dominik Pajak:
Does Adding More Agents Make a Difference? A Case Study of Cover Time for the Rotor-Router. ICALP (2) 2014: 544-555 - [c46]Jurek Czyzowicz, Dariusz Dereniowski, Leszek Gasieniec, Ralf Klasing, Adrian Kosowski, Dominik Pajak:
Collision-Free Network Exploration. LATIN 2014: 342-354 - [c45]Shantanu Das, Dariusz Dereniowski, Adrian Kosowski, Przemyslaw Uznanski:
Rendezvous of Distance-Aware Mobile Agents in Unknown Graphs. SIROCCO 2014: 295-310 - [c44]Dariusz Dereniowski, Ralf Klasing, Adrian Kosowski, Lukasz Kuszner:
Rendezvous of Heterogeneous Mobile Agents in Edge-Weighted Networks. SIROCCO 2014: 311-326 - [c43]Dariusz Dereniowski, Adrian Kosowski, Dominik Pajak, Przemyslaw Uznanski:
Bounds on the Cover Time of Parallel Rotor Walks. STACS 2014: 263-275 - [i9]Petra Berenbrink, Ralf Klasing, Adrian Kosowski, Frederik Mallmann-Trenn, Przemyslaw Uznanski:
Be Fair and Be Selfish! Characterizing Deterministic Diffusive Load-Balancing Schemes with Small Discrepancy. CoRR abs/1404.4344 (2014) - [i8]Dariusz Dereniowski, Ralf Klasing, Adrian Kosowski, Lukasz Kuszner:
Rendezvous of Heterogeneous Mobile Agents in Edge-weighted Networks. CoRR abs/1406.2008 (2014) - [i7]Shantanu Das, Dariusz Dereniowski, Adrian Kosowski, Przemyslaw Uznanski:
Rendezvous of Distance-aware Mobile Agents in Unknown Graphs. CoRR abs/1406.2795 (2014) - [i6]Dariusz Dereniowski, Adrian Kosowski, Dominik Pajak:
Distinguishing Views in Symmetric Networks: A Tight Lower Bound. CoRR abs/1407.2511 (2014) - [i5]Jérémie Chalopin, Shantanu Das, Pawel Gawrychowski, Adrian Kosowski, Arnaud Labourel, Przemyslaw Uznanski:
Lock-in Problem for Parallel Rotor-router Walks. CoRR abs/1407.3200 (2014) - 2013
- [b1]Adrian Kosowski:
Time and Space-Efficient Algorithms for Mobile Agents in an Anonymous Network. University of Bordeaux, France, 2013 - [j28]Jurek Czyzowicz, Adrian Kosowski, Andrzej Pelc:
Deterministic Rendezvous of Asynchronous Bounded-Memory Agents in Polygonal Terrains. Theory Comput. Syst. 52(2): 179-199 (2013) - [j27]Adrian Kosowski, Alfredo Navarra, Dominik Pajak, Maria Cristina Pinotti:
Maximum matching in multi-interface networks. Theor. Comput. Sci. 507: 52-60 (2013) - [j26]Adrian Kosowski, Masafumi Yamashita:
Preface. Theor. Comput. Sci. 509: 1-2 (2013) - [c42]Adrian Kosowski, Przemyslaw Uznanski:
Splittable Single Source-Sink Routing on CMP Grids: A Sublinear Number of Paths Suffice. Euro-Par 2013: 671-683 - [c41]Dariusz Dereniowski, Yann Disser, Adrian Kosowski, Dominik Pajak, Przemyslaw Uznanski:
Fast Collaborative Graph Exploration. ICALP (2) 2013: 520-532 - [c40]Ralf Klasing, Adrian Kosowski, Dominik Pajak, Thomas Sauerwald:
The multi-agent rotor-router on the ring: a deterministic alternative to parallel random walks. PODC 2013: 365-374 - [c39]Adrian Kosowski:
A Õ (n2) Time-Space Trade-off for Undirected s-t Connectivity. SODA 2013: 1873-1883 - [c38]Andrew Collins, Jurek Czyzowicz, Leszek Gasieniec, Adrian Kosowski, Evangelos Kranakis, Danny Krizanc, Russell Martin, Oscar Morales-Ponce:
Optimal patrolling of fragmented boundaries. SPAA 2013: 241-250 - [i4]Adrian Kosowski, Marcin Markiewicz:
Lower Bounds on the Communication Complexity of Binary Local Quantum Measurement Simulation. CoRR abs/1310.2217 (2013) - 2012
- [j25]Adrian Kosowski, Alfredo Navarra:
Graph Decomposition for Memoryless Periodic Exploration. Algorithmica 63(1-2): 26-38 (2012) - [j24]Adrian Kosowski, Ichiro Suzuki, Pawel Zylinski:
A Point Set Connection Problem for Autonomous Mobile Robots in a Grid. Comput. Informatics 31(2): 349-369 (2012) - [j23]Florent Foucaud, Ralf Klasing, Adrian Kosowski, André Raspaud:
On the size of identifying codes in triangle-free graphs. Discret. Appl. Math. 160(10-11): 1532-1546 (2012) - [j22]Jurek Czyzowicz, Adrian Kosowski, Andrzej Pelc:
How to meet when you forget: log-space rendezvous in arbitrary graphs. Distributed Comput. 25(2): 165-178 (2012) - [c37]Adrian Kosowski, Alfredo Navarra, Dominik Pajak, Maria Cristina Pinotti:
Maximum Matching in Multi-Interface Networks. COCOA 2012: 13-24 - [c36]Adrian Kosowski, Bi Li, Nicolas Nisse, Karol Suchan:
k-Chordal Graphs: From Cops and Robber to Compact Routing via Treewidth. ICALP (2) 2012: 610-622 - [c35]Jurek Czyzowicz, Adrian Kosowski, Andrzej Pelc:
Time vs. space trade-offs for rendezvous in trees. SPAA 2012: 1-10 - [c34]Florent Becker, Adrian Kosowski, Nicolas Nisse, Ivan Rapaport, Karol Suchan:
Allowing each node to communicate only once in a distributed system: shared whiteboard models. SPAA 2012: 11-17 - [c33]Jurek Czyzowicz, Leszek Gasieniec, Adrian Kosowski, Evangelos Kranakis, Oscar Morales-Ponce, Eduardo Pacheco:
Position Discovery for a System of Bouncing Robots. DISC 2012: 341-355 - [i3]Adrian Kosowski:
A $\tilde O(n^2)$ Time-Space Trade-off for Undirected s-t Connectivity. CoRR abs/1204.1136 (2012) - 2011
- [j21]Colin Cooper, David Ilcinkas, Ralf Klasing, Adrian Kosowski:
Derandomizing random walks in undirected graphs using locally fair exploration strategies. Distributed Comput. 24(2): 91-99 (2011) - [j20]Adrian Kosowski, Dominik Pajak, Zuzanna Stamirowska:
Review of SIROCCO 2011. SIGACT News 42(4): 92-95 (2011) - [j19]Adrian Kosowski, Alfredo Navarra, Maria Cristina Pinotti:
Synchronous black hole search in directed graphs. Theor. Comput. Sci. 412(41): 5752-5759 (2011) - [c32]Jurek Czyzowicz, Leszek Gasieniec, Adrian Kosowski, Evangelos Kranakis:
Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds. ESA 2011: 701-712 - [c31]Andrew Collins, Jurek Czyzowicz, Leszek Gasieniec, Adrian Kosowski, Russell A. Martin:
Synchronous Rendezvous for Location-Aware Agents. DISC 2011: 447-459 - [e1]Adrian Kosowski, Masafumi Yamashita:
Structural Information and Communication Complexity - 18th International Colloquium, SIROCCO 2011, Gdansk, Poland, June 26-29, 2011. Proceedings. Lecture Notes in Computer Science 6796, Springer 2011, ISBN 978-3-642-22211-5 [contents] - [i2]Florent Becker, Adrian Kosowski, Nicolas Nisse, Ivan Rapaport, Karol Suchan:
Interconnection network with a shared whiteboard: Impact of (a)synchronicity on computing power. CoRR abs/1109.6534 (2011) - 2010
- [j18]Ralf Klasing, Adrian Kosowski, Alfredo Navarra:
Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring. Theor. Comput. Sci. 411(34-36): 3235-3246 (2010) - [j17]Adrian Kosowski, Alfredo Navarra, Maria Cristina Pinotti:
Exploiting multi-interface networks: Connectivity and Cheapest Paths. Wirel. Networks 16(4): 1063-1073 (2010) - [c30]Jurek Czyzowicz, Adrian Kosowski, Andrzej Pelc:
Deterministic Rendezvous of Asynchronous Bounded-Memory Agents in Polygonal Terrains. MFCS 2010: 294-305 - [c29]Jérémie Chalopin, Shantanu Das, Adrian Kosowski:
Constructing a Map of an Anonymous Graph: Applications of Universal Sequences. OPODIS 2010: 119-134 - [c28]Nicolas Hanusse, David Ilcinkas, Adrian Kosowski, Nicolas Nisse:
Locating a target with an agent guided by unreliable local advice: how to beat the random walk when you have a clock? PODC 2010: 355-364 - [c27]Jurek Czyzowicz, Adrian Kosowski, Andrzej Pelc:
How to meet when you forget: log-space rendezvous in arbitrary graphs. PODC 2010: 450-459 - [i1]Florent Foucaud, Ralf Klasing, Adrian Kosowski, André Raspaud:
On the size of identifying codes in triangle-free graphs. CoRR abs/1010.5975 (2010)
2000 – 2009
- 2009
- [j16]Adrian Kosowski:
Forwarding and optical indices of a graph. Discret. Appl. Math. 157(2): 321-329 (2009) - [j15]Adrian Kosowski:
A note on the strength and minimum color sum of bipartite graphs. Discret. Appl. Math. 157(11): 2552-2554 (2009) - [j14]Adrian Kosowski:
Approximating the maximum 2- and 3-edge-colorable subgraph problems. Discret. Appl. Math. 157(17): 3593-3600 (2009) - [j13]Robert Janczewski, Adrian Kosowski, Michal Malafiejski:
The complexity of the L(p, q)-labeling problem for bipartite planar graphs of small degree. Discret. Math. 309(10): 3270-3279 (2009) - [j12]Hanna Furmanczyk, Adrian Kosowski, Bernard Ries, Pawel Zylinski:
Mixed graph edge coloring. Discret. Math. 309(12): 4027-4036 (2009) - [j11]Krzysztof Kosowski, Karol Tucki, Adrian Kosowski:
Turbine stage design aided by artificial intelligence methods. Expert Syst. Appl. 36(9): 11536-11542 (2009) - [j10]Ralf Klasing, Adrian Kosowski, Alfredo Navarra:
Cost minimization in wireless networks with a bounded and unbounded number of interfaces. Networks 53(3): 266-275 (2009) - [j9]Cyril Gavoille, Ralf Klasing, Adrian Kosowski, Lukasz Kuszner, Alfredo Navarra:
On the complexity of distributed graph coloring with local minimality constraints. Networks 54(1): 12-19 (2009) - [j8]Pierre Fraigniaud, Cyril Gavoille, Adrian Kosowski, Emmanuelle Lebhar, Zvi Lotker:
Universal augmentation schemes for network navigability. Theor. Comput. Sci. 410(21-23): 1970-1981 (2009) - [c26]Colin Cooper, David Ilcinkas, Ralf Klasing, Adrian Kosowski:
Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies. ICALP (2) 2009: 411-422 - [c25]Adrian Kosowski, Ichiro Suzuki, Pawel Zylinski:
Forming a connected network in a grid by asynchronous and oblivious robots. IMCSIT 2009: 583-588 - [c24]Adrian Kosowski, Alfredo Navarra:
Graph Decomposition for Improving Memoryless Periodic Exploration. MFCS 2009: 501-512 - [c23]Adrian Kosowski, Alfredo Navarra, Maria Cristina Pinotti:
Synchronization Helps Robots to Detect Black Holes in Directed Graphs. OPODIS 2009: 86-98 - [c22]Evangelos Bampas, Leszek Gasieniec, Ralf Klasing, Adrian Kosowski, Tomasz Radzik:
Robustness of the Rotor-router Mechanism. OPODIS 2009: 345-358 - [c21]Agnieszka Kolenderska, Adrian Kosowski, Michal Malafiejski, Pawel Zylinski:
An Improved Strategy for Exploring a Grid Polygon. SIROCCO 2009: 222-236 - [c20]Cyril Gavoille, Adrian Kosowski, Marcin Markiewicz:
What Can Be Observed Locally? DISC 2009: 243-257 - [c19]Evangelos Bampas, Leszek Gasieniec, Nicolas Hanusse, David Ilcinkas, Ralf Klasing, Adrian Kosowski:
Euler Tour Lock-In Problem in the Rotor-Router Model. DISC 2009: 423-435 - 2008
- [j7]Adrian Kosowski, Pawel Zylinski:
Packing Three-Vertex Paths in 2-Connected Cubic Graphs. Ars Comb. 89 (2008) - [j6]Adrian Kosowski, Michal Malafiejski, Pawel Zylinski:
Tighter Bounds on the Size of a Maximum P3-Matching in a Cubic Graph. Graphs Comb. 24(5): 461-468 (2008) - [j5]Hanna Furmanczyk, Adrian Kosowski, Pawel Zylinski:
A note on mixed tree coloring. Inf. Process. Lett. 106(4): 133-135 (2008) - [j4]Adrian Kosowski:
The maximum edge-disjoint paths problem in complete graphs. Theor. Comput. Sci. 399(1-2): 128-140 (2008) - [c18]Ralf Klasing, Adrian Kosowski, Alfredo Navarra:
Taking Advantage of Symmetries: Gathering of Asynchronous Oblivious Robots on a Ring. OPODIS 2008: 446-462 - [c17]Adrian Kosowski, Alfredo Navarra, Maria Cristina Pinotti:
Connectivity in Multi-interface Networks. TGC 2008: 157-170 - 2007
- [j3]Adrian Kosowski, Michal Malafiejski, Pawel Zylinski:
Cooperative mobile guards in grids. Comput. Geom. 37(2): 59-71 (2007) - [j2]Adrian Kosowski, Michal Malafiejski, Pawel Zylinski:
Packing [1, Delta] -factors in graphs of small degree. J. Comb. Optim. 14(1): 63-86 (2007) - [c16]Adrian Kosowski, Michal Malafiejski, Tomasz Noinski:
Application of an Online Judge & Contester System in Academic Tuition. ICWL 2007: 343-354 - [c15]Ralf Klasing, Adrian Kosowski, Alfredo Navarra:
Cost Minimisation in Multi-interface Networks. NET-COOP 2007: 276-285 - [c14]Hanna Furmanczyk, Adrian Kosowski, Pawel Zylinski:
Scheduling with Precedence Constraints: Mixed Graph Coloring in Series-Parallel Graphs. PPAM 2007: 1001-1008 - [c13]Adrian Kosowski, Alfredo Navarra:
Cost Minimisation in Unbounded Multi-interface Networks. PPAM 2007: 1039-1047 - [c12]Pierre Fraigniaud, Cyril Gavoille, Adrian Kosowski, Emmanuelle Lebhar, Zvi Lotker:
Universal augmentation schemes for network navigability: overcoming the sqrt(n)-barrier. SPAA 2007: 1-7 - [c11]Cyril Gavoille, Ralf Klasing, Adrian Kosowski, Alfredo Navarra:
On the Complexity of Distributed Greedy Coloring. DISC 2007: 482-484 - 2006
- [j1]Adrian Kosowski, Michal Malafiejski, Pawel Zylinski:
An approximation algorithm for maximum P3-packing in subcubic graphs. Inf. Process. Lett. 99(6): 230-233 (2006) - [c10]Adrian Kosowski, Lukasz Kuszner:
On Greedy Graph Coloring in the Distributed Model. Euro-Par 2006: 592-601 - [c9]Adrian Kosowski, Lukasz Kuszner:
Self-stabilizing Algorithms for Graph Coloring with Improved Performance Guarantees. ICAISC 2006: 1150-1159 - [c8]Adrian Kosowski, Michal Malafiejski, Pawel Zylinski:
An Efficient Algorithm for Mobile Guarded Guards in Simple Grids. ICCSA (1) 2006: 141-150 - [c7]Adrian Kosowski, Michal Malafiejski, Pawel Zylinski:
Fault Tolerant Guarding of Grids. ICCSA (1) 2006: 161-170 - [c6]Adrian Kosowski, Lukasz Kuszner:
Energy Optimisation in Resilient Self-Stabilizing Processes. PARELEC 2006: 105-110 - [c5]Adrian Kosowski:
Approximation Strategies for Routing Edge Disjoint Paths in Complete Graphs. SIROCCO 2006: 130-142 - 2005
- [c4]Adrian Kosowski, Michal Malafiejski, Pawel Zylinski:
On Bounded Load Routings for Modeling k-Regular Connection Topologies. ISAAC 2005: 614-623 - [c3]Adrian Kosowski, Lukasz Kuszner:
A Self-stabilizing Algorithm for Finding a Spanning Tree in a Polynomial Number of Moves. PPAM 2005: 75-82 - [c2]Adrian Kosowski, Michal Malafiejski, Pawel Zylinski:
Parallel Processing Subsystems with Redundancy in a Distributed Environment. PPAM 2005: 1002-1009 - 2004
- [c1]Adrian Kosowski:
An Efficient Algorithm for the Longest Tandem Scattered Subsequence Problem. SPIRE 2004: 93-100
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-08-05 20:20 CEST 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:
