Search Results

There are 7274791 results for: content related to: Efficient analysis of periodic structures using the finite-element and SOC techniques

  1. Regular pairs in sparse random graphs I

    Random Structures & Algorithms

    Volume 22, Issue 4, July 2003, Pages: 359–434, Y. Kohayakawa and V. Rödl

    Version of Record online : 10 MAR 2003, DOI: 10.1002/rsa.10081

  2. Node-disjoint paths and related problems on hierarchical cubic networks

    Networks

    Volume 40, Issue 3, October 2002, Pages: 142–154, Jung-Sheng Fu, Gen-Huey Chen and Dyi-Rong Duh

    Version of Record online : 7 AUG 2002, DOI: 10.1002/net.10040

  3. A concave-cost production planning problem with remanufacturing options

    Naval Research Logistics (NRL)

    Volume 52, Issue 5, August 2005, Pages: 443–458, Jian Yang, Boaz Golany and Gang Yu

    Version of Record online : 28 APR 2005, DOI: 10.1002/nav.20089

  4. Testing membership in parenthesis languages

    Random Structures & Algorithms

    Volume 22, Issue 1, January 2003, Pages: 98–138, Michal Parnas, Dana Ron and Ronitt Rubinfeld

    Version of Record online : 18 NOV 2002, DOI: 10.1002/rsa.10067

  5. Upgrading trees under diameter and budget constraints

    Networks

    Volume 41, Issue 1, January 2003, Pages: 24–35, Victor Chepoi, Hartmut Noltemeier and Yann Vaxès

    Version of Record online : 11 DEC 2002, DOI: 10.1002/net.10055

  6. Theoretical analysis of the anomalous dips of scattering parameter S22 in deep sub-micrometer MOSFETs

    Microwave and Optical Technology Letters

    Volume 36, Issue 3, 5 February 2003, Pages: 193–200, Yo-Sheng Lin and Shey-Shi Lu

    Version of Record online : 21 JAN 2003, DOI: 10.1002/mop.10718

  7. On the power of BFS to determine a graph's diameter

    Networks

    Volume 42, Issue 4, December 2003, Pages: 209–222, Derek G. Corneil, Feodor F. Dragan and Ekkehard Köhler

    Version of Record online : 10 SEP 2003, DOI: 10.1002/net.10098

  8. Fault-tolerant cycle embedding in hierarchical cubic networks

    Networks

    Volume 43, Issue 1, January 2004, Pages: 28–38, Jung-Sheng Fu and Gen-Huey Chen

    Version of Record online : 10 NOV 2003, DOI: 10.1002/net.10101

  9. Integer and fractional packings in dense 3-uniform hypergraphs

    Random Structures & Algorithms

    Volume 22, Issue 3, May 2003, Pages: 248–310, Penny Haxell, Brendan Nagle and Vojtěch Rödl

    Version of Record online : 28 FEB 2003, DOI: 10.1002/rsa.10075

  10. Representing Preferences with a Unique Subjective State Space

    Econometrica

    Volume 69, Issue 4, July 2001, Pages: 891–934, Eddie Dekel, Barton L. Lipman and Aldo Rustichini

    Version of Record online : 9 FEB 2004, DOI: 10.1111/1468-0262.00224

  11. Discrete stochastic optimization using variants of the stochastic ruler method

    Naval Research Logistics (NRL)

    Volume 52, Issue 4, June 2005, Pages: 344–360, Mahmoud H. Alrefaei and Sigrún Andradóttir

    Version of Record online : 22 MAR 2005, DOI: 10.1002/nav.20080

  12. Project scheduling under competition

    Naval Research Logistics (NRL)

    Volume 52, Issue 6, September 2005, Pages: 481–492, Igor Averbakh and Vasilij Lebedev

    Version of Record online : 8 JUN 2005, DOI: 10.1002/nav.20091

  13. Scheduling of depalletizing and truck loading operations in a food distribution system

    Naval Research Logistics (NRL)

    Volume 50, Issue 3, April 2003, Pages: 239–256, Zhi-Long Chen and Chung-Yee Lee

    Version of Record online : 8 JAN 2003, DOI: 10.1002/nav.10049

  14. The decomposition threshold for bipartite graphs with minimum degree one

    Random Structures & Algorithms

    Volume 21, Issue 2, September 2002, Pages: 121–134, Raphael Yuster

    Version of Record online : 16 JUL 2002, DOI: 10.1002/rsa.10044

  15. Linear waste of best fit bin packing on skewed distributions

    Random Structures & Algorithms

    Volume 20, Issue 3, May 2002, Pages: 441–464, Claire Kenyon and Michael Mitzenmacher

    Version of Record online : 4 APR 2002, DOI: 10.1002/rsa.10037

  16. Discretization of the continuous ambush game

    Naval Research Logistics (NRL)

    Volume 50, Issue 5, August 2003, Pages: 515–529, I.D. Woodward

    Version of Record online : 24 JAN 2003, DOI: 10.1002/nav.10066

  17. Properly colored subgraphs and rainbow subgraphs in edge-colorings with local constraints

    Random Structures & Algorithms

    Volume 23, Issue 4, December 2003, Pages: 409–433, Noga Alon, Tao Jiang, Zevi Miller and Dan Pritikin

    Version of Record online : 17 OCT 2003, DOI: 10.1002/rsa.10102

  18. On the optimality of the random hyperplane rounding technique for MAX CUT

    Random Structures & Algorithms

    Volume 20, Issue 3, May 2002, Pages: 403–440, Uriel Feige and Gideon Schechtman

    Version of Record online : 28 MAR 2002, DOI: 10.1002/rsa.10036

  19. On characterizing hypergraph regularity

    Random Structures & Algorithms

    Volume 21, Issue 3-4, October - December 2002, Pages: 293–335, Y. Dementieva, P. E. Haxell, B. Nagle and V. Rödl

    Version of Record online : 16 OCT 2002, DOI: 10.1002/rsa.10058

  20. The Nut in Screw Theory

    Journal of Robotic Systems

    Volume 20, Issue 8, August 2003, Pages: 437–476, Michael Griffis and José María Rico

    Version of Record online : 17 JUL 2003, DOI: 10.1002/rob.10098