SCEAS

The SCEAS System

Search the dblp DataBase

Title:
Author:

Petteri Kaski: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

Emil Falck, Patrik Floréen, Petteri Kaski, Jukka Kohonen, Pekka Orponen
Balanced Data Gathering in Energy-Constrained Sensor Networks. [Citation Graph (0, 0)][DBLP]
ALGOSENSORS, 2004, pp:59-70 [Conf]
Patrik Floréen, Petteri Kaski, Jukka Kohonen, Pekka Orponen
Multicast time maximization in energy constrained wireless networks. [Citation Graph (0, 0)][DBLP]
DIALM-POMC, 2003, pp:50-58 [Conf]
Petteri Kaski, Patric R. J. Östergård
Enumeration of balanced ternary designs. [Citation Graph (0, 0)][DBLP]
Discrete Applied Mathematics, 2004, v:138, n:1-2, pp:133-141 [Journal]
Harri Haanpää, Petteri Kaski
The Near Resolvable 2-(13, 4, 3) Designs and Thirteen-Player Whist Tournaments. [Citation Graph (0, 0)][DBLP]
Des. Codes Cryptography, 2005, v:35, n:3, pp:271-285 [Journal]
Patric R. J. Östergård, Petteri Kaski
Enumeration of 2-(9, 3, lambda) Designs and Their Resolutions. [Citation Graph (0, 0)][DBLP]
Des. Codes Cryptography, 2002, v:27, n:1-2, pp:131-137 [Journal]
Petteri Kaski, Patric R. J. Östergård
Miscellaneous classification results for 2-designs. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 2004, v:280, n:1-3, pp:65-75 [Journal]
Petteri Kaski
Packing Steiner trees with identical terminal sets. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 2004, v:91, n:1, pp:1-5 [Journal]
Malcolm Greig, Harri Haanpää, Petteri Kaski
On the coexistence of conference matrices and near resolvable 2-(2k+1, k, k-1) designs. [Citation Graph (0, 0)][DBLP]
J. Comb. Theory, Ser. A, 2006, v:113, n:4, pp:703-711 [Journal]
Petteri Kaski, Patric R. J. Östergård, Olli Pottonen
The Steiner quadruple systems of order 16. [Citation Graph (0, 0)][DBLP]
J. Comb. Theory, Ser. A, 2006, v:113, n:8, pp:1764-1770 [Journal]
Petteri Kaski, Patric R. J. Östergård
The Steiner triple systems of order 19. [Citation Graph (0, 0)][DBLP]
Math. Comput., 2004, v:73, n:248, pp:2075-2092 [Journal]
Petteri Kaski
Isomorph-Free Exhaustive Generation of Designs with Prescribed Groups of Automorphisms. [Citation Graph (0, 0)][DBLP]
SIAM J. Discrete Math., 2005, v:19, n:3, pp:664-690 [Journal]
Patrik Floréen, Petteri Kaski, Jukka Kohonen, Pekka Orponen
Exact and approximate balanced data gathering in energy-constrained sensor networks. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2005, v:344, n:1, pp:30-46 [Journal]
Petteri Kaski, Aleksi Penttinen, Jukka Suomela
Coordinating Concurrent Transmissions: A Constant-Factor Approximation of Maximum-Weight Independent Set in Local Conflict Graphs. [Citation Graph (0, 0)][DBLP]
ADHOC-NOW, 2007, pp:74-86 [Conf]
Tommi A. Junttila, Petteri Kaski
Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs. [Citation Graph (0, 0)][DBLP]
ALENEX, 2007, pp:- [Conf]
Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
Fourier meets möbius: fast subset convolution. [Citation Graph (0, 0)][DBLP]
STOC, 2007, pp:67-74 [Conf]
Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
Fourier meets Möbius: fast subset convolution [Citation Graph (0, 0)][DBLP]
CoRR, 2006, v:0, n:, pp:- [Journal]
Petteri Kaski
Barriers and local minima in energy landscapes of stochastic local search [Citation Graph (0, 0)][DBLP]
CoRR, 2006, v:0, n:, pp:- [Journal]
Patrik Floréen, Petteri Kaski, Topi Musto, Jukka Suomela
Approximating max-min linear programs with local algorithms [Citation Graph (0, 0)][DBLP]
CoRR, 2007, v:0, n:, pp:- [Journal]
Local Approximation Algorithms for Scheduling Problems in Sensor Networks. [Citation Graph (, )][DBLP]
Tight Local Approximation Results for Max-Min Linear Programs. [Citation Graph (, )][DBLP]
Counting Paths and Packings in Halves. [Citation Graph (, )][DBLP]
Computing the Tutte Polynomial in Vertex-Exponential Time. [Citation Graph (, )][DBLP]
The Travelling Salesman Problem in Bounded Degree Graphs. [Citation Graph (, )][DBLP]
Covering and Packing in Linear Space. [Citation Graph (, )][DBLP]
Approximating max-min linear programs with local algorithms. [Citation Graph (, )][DBLP]
Brief announcement: distributed almost stable marriage. [Citation Graph (, )][DBLP]
An optimal local approximation algorithm for max-min linear programs. [Citation Graph (, )][DBLP]
Trimmed Moebius Inversion and Graphs of Bounded Degree. [Citation Graph (, )][DBLP]
A distributed approximation scheme for sleep sceduling in sensor networks. [Citation Graph (, )][DBLP]
One-Factorizations of Regular Graphs of Order 12. [Citation Graph (, )][DBLP]
Computing the Tutte polynomial in vertex-exponential time [Citation Graph (, )][DBLP]
Circumspect descent prevails in solving random constraint satisfaction problems [Citation Graph (, )][DBLP]
Trimmed Moebius Inversion and Graphs of Bounded Degree [Citation Graph (, )][DBLP]
Tight local approximation results for max-min linear programs [Citation Graph (, )][DBLP]
Local approximation algorithms for a class of 0/1 max-min linear programs [Citation Graph (, )][DBLP]
An optimal local approximation algorithm for max-min linear programs [Citation Graph (, )][DBLP]
The fast intersection transform with applications to counting paths [Citation Graph (, )][DBLP]
Almost stable matchings in constant time [Citation Graph (, )][DBLP]
Counting Paths and Packings in Halves [Citation Graph (, )][DBLP]
On evaluation of permanents [Citation Graph (, )][DBLP]
Narrow sieves for parameterized paths and packings [Citation Graph (, )][DBLP]
Steiner triple systems of order 19 and 21 with subsystems of order 7. [Citation Graph (, )][DBLP]

Search in 0.006secs, Finished in 0.008secs

NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades

NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP