Anders Dessmark
Impact in
-
- Optimization and Search Problems
- Mobile Ad Hoc Networks
- Distributed systems and fault tolerance
- Mobile Agent-Based Network Management
- Distributed Control Multi-Agent Systems
- Cooperative Communication and Network Coding
-
- Complexity and Algorithms in Graphs
Papers in
-
- Complexity and Algorithms in Graphs 6
- Advanced Graph Theory Research 5
-
- Optimization and Search Problems 3
- Cooperative Communication and Network Coding 2
- Mobile Ad Hoc Networks 2
- Co-authors
- Andrzej Pelc (5 shared papers)Dariusz R. Kowalski (1 shared paper)Pierre Fraigniaud (1 shared paper)Andrzej Lingas (8 shared papers)Andrzej Proskurowski (2 shared papers)Jesper Jansson (2 shared papers)Madhav Marathe (1 shared paper)Anil Maheshwari (1 shared paper)
- Journals
- Theoretical Computer Science (4 papers)Algorithmica (3 papers)Networks (1 paper)Journal of Parallel and Distributed Computing (1 paper)International Journal of Foundations of Computer Science (1 paper)
- Partner nations
- SwedenCanadaUnited States
In The Last Decade
Anders Dessmark
13 papers receiving 157 citations
Peers
Comparison fields: 5 of 29
- Computer Networks and Communications 150
- Computational Theory and Mathematics 34
- Computer Graphics and Computer-Aided Design 5
- Management Science and Operations Research 16
- Signal Processing 8
Countries citing papers authored by Anders Dessmark
This map shows the geographic impact of Anders Dessmark's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Anders Dessmark with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Anders Dessmark more than expected).
Fields of papers citing papers by Anders Dessmark
This network shows the impact of papers produced by Anders Dessmark. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Anders Dessmark. The network helps show where Anders Dessmark may publish in the future.
Co-authors
The 8 scholars most cited alongside Anders Dessmark, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 2006 | 67 | |
| 2 | 2004 | 31 | |
| 3 | 2006 | 24 | |
| 4 | 2001 | 17 | |
| 5 | 2000 | 14 | |
| 6 | 2002 | 4 | |
| 7 | 1998 | 3 | |
| 8 | 1998 | 3 | |
| 9 | 2000 | 2 | |
| 10 | 1995 | 1 | |
| 11 | 2007 | 1 | |
| 12 | 2007 | 1 | |
| 13 | 1996 | 1 |
About Anders Dessmark
Anders Dessmark is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications, Computer Vision and Pattern Recognition, Artificial Intelligence and Molecular Biology, having authored 13 papers that have together received 169 indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (6 papers), Advanced Graph Theory Research (5 papers), Optimization and Search Problems (3 papers), Cooperative Communication and Network Coding (2 papers), Antenna Design and Analysis (2 papers), Graph Theory and Algorithms (2 papers), Mobile Ad Hoc Networks (2 papers) and Algorithms and Data Compression (2 papers). The work is most often cited by research in Computer Networks and Communications (150 citations), Computational Theory and Mathematics (34 citations), Computer Graphics and Computer-Aided Design (5 citations), Management Science and Operations Research (16 citations) and Signal Processing (8 citations). Anders Dessmark has collaborated with scholars based in Sweden, Canada and United States. Frequent co-authors include Andrzej Pelc, Dariusz R. Kowalski, Pierre Fraigniaud, Andrzej Lingas, Andrzej Proskurowski, Jesper Jansson, Madhav Marathe and Anil Maheshwari. Their work appears in journals such as Theoretical Computer Science, Algorithmica, Networks, Journal of Parallel and Distributed Computing and International Journal of Foundations of Computer Science.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.