Ondrej sykora (48 risultati)

Condizione: good. A copy that has been read, remains in good condition. All pages are intact, and the cover is intact. The spine and cover show signs of wear. Pages can include notes and highlighting and show signs of wear, and the copy can include "From the library of" labels or previous owner inscriptions. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item! Ships via media mail.…

Condizione: good. A copy that has been read, remains in good condition. All pages are intact, and the cover is intact. The spine and cover show signs of wear. Pages can include notes and highlighting and show signs of wear, and the copy can include "From the library of" labels or previous owner inscriptions. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item! Ships via media mail.…

Condizione: very_good. Gently read. May have name of previous ownership, or ex-library edition. Binding tight; spine straight and smooth, with no creasing; covers clean and crisp. Minimal signs of handling or shelving. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item! Ships USPS Media Mail.…

Paperback. Condizione: New.

Condizione: Very Good. Former library copy. Pages intact with possible writing/highlighting. Binding strong with minor wear. Dust jackets/supplements may not be included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.

Condizione: New.

Paperback or Softback. Condizione: New. Structural Information and Communication Complexity: 11th International Colloquium, Sirocco 2004, Smolenice Castle, Slowakia, June 21-23, 2004, Procee. Book.

Condizione: As New. Unread book in perfect condition.

Condizione: New.

Condizione: New.

Paperback. Condizione: New. 1998 ed. The International Workshop on Graph-Theoretic Concepts in Computer Science is one of the most traditional and high quality conferences in Computer Science. PreviousconferenceswereorganizedatvariousplacesinAustria,Germany,Italy, and the Netherlands. The workshop aims at uniting theory and practice by demonstrating how graph-theoretic concepts can be applied to various areas in computer science, or by extracting new problems from applications. The goal is to present recent research results and to identify and explore directions of future research. The workshop is well-balanced with respect to established researchers and young scientists. th The24 InternationalWorkshoponGraph-TheoreticConceptsinComputer Science(WG'98)washeldatSmoleniceCastle,nearBratislava,SlovakRepublic, June 18-20, 1998. It was organized by the Slovak Academy of Computer Science in cooperation with the Department of Computer Science I at RWTH Aachen (Germany) and with Slovak Society for Computer Science. For the ?rst time in its history, WG took place in a country of the former eastern block, in the Slovak Republic. The program committee of WG'98 consisted of: H. Bodlaender, Utrecht (NL) A. Brandst. adt, Rostock (D) M.Habib, Montpellier (F) J. Hromkovi? c, Aachen (D) L. Kirousis, Patras (GR) L. Ku? cera, Praha (CR) A. Marchetti-Spaccamela, Roma (I) E. Mayr, Munc . hen (D) R. Moehring, Berlin (D) M. Nagl, Aachen (D) H. Noltemeier, Wurzburg . (D) F. Parisi Presicce, Roma (I) O. Syk ' ora, Bratislava (SK) G. Tinhofer, Munc . hen (D) D. Wagner, Konstanz (D) P.…

Condizione: New.

Condizione: New.

Condizione: New.

Condizione: New. In English.

Condizione: New. In English.

Condizione: New. In English.

Condizione: New.

Condizione: As New. Unread book in perfect condition.

Condizione: As New. Unread book in perfect condition.

Condizione: New. pp. 404.

Condizione: New. pp. 448.

Kartoniert / Broschiert. Condizione: New.

Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width.- Minus Domination in Small-Degree Graphs.- The Vertex-Disjoint Triangles Problem.- Communication in the Two-Way Listen-in Vertex-Disjoint Paths Mode.- Broadcasting on Anonymous Unoriented Tori.- Families of Graphs Having Broadcasting and Gossiping Properties.- Optical All-to-All Communication in Inflated Networks.- A Generalization of AT-free Graphs and a Generic Algorithm for Solving Treewidth, Minimum Fill-In and Vertex Ranking.- A Polynomial-Time Algorithm for Finding Total Colorings of Partial k-Trees.- Rankings of Directed Graphs.- Drawing Planar Partitions II: HH-Drawings.- Triangles in Euclidean Arrangements.- Internally Typed Second-Order Term Graphs.- Compact Implicit Representation of Graphs.- Graphs with Bounded Induced Distance.- Diameter Determination on Restricted Graph Families.- Independent Tree Spanners.- Upgrading Bottleneck Constrained Forests.- Routing in Recursive Circulant Graphs: Edge Forwarding Index and Hamiltonian Decomposition.- Improved Compressions of Cube-Connected Cycles Networks.- Efficient Embeddings of Grids into Grids.- Integral Uniform Flows in Symmetric Networks.- Splitting Number is NP-Complete.- Tree Spanners in Planar Graphs.- A Linear-Time Algorithm to Find Four Independent Spanning Trees in Four-Connected Planar Graphs.- Linear Algorithms for a k-partition Problem of Planar Graphs without Specifying Bases.- Domination and Steiner Tree Problems on Graphs with Few P 4s.- Minimum Fill-In and Treewidth for Graphs Modularly Decomposable into Chordal Graphs.- Interval Completion with the Smallest Max-Degree.- An Estimate of the Tree-Width of a Planar Graph Which Has Not a Given Planar Grid as a Minor.…

Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - Traffic Grooming in a Passive Star WDM Network.- The Price of Anarchy in All-Optical Networks.- Morelia Test: Improving the Efficiency of the Gabriel Test and Face Routing in Ad-Hoc Networks.- Path Layout on Tree Networks: Bounds in Different Label Switching Models.- On Approximability of the Independent Set Problem for Low Degree Graphs.- Asynchronous Broadcast in Radio Networks.- Two-Hop Virtual Path Layout in Tori.- Robot Convergence via Center-of-Gravity Algorithms.- F-Chord: Improved Uniform Routing on Chord.- Swapping a Failing Edge of a Shortest Paths Tree by Minimizing the Average Stretch Factor.- Improved Bounds for Optimal Black Hole Search with a Network Map.- Sparse Additive Spanners for Bounded Tree-Length Graphs.- No-Hole L(p,0) Labelling of Cycles, Grids and Hypercubes.- Existence of Nash Equilibria in Selfish Routing Problems.- Mobile Agents Rendezvous When Tokens Fail.- Time Efficient Gossiping in Known Radio Networks.- Long-Lived Rambo: Trading Knowledge for Communication.- Fault Tolerant Forwarding and Optical Indexes: A Design Theory Approach.- Tighter Bounds on Feedback Vertex Sets in Mesh-Based Networks.- Perfect Token Distribution on Trees.- Approximation Algorithm for Hotlink Assignment in the Greedy Model.- Optimal Decision Strategies in Byzantine Environments.- Sharing the Cost of Multicast Transmissions in Wireless Networks.- NP-Completeness Results for All-Shortest-Path Interval Routing.- On-Line Scheduling of Parallel Jobs.- The Range Assignment Problem in Static Ad-Hoc Networks on Metric Spaces.…

Paperback. Condizione: New. 1998 ed. The International Workshop on Graph-Theoretic Concepts in Computer Science is one of the most traditional and high quality conferences in Computer Science. PreviousconferenceswereorganizedatvariousplacesinAustria,Germany,Italy, and the Netherlands. The workshop aims at uniting theory and practice by demonstrating how graph-theoretic concepts can be applied to various areas in computer science, or by extracting new problems from applications. The goal is to present recent research results and to identify and explore directions of future research. The workshop is well-balanced with respect to established researchers and young scientists. th The24 InternationalWorkshoponGraph-TheoreticConceptsinComputer Science(WG'98)washeldatSmoleniceCastle,nearBratislava,SlovakRepublic, June 18-20, 1998. It was organized by the Slovak Academy of Computer Science in cooperation with the Department of Computer Science I at RWTH Aachen (Germany) and with Slovak Society for Computer Science. For the ?rst time in its history, WG took place in a country of the former eastern block, in the Slovak Republic. The program committee of WG'98 consisted of: H. Bodlaender, Utrecht (NL) A. Brandst. adt, Rostock (D) M.Habib, Montpellier (F) J. Hromkovi? c, Aachen (D) L. Kirousis, Patras (GR) L. Ku? cera, Praha (CR) A. Marchetti-Spaccamela, Roma (I) E. Mayr, Munc . hen (D) R. Moehring, Berlin (D) M. Nagl, Aachen (D) H. Noltemeier, Wurzburg . (D) F. Parisi Presicce, Roma (I) O. Syk ' ora, Bratislava (SK) G. Tinhofer, Munc . hen (D) D. Wagner, Konstanz (D) P.…

Paperback. Condizione: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Condizione: As New. Unread book in perfect condition.

Condizione: As New. Unread book in perfect condition.

Paperback. Condizione: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.