Jukka Suomela: Publications: By year
| [41] | Distributed maximal matching: greedy is optimal, PODC 2012 |
| [40] | Weak models of distributed computing, with connections to modal logic, PODC 2012 |
| [39] | Lower bounds for local approximation, PODC 2012 |
| [38] | Deterministic local algorithms, unique identifiers, and fractional graph colouring, SIROCCO 2012 |
| [37] | Survey of local algorithms, ACM Computing Surveys |
| [36] | Local approximability of max-min and min-max linear programs, Theory of Computing Systems |
| [35] | Analysing local algorithms in location-aware quasi-unit-disk graphs, Discrete Applied Mathematics |
| [34] | Planar subgraphs without low-degree nodes, WADS 2011 |
| [33] | Locally checkable proofs, PODC 2011 |
| [32] | Paikallinen laskettavuus, Tietojenkäsittelytiede |
| [31] | Almost stable matchings by truncating the Gale–Shapley algorithm, Algorithmica |
| [30] | Brief announcement: Distributed almost stable marriage, PODC 2010 |
| [29] | Distributed algorithms for edge dominating sets, PODC 2010 |
| [28] | Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks, SPAA 2010 |
| [26] | Local algorithms: self-stabilization on speed, SSS 2009 |
| [25] | A local 2-approximation algorithm for the vertex cover problem, DISC 2009 |
| [24] | Optimisation problems in wireless sensor networks: Local algorithms and local graphs, PhD thesis |
| [23] | An optimal local approximation algorithm for max-min linear programs, SPAA 2009 |
| [22] | A simple local 3-approximation algorithm for vertex cover, Information Processing Letters |
| [21] | Comparing type counts: The case of women, men and -ity in early English letters, ICAME 2007 |
| [20] | Coordinating concurrent transmissions: A constant-factor approximation of maximum-weight independent set in local conflict graphs, Ad Hoc & Sensor Wireless Networks |
| [19] | Improved approximation algorithms for relay placement, ESA 2008 |
| [18] | Optimal backlog in the plane, Algosensors 2008 |
| [17] | Tight local approximation results for max-min linear programs, Algosensors 2008 |
| [16] | Local 3-approximation algorithms for weighted dominating set and vertex cover in quasi unit-disk graphs, LOCALGOS 2008 |
| [15] | Approximating max-min linear programs with local algorithms, IPDPS 2008 |
| [11] | Local approximation algorithms for scheduling problems in sensor networks, Algosensors 2007 |
| [13] | The minimum-backlog problem, MACIS 2007 |
| [12] | Coordinating concurrent transmissions: A constant-factor approximation of maximum-weight independent set in local conflict graphs, AdHoc-NOW 2007 |
| [10] | Approximability of identifying codes and locating-dominating codes, Information Processing Letters |
| [9] | BeTelGeuse – a tool for Bluetooth data gathering, BodyNets 2007 |
| [8] | A distributed approximation scheme for sleep scheduling in sensor networks, SECON 2007 |
| [7] | A system for context-dependent user modeling, CAMS 2006 |
| [6] | Locality helps sleep scheduling, WSW 2006 |
| [5] | Approximating relay placement in sensor networks, PE-WASUN 2006 |
| [4] | BeTelGeuse: Tool for context data gathering via Bluetooth, CAPS 2006 |
| [3] | Computational complexity of relay placement in sensor networks, SOFSEM 2006 |
| [1] | Lessons learned in the challenge: making predictions and scoring them, MLCW 2005 |
| [2] | Relay placement in sensor networks, MSc thesis |
| [42] | No sublogarithmic-time approximation scheme for bipartite vertex cover, manuscript |
| [27] | Local algorithms in (weakly) coloured graphs, manuscript |
| [14] | Local approximation algorithms for a class of 0/1 max-min linear programs, manuscript |