#### Filter Results:

- Full text PDF available (6)

#### Publication Year

2013

2017

- This year (2)
- Last 5 years (11)
- Last 10 years (11)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Jisu Jeong, Eun Jung Kim, Sang-il Oum
- SODA
- 2016

Given n subspaces of a finite-dimensional vector space over a fixed finite field F, we wish to find a linear layout V1, V2,. .. , Vn of the subspaces such that dim((V1 +V2 +· · ·+Vi)∩(Vi+1 +· · ·+Vn)) ≤ k for all i; such a linear layout is said to have width at most k. When restricted to 1-dimensional subspaces, this problem is equivalent to computing the… (More)

- Heejun Hwang, Jinwoo Kim, Jisu Jeong, Sukbok Chang
- Journal of the American Chemical Society
- 2014

Reported herein is the metal-catalyzed regioselective C-H functionalization of quinoline N-oxides at the 8-position: direct iodination and amidation were developed using rhodium and iridium catalytic systems, respectively. Mechanistic study of the amidation revealed that the unique regioselectivity is achieved through the smooth formation of… (More)

- Jisu Jeong, O-joung Kwon, Sang-il Oum
- Eur. J. Comb.
- 2013

Linear rank-width is a graph width parameter, which is a variation of rank-width by restricting its tree to a caterpillar. As a corollary of known theorems, for each k, there is a finite obstruction set O k of graphs such that a graph G has linear rank-width at most k if and only if no vertex-minor of G is isomorphic to a graph in O k. However, no attempts… (More)

- Jisu Jeong, Sigve Hortemo Sæther, Jan Arne Telle
- IPEC
- 2015

We give alternative definitions for maximum matching width, e.g. a graph G has mmw(G) ≤ k if and only if it is a subgraph of a chordal graph H and for every maximal clique X of H there exists A, B, C ⊆ X with A∪B ∪C = X and |A|, |B|, |C| ≤ k such that any subset of X that is a minimal separator of H is a subset of either A, B or C. Treewidth and branchwidth… (More)

- Ho-Jin Choi, Ilkyoo Choi, Jisu Jeong, Geewon Suh
- Journal of Graph Theory
- 2017

- Changho Sohn, Jisu Jeong, +5 authors Myung Hwan Park
- Dalton transactions
- 2016

Three novel BODIPY-based heterodinuclear complexes, [salen(3,5-(t)Bu)2Al-(OC6H4-BODIPY)] (6), [salen(3,5-(t)Bu)2Al-(OC6F2H2-BODIPY)] (7), and [(mq)2Al-(OC6H4-BODIPY)] (8) (salen = N,N'-bis(salicylidene)ethylenediamine, BODIPY = 4,4-difluoro-4-bora-3a,4a-diaza-s-indacene, and mq = methyl-8-quinolinolato) were prepared and characterized by multinuclear NMR… (More)

- Seung Youn Hong, Jisu Jeong, Sukbok Chang
- Angewandte Chemie
- 2017

A change in reaction pathway was achieved for the first time by tuning the cyclopentadienyl (Cp) ligand used for the rhodium-catalyzed cyclization of benzamides with conjugated enynones. Depending on the Cp ligand, the reaction pathway switched between [4+2] and [4+1] annulation. Electronic effects turned out to be crucial for the product distribution. The… (More)

- Jisu Jeong, Pitambar Patel, Heejun Hwang, Sukbok Chang
- Organic letters
- 2014

The Rh(III)-catalyzed C-8 selective direct alkylation and alkynylation of quinoline N-oxides has been developed. The reactions proceeded highly efficiently at room temperature over a broad range of substrates with excellent regioselectivity and functional group tolerance. This development demonstrates the synthetic utility of the N-oxide directing group as… (More)

- Jisu Jeong, Donggun Lee, Sukbok Chang
- Chemical communications
- 2015

Deoxygenation of various types of N-oxides including both heterocyclic and alkyl(aryl)amine derivatives has successfully been developed by the copper-catalyzed oxygen atom transfer using diazo compounds as the oxygen acceptor. The reaction proceeds smoothly over a broad range of substrates with excellent functional group tolerance under mild conditions.

- Robert Brignall, Ho-Jin Choi, Jisu Jeong, Sang-il Oum
- ArXiv
- 2016

A homogeneous set of a graph G is a set X of vertices such that 2 ≤ |X| < |V (G)| and no vertex in V (G) − X has both a neighbor and a non-neighbor in X. A graph is prime if it has no homogeneous set. We present an algorithm to decide whether a class of graphs given by a finite set of forbidden induced subgraphs contains infinitely many non-isomorphic prime… (More)