The following pages link to Celina M. Herrera de Figueiredo (Q1567274):
Displayed 50 items.
- The sandwich problem for decompositions and almost monotone properties (Q1799213) (← links)
- On the complexity of the approximation of nonplanarity parameters for cubic graphs (Q1827857) (← links)
- Kinetic heap-ordered trees: Tight analysis and improved algorithms (Q1853697) (← links)
- Stable skew partition problem (Q1887035) (← links)
- On decision and optimization (\(k\),\(l\))-graph sandwich problems (Q1887051) (← links)
- A general method for forbidden induced subgraph sandwich problem NP-completeness (Q2132372) (← links)
- On caterpillars of game chromatic number 4 (Q2132381) (← links)
- Even-power of cycles with many vertices are type 1 total colorable (Q2132416) (← links)
- On total and edge coloring some Kneser graphs (Q2168715) (← links)
- Complexity-separating graph classes for vertex, edge and total colouring (Q2184678) (← links)
- The complexity of forbidden subgraph sandwich problems and the skew partition sandwich problem (Q2255038) (← links)
- Chromatic index of graphs with no cycle with a unique chord (Q2267844) (← links)
- On the computational complexity of closest genome problems (Q2295622) (← links)
- Complexity separating classes for edge-colouring and total-colouring (Q2391946) (← links)
- Timber game as a counting problem (Q2414465) (← links)
- Extended skew partition problem (Q2433705) (← links)
- A characterization of \(P_{4}\)-comparability graphs (Q2433707) (← links)
- The hunting of a snark with total chromatic number 5 (Q2448882) (← links)
- The sandwich problem for cutsets: clique cutset, \(k\)-star cutset (Q2500527) (← links)
- Hierarchical complexity of 2-clique-colouring weakly chordal graphs and perfect graphs having cliques of size at least 3 (Q2634675) (← links)
- (Q2741377) (← links)
- (Q2741455) (← links)
- (Q2741456) (← links)
- (Q2758333) (← links)
- (Q2777504) (← links)
- (Q2816076) (← links)
- The Same Upper Bound for Both: The 2-page and the Rectilinear Crossing Numbers of the<i>n</i>-Cube (Q2825477) (← links)
- Linear-time graph distance and diameter approximation (Q2827756) (← links)
- Skew partition sandwich problem is NP-complete (Q2840508) (← links)
- On Coloring Problems of Snark Families (Q2840681) (← links)
- Linear Time Approximation for Dominating Sets and Independent Dominating Sets in Unit Disk Graphs (Q2848916) (← links)
- The Same Upper Bound for Both: The 2-Page and the Rectilinear Crossing Numbers of the n-Cube (Q2864306) (← links)
- Complexity dichotomy on degree-constrained VLSI layouts with unit-length edges (Q2883585) (← links)
- Total chromatic number of {square,unichord}-free graphs (Q2883635) (← links)
- (Q2918472) (← links)
- (Q2918477) (← links)
- Unitary Toric Classes, the Reality and Desire Diagram, and Sorting by Transpositions (Q3008008) (← links)
- A decomposition for total-coloring partial-grids and list-total-coloring outerplanar graphs (Q3008921) (← links)
- (Q3011750) (← links)
- Split Clique Graph Complexity (Q3104760) (← links)
- (Q3424778) (← links)
- Bull-Reducible Berge Graphs are Perfect (Q3438957) (← links)
- Loop Graphs and Asteroidal Sets (Q3439331) (← links)
- (Q3439695) (← links)
- Linear-Time Approximation Algorithms for Unit Disk Graphs (Q3453289) (← links)
- Sufficient conditions for a graph to be edge-colorable with maximum degree colors (Q3503532) (← links)
- 2K2 vertex-set partition into nonempty parts (Q3503567) (← links)
- Clique Graph Recognition Is NP-Complete (Q3522963) (← links)
- A NEW QUANTUM ALGORITHM FOR SOLVING THE MINIMUM SEARCHING PROBLEM (Q3534103) (← links)
- Hamiltonian paths in odd graphs (Q3655060) (← links)