Live briefing
Everything about Planarization
Technique for drawing non-planar graphs
In the mathematical field of graph theory, planarization is a method of extending graph drawing methods from planar graphs to graphs that are not planar, by embedding the non-planar graphs within a larger planar graph. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: PlanarizationA 5-minute orientation
- Skim a recent paper: Facile Synthesis of Metallosalphen‐Based 2D Conductive Metal‐Organic Frameworks for NO 2 Sensing: Metal Coordination Induced PlanarizationInfluential work since 2022
- Pick up a classic book: Nanoparticle engineering for chemical-mechanical planarizationThe most-reprinted book on the subject
- Read the landmark paper: Chemical mechanical planarization for microelectronics applicationsCited 573 times
- Go sideways: Map graphA closely related topic
- Go sideways: Planarity testingA closely related topic
📖 Definitions
Noun The act or process of planarizing.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Chemical mechanical planarization for microelectronics applications
Chemical Mechanical Planarization: Slurry Chemistry, Materials, and Mechanisms
Steps To Demarcate the Effects of Chromophore Aggregation and Planarization in Poly(phenyleneethynylene)s. 1. Rotationally Interrupted Conjugation in the Excited States of 1,4-Bis(phenylethynyl)benzene
Acceptor Planarization and Donor Rotation: A Facile Strategy for Realizing Synergistic Cancer Phototherapy via Type I PDT and PTT
High Open‐Circuit Voltage (1.197 V) in Large‐Area (1 cm 2 ) Inverted Perovskite Solar Cell via Interface Planarization and Highly Polar Self‐Assembled Monolayer
A review on chemical and mechanical phenomena at the wafer interface during chemical mechanical planarization
Interplay of Thermochromicity and Liquid Crystalline Behavior in Poly( p- phenyleneethynylene)s: π−π Interactions or Planarization of the Conjugated Backbone?
Surface Chemistry Studies of Copper Chemical Mechanical Planarization
🆕 Influential since 2022
Facile Synthesis of Metallosalphen‐Based 2D Conductive Metal‐Organic Frameworks for NO 2 Sensing: Metal Coordination Induced Planarization
“Light on” fluorescence carbon dots with intramolecular hydrogen bond-regulated co-planarization for cell imaging and temperature sensing
A nanoclustered ceria abrasives with low crystallinity and high Ce3+/Ce4+ ratio for scratch reduction and high oxide removal rates in the chemical mechanical planarization
Development of polystyrene/polyaniline/ceria (PS/PANI/CeO2) multi-component abrasives for photochemical mechanical polishing/planarization applications
Examining amino acids as environmentally friendly corrosion inhibitors for Cu and Co chemical mechanical planarization
📚 Books worth reading
Nanoparticle engineering for chemical-mechanical planarizationUngyu Paik · 2008- 📕Micro-Coplanar Striplines--new transmission media for microwave applicationsKavita Goverdhanam · 1998
- 📕Planar Dynamical SystemsYirong Liu · 2014
Microelectronic Applications of Chemical Mechanical PlanarizationYuzhuo Li · 2007
Chemical mechanical planarization of microelectronic materialsJoseph M. Steigerwald · 1997
Chemical-mechanical polishing, fundamentals and challengesS. V. Babu, S. Danyluk · 1999- 📕Handōtai CMP yōgo jiten · 2008
- 📕[ Building an LO source at 1036 GHz for a receiver]Neal R. Erickson · 1995
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Map graph In graph theory, a branch of mathematics, a map graph is an undirected graph formed as the intersection graph of finitely many simply connected and internally…
- Planarity testing In graph theory, the planarity testing problem is the algorithmic problem of testing whether a given graph is a planar graph (that is, whether it can be…
- Graph minor In graph theory, an undirected graph H is called a minor of the undirected graph G if H can be formed from G by deleting edges and vertices and by contracting…
- Simultaneous embedding Simultaneous embedding is a technique in graph drawing and information visualization for visualizing two or more different graphs on the same or overlapping…
- Matroid parity problem In combinatorial optimization, the matroid parity problem is a problem of finding the largest independent set of paired elements in a matroid, a structure…
- Feedback arc set In graph theory and graph algorithms, a feedback arc set or feedback edge set in a directed graph is a subset of the edges of the graph that contains at…
- Bounded expansion In graph theory, a family of graphs is said to have bounded expansion if all of its shallow minors are sparse graphs. Many natural families of sparse graphs…
- 1-planar graph In topological graph theory, a 1-planar graph is a graph that can be drawn in the Euclidean plane in such a way that each edge has at most one crossing…