| 2009 |
|---|
| 24 | EE | Leszek Gasieniec,
Miroslaw Kowaluk,
Andrzej Lingas:
Faster multi-witnesses for Boolean matrix multiplication.
Inf. Process. Lett. 109(4): 242-247 (2009) |
| 2008 |
|---|
| 23 | EE | Miroslaw Kowaluk,
Andrzej Lingas,
Johannes Nowak:
A Path Cover Technique for LCAs in Dags.
SWAT 2008: 222-233 |
| 2007 |
|---|
| 22 | EE | Miroslaw Kowaluk,
Andrzej Lingas:
Unique Lowest Common Ancestors in Dags Are Almost as Easy as Matrix Multiplication.
ESA 2007: 265-274 |
| 21 | EE | Artur Czumaj,
Miroslaw Kowaluk,
Andrzej Lingas:
Faster algorithms for finding lowest common ancestors in directed acyclic graphs.
Theor. Comput. Sci. 380(1-2): 37-46 (2007) |
| 2006 |
|---|
| 20 | EE | Artur Czumaj,
Miroslaw Kowaluk,
Andrzej Lingas:
Faster algorithms for finding lowest common ancestors in directed acyclic graphs.
Electronic Colloquium on Computational Complexity (ECCC) 13(111): (2006) |
| 2005 |
|---|
| 19 | EE | Miroslaw Kowaluk,
Andrzej Lingas:
LCA Queries in Directed Acyclic Graphs.
ICALP 2005: 241-248 |
| 2004 |
|---|
| 18 | EE | Jerzy W. Jaromczyk,
Miroslaw Kowaluk,
Neil Moore:
A web interface to image-based concurrent markup using image maps.
WIDM 2004: 152-159 |
| 17 | EE | Jerzy W. Jaromczyk,
Miroslaw Kowaluk:
Editorial.
Comput. Geom. 27(1): 1- (2004) |
| 16 | EE | Marek Karpinski,
Miroslaw Kowaluk,
Andrzej Lingas:
Approximation Algorithms for MAX-BISECTION on Low Degree Regular Graphs.
Fundam. Inform. 62(3-4): 369-375 (2004) |
| 2003 |
|---|
| 15 | | Jerzy W. Jaromczyk,
Miroslaw Kowaluk:
Sets of lines and cutting out polyhedral objects.
Comput. Geom. 25(1-2): 67-95 (2003) |
| 2000 |
|---|
| 14 | | Jerzy W. Jaromczyk,
Miroslaw Kowaluk:
The Face-Wise Continuity in Hot Wire Cutting of Polyhedral Sets.
EWCG 2000: 93-97 |
| 13 | EE | Marek Karpinski,
Miroslaw Kowaluk,
Andrzej Lingas:
Approximation Algorithms for MAX-BISECTION on Low Degree Reg ular Graphs and Planar Graphs
Electronic Colloquium on Computational Complexity (ECCC) 7(51): (2000) |
| 12 | EE | Bogdan S. Chlebus,
Artur Czumaj,
Leszek Gasieniec,
Miroslaw Kowaluk,
Wojciech Plandowski:
Algorithms for the parallel alternating direction access machine.
Theor. Comput. Sci. 245(2): 151-173 (2000) |
| 1999 |
|---|
| 11 | | Jerzy W. Jaromczyk,
Miroslaw Kowaluk:
A geometric proof of the combinatorial bounds for the number of optimal solutions for the Euclidean 2-center problem.
Comput. Geom. 14(4): 187-196 (1999) |
| 1996 |
|---|
| 10 | | Bogdan S. Chlebus,
Artur Czumaj,
Leszek Gasieniec,
Miroslaw Kowaluk,
Wojciech Plandowski:
Parallel Alternating-Direction Access Machine.
MFCS 1996: 267-278 |
| 1995 |
|---|
| 9 | | Jerzy W. Jaromczyk,
Miroslaw Kowaluk:
The Two-Line Center Problem from a Polar View: A New Algorithm and Data Structure.
WADS 1995: 13-25 |
| 8 | | Bogdan S. Chlebus,
Krzysztof Diks,
Miroslaw Kowaluk:
O(log log n)-Time Integer Geometry on the CRCW PRAM.
Algorithmica 14(1): 52-69 (1995) |
| 7 | | Faith E. Fich,
Miroslaw Kowaluk,
Miroslaw Kutylowski,
Krzysztof Lorys,
Prabhakar Ragde:
Retrieval of Scattered Information by EREW, CREW, and CRCW PRAMs.
Computational Complexity 5(2): 113-131 (1995) |
| 1994 |
|---|
| 6 | EE | Jerzy W. Jaromczyk,
Miroslaw Kowaluk:
An Efficient Algorithm for the Euclidean Two-Center Problem.
Symposium on Computational Geometry 1994: 303-311 |
| 1992 |
|---|
| 5 | | Faith E. Fich,
Miroslaw Kowaluk,
Krzysztof Lorys,
Miroslaw Kutylowski,
Prabhakar Ragde:
Retrieval of scattered information by EREW, CREW and CRCW PRAMs.
SWAT 1992: 30-41 |
| 1991 |
|---|
| 4 | EE | Jerzy W. Jaromczyk,
Miroslaw Kowaluk:
Constructing the relative neighborhood graph in 3-dimensional Euclidean space.
Discrete Applied Mathematics 31(2): 181-191 (1991) |
| 1990 |
|---|
| 3 | | Miroslaw Kowaluk,
Klaus W. Wagner:
Vector Language: Simple Description of Hard Instances (Extended Abstract).
MFCS 1990: 378-384 |
| 1988 |
|---|
| 2 | EE | Jerzy W. Jaromczyk,
Miroslaw Kowaluk:
Skewed Projections with an Application to Line Stabbing in R3.
Symposium on Computational Geometry 1988: 362-370 |
| 1987 |
|---|
| 1 | EE | Jerzy W. Jaromczyk,
Miroslaw Kowaluk:
A Note on Relative Neighborhood Graphs.
Symposium on Computational Geometry 1987: 233-241 |
