Sign in
Author
|
Conference
|
Journal
|
Organization
|
Year
|
DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all fields of study
Limit my searches in the following fields of study
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Authors
(212)
Sandip Das
6
Shin-ichi Nakano (中野眞一)
5
Masud Hasan
5
Subhas C. Nandy
4
Stavros D. Nikolopoulos
4
Chandrasekharan Pandu Rangan
4
Ryuhei Uehara (上原隆平)
4
Mohammad Sohel Rahman
4
Takao NISHIZEKI (西関隆夫)
3
Alejandro Lopez-ortiz (Alejandro López-ortiz)
3
Keywords
(248)
Subscribe
Academic
Conferences
WALCOM - Workshop on Algorithms and Computation
Workshop on Algorithms and Computation,WALCOM,Algorithms & Theory
WALCOM - Workshop on Algorithms and Computation
Publications: 116
|
Citation Count: 97 (Self-Citation: 8)
Year Range: 2007-2011
Fields of study:
Algorithms & Theory
Homepage
Cumulative
Annual
Sort by:
Publications
(116)
Efficient Computation of Time-Dependent Centralities in Air Transportation Networks
(
Citations: 1
)
Annabell Berger
,
Matthias Müller-Hannemann
,
Steffen Rechner
,
Alexander Zock
Conference:
Workshop on Algorithms and Computation - WALCOM
, pp. 77-88, 2011
Inapproximability of
Mourad El Ouali
,
Antje Fretwurst
,
Anand Srivastav
Conference:
Workshop on Algorithms and Computation - WALCOM
, pp. 57-69, 2011
On Graceful Labelings of Trees - (Extended Abstract)
Sourabh Aryabhatta
,
Tonmoy Guha Roy
Conference:
Workshop on Algorithms and Computation - WALCOM
, pp. 214-220, 2011
Approximation Algorithms for Minimum Chain Vertex Deletion
Mrinal Kumar
,
Sounaka Mishra
,
N. Safina Devi
,
Saket Saurabh
Conference:
Workshop on Algorithms and Computation - WALCOM
, pp. 21-32, 2011
A Polynomial Time Algorithm for Longest Paths in Biconvex Graphs
Esha Ghosh
,
N. S. Narayanaswamy
,
C. Pandu Rangan
Conference:
Workshop on Algorithms and Computation - WALCOM
, pp. 191-201, 2011