241 results on '"Fernandes, Cristina G."'
Search Results
2. Approximations for the Steiner Multicycle Problem
3. Independent dominating sets in planar triangulations
4. Separating Path Systems in Complete Graphs
5. How heavy independent sets help to find arborescences with many leaves in DAGs
6. Approximations for the Steiner Multicycle problem
7. Period collapse in Ehrhart quasi-polynomials of \(\{1,3\}\)-graphs
8. On the period collapse of a family of Ehrhart quasi-polynomials
9. Leafy Spanning Arborescences in DAGs
10. On Tuza's conjecture for triangulations and graphs with small treewidth
11. How heavy independent sets help to find arborescences with many leaves in DAGs
12. Leafy spanning k-forests
13. Approximations for the Steiner Multicycle Problem
14. Complexity and approximability of Minimum Path-Collection Exact Covers
15. Cubic graphs, their Ehrhart quasi-polynomials, and a scissors congruence phenomenon
16. Leafy spanning arborescences in DAGs
17. Transversals of Longest Paths
18. Approximating the Minimum $k$-Section Width in Bounded-Degree Trees with Linear Diameter
19. On Minimum Bisection and Related Cut Problems in Trees and Tree-Like Graphs
20. Edge-magic labelings for constellations and armies of caterpillars
21. Prices of anarchy of selfish 2D bin packing games
22. Matroid basis graph: Counting Hamiltonian cycles
23. Improved Approximation Algorithms for Capacitated Fault-Tolerant k-Center
24. Kinetic Clustering of Points on the Line
25. Approximations for the Steiner Multicycle Problem
26. Cubic Graphs, Their Ehrhart Quasi-Polynomials, and a Scissors Congruence Phenomenon
27. Spanning trees with nonseparating paths
28. A MILP model for an extended version of the Flexible Job Shop Problem
29. Nonempty Intersection of Longest Paths in Series-Parallel Graphs
30. The Unit-Demand Envy-Free Pricing Problem
31. Approximation Algorithms for the Max-Buying Problem with Limited Supply
32. Repetition-free longest common subsequence of random sequences
33. The Online Multicommodity Connected Facility Location Problem
34. A Systematic Approach to Bound Factor-Revealing LPs and its Application to the Metric and Squared Metric Facility Location Problems
35. Edge-coloring series-parallel multigraphs
36. Geodesic stability for memoryless binary long-lived consensus
37. A note on Johnson, Minkoff and Phillips' algorithm for the Prize-Collecting Steiner Tree Problem
38. Melanophoroma in a Lichtenstein's green racer snake
39. Leafy Spanning Arborescences in DAGs
40. From Monomials to Words to graphs
41. Counting Hamiltonian Cycles in the Matroid Basis Graph
42. Approximation Algorithms for the Max-Buying Problem with Limited Supply
43. The envy-free pricing problem, unit-demand markets and connections with the network pricing problem
44. Improved Approximation Algorithms for Capacitated Fault-Tolerant k-Center
45. Repetition-free longest common subsequence of random sequences
46. Kinetic clustering of points on the line
47. Approximation Algorithms for the Max-Buying Problem with Limited Supply
48. The Envy-Free Pricing Problem and Unit-Demand Markets
49. The Online Multicommodity Connected Facility Location Problem
50. On the structure of graphs with large minimum bisection
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.