Andrzej Lingas

Senior Professor
More filtering options
  1. 2019
  2. Graphs with equal domination and covering numbers

    Andrzej Lingas, Miotk, M., Topp, J. & Żyliński, P., 2019 Oct 25, In : Journal of Combinatorial Optimization.

    Research output: Contribution to journalArticle

  3. Pushing the Online Matrix-Vector Conjecture Off-Line and Identifying Its Easy Cases

    Gasieniec, L., Jansson, J., Christos Levcopoulos, Andrzej Lingas & Persson, M., 2019 Apr 9, Frontiers in Algorithmics : 13th International Workshop, FAW 2019, Sanya, China, April 29 – May 3, 2019, Proceedings. Springer, p. 156-169 14 p. (Lecture Notes in Computer Science; vol. 11458).

    Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceeding

  4. Rare Siblings Speed-Up Deterministic Detection and Counting of Small Pattern Graphs

    Kowaluk, M. & Andrzej Lingas, 2019 Jan 1, Fundamentals of Computation Theory: 22nd International Symposium, FCT 2019, Proceedings. Gąsieniec, L. A., Jansson, J. & Levcopoulos, C. (eds.). Springer, Vol. 11651. p. 322-334 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11651 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceeding

  5. A fast deterministic detection of small pattern graphs in graphs without large cliques

    Kowaluk, M. & Andrzej Lingas, 2019, In : Theoretical Computer Science. 770, p. 79-87

    Research output: Contribution to journalArticle

  6. Clearing directed subgraphs by mobile agents: Variations on covering with paths

    Dereniowski, D., Andrzej Lingas, Osula, D., Persson, M. & Żyliński, P., 2019, In : Journal of Computer and System Sciences. 102, p. 57-68

    Research output: Contribution to journalArticle

  7. Lower bounds for Demorgan circuits of bounded negation width

    Jukna, S. & Andrzej Lingas, 2019, 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019. Niedermeier, R. & Paul, C. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 41. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 126).

    Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceeding

  8. On a Fire Fighter’s Problem

    Klein, R., Langetepe, E., Christos Levcopoulos, Andrzej Lingas & Schwarzwald, B., 2019, In : International Journal of Foundations of Computer Science. 30, 02, p. 231-246 16 p.

    Research output: Contribution to journalArticle

  9. The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets

    Dannenberg, K., Jansson, J., Andrzej Lingas & Lundell, E. M., 2019, In : Discrete Applied Mathematics. 257, p. 101-114

    Research output: Contribution to journalArticle

  10. 2018
  11. Determining the consistency of resolved triplets and fan triplets

    Jansson, J., Andrzej Lingas, Rajaby, R. & Sung, W. K., 2018 Jul 1, In : Journal of Computational Biology. 25, 7, p. 740-754 15 p.

    Research output: Contribution to journalArticle

  12. Are unique subgraphs not easier to find?

    Kowaluk, M. & Andrzej Lingas, 2018 Jun 1, In : Information Processing Letters. 134, p. 57-61 5 p.

    Research output: Contribution to journalArticle

  13. Approximation Algorithms for the Geometric Firefighter and Budget Fence Problems

    Klein, R., Christos Levcopoulos & Andrzej Lingas, 2018 Apr 11, In : Algorithms. 11, 4, 45.

    Research output: Contribution to journalArticle

  14. Forest-like abstract Voronoi diagrams in linear time

    Bohler, C., Klein, R., Andrzej Lingas & Liu, C. H., 2018 Mar, In : Computational Geometry: Theory and Applications. 68, p. 134-145

    Research output: Contribution to journalArticle

  15. A QPTAS for the base of the number of crossing-free structures on a planar point set

    Karpinski, M., Andrzej Lingas & Sledneu, D., 2018 Feb, In : Theoretical Computer Science. 711, p. 56-65

    Research output: Contribution to journalArticle

  16. 3D Rectangulations and Geometric Matrix Multiplication

    SAVONEN FLODERUS, PETER., Jansson, J., Christos Levcopoulos, Andrzej Lingas & SLEDNEU, DZMITRY., 2018 Jan, In : Algorithmica. 80, 1, p. 136-154

    Research output: Contribution to journalArticle

  17. Approximation schemes for capacitated geometric network design

    Adamaszek, A., Czumaj, A., Andrzej Lingas & Wojtaszczyk, J. O., 2018, In : SIAM Journal on Discrete Mathematics. 32, 4, p. 2720-2746 27 p.

    Research output: Contribution to journalArticle

  18. Extreme Witnesses and Their Applications

    Andrzej Lingas & Persson, M., 2018, In : Algorithmica. 80, 12, p. 3943-3957

    Research output: Contribution to journalArticle

  19. 2017
  20. Efficiently Correcting Matrix Products

    Gasieniec, L., Christos Levcopoulos, Andrzej Lingas, Pagh, R. & Tokuyama, T., 2017 Oct, In : Algorithmica. 79, 2, p. 428-443

    Research output: Contribution to journalArticle

  21. Bamboo Garden Trimming Problem (Perpetual Maintenance of Machines with Different Attendance Urgency Factors)

    Christos Levcopoulos, Andrzej Lingas, Gąsieniec, L., Klasing, R., Min, J. & Radzik, T., 2017 Jan 11, Lecture Notes in Computer Science (LNCS): In: Steffen B., Baier C., van den Brand M., Eder J., Hinchey M., Margaria T. (eds) SOFSEM 2017: Theory and Practice of Computer Science. SOFSEM 2017. Lecture Notes in Computer Science, vol 10139. Springer, Cham. Springer, Vol. 10139. p. 229-240 12 p.

    Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceeding

  22. A fast deterministic detection of small pattern graphs in graphs without large cliques

    Kowaluk, M. & Andrzej Lingas, 2017, WALCOM: Algorithms and Computation - 11th International Conference and Workshops, WALCOM 2017, Proceedings. Springer, Vol. 10167 LNCS. p. 217-227 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10167 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceeding

  23. Bounds for semi-disjoint bilinear forms in a unit-cost computational model

    Andrzej Lingas, Persson, M. & Sledneu, D., 2017, Theory and Applications of Models of Computation - 14th Annual Conference, TAMC 2017, Proceedings. Springer, Vol. 10185 LNCS. p. 412-424 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10185 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceeding

  24. Determining the consistency of resolved triplets and fan triplets

    Jansson, J., Andrzej Lingas, Rajaby, R. & Sung, W. K., 2017, Research in Computational Molecular Biology - 21st Annual International Conference, RECOMB 2017, Proceedings. Springer, Vol. 10229 LNCS. p. 82-98 17 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10229 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceeding

  25. The snow team problem: (Clearing Directed subgraphs by mobile agents)

    Dereniowski, D., Andrzej Lingas, Persson, M., Urbańska, D. & Żyliński, P., 2017, Fundamentals of Computation Theory - 21st International Symposium, FCT 2017, Proceedings. Springer, Vol. 10472 LNCS. p. 190-203 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10472 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceeding

  26. Towards an almost quadratic lower bound on the monotone circuit complexity of the Boolean convolution

    Andrzej Lingas, 2017, Theory and Applications of Models of Computation - 14th Annual Conference, TAMC 2017, Proceedings. Springer, Vol. 10185 LNCS. p. 401-411 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10185 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceeding

  27. 2016
  28. Efficiently Correcting Matrix Products (arXiv 2016)

    Leszek Gasieniec, Christos Levcopoulos, Andrzej Lingas, Pagh, R. & Tokuyama, T., 2016, arXiv.org.

    Research output: Book/ReportReport

  29. 2015
  30. A Fast Parallel Algorithm for Minimum-Cost Small Integral Flows

    Andrzej Lingas & Persson, M., 2015, In : Algorithmica. 72, 2, p. 607-619

    Research output: Contribution to journalArticle

  31. A QPTAS for the Base of the Number of Crossing-Free Structures on a Planar Point Set

    Karpinski, M., Andrzej Lingas & Sledneu, D., 2015, Automata, Languages, and Programming/Lecture notes in computer science. Springer, Vol. 9134. p. 785-796

    Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceeding

  32. Detecting and Counting Small Pattern Graphs

    Floderus, P., Kowaluk, M., Andrzej Lingas & Lundell, E-M., 2015, In : SIAM Journal on Discrete Mathematics. 29, 3, p. 1322-1339

    Research output: Contribution to journalArticle

  33. Detecting monomials with k distinct variables

    Floderus, P., Andrzej Lingas, Persson, M. & Sledneu, D., 2015, In : Information Processing Letters. 115, 2, p. 82-86

    Research output: Contribution to journalArticle

  34. Induced subgraph isomorphism: Are some patterns substantially easier than others?

    Floderus, P., Kowaluk, M., Andrzej Lingas & Lundell, E-M., 2015, In : Theoretical Computer Science. 605, p. 119-128

    Research output: Contribution to journalArticle

  35. 2014
  36. 3D Rectangulations and Geometric Matrix Multiplication

    Floderus, P., Jansson, J., Christos Levcopoulos, Andrzej Lingas & Sledneu, D., 2014, Algorithms and Computation, ISAAC 2014. Springer, Vol. 8889. p. 65-78

    Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceeding

  37. Approximation Algorithms for the Geometric Firefighter and Budget Fence Problems.

    Klein, R., Christos Levcopoulos & Andrzej Lingas, 2014, LATIN 2014: Theoretical Informatics /Lecture Notes in Computer Science. Pardo, A. & Viola, A. (eds.). Springer, Vol. 8392. p. 261-272 12 p.

    Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceeding

  38. Clearing Connections by Few Agents

    Christos Levcopoulos, Andrzej Lingas, Nilsson, B. J. & Zylinski, P., 2014, Fun with Algorithms/Lecture notes in computer science. Springer, Vol. 8496. p. 289-300

    Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceeding

  39. Efficiently Correcting Matrix Products

    Gasieniec, L., Christos Levcopoulos & Andrzej Lingas, 2014, Algorithms and Computation, ISAAC 2014. Springer, Vol. 8889. p. 53-64

    Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceeding

  40. Iterative merging heuristics for correlation clustering

    Andrzej Lingas, Persson, M. & Sledneu, D., 2014, In : International Journal of Metaheuristics. 3, 2, p. 105-117

    Research output: Contribution to journalArticle

  41. Simple Iterative Heuristics for Correlation Clustering

    Andrzej Lingas & Persson, M., 2014, Large-Scale Scientific Computing, LSSC 2013. Springer, Vol. 8353. p. 264-271

    Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceeding

  42. 2013
  43. Counting and Detecting Small Subgraphs via Equations

    Kowaluk, M., Andrzej Lingas & Lundell, E-M., 2013, In : SIAM Journal on Discrete Mathematics. 27, 2, p. 892-909

    Research output: Contribution to journalArticle

  44. Detecting and Counting Small Pattern Graphs

    Floderus, P., Kowaluk, M., Andrzej Lingas & Lundell, E-M., 2013, Algorithms and Computation. Springer, Vol. 8283. p. 547-557

    Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceeding

  45. Efficient broadcasting in radio networks with long-range interference

    Galcik, F., Gasieniec, L. & Andrzej Lingas, 2013, In : Distributed Computing. 26, 1, p. 59-74

    Research output: Contribution to journalArticle

  46. Optimal cuts and partitions in tree metrics in polynomial time

    Karpinski, M., Andrzej Lingas & Sledneu, D., 2013, In : Information Processing Letters. 113, 12, p. 447-451

    Research output: Contribution to journalArticle

  47. Towards more efficient infection and fire fighting

    Floderus, P., Andrzej Lingas & Persson, M., 2013, In : International Journal of Foundations of Computer Science. 24, 1, p. 3-14

    Research output: Contribution to journalArticle

  48. Unique subgraphs are not easier to find

    Kowaluk, M., Andrzej Lingas & Lundell, E-M., 2013, In : International Journal of Computer Mathematics. 90, 6, p. 1247-1253

    Research output: Contribution to journalArticle

  49. 2012
  50. A Combinatorial Algorithm for All-Pairs Shortest Paths in Directed Vertex-Weighted Graphs with Applications to Disc Graphs

    Andrzej Lingas & Sledneu, D., 2012, SOFSEM 2012: Theory and Practice of Computer Science/Lecture Notes in Computer Science. Springer, Vol. 7147. p. 373-384

    Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceeding

  51. An Approximation Algorithm for Directed Shallow Steiner Trees

    Andrzej Lingas, 2012, Proceedings of the 3rd International Conference on Information and Communication Systems (ICICS). ACM, p. 1

    Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceeding

  52. Exact and approximation algorithms for geometric and capacitated set cover problems

    Berman, P., Karpinski, M. & Andrzej Lingas, 2012, Computing and Combinatorics / Lecture Notes in Computer Science. Springer, Vol. 6196. p. 295-310

    Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceeding

  53. Linear-time 3-approximation algorithm for the r-star covering problem

    Andrzej Lingas, Wasylewicz, A. & Zylinski, P., 2012, In : International Journal of Computational Geometry and Applications. 22, 2, p. 103-141

    Research output: Contribution to journalArticle

  54. The complexity of inferring a minimally resolved phylogenetic supertree

    Jansson, J., Lemence, R. S. & Andrzej Lingas, 2012, In : SIAM Journal on Computing. 41, 1, p. 272-291

    Research output: Contribution to journalArticle

  55. 2011
  56. A Fast Output-Sensitive Algorithm for Boolean Matrix Multiplication

    Andrzej Lingas, 2011, In : Algorithmica. 61, 1, p. 36-50

    Research output: Contribution to journalArticle

  57. Approximation algorithms for buy-at-bulk geometric network design

    Czumaj, A., Czyzowicz, J., Gasieniec, L., Jansson, J., Andrzej Lingas & Zylinski, P., 2011, Algorithms and data structures / Lecture notes in computer science. Springer, Vol. 5664. p. 1949-1969

    Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceeding

  58. 2010
  59. Approximability of edge matching puzzles

    Antoniadis, A. & Andrzej Lingas, 2010, SOFSEM 2010: Theory and Practice of Computer Science / Lecture notes in computer science. Springer, Vol. 5901. p. 153-164

    Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceeding

Previous 1 2 3 Next