default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrzej Lingas
Person information
- affiliation: Lund University, Sweden
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j108]Leszek Gasieniec, Tomasz Jurdzinski, Ralf Klasing, Christos Levcopoulos, Andrzej Lingas, Jie Min, Tomasz Radzik:
Perpetual maintenance of machines with different urgency requirements. J. Comput. Syst. Sci. 139: 103476 (2024)- [c139]Andrzej Lingas:
Boolean Matrix Multiplication for Highly Clustered Data on the Congested Clique. Euro-Par (3) 2024: 45-58 - [i37]Jesper Jansson
, Christos Levcopoulos, Andrzej Lingas:
The Voronoi Diagram of Weakly Smooth Planar Point Sets in O(log n) Deterministic Rounds on the Congested Clique. CoRR abs/2404.06068 (2024) - [i36]Andrzej Lingas:
A Note on Solving Problems of Substantially Super-linear Complexity in No(1) Rounds of the Congested Clique. CoRR abs/2405.15270 (2024) - [i35]Andrzej Lingas:
Boolean Matrix Multiplication for Highly Clustered Data on the Congested Clique. CoRR abs/2405.16103 (2024) - 2023
- [j107]Miroslaw Kowaluk, Andrzej Lingas:
Rare Siblings Speed-Up Deterministic Detection and Counting of Small Pattern Graphs. Algorithmica 85(4): 976-991 (2023) - [j106]Jesper Jansson, Christos Levcopoulos, Andrzej Lingas:
Online and Approximate Network Construction from Bounded Connectivity Constraints. Int. J. Found. Comput. Sci. 34(5): 453-468 (2023) - [j105]Artur Czumaj, Andrzej Lingas:
On parallel time in population protocols. Inf. Process. Lett. 179: 106314 (2023) - [c138]Jesper Jansson, Christos Levcopoulos, Andrzej Lingas:
Convex Hulls and Triangulations of Planar Point Sets on the Congested Clique. CCCG 2023: 183-189 - [c137]Andrzej Lingas, Mia Persson:
$(\min ,+)$ Matrix and Vector Products for Inputs Decomposable into Few Monotone Subsequences. COCOON (2) 2023: 55-68 - [c136]Adrian Dumitrescu, Andrzej Lingas:
Finding Small Complete Subgraphs Efficiently. IWOCA 2023: 185-196 - [c135]Andrzej Lingas:
Lower Bounds for Monotone q-Multilinear Boolean Circuits. SOFSEM 2023: 301-312 - [i34]Andrzej Lingas, Mia Persson:
Improved Lower Bounds for Monotone q-Multilinear Boolean Circuits. CoRR abs/2305.07364 (2023) - [i33]Jesper Jansson, Christos Levcopoulos, Andrzej Lingas:
Convex Hulls and Triangulations of Planar Point Sets on the Congested Clique. CoRR abs/2305.09987 (2023) - [i32]Adrian Dumitrescu, Andrzej Lingas:
Finding Small Complete Subgraphs Efficiently. CoRR abs/2308.11146 (2023) - [i31]Andrzej Lingas, Mia Persson:
(min, +) Matrix and Vector Products for Inputs Decomposable into Few Monotone Subsequences. CoRR abs/2309.01136 (2023) - 2022
- [j104]Miroslaw Kowaluk, Andrzej Lingas:
A Multi-Dimensional Matrix Product - A Natural Tool for Parameterized Graph Algorithms. Algorithms 15(12): 448 (2022) - [j103]Stasys Jukna, Andrzej Lingas:
Lower bounds for Boolean circuits of bounded negation width. J. Comput. Syst. Sci. 129: 90-105 (2022) - [c134]Andrzej Lingas, Mia Persson, Dzmitry Sledneu:
An Output-Sensitive Algorithm for All-Pairs Shortest Paths in Directed Acyclic Graphs. CALDAM 2022: 140-151 - [i30]Leszek Gasieniec, Ralf Klasing, Christos Levcopoulos, Andrzej Lingas, Jie Min, Tomasz Radzik:
Perpetual maintenance of machines with different urgency requirements. CoRR abs/2202.01567 (2022) - [i29]Andrzej Lingas:
A Note on Lower Bounds for Monotone Multilinear Boolean Circuits. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [j102]Leszek Gasieniec, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas, Mia Persson:
Pushing the Online Boolean Matrix-vector Multiplication conjecture off-line and identifying its easy cases. J. Comput. Syst. Sci. 118: 108-118 (2021) - [c133]Miroslaw Kowaluk, Andrzej Lingas:
Quantum and Approximation Algorithms for Maximum Witnesses of Boolean Matrix Products. CALDAM 2021: 440-451 - [c132]Jesper Jansson, Christos Levcopoulos, Andrzej Lingas:
Online and Approximate Network Construction from Bounded Connectivity Constraints. CIAC 2021: 314-325 - [c131]Andrzej Lingas:
Consequences of APSP, triangle detection, and 3SUM hardness for separation between determinism and non-determinism. LAGOS 2021: 163-171 - [c130]Leszek Gasieniec, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas:
Efficient Assignment of Identities in Anonymous Populations. OPODIS 2021: 12:1-12:21 - [i28]Leszek Gasieniec, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas:
Efficient Assignment of Identities in Anonymous Populations. CoRR abs/2105.12083 (2021) - [i27]Andrzej Lingas, Mia Persson, Dzmitry Sledneu:
An output-sensitive algorithm for all-pairs shortest paths in directed acyclic graphs. CoRR abs/2108.03455 (2021) - [i26]Artur Czumaj, Andrzej Lingas:
On Truly Parallel Time in Population Protocols. CoRR abs/2108.11613 (2021) - [i25]Miroslaw Kowaluk, Andrzej Lingas:
Breaking the hegemony of the triangle method in clique detection. CoRR abs/2109.14876 (2021) - 2020
- [j101]Andrzej Lingas, Mia Persson:
Computing the Boolean Product of Two n × n Boolean Matrices Using O(n2) Mechanical Operations. Int. J. Unconv. Comput. 15(3): 225-236 (2020) - [j100]Miroslaw Kowaluk, Andrzej Lingas:
A simple approach to nondecreasing paths. Inf. Process. Lett. 162: 105992 (2020) - [j99]Andrzej Lingas, Mateusz Miotk, Jerzy Topp, Pawel Zylinski:
Graphs with equal domination and covering numbers. J. Comb. Optim. 39(1): 55-71 (2020) - [j98]Andrzej Lingas:
Small normalized circuits for semi-disjoint bilinear forms require logarithmic and-depth. Theor. Comput. Sci. 820: 17-25 (2020) - [c129]Andrzej Lingas:
Solving Hard Problems by Protein Folding? TPNC 2020: 36-41 - [i24]Andrzej Lingas, Mia Persson:
Computing the Boolean product of two n\times n Boolean matrices using O(n^2) mechanical operation. CoRR abs/2004.13086 (2020) - [i23]Miroslaw Kowaluk, Andrzej Lingas:
Quantum and approximation algorithms for maximum witnesses of Boolean matrix products. CoRR abs/2004.14064 (2020) - [i22]Andrzej Lingas:
Consequences of APSP, triangle detection, and 3SUM hardness for separation between determinism and non-determinism. CoRR abs/2011.02428 (2020)
2010 – 2019
- 2019
- [j97]Katharina Dannenberg, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell:
The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets. Discret. Appl. Math. 257: 101-114 (2019) - [j96]Rolf Klein, Elmar Langetepe, Barbara Schwarzwald, Christos Levcopoulos, Andrzej Lingas:
On a Fire Fighter's Problem. Int. J. Found. Comput. Sci. 30(2): 231-246 (2019) - [j95]Dariusz Dereniowski, Andrzej Lingas, Dorota Osula, Mia Persson, Pawel Zylinski:
Clearing directed subgraphs by mobile agents: Variations on covering with paths. J. Comput. Syst. Sci. 102: 57-68 (2019) - [j94]Miroslaw Kowaluk, Andrzej Lingas:
A fast deterministic detection of small pattern graphs in graphs without large cliques. Theor. Comput. Sci. 770: 79-87 (2019) - [c128]Leszek Gasieniec, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas, Mia Persson:
Pushing the Online Matrix-Vector Conjecture Off-Line and Identifying Its Easy Cases. FAW 2019: 156-169 - [c127]Miroslaw Kowaluk, Andrzej Lingas:
Rare Siblings Speed-Up Deterministic Detection and Counting of Small Pattern Graphs. FCT 2019: 322-334 - [c126]Stasys Jukna, Andrzej Lingas:
Lower Bounds for DeMorgan Circuits of Bounded Negation Width. STACS 2019: 41:1-41:17 - 2018
- [j93]Peter Floderus, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas, Dzmitry Sledneu:
3D Rectangulations and Geometric Matrix Multiplication. Algorithmica 80(1): 136-154 (2018) - [j92]Andrzej Lingas, Mia Persson:
Extreme Witnesses and Their Applications. Algorithmica 80(12): 3943-3957 (2018) - [j91]Rolf Klein, Christos Levcopoulos, Andrzej Lingas:
Approximation Algorithms for the Geometric Firefighter and Budget Fence Problems. Algorithms 11(4): 45 (2018) - [j90]Cecilia Bohler, Rolf Klein, Andrzej Lingas, Chih-Hung Liu:
Forest-like abstract Voronoi diagrams in linear time. Comput. Geom. 68: 134-145 (2018) - [j89]Miroslaw Kowaluk, Andrzej Lingas:
Are unique subgraphs not easier to find? Inf. Process. Lett. 134: 57-61 (2018) - [j88]Jesper Jansson, Andrzej Lingas, Ramesh Rajaby, Wing-Kin Sung:
Determining the Consistency of Resolved Triplets and Fan Triplets. J. Comput. Biol. 25(7): 740-754 (2018) - [j87]Anna Adamaszek, Artur Czumaj, Andrzej Lingas, Jakub Onufry Wojtaszczyk:
Approximation Schemes for Capacitated Geometric Network Design. SIAM J. Discret. Math. 32(4): 2720-2746 (2018) - [j86]Marek Karpinski, Andrzej Lingas, Dzmitry Sledneu:
A QPTAS for the base of the number of crossing-free structures on a planar point set. Theor. Comput. Sci. 711: 56-65 (2018) - [c125]Andrzej Lingas:
Small Normalized Boolean Circuits for Semi-disjoint Bilinear Forms Require Logarithmic Conjunction-depth. CCC 2018: 26:1-26:10 - [p1]Artur Czumaj, Andrzej Lingas:
Approximation Schemes for Minimum-Cost k-Connectivity Problems in Geometric Graphs. Handbook of Approximation Algorithms and Metaheuristics (2) 2018 - [i21]Stasys Jukna, Andrzej Lingas:
Lower Bounds for Circuits of Bounded Negation Width. Electron. Colloquium Comput. Complex. TR18 (2018) - [i20]Andrzej Lingas:
Small Normalized Boolean Circuits for Semi-disjoint Bilinear Forms Require Logarithmic Conjunction-depth. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [j85]Leszek Gasieniec, Christos Levcopoulos, Andrzej Lingas, Rasmus Pagh, Takeshi Tokuyama:
Efficiently Correcting Matrix Products. Algorithmica 79(2): 428-443 (2017) - [c124]Dariusz Dereniowski, Andrzej Lingas, Mia Persson, Dorota Urbanska, Pawel Zylinski:
The Snow Team Problem - (Clearing Directed Subgraphs by Mobile Agents). FCT 2017: 190-203 - [c123]Jesper Jansson, Andrzej Lingas, Ramesh Rajaby, Wing-Kin Sung:
Determining the Consistency of Resolved Triplets and Fan Triplets. RECOMB 2017: 82-98 - [c122]Leszek Gasieniec, Ralf Klasing, Christos Levcopoulos, Andrzej Lingas, Jie Min, Tomasz Radzik:
Bamboo Garden Trimming Problem (Perpetual Maintenance of Machines with Different Attendance Urgency Factors). SOFSEM 2017: 229-240 - [c121]Andrzej Lingas:
Towards an Almost Quadratic Lower Bound on the Monotone Circuit Complexity of the Boolean Convolution. TAMC 2017: 401-411 - [c120]Andrzej Lingas, Mia Persson, Dzmitry Sledneu:
Bounds for Semi-disjoint Bilinear Forms in a Unit-Cost Computational Model. TAMC 2017: 412-424 - [c119]Miroslaw Kowaluk, Andrzej Lingas:
A Fast Deterministic Detection of Small Pattern Graphs in Graphs Without Large Cliques. WALCOM 2017: 217-227 - [i19]Dariusz Dereniowski, Andrzej Lingas, Dorota Osula, Mia Persson, Pawel Zylinski:
The Snow Team Problem (Clearing Directed Subgraphs by Mobile Agents). CoRR abs/1712.00316 (2017) - 2016
- [r3]Artur Czumaj, Andrzej Lingas:
Minimum k-Connected Geometric Networks. Encyclopedia of Algorithms 2016: 1318-1322 - [i18]Leszek Gasieniec, Christos Levcopoulos, Andrzej Lingas, Rasmus Pagh, Takeshi Tokuyama:
Efficiently Correcting Matrix Products. CoRR abs/1602.00435 (2016) - 2015
- [j84]Andrzej Lingas, Mia Persson:
A Fast Parallel Algorithm for Minimum-Cost Small Integral Flows. Algorithmica 72(2): 607-619 (2015) - [j83]Peter Floderus, Andrzej Lingas, Mia Persson, Dzmitry Sledneu:
Detecting monomials with k distinct variables. Inf. Process. Lett. 115(2): 82-86 (2015) - [j82]Peter Floderus, Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell:
Detecting and Counting Small Pattern Graphs. SIAM J. Discret. Math. 29(3): 1322-1339 (2015) - [j81]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) - [c118]Andrzej Lingas, Mia Persson:
Extreme Witnesses and Their Applications. COCOA 2015: 452-466 - [c117]Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell:
The Approximability of Maximum Rooted Triplets Consistency with Fan Triplets and Forbidden Triplets. CPM 2015: 272-283 - [c116]Marek Karpinski, Andrzej Lingas, Dzmitry Sledneu:
A QPTAS for the Base of the Number of Crossing-Free Structures on a Planar Point Set. ICALP (1) 2015: 785-796 - 2014
- [j80]Niklas Zechner, Andrzej Lingas:
Efficient Algorithms for Subgraph Listing. Algorithms 7(2): 243-252 (2014) - [j79]Andrzej Lingas, Mia Persson, Dzmitry Sledneu:
Iterative merging heuristics for correlation clustering. Int. J. Metaheuristics 3(2): 105-117 (2014) - [j78]Christos Levcopoulos, Andrzej Lingas:
A note on a QPTAS for maximum weight triangulation of planar point sets. Inf. Process. Lett. 114(8): 414-416 (2014) - [j77]Andrzej Lingas, Leonidas Palios, Agnieszka Wasylewicz, Pawel Zylinski:
Corrigendum to "Note on covering monotone orthogonal polygons" [Inf. Process. Lett. 104(6) (2007) 220-227]. Inf. Process. Lett. 114(11): 646-654 (2014) - [j76]Jesper Jansson, Andrzej Lingas:
Computing the rooted triplet distance between galled trees by counting triangles. J. Discrete Algorithms 25: 66-78 (2014) - [c115]Christos Levcopoulos, Andrzej Lingas, Bengt J. Nilsson, Pawel Zylinski:
Clearing Connections by Few Agents. FUN 2014: 289-300 - [c114]Leszek Gasieniec, Christos Levcopoulos, Andrzej Lingas:
Efficiently Correcting Matrix Products. ISAAC 2014: 53-64 - [c113]Peter Floderus, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas, Dzmitry Sledneu:
3D Rectangulations and Geometric Matrix Multiplication. ISAAC 2014: 65-78 - [c112]Rolf Klein, Christos Levcopoulos, Andrzej Lingas:
Approximation Algorithms for the Geometric Firefighter and Budget Fence Problems. LATIN 2014: 261-272 - [i17]Marek Karpinski, Andrzej Lingas, Dzmitry Sledneu:
A QPTAS for the Base of the Number of Triangulations of a Planar Point Set. CoRR abs/1411.0544 (2014) - [i16]Andrzej Lingas:
Vector convolution in O(n) steps and matrix multiplication in O(n^2) steps : -). Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [j75]Frantisek Galcík, Leszek Gasieniec, Andrzej Lingas:
Efficient broadcasting in radio networks with long-range interference. Distributed Comput. 26(1): 59-74 (2013) - [j74]Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell:
Unique subgraphs are not easier to find. Int. J. Comput. Math. 90(6): 1247-1253 (2013) - [j73]Peter Floderus, Andrzej Lingas, Mia Persson:
Towards More Efficient Infection and Fire Fighting. Int. J. Found. Comput. Sci. 24(1): 3-14 (2013) - [j72]Marek Karpinski, Andrzej Lingas, Dzmitry Sledneu:
Optimal cuts and partitions in tree metrics in polynomial time. Inf. Process. Lett. 113(12): 447-451 (2013) - [j71]Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell:
Counting and Detecting Small Subgraphs via Equations. SIAM J. Discret. Math. 27(2): 892-909 (2013) - [c111]Peter Floderus, Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell:
Detecting and Counting Small Pattern Graphs. ISAAC 2013: 547-557 - [c110]Andrzej Lingas, Mia Persson:
Simple Iterative Heuristics for Correlation Clustering. LSSC 2013: 264-271 - [i15]Peter Floderus, Andrzej Lingas, Mia Persson, Dzmitry Sledneu:
Detecting Monomials with k Distinct Variables. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [j70]Piotr Berman, Marek Karpinski, Andrzej Lingas:
Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems. Algorithmica 64(2): 295-310 (2012) - [j69]Andrzej Lingas, Agnieszka Wasylewicz, Pawel Zylinski:
Linear-Time 3-Approximation Algorithm for the R-Star Covering Problem. Int. J. Comput. Geom. Appl. 22(2): 103-142 (2012) - [j68]Jesper Jansson, Richard S. Lemence, Andrzej Lingas:
The Complexity of Inferring a Minimally Resolved Phylogenetic Supertree. SIAM J. Comput. 41(1): 272-291 (2012) - [c109]Peter Floderus, Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell:
Induced Subgraph Isomorphism: Are Some Patterns Substantially Easier Than Others? COCOON 2012: 37-48 - [c108]Jesper Jansson, Andrzej Lingas:
Computing the Rooted Triplet Distance between Galled Trees by Counting Triangles. CPM 2012: 385-398 - [c107]Andrzej Lingas, Mia Persson:
A Fast Parallel Algorithm for Minimum-Cost Small Integral Flows. Euro-Par 2012: 688-699 - [c106]Andrzej Lingas, Dzmitry Sledneu:
A Combinatorial Algorithm for All-Pairs Shortest Paths in Directed Vertex-Weighted Graphs with Applications to Disc Graphs. SOFSEM 2012: 373-384 - [i14]Marek Karpinski, Andrzej Lingas, Dzmitry Sledneu:
Optimal Cuts and Bisections on the Real Line in Polynomial Time. CoRR abs/1207.0933 (2012) - [i13]Andrzej Lingas, Mia Persson:
A fast parallel algorithm for minimum-cost small integral flows. CoRR abs/1210.0340 (2012) - [i12]Marek Karpinski, Andrzej Lingas, Dzmitry Sledneu:
Optimal Cuts and Partitions in Tree Metrics in Polynomial Time. CoRR abs/1212.3471 (2012) - [i11]Marek Karpinski, Andrzej Lingas, Dzmitry Sledneu:
Optimal Cuts and Partitions in Tree Metrics in Polynomial Time. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [j67]Andrzej Lingas:
A Fast Output-Sensitive Algorithm for Boolean Matrix Multiplication. Algorithmica 61(1): 36-50 (2011) - [j66]Artur Czumaj, Jurek Czyzowicz, Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Pawel Zylinski:
Approximation Algorithms for Buy-at-Bulk Geometric Network Design. Int. J. Found. Comput. Sci. 22(8): 1949-1969 (2011) - [c105]Peter Floderus, Andrzej Lingas, Mia Persson:
Towards More Efficient Infection and Fire Fighting. CATS 2011: 69-74 - [c104]Anna Adamaszek, Artur Czumaj, Andrzej Lingas, Jakub Onufry Wojtaszczyk:
Approximation Schemes for Capacitated Geometric Network Design. ICALP (1) 2011: 25-36 - [c103]Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell:
Unique Small Subgraphs Are Not Easier to Find. LATA 2011: 336-341 - [c102]Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell:
Counting and detecting small subgraphs via equations and matrix multiplication. SODA 2011: 1468-1476 - [c101]Andrzej Lingas, Cui Di:
Near Approximation of Maximum Weight Matching through Efficient Weight Reduction. TAMC 2011: 48-57 - [i10]Ajit A. Diwan, Subir Kumar Ghosh, Partha P. Goswami, Andrzej Lingas:
On joint triangulations of two sets of points in the plane. CoRR abs/1102.1235 (2011) - [i9]Andrzej Lingas, Dzmitry Sledneu:
A Combinatorial Algorithm for All-Pairs Shortest Paths in Directed Vertex-Weighted Graphs with Applications to Disc Graphs. CoRR abs/1111.6519 (2011) - 2010
- [j65]Anna Adamaszek, Artur Czumaj, Andrzej Lingas:
Ptas for k-Tour Cover Problem on the Plane for Moderately Large Values of k. Int. J. Found. Comput. Sci. 21(6): 893-904 (2010) - [c100]Piotr Berman, Marek Karpinski, Andrzej Lingas:
Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems. COCOON 2010: 226-234 - [c99]Antonios Antoniadis, Andrzej Lingas:
Approximability of Edge Matching Puzzles. SOFSEM 2010: 153-164 - [c98]Jesper Jansson, Richard S. Lemence, Andrzej Lingas:
The Complexity of Inferring a Minimally Resolved Phylogenetic Supertree. WABI 2010: 262-273 - [i8]Cui Di, Andrzej Lingas:
Near approximation of maximum weight matching through efficient weight reduction. CoRR abs/1012.5911 (2010)
2000 – 2009
- 2009
- [j64]Leszek Gasieniec, Miroslaw Kowaluk, Andrzej Lingas:
Faster multi-witnesses for Boolean matrix multiplication. Inf. Process. Lett. 109(4): 242-247 (2009) - [j63]