Wydział Matematyki, Informatyki i Mechaniki Uniwersytetu Warszawskiego
Publikacje
Mirosław Kowaluk
2017
- Jacek Sroka, Artur Leśniewski, Mirosław Kowaluk, Krzysztof Stencel i Jerzy Paweł Tyszkiewicz, Towards minimal algorithms for big data analytics with spreadsheets, w: Proceedings of the 4th ACM SIGMOD Workshop on Algorithms and Systems for MapReduce and Beyond, BeyondMR@SIGMOD 2017, Chicago, IL, USA, May 19, 2017, ACM, 2017, s. 1:1–1:4.zobacz w PBN
- Mirosław Kowaluk i Andrzej Lingas, A Fast Deterministic Detection of Small Pattern Graphs in Graphs Without Large Cliques, Lecture Notes In Computer Science 10167 2017, s. 217–227.zobacz w PBN
2015
- Mirosław Kowaluk i Gabriela Majewska, β-skeletons for a Set of Line Segments in R2, Lecture Notes In Computer Science 9210 2015, s. 65–78.zobacz w PBN
- Mirosław Kowaluk i Gabriela Majewska, New sequential and parallel algorithms for computing the β-spectrum, Theoretical Computer Science 590 2015, s. 73–85.zobacz w PBN
- Peter Floderus, Mirosław Kowaluk, Andrzej Lingas i Eva-Marta Lundell, Detecting and Counting Small Pattern Graphs, Siam Journal On Discrete Mathematics 29 (3) 2015, s. 1322–1339.zobacz w PBN
- Peter Floderus, Mirosław Kowaluk, Andrzej Lingas i Eva-Marta Lundell, Induced subgraph isomorphism: Are some patterns substantially easier than others?, Theoretical Computer Science 605 2015, s. 119–128.zobacz w PBN
2013
- Gabriela Majewska i Mirosław Kowaluk, New Sequential and Parallel Algorithms for Computing the β-Spectrum, Lecture Notes In Computer Science 2013, s. 210–224.zobacz w PBN
- Mirosław Kowaluk, Andrzej Lingas i Eva-Marta Lundell, Counting and Detecting Small Subgraphs via Equations, Siam Journal On Discrete Mathematics 27 (2) 2013, s. 892–909.zobacz w PBN
- Mirosław Kowaluk, Andrzej Lingas i Eva-Marta Lundell, Unique Small Subgraphs Are Not Easier to Find, International Journal Of Computer Mathematics 90 (6) 2013, s. 1247–1253.zobacz w PBN
- Peter Floderus, Mirosław Kowaluk, Andrzej Lingas i Eva-Marta Lundell, Detecting and Counting Small Pattern Graphs, Lecture Notes In Computer Science 8283 2013, s. 547–557.zobacz w PBN
2012
- Peter Floderus, Mirosław Kowaluk, Andrzej Lingas i Eva-Marta Lundell, Induced Subgraph Isomorphism: Are Some Patterns Substantially Easier Than Others?, w: COCOON, 2012.zobacz w PBN
2004
- M. Karpinski, M. Kowaluk i A. Lingas, Approximation Algorithms for MAX-BISECTION on Low Degree Regular Graphs, Fundamenta Informaticae Vol. 62, nr 3,4 2004, s. 369–375.zobacz w PBN
- Marek Karpinski, Mirosław Kowaluk i Andrzej Lingas, Approximation Algorithms for MAX-BISECTION on Low Degree Regular Graphs, Fundamenta Informaticae 62 (3) 2004, s. 369–375.zobacz w PBN
- Jerzy Jaromczyk, Mirosław Kowaluk i Neil Moore, A web interface to image-based concurrent markup using maps, w: Sixth ACM CIKM International Workshop on Web Information and Data Management (WIDM 2004), ACM, USA 2004.zobacz w PBN
- Mirosław Kowaluk i Jerzy Jaromczyk (red.), Proc. 18th Eur. Worksh. Computational Geometry (EWCG 2002), Elsevier, Amsterdam 2004.zobacz w PBN
2002
- Jerzy Jaromczyk i Mirosław Kowaluk, A kinetic view of the shooter problem, w: Proc. of the 18th European Workshop on Computational Geometry, Wydział Matematyki, Informatyki i Mechaniki Uniwersytetu Warszawskiego, Warszawa 2002.zobacz w PBN
2000
- Bogdan Chlebus, A. Czumaj, Leszek Gąsieniec, Mirosław Kowaluk i Wojciech Plandowski, Algorithms for the parallel alternating direction access machine, Theoretical Computer Science 245 (2) 2000, s. 151–173.zobacz w PBN
- Mirosław Kowaluk i J Jaromczyk, The face-wise continuity in hot wire cutting of polyhedral sets, w: Proceedinngs 16th European Workshop on Computational Geometry, Ben Gurion University, Eilat, Israel, 2000.zobacz w PBN
Nie jesteś zalogowany | zaloguj się
