The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Miroslaw Kowaluk: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  21. A Path Cover Technique for LCAs in Dags. [Citation Graph (, )][DBLP]


  22. Constructing the relative neighborhood graph in 3-dimensional Euclidean space. [Citation Graph (, )][DBLP]


  23. Faster algorithms for finding lowest common ancestors in directed acyclic graphs. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002