Tibor Jordán

发表

Constrained Edge-Splitting Problems

Tibor Jordán, T. Jordán, 1999, SIAM J. Discret. Math..

Edge splitting and connectivity augmentation in directed hypergraphs

Bill Jackson, Tibor Jordán, Alex R. Berg, 2003, Discret. Math..

Incresing the Vertex-Connectivity in Directed Graphs

Tibor Jordán, T. Jordán, 1993, ESA.

Generic global rigidity of body-hinge frameworks

Tibor Jordán, Shin-ichi Tanigawa, Csaba Király, 2016, J. Comb. Theory, Ser. B.

Tree-representation of directed circuits

András Frank, Tibor Jordán, A. Frank, 1991, Graph Structure Theory.

Combinatorial Conditions for the Unique Completability of Low-Rank Matrices

Bill Jackson, Tibor Jordán, Shin-ichi Tanigawa, 2014, SIAM J. Discret. Math..

Edge-Splitting Problems with Demands

Tibor Jordán, 1999, IPCO.

Bisecting Two Subsets in 3-Connected Graphs

Toshihide Ibaraki, Hiroshi Nagamochi, Tibor Jordán, 1999, ISAAC.

Edge-Connectivity Augmentation Preserving Simplicity

Tibor Jordán, Jørgen Bang-Jensen, 1998, SIAM J. Discret. Math..

Rigid Two-Dimensional Frameworks with Three Collinear Points

Bill Jackson, Tibor Jordán, 2005, Graphs Comb..

Unique low rank completability of partially filled matrices

Bill Jackson, Tibor Jordán, Shin-ichi Tanigawa, 2016, J. Comb. Theory, Ser. B.

Detachments Preserving Local Edge-Connectivity of Graphs

Tibor Jordán, Zoltán Szigeti, 2003, SIAM J. Discret. Math..

Egerváry Research Group on Combinatorial Optimization Connected Rigidity Matroids and Unique Realizations of Graphs Connected Rigidity Matroids and Unique Realizations of Graphs

Bill Jackson, Tibor Jordán, Tibor Jordán, 2022 .

Connectivity Augmentation of Graphs

Bill Jackson, Tibor Jordán, 2000, Electron. Notes Discret. Math..

On the existence of (k, l)-critical graphs

Tibor Jordán, 1998, Discret. Math..

On 2-Coverings and 2-Packings of Laminar Families

R. Ravi, Tibor Jordán, Joseph Cheriyan, 1999, ESA.

A Note on the Vertex-Connectivity Augmentation Problem

Tibor Jordán, Tibor Jordán, 1997, J. Comb. Theory, Ser. B.

An Orientation Theorem with Parity Conditions

András Frank, Tibor Jordán, Zoltán Szigeti, 1999, IPCO.

Bipartition constrained edge-splitting in directed graphs

Tibor Jordán, Harold N. Gabow, 2001, Discret. Appl. Math..

Sparse certificates and removable cycles in l-mixed p-connected graphs

Tibor Jordán, Alex R. Berg, 2005, Oper. Res. Lett..

Egerváry Research Group on Combinatorial Optimization Uniquely Localizable Networks with Few Anchors

Zsolt Fekete, Tibor Jordán, Zsolt Fekete, 2022 .

Editorial

Tamás Szántai, Tibor Csendes, Tibor Jordán, 2013, Central Eur. J. Oper. Res..

Strongly rigid tensegrity graphs on the line

Bill Jackson, Tibor Jordán, Csaba Király, 2013, Discret. Appl. Math..

Globally rigid circuits of the direction-length rigidity matroid

Bill Jackson, Tibor Jordán, 2010, J. Comb. Theory, Ser. B.

Algorithms for Graph Rigidity and Scene Analysis

Tibor Jordán, Alex R. Berg, Tibor Jordán, 2003, ESA.

Egerváry Research Group on Combinatorial Optimization Globally Linked Pairs of Vertices in Equivalent Realizations of Graphs Globally Linked Pairs of Vertices in Equivalent Realizations of Graphs

Bill Jackson, Tibor Jordán, Zoltan Szabadka, 2022 .

How to Make a Strongly Connected Digraph Two-Connected

András Frank, Tibor Jordán, A. Frank, 1995, IPCO.

Splitting off edges between two subsets preserving the edge-connectivity of the graph

Tibor Jordán, Jørgen Bang-Jensen, 2004, Discret. Math..

Highly connected rigidity matroids have unique underlying graphs

Tibor Jordán, Viktória E. Kaszanitzky, T. Jordán, 2013, Eur. J. Comb..

Splitting Off Edges within a Specified Subset Preserving the Edge-Connectivity of the Graph

Tibor Jordán, Jørgen Bang-Jensen, Tibor Jordán, 2000, J. Algorithms.

On the Rank Function of the 3-Dimensional Rigidity Matroid Bill Jackson ? and

Bill Jackson, Tibor Jordán, B. Jackson, 2005 .

The Steiner Problem for Count Matroids

Kazuhisa Makino, Tibor Jordán, Yusuke Kobayashi, 2020, IWOCA.

Adding and Reversing Arcs in Semicomplete Digraphs

Tibor Jordán, Jørgen Bang-Jensen, J. Bang-Jensen, 1998, Combinatorics, Probability and Computing.

Highly edge-connected detachments of graphs and digraphs

Bill Jackson, Tibor Jordán, Alex R. Berg, 2003, J. Graph Theory.

A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid

Tibor Jordán, Alex R. Berg, T. Jordán, 2003, J. Comb. Theory, Ser. B.

Geometric Sensitivity of Rigid Graphs

Tibor Jordán, Gábor Domokos, Krisztina Tóth, 2013, SIAM J. Discret. Math..

Orientations and detachments of graphs with prescribed degrees and connectivity

Satoru Iwata, Tibor Jordán, S. Iwata, 2014, Discret. Optim..

Two NP-Complete Augmentation Problems

Tibor Jordán, 1997 .

Graph Connectivity Augmentation

András Frank, Tibor Jordán, A. Frank, 2015 .

Egerváry Research Group on Combinatorial Optimization Generically Globally Rigid Zeolites in the Plane Generically Globally Rigid Zeolites in the Plane

Tibor Jordán, T. Jordán, 2022 .

Rigid realizations of graphs on small grids

Zsolt Fekete, Tibor Jordán, Zsolt Fekete, 2005, Comput. Geom..

Spanning 2-strong tournaments in 3-strong semicomplete digraphs

Tibor Jordán, Jørgen Bang-Jensen, J. Bang-Jensen, 2010, Discret. Math..

Non-Separable Detachments of Graphs

Bill Jackson, Tibor Jordán, 2001, Electron. Notes Discret. Math..

An Inductive Construction for Plane Laman Graphs via Vertex Splitting

Zsolt Fekete, Tibor Jordán, Walter Whiteley, 2004, ESA.

Discrete Geometric Analysis

Tibor Jordán, Martin T. Barlow, Andrzej Zuk, 2016 .

Egerváry Research Group on Combinatorial Optimization Operations Preserving the Global Rigidity of Graphs and Frameworks in the Plane Operations Preserving the Global Rigidity of Graphs and Frameworks in the Plane

Tibor Jordán, Zoltan Szabadka, Zoltan Szabadka, 2022 .

Edge-connectivity augmentation with partition constraints

Tibor Jordán, Jørgen Bang-Jensen, Zoltán Szigeti, 1998, SODA '98.

On minimally k-edge-connected graphs and shortest k-edge-connected Steiner networks

Tibor Jordán, 2003, Discret. Appl. Math..

Extremal graphs in connectivity augmentation

Tibor Jordán, Tibor Jordán, 1999, J. Graph Theory.

Minimally k-Edge-Connected Directed Graphs of Maximal Size

Tibor Jordán, Alex R. Berg, 2005, Graphs Comb..

Coverings and structure of crossing families

Tibor Jordán, Tamás Fleiner, 1999, Math. Program..

Independence free graphs and vertex connectivity augmentation

Bill Jackson, Tibor Jordán, 2005, J. Comb. Theory, Ser. B.

Gain-Sparsity and Symmetry-Forced Rigidity in the Plane

Tibor Jordán, Shin-ichi Tanigawa, Viktória E. Kaszanitzky, 2016, Discret. Comput. Geom..

Convex Embeddings and Bisections of 3-Connected Graphs1

Toshihide Ibaraki, Hiroshi Nagamochi, Tibor Jordán, 2002, Comb..

Optimal and almost optimal algorithms for connectivity augmentation problems

Tibor Jordán, 1993, IPCO.

On universally rigid frameworks on the line

Tibor Jordán, Viet Hang Nguyen, V. Nguyen, 2015, Contributions Discret. Math..

Directed vertex-connectivity augmentation

Tibor Jordán, András Frank, A. Frank, 1999, Math. Program..

Incrementing Bipartite Digraph Edge-Connectivity

Tibor Jordán, Harold N. Gabow, H. Gabow, 2000, J. Comb. Optim..

Editorial

Tibor Csendes, Botond Bertók, Tibor Jordán, 2019, Central Eur. J. Oper. Res..

Operations Preserving Global Rigidity of Generic Direction-Length Frameworks

Bill Jackson, Tibor Jordán, 2010, Int. J. Comput. Geom. Appl..

Independence free graphs and vertex connectivity augmentation

Bill Jackson, Tibor Jordán, Tibor Jordán, 2001, J. Comb. Theory, Ser. B.

Rigid Components in Molecular Graphs

Bill Jackson, Tibor Jordán, B. Jackson, 2007, Algorithmica.

Edge-connectivity augmentation preserving simplicity

Tibor Jordán, Jørgen Bang-Jensen, 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

A characterization of weakly four-connected graphs

Tibor Jordán, 2006, J. Graph Theory.

Rigid Two-Dimensional Frameworks with Two Coincident Points

Zsolt Fekete, Tibor Jordán, Viktória E. Kaszanitzky, 2014, Graphs and Combinatorics.

How to make a square grid framework with cables rigid

Tibor Jordán, Harold N. Gabow, H. Gabow, 2000, SODA '99.

Egerváry Research Group on Combinatorial Optimization the Dress Conjectures on Rank in the 3-dimensional Rigidity Matroid the Dress Conjectures on Rank in the 3-dimensional Rigidity Matroid

Bill Jackson, Tibor Jordán, Bill Jackson, 2003 .

The generic rank of body-bar-and-hinge frameworks

Bill Jackson, Tibor Jordán, B. Jackson, 2010, Eur. J. Comb..

On the number of shredders

Tibor Jordán, Tibor Jordán, 1997, J. Graph Theory.

Combinatorial problems related to origin-destination matrices

András Frank, Tibor Jordán, Zoltán Szigeti, 2001, Discret. Appl. Math..

Brick partitions of graphs

Bill Jackson, Tibor Jordán, B. Jackson, 2010, Discret. Math..

Successive edge-connectivity augmentation problems

Eddie Cheng, Tibor Jordán, 1999, Math. Program..

Global Rigidity of Unit Ball Graphs

Tibor Jordán, Dániel Garamvölgyi, Dániel Garamvölgyi, 2020, SIAM J. Discret. Math..

On the existence of k edge-disjoint 2-connected spanning subgraphs

Tibor Jordán, Tibor Jordán, 2005, J. Comb. Theory, Ser. B.

Robust Tensegrity Polygons

Tibor Jordán, János Geleji, János Geleji, 2013, Discret. Comput. Geom..

The d-dimensional rigidity matroid of sparse graphs

Bill Jackson, Tibor Jordán, Bill Jackson, 2005, J. Comb. Theory B.

Non-separable detachments of graphs

Bill Jackson, Tibor Jordán, 2003, J. Comb. Theory, Ser. B.

A Near Optimal Algorithm for Vertex Connectivity Augmentation

Bill Jackson, Tibor Jordán, Tibor Jordán, 2000, ISAAC.

Generic global rigidity of body-bar frameworks

Tibor Jordán, Robert Connelly, Walter Whiteley, 2013, J. Comb. Theory B.

On persistent directed graphs

Tibor Jordán, Jørgen Bang-Jensen, J. Bang-Jensen, 2008, Networks.

On Rooted Node-Connectivity Problems

Tibor Jordán, Joseph Cheriyan, Zeev Nutov, 2001, Algorithmica.

Egerváry Research Group on Combinatorial Optimization Highly Connected Molecular Graphs Are Rigid in Three Dimensions Highly Connected Molecular Graphs Are Rigid in Three Dimensions

Tibor Jordán, T. Jordán, 2022 .

Pin-Collinear Body-and-Pin Frameworks and the Molecular Conjecture

Bill Jackson, Tibor Jordán, B. Jackson, 2008, Discret. Comput. Geom..

Computational advances in combinatorial optimization

Tibor Jordán, Tamás Kis, Silvano Martello, 2018, Discret. Appl. Math..

Global rigidity of triangulations with braces

Tibor Jordán, Shin-ichi Tanigawa, Shin-ichi Tanigawa, 2019, J. Comb. Theory, Ser. B.

On the Optimal Vertex-Connectivity Augmentation

Tibor Jordán, Tibor Jordán, T. Jordán, 1995, J. Comb. Theory B.

Egerváry Research Group on Combinatorial Optimization a Sufficient Connectivity Condition for Generic Rigidity in the Plane a Sufficient Connectivity Condition for Generic Rigidity in the Plane

Bill Jackson, Tibor Jordán, B. Jackson, 2022 .

On the rigidity of molecular graphs

Bill Jackson, Tibor Jordán, B. Jackson, 2008, Comb..

How to make a graph four-connected

Tibor Jordán, Ervin Györi, Tibor Jordán, 1999, Math. Program..

Minimal Edge-Coverings of Pairs of Sets

András Frank, Tibor Jordán, A. Frank, 1995, J. Comb. Theory B.

Two‐connected orientations of Eulerian graphs

Tibor Jordán, Alex R. Berg, Tibor Jordán, 2006, J. Graph Theory.

Parameterized complexity of spare capacity allocation and the multicost Steiner subgraph problem

Tibor Jordán, Ildikó Schlotter, Ildikó Schlotter, 2015, J. Discrete Algorithms.

Approximating k-outconnected Subgraph Problems

Tibor Jordán, Joseph Cheriyan, Zeev Nutov, 1998, APPROX.

Sparse hypergraphs with applications in combinatorial rigidity

Tibor Jordán, Viktória E. Kaszanitzky, T. Jordán, 2015, Discret. Appl. Math..

Rigid tensegrity labelings of graphs

Tibor Jordán, András Recski, Zoltan Szabadka, 2009, Eur. J. Comb..

Graph Reconstruction from Unlabeled Edge Lengths

Tibor Jordán, Dániel Garamvölgyi, Dániel Garamvölgyi, 2021, Discret. Comput. Geom..

Minimum Size Highly Redundantly Rigid Graphs in the Plane

Tibor Jordán, 2021, Graphs Comb..

A note on generic rigidity of graphs in higher dimension

Tibor Jordán, T. Jordán, 2021, Discret. Appl. Math..

Constrained Edge-Splitting Problems

Tibor Jordán, 1999 .

Rank and independence in the rigidity matroid of molecular graphs

Tibor Jordán, T. Jordán, 2006 .

Highly edge-connected detachments of graphs and digraphs

Bill Jackson, Tibor Jordán, Alex R. Berg, 2003 .

An orientation theorem with parity conditions

András Frank, Tibor Jordán, Zoltán Szigeti, 2001 .

Henneberg moves on mechanisms

Bill Jackson, Tibor Jordán, Brigitte Servatius, 2015 .

Globally Linked Pairs of Vertices in Rigid Frameworks

Bill Jackson, Tibor Jordán, Zoltán Szabadka, 2014 .

Two-connected orientations of Eulerian graphs

Tibor Jordán, Alex R. Berg, Tibor Jordán, 2006 .

Graph theoretic techniques in the analysis of uniquely localizable sensor networks

Bill Jackson, Tibor Jordán, B. Jackson, 2009 .

II – Combinatorial Rigidity: Graphs and Matroids in the Theory of Rigid Frameworks

Tibor Jordán, T. Jordán, 2016 .

On the number of shredders

Tibor Jordán, 1999 .