Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMattias Andersson 0002
Person information
- affiliation (PhD 2007): Lund University, Department of Computer Science, Sweden
Other persons with the same name
- Mattias Andersson — disambiguation page
- Mattias Andersson 0001 — Royal Institute of Technology, Stockholm, Sweden
- Mattias Andersson 0003 — Ericsson AB, Ericsson Modems, Lund, Sweden (and 1 more)
- Mattias Andersson 0004
![[0000-0002-5383-5533]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0002-5383-5533")
— Mid Sweden University, Sundsvall, Sweden (and 5 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2007
[b1]Mattias Andersson:
Approximation Algorithms for Geometric Networks. Lund University, Sweden, 2007
Journal Articles
- 2009
- [j5]Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos:
Restricted Mesh Simplification Using Edge Contractions. Int. J. Comput. Geom. Appl. 19(3): 247-265 (2009) - 2008
- [j4]Mattias Andersson, Joachim Gudmundsson, Patrick Laube, Thomas Wolle:
Reporting Leaders and Followers among Trajectories of Moving Point Objects. GeoInformatica 12(4): 497-528 (2008) - 2007
- [j3]Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos:
Approximate distance oracles for graphs with dense clusters. Comput. Geom. 37(3): 142-154 (2007) - 2005
- [j2]Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos:
Chips on wafers, or packing rectangles into grids. Comput. Geom. 30(2): 95-111 (2005) - 2003
- [j1]Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan:
Balanced Partition of Minimum Spanning Trees. Int. J. Comput. Geom. Appl. 13(4): 303-316 (2003)
Conference and Workshop Papers
- 2007
- [c6]Mattias Andersson, Joachim Gudmundsson, Patrick Laube, Thomas Wolle:
Reporting leadership patterns among trajectories. SAC 2007: 3-7 - 2006
- [c5]Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos:
Restricted Mesh Simplification Using Edge Contractions. COCOON 2006: 196-204 - 2004
- [c4]Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos:
Approximate Distance Oracles for Graphs with Dense Clusters. ISAAC 2004: 53-64 - [c3]Mattias Andersson, Joachim Giesen, Mark Pauly, Bettina Speckmann:
Bounds on the k-Neighborhood for Locally Uniformly Sampled Surfaces. PBG 2004: 167-171 - 2003
- [c2]Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos:
Chips on Wafers. WADS 2003: 412-423 - 2002
- [c1]Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan:
Balanced Partition of Minimum Spanning Trees. International Conference on Computational Science (3) 2002: 26-35
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-07-08 22:23 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:
