default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMiroslaw Kowaluk
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j20]Miroslaw Kowaluk, Andrzej Lingas:
Rare Siblings Speed-Up Deterministic Detection and Counting of Small Pattern Graphs. Algorithmica 85(4): 976-991 (2023)- 2022
- [j19]Miroslaw Kowaluk
, Andrzej Lingas:
A Multi-Dimensional Matrix Product - A Natural Tool for Parameterized Graph Algorithms. Algorithms 15(12): 448 (2022) - 2021
- [c23]Miroslaw Kowaluk, Andrzej Lingas:
Quantum and Approximation Algorithms for Maximum Witnesses of Boolean Matrix Products. CALDAM 2021: 440-451 - [i9]Miroslaw Kowaluk, Andrzej Lingas:
Breaking the hegemony of the triangle method in clique detection. CoRR abs/2109.14876 (2021) - 2020
- [j18]Miroslaw Kowaluk, Andrzej Lingas:
A simple approach to nondecreasing paths. Inf. Process. Lett. 162: 105992 (2020) - [i8]Miroslaw Kowaluk, Andrzej Lingas:
Quantum and approximation algorithms for maximum witnesses of Boolean matrix products. CoRR abs/2004.14064 (2020)
2010 – 2019
- 2019
- [j17]Miroslaw Kowaluk, Andrzej Lingas:
A fast deterministic detection of small pattern graphs in graphs without large cliques. Theor. Comput. Sci. 770: 79-87 (2019) - [c22]Miroslaw Kowaluk, Andrzej Lingas:
Rare Siblings Speed-Up Deterministic Detection and Counting of Small Pattern Graphs. FCT 2019: 322-334 - 2018
- [j16]Miroslaw Kowaluk, Andrzej Lingas:
Are unique subgraphs not easier to find? Inf. Process. Lett. 134: 57-61 (2018) - 2017
- [c21]Jacek Sroka, Artur Lesniewski, Miroslaw Kowaluk, Krzysztof Stencel, Jerzy Tyszkiewicz:
Towards minimal algorithms for big data analytics with spreadsheets. BeyondMR@SIGMOD 2017: 1:1-1:4 - [c20]Miroslaw Kowaluk, Andrzej Lingas:
A Fast Deterministic Detection of Small Pattern Graphs in Graphs Without Large Cliques. WALCOM 2017: 217-227 - 2015
- [j15]Peter Floderus, Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell:
Detecting and Counting Small Pattern Graphs. SIAM J. Discret. Math. 29(3): 1322-1339 (2015) - [j14]Miroslaw Kowaluk, Gabriela Majewska:
New sequential and parallel algorithms for computing the β-spectrum. Theor. Comput. Sci. 590: 73-85 (2015) - [j13]Peter Floderus, Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell:
Induced subgraph isomorphism: Are some patterns substantially easier than others? Theor. Comput. Sci. 605: 119-128 (2015) - [c19]Miroslaw Kowaluk, Gabriela Majewska:
β-skeletons for a Set of Line Segments in R2. FCT 2015: 65-78 - 2014
- [i7]Miroslaw Kowaluk, Gabriela Majewska:
Generalized $β$-skeletons. CoRR abs/1411.5455 (2014) - [i6]Miroslaw Kowaluk, Gabriela Majewska:
$β$-skeletons for a set of line segments in $R^2$. CoRR abs/1411.5457 (2014) - [i5]Miroslaw Kowaluk:
Planar $β$-skeletons via point location in monotone subdivisions of subset of lunes. CoRR abs/1411.5459 (2014) - [i4]Miroslaw Kowaluk, Gabriela Majewska:
Multidimensional β-skeletons in L1 and L∞ metric. CoRR abs/1411.5472 (2014) - 2013
- [j12]Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell:
Unique subgraphs are not easier to find. Int. J. Comput. Math. 90(6): 1247-1253 (2013) - [j11]Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell:
Counting and Detecting Small Subgraphs via Equations. SIAM J. Discret. Math. 27(2): 892-909 (2013) - [c18]Miroslaw Kowaluk, Gabriela Majewska:
New Sequential and Parallel Algorithms for Computing the β-Spectrum. FCT 2013: 210-224 - [c17]Peter Floderus, Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell:
Detecting and Counting Small Pattern Graphs. ISAAC 2013: 547-557 - 2012
- [c16]Peter Floderus, Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell:
Induced Subgraph Isomorphism: Are Some Patterns Substantially Easier Than Others? COCOON 2012: 37-48 - 2011
- [c15]Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell:
Unique Small Subgraphs Are Not Easier to Find. LATA 2011: 336-341 - [c14]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
- [c13]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) - [c12]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. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [c11]Miroslaw Kowaluk, Andrzej Lingas:
LCA Queries in Directed Acyclic Graphs. ICALP 2005: 241-248 - 2004
- [j8]Jerzy W. Jaromczyk, Miroslaw Kowaluk:
Editorial. Comput. Geom. 27(1): 1 (2004) - [j7]Marek Karpinski, Miroslaw Kowaluk, Andrzej Lingas:
Approximation Algorithms for MAX-BISECTION on Low Degree Regular Graphs. Fundam. Informaticae 62(3-4): 369-375 (2004) - [c10]Jerzy W. Jaromczyk, Miroslaw Kowaluk, Neil Moore:
On Visualization of Complex Image-Basedmarkup. ICCVG 2004: 477-484 - [c9]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. Electron. Colloquium Comput. Complex. TR00 (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
- [c8]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. Comput. Complex. 5(2): 113-131 (1995) - [c7]Jerzy W. Jaromczyk, Miroslaw Kowaluk:
A geometric proof of the combinatorial bounds the number of optimal solutions for the 2-center euclidean problem. CCCG 1995: 19-24 - [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. SCG 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. Discret. Appl. Math. 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. SCG 1988: 362-370 - 1987
- [c1]Jerzy W. Jaromczyk, Miroslaw Kowaluk:
A Note on Relative Neighborhood Graphs. SCG 1987: 233-241
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
