Matches in SemOpenAlex for { <https://semopenalex.org/work/W1533471856> ?p ?o ?g. }
Showing items 1 to 69 of
69
with 100 items per page.
- W1533471856 abstract "Invited Lecture.- Blow-Ups, Win/Win's, and Crown Rules: Some New Directions in FPT.- Matching, Edge-Colouring, and Dimers.- Regular Papers.- Minimum Flow Time Graph Ordering.- Searching Is Not Jumping.- Incremental Integration Tools for Chemical Engineering: An Industrial Application of Triple Graph Grammars.- The Minimum Degree Heuristic and the Minimal Triangulation Process.- Generalized Parametric Multi-terminal Flows Problem.- Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding, and Generation.- The Complexity of the Matching-Cut Problem for Planar Graphs and Other Graph Classes.- Tree Spanners for Bipartite Graphs and Probe Interval Graphs.- A Simple Linear Time LexBFS Cograph Recognition Algorithm.- Backbone Colorings for Networks.- Greedy Edge-Disjoint Paths in Complete Graphs.- Graph-Based Approaches to Software Watermarking.- Completely Connected Clustered Graphs.- An FPT Algorithm for Set Splitting.- Drawing Planar Graphs on a Curve.- Tree-Partitions of k-Trees with Applications in Graph Layout.- Resource Allocation Problems in Multifiber WDM Tree Networks.- An Improved Upper Bound on the Crossing Number of the Hypercube.- NCE Graph Grammars and Clique-Width.- Chordal Probe Graphs.- Subgraph Induced Planar Connectivity Augmentation.- On the Recognition of General Partition Graphs.- Short Cycles in Planar Graphs.- Complexity of Hypergraph Coloring and Seidel's Switching.- Feedback Vertex Set and Longest Induced Path on AT-Free Graphs.- The Complexity of Graph Contractions.- Tree Spanners, Cayley Graphs, and Diametrically Uniform Graphs.- The Probabilistic Minimum Coloring Problem.- Recognizing Bipolarizable and P 4-Simplicial Graphs.- Coloring Powers of Graphs of Bounded Clique-Width.- Erratum.- Erratum: Cycles in Generalized Networks." @default.
- W1533471856 created "2016-06-24" @default.
- W1533471856 creator A5032730524 @default.
- W1533471856 date "2003-10-29" @default.
- W1533471856 modified "2023-09-27" @default.
- W1533471856 title "Graph-Theoretic Concepts in Computer Science: 29th International Workshop, WG 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers" @default.
- W1533471856 hasPublicationYear "2003" @default.
- W1533471856 type Work @default.
- W1533471856 sameAs 1533471856 @default.
- W1533471856 citedByCount "0" @default.
- W1533471856 crossrefType "book" @default.
- W1533471856 hasAuthorship W1533471856A5032730524 @default.
- W1533471856 hasConcept C101837359 @default.
- W1533471856 hasConcept C102192266 @default.
- W1533471856 hasConcept C114614502 @default.
- W1533471856 hasConcept C118615104 @default.
- W1533471856 hasConcept C132525143 @default.
- W1533471856 hasConcept C132569581 @default.
- W1533471856 hasConcept C160446614 @default.
- W1533471856 hasConcept C18359143 @default.
- W1533471856 hasConcept C186942658 @default.
- W1533471856 hasConcept C203776342 @default.
- W1533471856 hasConcept C33923547 @default.
- W1533471856 hasConcept C43517604 @default.
- W1533471856 hasConcept C59824394 @default.
- W1533471856 hasConcept C74133993 @default.
- W1533471856 hasConcept C8554925 @default.
- W1533471856 hasConceptScore W1533471856C101837359 @default.
- W1533471856 hasConceptScore W1533471856C102192266 @default.
- W1533471856 hasConceptScore W1533471856C114614502 @default.
- W1533471856 hasConceptScore W1533471856C118615104 @default.
- W1533471856 hasConceptScore W1533471856C132525143 @default.
- W1533471856 hasConceptScore W1533471856C132569581 @default.
- W1533471856 hasConceptScore W1533471856C160446614 @default.
- W1533471856 hasConceptScore W1533471856C18359143 @default.
- W1533471856 hasConceptScore W1533471856C186942658 @default.
- W1533471856 hasConceptScore W1533471856C203776342 @default.
- W1533471856 hasConceptScore W1533471856C33923547 @default.
- W1533471856 hasConceptScore W1533471856C43517604 @default.
- W1533471856 hasConceptScore W1533471856C59824394 @default.
- W1533471856 hasConceptScore W1533471856C74133993 @default.
- W1533471856 hasConceptScore W1533471856C8554925 @default.
- W1533471856 hasLocation W15334718561 @default.
- W1533471856 hasOpenAccess W1533471856 @default.
- W1533471856 hasPrimaryLocation W15334718561 @default.
- W1533471856 hasRelatedWork W1490378150 @default.
- W1533471856 hasRelatedWork W1495306806 @default.
- W1533471856 hasRelatedWork W1495378593 @default.
- W1533471856 hasRelatedWork W1516977005 @default.
- W1533471856 hasRelatedWork W1518536587 @default.
- W1533471856 hasRelatedWork W1541220080 @default.
- W1533471856 hasRelatedWork W1553979245 @default.
- W1533471856 hasRelatedWork W1577297177 @default.
- W1533471856 hasRelatedWork W1579180406 @default.
- W1533471856 hasRelatedWork W1583852878 @default.
- W1533471856 hasRelatedWork W1590991129 @default.
- W1533471856 hasRelatedWork W1592641396 @default.
- W1533471856 hasRelatedWork W1593753809 @default.
- W1533471856 hasRelatedWork W1596754947 @default.
- W1533471856 hasRelatedWork W1604637520 @default.
- W1533471856 hasRelatedWork W1875294378 @default.
- W1533471856 hasRelatedWork W2001742706 @default.
- W1533471856 hasRelatedWork W2282219474 @default.
- W1533471856 hasRelatedWork W569473531 @default.
- W1533471856 hasRelatedWork W640456369 @default.
- W1533471856 isParatext "false" @default.
- W1533471856 isRetracted "false" @default.
- W1533471856 magId "1533471856" @default.
- W1533471856 workType "book" @default.