Journal of Discrete Algorithms

Công bố khoa học tiêu biểu

* Dữ liệu chỉ mang tính chất tham khảo

Sắp xếp:  
On the hardness of full Steiner tree problems
Journal of Discrete Algorithms - Tập 34 - Trang 118-127 - 2015
Ahmad Biniaz, Anil Maheshwari, Michiel Smid
On the analysis of a dynamic evolutionary algorithm
Journal of Discrete Algorithms - Tập 4 - Trang 181-199 - 2006
Thomas Jansen, Ingo Wegener
Folding a paper strip to minimize thickness
Journal of Discrete Algorithms - Tập 36 - Trang 18-26 - 2016
Erik D. Demaine, David Eppstein, Adam Hesterberg, Hiro Ito, Anna Lubiw, Ryuhei Uehara, Yushi Uno
On strategy improvement algorithms for simple stochastic games
Journal of Discrete Algorithms - Tập 9 - Trang 263-278 - 2011
Rahul Tripathi, Elena Valkanova, V.S. Anil Kumar
On antimagic labeling of regular graphs with particular factors
Journal of Discrete Algorithms - Tập 23 - Trang 76-82 - 2013
Tao-Ming Wang, Guang-Hui Zhang
Algorithms for computing Best Coverage Path in the presence of obstacles in a sensor field
Journal of Discrete Algorithms - Tập 13 - Trang 86-97 - 2012
Senjuti Basu Roy, Gautam Das, Sajal K. Das
The constrained shortest common supersequence problem
Journal of Discrete Algorithms - Tập 21 - Trang 11-17 - 2013
Riccardo Dondi
Hardness of approximation for orthogonal rectangle packing and covering problems
Journal of Discrete Algorithms - Tập 7 - Trang 291-305 - 2009
Miroslav Chlebík, Janka Chlebíková
Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs
Journal of Discrete Algorithms - Tập 8 - Trang 330-338 - 2010
Ignasi Sau, Dimitrios M. Thilikos
Correlation decay and deterministic FPTAS for counting colorings of a graph
Journal of Discrete Algorithms - Tập 12 - Trang 29-47 - 2012
David Gamarnik, Dmitriy Katz
Tổng số: 323   
  • 1
  • 2
  • 3
  • 4
  • 5
  • 6
  • 10