Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Eva-Marta Lundell

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▷ joint publications with Andrzej Lingas

> Home > Persons > Eva-Marta Lundell

Publications

2019
[j8]
- view
  authority control:
- export record
  dblp key:
  - journals/dam/DannenbergJLL19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/DannenbergJLL19
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)
2015
[j7]
- view
  authority control:
- export record
  dblp key:
  - journals/siamdm/FloderusKLL15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamdm/FloderusKLL15
Peter Floderus, Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell:
Detecting and Counting Small Pattern Graphs. SIAM J. Discret. Math. 29(3): 1322-1339 (2015)
[j6]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/FloderusKLL15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/FloderusKLL15
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)
[c9]
- view
  authority control:
- export record
  dblp key:
  - conf/cpm/JanssonLL15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cpm/JanssonLL15
Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell:
The Approximability of Maximum Rooted Triplets Consistency with Fan Triplets and Forbidden Triplets. CPM 2015: 272-283
2013
[j5]
- view
  authority control:
- export record
  dblp key:
  - journals/ijcm/KowalukLL13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ijcm/KowalukLL13
Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell:
Unique subgraphs are not easier to find. Int. J. Comput. Math. 90(6): 1247-1253 (2013)
[j4]
- view
  authority control:
- export record
  dblp key:
  - journals/siamdm/KowalukLL13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamdm/KowalukLL13
Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell:
Counting and Detecting Small Subgraphs via Equations. SIAM J. Discret. Math. 27(2): 892-909 (2013)
[c8]
- view
  authority control:
- export record
  dblp key:
  - conf/isaac/FloderusKLL13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isaac/FloderusKLL13
Peter Floderus, Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell:
Detecting and Counting Small Pattern Graphs. ISAAC 2013: 547-557
2012
[c7]
- view
  authority control:
- export record
  dblp key:
  - conf/cocoon/FloderusKLL12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cocoon/FloderusKLL12
Peter Floderus, Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell:
Induced Subgraph Isomorphism: Are Some Patterns Substantially Easier Than Others? COCOON 2012: 37-48
2011
[c6]
- view
  authority control:
- export record
  dblp key:
  - conf/lata/KowalukLL11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/lata/KowalukLL11
Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell:
Unique Small Subgraphs Are Not Easier to Find. LATA 2011: 336-341
[c5]
- view
  authority control:
- export record
  dblp key:
  - conf/soda/KowalukLL11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/KowalukLL11
Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell:
Counting and detecting small subgraphs via equations and matrix multiplication. SODA 2011: 1468-1476
2009
[j3]
- view
  authority control:
- export record
  dblp key:
  - journals/ipl/LingasL09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/LingasL09
Andrzej Lingas, Eva-Marta Lundell:
Efficient approximation algorithms for shortest cycles in undirected graphs. Inf. Process. Lett. 109(10): 493-498 (2009)
2008
[c4]
- view
  authority control:
- export record
  dblp key:
  - conf/latin/LingasL08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/latin/LingasL08
Andrzej Lingas, Eva-Marta Lundell:
Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs. LATIN 2008: 736-746
2007
[j2]
- view
  authority control:
- export record
  dblp key:
  - journals/algorithmica/DessmarkJLL07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/DessmarkJLL07
Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell:
Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem. Algorithmica 48(3): 233-248 (2007)
[j1]
- view
  authority control:
- export record
  dblp key:
  - journals/ijfcs/DessmarkJLLP07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ijfcs/DessmarkJLLP07
Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell, Mia Persson:
On the Approximability of Maximum and Minimum Edge Clique Partition Problems. Int. J. Found. Comput. Sci. 18(2): 217-226 (2007)
2006
[c3]
- view
  - electronic edition @ westernsydney.edu.au (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/cats/DessmarkJLLP06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cats/DessmarkJLLP06
Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell, Mia Persson:
On the Approximability of Maximum and Minimum Edge Clique Partition Problems. CATS 2006: 101-105
2004
[c2]
- view
  authority control:
- export record
  dblp key:
  - conf/cpm/DessmarkJLL04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cpm/DessmarkJLL04
Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell:
Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem. CPM 2004: 220-229
[c1]
- view
  authority control:
- export record
  dblp key:
  - conf/swat/DessmarkLL04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/swat/DessmarkLL04
Anders Dessmark, Andrzej Lingas, Eva-Marta Lundell:
Subexponential-Time Framework for Optimal Embeddings of Graphs in Integer Lattices. SWAT 2004: 248-259

a service of

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.