scientific article; zbMATH DE number 4200260
From MaRDI portal
Publication:3348944
Recommendations
Cited in
(43)- On streaming algorithms for geometric independent set and clique
- On the stability number of the edge intersection of two graphs.
- Computing maximum independent set on outerstring graphs and their relatives
- Maximum bipartite subgraphs of geometric intersection graphs
- Fixed Parameter Tractability of Independent Set in Segment Intersection Graphs
- Proper colorability of segment intersection graphs
- On the obfuscation complexity of planar graphs
- On the speed of algebraically defined graph classes
- The clique problem in ray intersection graphs
- Maximum independent set in 2-direction outersegment graphs
- Segment representation of a subclass of co-planar graphs
- Computing the independence number of intersection graphs
- Intersection graphs of homothetic polygons
- Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane
- Strong pseudo transitivity and intersection graphs
- Complexity and polynomially solvable special cases of QUBO
- Recognizing some subclasses of vertex intersection graphs of 0-bend paths in a grid
- Intersection graphs of segments
- Finding a Maximum Clique in a Grounded 1-Bend String Graph
- On intersection representations of co-planar graphs
- The Clique Problem in Ray Intersection Graphs
- Maximum independent set on \(B_1\)-VPG graphs
- Many disjoint edges in topological graphs
- On the stab number of rectangle intersection graphs
- Thresholds for classes of intersection graphs
- scientific article; zbMATH DE number 7559254 (Why is no real title available?)
- A special planar satisfiability problem and a consequence of its NP- completeness
- Homothetic polygons and beyond: maximal cliques in intersection graphs
- On intersection graphs of convex polygons
- Proper colorability of segment intersection graphs
- scientific article; zbMATH DE number 1979524 (Why is no real title available?)
- Beyond homothetic polygons: recognition and maximum clique
- Covering and packing of triangles intersecting a straight line
- Max point-tolerance graphs
- On the chromatic number of disjointness graphs of curves
- The maximum clique problem in multiple interval graphs
- Disjointness graphs of segments in the space
- Efficient local representations of graphs
- On the complexity of finding a potential community
- Matching colored points with rectangles
- Many disjoint edges in topological graphs
- On plane subgraphs of complete topological drawings
- An algorithm for the maximum weight independent set problem on outerstring graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3348944)
