Biing-Feng Wang

From MaRDI portal
Revision as of 13:05, 7 October 2023 by Import231006081045 (talk | contribs) (Created automatically from import231006081045)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:269485

Available identifiers

zbMath Open wang.biing-fengMaRDI QIDQ269485

List of research outcomes





PublicationDate of PublicationType
Parameterized Complexity for Finding a Perfect Phylogeny from Mixed Tumor Samples2023-09-27Paper
A new dynamic programming algorithm for the simplified partial digest problem2023-04-12Paper
Efficient algorithms for the minmax regret path center problem with length constraint on trees2022-05-10Paper
An improved algorithm for the minmax regret path center problem on trees2020-09-07Paper
On the minmax regret path center problem on trees2020-07-07Paper
Improved algorithms for the minmax-regret 1-center and 1-median problems2018-11-05Paper
An improved algorithm for the minmax regret path centdian problem on trees2018-09-07Paper
Comments on: ``Extensive facility location problems on networks: an updated review2018-08-28Paper
Efficient algorithms for the round-trip 1-center and 1-median problems2016-04-18Paper
On the minmax regret path median problem on trees2015-07-13Paper
A Linear-Time Algorithm for the Minimum Degree Hypergraph Problem with the Consecutive Ones Property2013-06-11Paper
Efficient algorithms for the conditional covering problem2012-11-27Paper
On the Minimum Degree Hypergraph Problem with Subset Size Two and the Red-Blue Set Cover Problem with the Consecutive Ones Property2012-09-25Paper
On the Round-Trip 1-Center and 1-Median Problems2012-06-08Paper
Faster query algorithms for the text fingerprinting problem2011-07-18Paper
Improved data structures for the orthogonal range successor problem2011-01-21Paper
Efficient Indexes for the Positional Pattern Matching Problem and Two Related Problems over Small Alphabets2010-12-09Paper
Improved algorithms for finding length-bounded two vertex-disjoint paths in a planar graph and minmax \(k\) vertex-disjoint paths in a directed acyclic graph2010-10-07Paper
Improved algorithms for the continuous tree edge-partition problems and a note on ratio and sorted matrices searches2010-05-25Paper
On Chen and Chen's new tree inclusion algorithm2010-03-24Paper
Algorithms - ESA 20032010-03-03Paper
Efficient algorithms for the problems of enumerating cuts by non-decreasing weights2010-02-23Paper
Efficient algorithms for the inverse sorting problem with bound constraints under the \(l_{\infty }\)-norm and the Hamming distance2009-11-10Paper
Efficient Data Structures for the Orthogonal Range Successor Problem2009-07-23Paper
Improved Algorithms for the Gene Team Problem2009-07-07Paper
Efficient algorithms for two generalized 2-median problems and the group median problem on trees2009-03-17Paper
A Faster Query Algorithm for the Text Fingerprinting Problem2008-09-25Paper
Finding the conditional location of a median path on a tree2008-08-14Paper
Efficient Algorithms for the k Smallest Cuts Enumeration2008-07-10Paper
Improved Algorithms for the Minmax-Regret 1-Center Problem2008-04-24Paper
Improved Algorithms for the Minmax Regret 1-Median Problem2007-09-10Paper
Efficient algorithms for a constrained k-tree core problem in a tree network2006-06-30Paper
Linear time algorithms for the ring loading problem with demand splitting2005-02-22Paper
Efficient algorithms for the scaled indexing problem2004-11-23Paper
https://portal.mardi4nfdi.de/entity/Q48086712004-08-12Paper
https://portal.mardi4nfdi.de/entity/Q44725202004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q44741422004-08-04Paper
An optimal simple parallel algorithm for testing isomorphism of maximal outerplanar graphs2002-07-04Paper
Finding a 2-Core of a Tree in Linear Time2002-04-23Paper
Tight bounds on the solutions of multidimensional divide-and-conquer maximin recurrences2000-08-21Paper
Efficient Parallel Algorithms for Optimally Locating a Path and a Tree of a Specified Length in a Weighted Tree Network2000-03-16Paper
The lowest common ancestor problem on a tree with an unfixed root2000-01-30Paper
EFFICIENT EMULATIONS FOR X-TREES AND /w-ARY TREES*1999-06-22Paper
Simulating the CRCW PRAM on reconfigurable networks1999-01-12Paper
Tighter Bounds on the Solution of a Divide-and-Conquer Maximin Recurrence1997-06-04Paper
Cost-optimal parallel algorithms for constructing B-trees1995-08-10Paper
Deriving algorithms on reconfigurable networks based on function decomposition1994-11-29Paper
Sorting and computing convex hulls on processor arrays with reconfigurable bus systems1994-01-13Paper
On the Set LCS and Set-Set LCS Problems1993-06-29Paper
A simple approach to implementing multiplication with small tables1991-01-01Paper
Constant time sorting on a processor array with a reconfigurable bus system1990-01-01Paper
Two dimensional processor array with a reconfigurable bus system is at least as powerful as CRCW model1990-01-01Paper

Research outcomes over time

This page was built for person: Biing-Feng Wang