The following pages link to (Q5387691):
Displayed 12 items.
- Maximal cliques in \(\{P_{2} \cup P_{3},C_{4}\}\)-free graphs (Q712269) (← links)
- A constant factor approximation algorithm for boxicity of circular arc graphs (Q741528) (← links)
- Geometric representation of graphs in low dimension using axis parallel boxes (Q848956) (← links)
- Robust set-membership state estimation; application to underwater robotics (Q1000813) (← links)
- Sublinear approximation algorithms for boxicity and related problems (Q1693125) (← links)
- Cubicity and bandwidth (Q1938886) (← links)
- Algorithms for induced biclique optimization problems (Q1944925) (← links)
- On standard quadratic programs with exact and inexact doubly nonnegative relaxations (Q2133420) (← links)
- Tightening a copositive relaxation for standard quadratic optimization problems (Q2376121) (← links)
- Monopolar graphs: complexity of computing classical graph parameters (Q2659081) (← links)
- Coordinate Shadows of Semidefinite and Euclidean Distance Matrices (Q5258947) (← links)
- Temporal interval cliques and independent sets (Q6039892) (← links)