| ||
| 1. | Unique Small Subgraphs Are Not Easier to Find
LECTURE NOTES IN COMPUTER SCIENCE Tom 6638 r. 2011, str. 336-341 (Artykuł) Mirosław Kowaluk, Andrzej Lingas, Eva-Marta Lundell | |
| 2. | Faster multi-witnesses for Boolean matrix multiplication
INFORMATION PROCESSING LETTERS Tom 109 Nr 4 r. 2009, str. 242-247 (Artykuł) Leszek Gasieniec, Mirosław Kowaluk, Andrzej Lingas | |
| 3. | A Path Cover Technique for LCAs in Dags
LECTURE NOTES IN COMPUTER SCIENCE Tom 5124 r. 2008, str. 222-233 (Artykuł) Mirosław Kowaluk, Andrzej Lingas, Johannes Nowak | |
| 4. | Faster algorithms for finding lowest common ancestors in directed acyclic graphs
THEORETICAL COMPUTER SCIENCE Tom 380 Nr 1 r. 2007, str. 37-46 (Artykuł) Artur Czumaj, Mirosław Kowaluk, Andrzej Lingas | |
| 5. | Unique Lowest Common Ancestors in Dags Are Almost as Easy as Matrix Multiplication
LECTURE NOTES IN COMPUTER SCIENCE Tom 4698 r. 2007, str. 265-274 (Artykuł konferencyjny) Mirosław Kowaluk, Andrzej Lingas | |
| 6. | LCA Queries in Directed Acyclic Graphs
LECTURE NOTES IN COMPUTER SCIENCE Tom 3580 r. 2005, str. 241-248 (Artykuł konferencyjny) Mirosław Kowaluk, Andrzej Lingas | |
| 7. | Approximation Algorithms for MAX-BISECTION on Low Degree Regular Graphs
FUNDAMENTA INFORMATICAE Tom 62 Nr 3 r. 2004, str. 369-375 (Artykuł) Marek Karpinski, Mirosław Kowaluk, Andrzej Lingas | |
| 8. | Sets of lines and cutting out polyhedral objects
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS Tom 25 r. 2003, str. 67-95 (Artykuł) J. Jaromczyk, Mirosław Kowaluk | |
| 9. | Algorithms for the parallel alternating direction access machine
THEORETICAL COMPUTER SCIENCE Tom 245 r. 2000, str. 151-173 (Artykuł) Bogdan Chlebus, A. Czumaj, Leszek G±sieniec, Mirosław Kowaluk, Wojciech Plandowski | |
| ||
| 10. | Proc. 18th Eur. Worksh. Computational Geometry (EWCG 2002)
Elsevier, r. 2004 (Ksi±żka) Mirosław Kowaluk (Redaktor), Jerzy Jaromczyk (Redaktor) | |
| ||
| 11. | Induced Subgraph Isomorphism: Are Some Patterns Substantially Easier Than Others?
w: COCOON, str. 37-48, r. 2012 (Artykuł konferencyjny) Peter Floderus, Mirosław Kowaluk, Andrzej Lingas, Eva-Marta Lundell | |
| 12. | Counting and detecting small subgraphs via equations and matrix multiplication
w: SODA, str. 1468-1476, SIAM, r. 2011 (Artykuł konferencyjny) Mirosław Kowaluk, Andrzej Lingas, Eva-Marta Lundell | |
| 13. | On visualization of complex image-based markup
w: International Conference on Computer Vision and Graphics, str. 477-484, Springer Verlag, r. 2005 (Artykuł konferencyjny) Jerzy Jaromczyk, Mirosław Kowaluk, Neil Moore | |
| 14. | A web interface to image-based concurrent markup using maps
w: Sixth ACM CIKM International Workshop on Web Information and Data Management (WIDM 2004), str. 152-159, ACM, r. 2004 (Artykuł konferencyjny) Jerzy Jaromczyk, Mirosław Kowaluk, Neil Moore | |
| 15. | A kinetic view of the shooter problem
w: Proc. of the 18th European Workshop on Computational Geometry, str. 31-35, Wydział Matematyki, Informatyki i Mechaniki Uniwersytetu Warszawskiego, r. 2002 (Artykuł konferencyjny) Jerzy Jaromczyk, Mirosław Kowaluk | |
| 16. | The face-wise continuity in hot wire cutting of polyhedral sets
w: Proceedinngs 16th European Workshop on Computational Geometry, str. 93-97, Ben Gurion University, r. 2000 (Artykuł) Mirosław Kowaluk, J Jaromczyk | |