Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Miroslaw Kowaluk
2010 – today
- 2012
[c14]Peter Floderus, Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell: Induced Subgraph Isomorphism: Are Some Patterns Substantially Easier Than Others? COCOON 2012: 37-48- 2011
- [c13]Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell: Unique Small Subgraphs Are Not Easier to Find. LATA 2011: 336-341
- [c12]Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell: Counting and detecting small subgraphs via equations and matrix multiplication. SODA 2011: 1468-1476
2000 – 2009
- 2009
- [j10]Leszek Gasieniec, Miroslaw Kowaluk, Andrzej Lingas: Faster multi-witnesses for Boolean matrix multiplication. Inf. Process. Lett. 109(4): 242-247 (2009)
- 2008
- [c11]Miroslaw Kowaluk, Andrzej Lingas, Johannes Nowak: A Path Cover Technique for LCAs in Dags. SWAT 2008: 222-233
- 2007
- [j9]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)
- [c10]Miroslaw Kowaluk, Andrzej Lingas: Unique Lowest Common Ancestors in Dags Are Almost as Easy as Matrix Multiplication. ESA 2007: 265-274
- 2006
- [i3]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
- [c9]
- 2004
- [j8]
- [j7]Marek Karpinski, Miroslaw Kowaluk, Andrzej Lingas: Approximation Algorithms for MAX-BISECTION on Low Degree Regular Graphs. Fundam. Inform. 62(3-4): 369-375 (2004)
- [c8]Jerzy W. Jaromczyk, Miroslaw Kowaluk, Neil Moore: A web interface to image-based concurrent markup using image maps. WIDM 2004: 152-159
- 2003
- [j6]Jerzy W. Jaromczyk, Miroslaw Kowaluk: Sets of lines and cutting out polyhedral objects. Comput. Geom. 25(1-2): 67-95 (2003)
- 2000
- [j5]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)
- [i2]Jerzy W. Jaromczyk, Miroslaw Kowaluk: The Face-Wise Continuity in Hot Wire Cutting of Polyhedral Sets. EuroCG 2000: 93-97
- [i1]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)
1990 – 1999
- 1999
- [j4]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
- [c7]Bogdan S. Chlebus, Artur Czumaj, Leszek Gasieniec, Miroslaw Kowaluk, Wojciech Plandowski: Parallel Alternating-Direction Access Machine. MFCS 1996: 267-278
- 1995
- [j3]Bogdan S. Chlebus, Krzysztof Diks, Miroslaw Kowaluk: O(log log n)-Time Integer Geometry on the CRCW PRAM. Algorithmica 14(1): 52-69 (1995)
- [j2]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)
- [c6]Jerzy W. Jaromczyk, Miroslaw Kowaluk: The Two-Line Center Problem from a Polar View: A New Algorithm and Data Structure. WADS 1995: 13-25
- 1994
- [c5]Jerzy W. Jaromczyk, Miroslaw Kowaluk: An Efficient Algorithm for the Euclidean Two-Center Problem. Symposium on Computational Geometry 1994: 303-311
- 1992
- [c4]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
- [j1]Jerzy W. Jaromczyk, Miroslaw Kowaluk: Constructing the relative neighborhood graph in 3-dimensional Euclidean space. Discrete Applied Mathematics 31(2): 181-191 (1991)
- 1990
- [c3]Miroslaw Kowaluk, Klaus W. Wagner: Vector Language: Simple Description of Hard Instances (Extended Abstract). MFCS 1990: 378-384
1980 – 1989
- 1988
- [c2]Jerzy W. Jaromczyk, Miroslaw Kowaluk: Skewed Projections with an Application to Line Stabbing in R3. Symposium on Computational Geometry 1988: 362-370
- 1987
- [c1]Jerzy W. Jaromczyk, Miroslaw Kowaluk: A Note on Relative Neighborhood Graphs. Symposium on Computational Geometry 1987: 233-241
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-08 21:05 CET by the dblp team